A method is developed for carrying out parametric analysis on a mixed integer linear program (MILP) as either objective function coefficients or right-hand-side values of the constraints are varied continuously. The method involves solving MILPs at point values of the parameters of variation and joining the results by LP parametric analysis. The procedure for parametric analysis on the objective function can be continued until a theoretical result proves that the analysis is complete. However, a heuristic rule that is presented may greatly reduce the number of individual MILPs that have to be solved and thus reduce the total computational effort. The rule assumes that if the same values of the integer variables are optimal at two different ...
We consider discrete bilevel optimization problems where the follower solves an integer pro...
Graduation date: 1965This thesis presents a general model for the location problem\ud based on integ...
Large scale mixed-integer linear programming MILP models may easily prove extraordinarily difficult ...
AbstractThe mixed integer polynomial programming problem is reformulated as a multi-parametric progr...
Long-term planning of municipal solid waste management systems is a complex decision making problem ...
summary:The problem indicated in the title is solved by means of a Bendersian dual decomposition met...
Many classes of mathematical programming problems can be formulated as a linear program with a param...
This paper introduces a hybrid optimization approach, an inexact two-stage mixed integer linear prog...
In this paper, the authors propose a mixed integer linear programming model for designing an Integra...
An interval chance-constrained mixed integer linear programming (ICCMILP) was developed for municipa...
[[abstract]]The reliable performance of a system for a mission under various conditions is of the ut...
We consider discrete bilevel optimization problems where the follower solves an integer program with...
We present a computational study of parametric tabu search for solving 01 mixed integer programming ...
In complex decision problems, some objectives are not well quantified or are not introduced explicit...
The provision of a reliable, feasible and sustainable municipal solid waste (MSW) management plan is...
We consider discrete bilevel optimization problems where the follower solves an integer pro...
Graduation date: 1965This thesis presents a general model for the location problem\ud based on integ...
Large scale mixed-integer linear programming MILP models may easily prove extraordinarily difficult ...
AbstractThe mixed integer polynomial programming problem is reformulated as a multi-parametric progr...
Long-term planning of municipal solid waste management systems is a complex decision making problem ...
summary:The problem indicated in the title is solved by means of a Bendersian dual decomposition met...
Many classes of mathematical programming problems can be formulated as a linear program with a param...
This paper introduces a hybrid optimization approach, an inexact two-stage mixed integer linear prog...
In this paper, the authors propose a mixed integer linear programming model for designing an Integra...
An interval chance-constrained mixed integer linear programming (ICCMILP) was developed for municipa...
[[abstract]]The reliable performance of a system for a mission under various conditions is of the ut...
We consider discrete bilevel optimization problems where the follower solves an integer program with...
We present a computational study of parametric tabu search for solving 01 mixed integer programming ...
In complex decision problems, some objectives are not well quantified or are not introduced explicit...
The provision of a reliable, feasible and sustainable municipal solid waste (MSW) management plan is...
We consider discrete bilevel optimization problems where the follower solves an integer pro...
Graduation date: 1965This thesis presents a general model for the location problem\ud based on integ...
Large scale mixed-integer linear programming MILP models may easily prove extraordinarily difficult ...