Discrete right hand side parametrization for linear integer programs

Untitled

“…For the case when a single parameter is present in the model, this issue has been addressed in four main ways: (i) by systematically fixing the integer variables (enumeration method, [42][43][44]), (ii) using convexity properties of the objective function (bounding method, [19,24]), (iii) relaxing integrality condition and deriving parametric upper and lower bounds (branch and bound (B&B) method, [32,36]), and, (iv) introducing constraints such that the space where the optimal solution does not lie is systematically cut-off from the feasible region (cutting plane method, [21]). These solution approaches have been reviewed in [19] and [24], however see [4,5,7,20,28,29,46,[54][55][56] for further details on the subject.…”

Parametric uncapacitated facility location

“…Moreover, most of the studies published so far are about the theory and solution strategies mainly on a general mixed integer programming problem [4][5][6][7][10][11][12][13]. But there still have been reported few results which perform the continuous parametric analysis for large scale real life problems.…”