Add to ORKGThe stability region of a solution is the polyhedral set of objective coefficients for which the solution is optimal. It provides valuable information for sensitivity analysis and re-optimization. An exact description of it may require an exponential number of inequalities. We develop polyhedral inner and outer approximations of linear size
A new method of sensitivity analysis for mixed integer/linear programming (MILP) is derived from the...
<p>The stability area is enclosed by the curves and , corresponding to the maximum and minimum numb...
AbstractThe corner relaxation of a mixed-integer linear program is a central concept in cutting plan...
The stability region of a solution is the polyhedral set of objective coefficients for which the sol...
We consider optimization problems with some binary variables, where the objective function is linear...
We consider optimization problems with some binary variables, where the objective function is linear...
textabstractWe present algorithms to calculate the stability radius of optimal or approximate soluti...
This paper updates the previous survey [121], bringing the calculation and use of stability regions ...
This thesis is focused on a specific type of optimization problems commonly referred to as convex MI...
AbstractWe consider multiple objective 0–1 programming problems in the situation where parameters of...
summary:using point-to-set mappings we identify two new regions of stability in input optimization. ...
summary:The marginal value formula in convex optimization holds in a more restrictive region of stab...
This thesis is a study of convex parametric programs on regions of stability. The main tools are com...
summary:Regions of stability are chunks of the space of parameters in which the optimal solution and...
summary:Regions of stability are chunks of the space of parameters in which the optimal solution and...
A new method of sensitivity analysis for mixed integer/linear programming (MILP) is derived from the...
<p>The stability area is enclosed by the curves and , corresponding to the maximum and minimum numb...
AbstractThe corner relaxation of a mixed-integer linear program is a central concept in cutting plan...
The stability region of a solution is the polyhedral set of objective coefficients for which the sol...
We consider optimization problems with some binary variables, where the objective function is linear...
We consider optimization problems with some binary variables, where the objective function is linear...
textabstractWe present algorithms to calculate the stability radius of optimal or approximate soluti...
This paper updates the previous survey [121], bringing the calculation and use of stability regions ...
This thesis is focused on a specific type of optimization problems commonly referred to as convex MI...
AbstractWe consider multiple objective 0–1 programming problems in the situation where parameters of...
summary:using point-to-set mappings we identify two new regions of stability in input optimization. ...
summary:The marginal value formula in convex optimization holds in a more restrictive region of stab...
This thesis is a study of convex parametric programs on regions of stability. The main tools are com...
summary:Regions of stability are chunks of the space of parameters in which the optimal solution and...
summary:Regions of stability are chunks of the space of parameters in which the optimal solution and...
A new method of sensitivity analysis for mixed integer/linear programming (MILP) is derived from the...
<p>The stability area is enclosed by the curves and , corresponding to the maximum and minimum numb...
AbstractThe corner relaxation of a mixed-integer linear program is a central concept in cutting plan...