MILP Sensitivity Analysis for the Objective Function Coefficients

References

• Blair CE, Jeroslow RG (1977) The value function of a mixed integer program I. Discrete Math. 19(2):121–138.Google Scholar
• Blair CE, Jeroslow RG (1979) The value function of a mixed integer program II. Discrete Math. 25(1):7–19.Google Scholar
• Blair CE, Jeroslow RG (1982) The value function of an integer program. Math. Programming 23(1):237–273.Google Scholar
• Blair CE, Jeroslow RG (1984) Constructive characterizations of the value function of a mixed-integer program I. Discrete Appl. Math. 9(3):217–233.Google Scholar
• Blair CE, Jeroslow RG (1985) Constructive characterizations of the value function of a mixed-integer program II. Discrete Appl. Math. 10(3):227–240.Google Scholar
• Bökler F, Mutzel P (2015) Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems. Bansal N, Finocchi I, eds. Lecture Notes in Computer Science, vol. 9294 (Springer), 288–299.Google Scholar
• Bökler F, Parragh SN, Sinnl M, Tricoire F (2021) An outer approximation algorithm for multiobjective mixed-integer linear programming. Preprint, submitted March 30, https://arxiv.org/abs/2103.16647.Google Scholar
• Bradley S, Hax A, Magnanti T (1977) Applied Mathematical Programming (Addison-Wesley).Google Scholar
• Charitopoulos V, Papageorgiou L, Dua V (2018) Multi-parametric mixed integer linear programming under global uncertainty. Comput. Chemical Engrg. 116:279–295.Google Scholar
• Cook W, Gerards AMH, Schrijver A, Tardos E (1986) Sensitivity theorems in integer linear programming. Math. Programming 34(3):251–264.Google Scholar
• Dawande MW, Hooker JN (2000) Inference-based sensitivity analysis for mixed integer/linear programming. Oper. Res. 48(4):623–634.Link, Google Scholar
• Doğan I, Lokman B, Köksalan M (2021) Representing the nondominated set in multi-objective mixed-integer programs. Eur. J. Oper. Res. 296(3):804–818.Google Scholar
• Dua V, Pistikopoulos EN (2000) An algorithm for the solution of multiparametric mixed integer linear programming problems. Ann. Oper. Res. 99(1):123–139.Google Scholar
• Eichfelder G, Warnow L (2021) A Hybrid Patch Decomposition Approach to Compute an Enclosure for Multi-Objective Mixed-Integer Convex Optimization Problems (Optimization Online).Google Scholar
• Forget N, Gadegaard SL, Nielsen LR (2022) Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. Eur. J. Oper. Res. 302(3):909–924.Google Scholar
• Gandibleux X, Soleilhac G, Przybylski A, Ruzika S (2017a) vOptSolver: An open source software environment for multiobjective mathematical optimization. IFORS2017: 21st Conf. Internat. Federation Oper. Res. Soc. (International Federation of Operational Research Societies).Google Scholar
• Gandibleux X, Soleilhac G, Przybylski A, Lucas F, Ruzika S, Halffmann P (2017b) vOptSolver: A “get and run” solver of multiobjective linear optimization problems built on Julia and JuMP. MCDM2017: 24th Internat. Conf. Multiple Criteria Decision Making (International Society on Multiple Criteria Decision Making).Google Scholar
• Geoffrion AM, Nauss R (1977) Parametric and postoptimality analysis in integer linear programming. Management Sci. 23(5):453–466.Link, Google Scholar
• Guzelsoy M, Ralphs TK (2010) Integer programming duality. Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Inc., New York).Google Scholar
• Hadžić T, Hooker JN (2006) Postoptimality analysis for integer programming using binary decision diagrams. Technical report, Carnegie Mellon University, Pittsburgh, PA.Google Scholar
• Holm S, Klein D (1978) Discrete right hand side parametrization for linear integer programs. Eur. J. Oper. Res. 2(1):50–53.Google Scholar
• Hooker JN (2009) Integer programming duality. Floudas CA, Pardalos PM, eds. Encyclopedia of Optimization (Springer), 1657–1667.Google Scholar
• Jenkins L (1982) Parametric mixed integer programming: An application to solid waste management. Management Sci. 28(11):1270–1284.Link, Google Scholar
• Jenkins L (1990) Parametric methods in integer linear programming. Ann. Oper. Res. 27(1):77–96.Google Scholar
• Jensen RE (1968) Sensitivity analysis and integer linear programming. Accounting Rev. 43(3):425–446.Google Scholar
• Kirlik G, Sayin S (2014) A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3):479–488.Google Scholar
• Klein D, Holm S (1979) Integer programming post-optimal analysis with cutting planes. Management Sci. 25(1):64–72.Link, Google Scholar
• Lasserre JB (2009) Duality and a Farkas Lemma for Integer Programs. Pearce C, Hunt E, eds. Springer Optimization and Its Applications (Springer Nature), 15–39.Google Scholar
• Li Z, Ierapetritou M (2007) A new methodology for the general multiparametric mixed-integer linear programming (MILP) problems. Indust. Engrg. Chemical Res. 46(15):5141–5151.Google Scholar
• Molina F, Morabito R, Alexandre de Araujo S (2016) MIP models for production lot sizing problems with distribution costs and cargo arrangement. J. Oper. Res. Soc. 67(11):1395–1407.Google Scholar
• Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization (Wiley, New York).Google Scholar
• Oberdieck R, Wittmann-Hohlbein M, Pistikopoulos E (2014) A branch and bound method for the solution of multiparametric mixed integer linear programming problems. J. Global Optim. 59:527–543.Google Scholar
• Ohtake Y, Nishida N (1985) A branch-and-bound algorithm for 0-1 parametric mixed integer programming. Oper. Res. Lett. 4(1):41–45.Google Scholar
• Özpeynirci O, Köksalan M (2010) An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Management Sci. 56(12):2302–2315.Link, Google Scholar
• Pal A, Charkhgard H (2019) FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming. Comput. Oper. Res. 112:104760.Google Scholar
• Petersen C (1967) Computational experience with variants of the Balas algorithm applied to the selection of R&D projects. Management Sci. 13(9):736–750.Link, Google Scholar
• Piper CJ, Zoltners AA (1975) Implicit enumeration based algorithms for postoptimizing zero-one programs. Naval Res. Logist. Quart. 22(4):791–809.Google Scholar
• Pisinger D, Saidi A (2017) Tolerance analysis for 0-1 knapsack problems. Eur. J. Oper. Res. 258(3):866–876.Google Scholar
• Przybylski A, Gandibleux X, Ehrgott M (2008) Two phase algorithms for the bi-objective assignment problem. Eur. J. Oper. Res. 185(2):509–533.Google Scholar
• Przybylski A, Gandibleux X, Ehrgott M (2010) A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective mixed integer programme. INFORMS J. Comput. 22(3):371–386.Link, Google Scholar
• Przybylski A, Klamroth K, Lacour R (2019) A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs. Preprint, submitted November 20, https://arxiv.org/abs/1911.08937.Google Scholar
• Roodman GM (1974) Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case. Naval Res. Logist. Quart. 21(4):595–607.Google Scholar
• Schrage L, Wolsey L (1985) Sensitivity analysis for branch and bound integer programming. Oper. Res. 33(5):1008–1023.Link, Google Scholar
• Serra T, Hooker JN (2017) Compact representation of near-optimal integer programming solutions. Technical report, Carnegie Mellon University, Pittsburgh, PA.Google Scholar
• Steuer RE (1986) Multiple Criteria Optimization: Theory, Computation and Application (Wiley).Google Scholar
• Stidsen T, Andersen KA (2018) A hybrid approach for biobjective optimization. Discrete Optim. 28:89–114.Google Scholar
• Stidsen T, Andersen KA, Dammann B (2014) A branch and bound algorithm for a class of biobjective mixed integer programs. Management Sci. 60(4):1009–1032.Link, Google Scholar
• Tamby S, Vanderpooten D (2021) Enumeration of the nondominated set of multiobjective discrete optimization problems. INFORMS J. Comput. 33(1):72–85.Link, Google Scholar
• Tind J, Wolsey L (1981) An elementary survey of general duality theory in mathematical programming. Math. Programming 21(1):241–261.Google Scholar
• Wolsey L (1981) Integer programming duality: Price functions and sensitivity analysis. Math. Programming 20(1):173–195.Google Scholar
• Yu P, Zeleny M (1976) Linear multiparametric programming by multicriteria simplex method. Management Sci. 23(2):159–170.Google Scholar