Sensitivity Analysis of the Cost Coefficients in Multiobjective Integer Linear Optimization

Published Online:https://doi.org/10.1287/mnsc.2021.01406

References

  • Alves M, Costa J (2016) Graphical exploration of the weight space in three-objective mixed integer linear programs. Eur. J. Oper. Res. 248:72–83.CrossrefGoogle Scholar
  • Antunes C, Clímaco J (1992) Sensitivity analysis in MCDM using the weight space. Oper. Res. Lett. 12:187–196.CrossrefGoogle Scholar
  • Benson H (1985) Multiple objective linear programming with parametric criteria coefficients. Management Sci. 31(4):461–474.LinkGoogle 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. Algorithms-ESA 2015, Lecture Notes in Computer Science, vol. 9294 (Springer, Berlin, Heidelberg), 288–299.CrossrefGoogle Scholar
  • Borges A, Antunes C (2002) A visual interactive tolerance approach to sensitivity analysis in MOLP. Eur. J. Oper. Res. 142:357–381.CrossrefGoogle Scholar
  • Borgonova E (2017) Sensitivity Analysis, an Introduction for the Management Scientist, International Series in Operations Research & Management Science (Springer International Publishing, Cham, Switzerland).Google Scholar
  • Dächert K, Fleuren T, Klamroth K (2024) A simple, efficient and versatile objective space algorithm for multiobjective integer programming. Math. Meth. Oper. Res. Forthcoming.Google Scholar
  • Fazlollahi S, Maréchal F (2013) Multi-objective, multi-period optimization of biomass conversion technologies using evolutionary algorithms and mixed integer linear programming (MILP). Appl. Thermal Engrg. 50:1504–1513.CrossrefGoogle Scholar
  • Forget N, Gadegaard SL, Klamroth K, Nielsen LR, Przybylski A (2022) Branch-and-bound and objective branching with three or more objectives. Comput. Oper. Res. 148:106012.Google Scholar
  • Gal T, Leberling H (1981) Relaxation analysis in linear vectorvalued maximization. Eur. J. Oper. Res. 8:274–282.CrossrefGoogle 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, Quebec City).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 MCDM, Ottawa).Google Scholar
  • Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22:618–630.CrossrefGoogle Scholar
  • Glasserman P, Tayur S (1995) A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times. Comput. Oper. Res. 41(2):263–281.Google Scholar
  • Hansen P, Labbé M, Wendell R (1989) Sensitivity analysis in multiple objective linear programming: The tolerance approach. Eur. J. Oper. Res. 38(1):63–69.CrossrefGoogle Scholar
  • Higgins AJ, Hajkowicza S, Buib E (2008) A multi-objective model for environmental investment decision making. Comput. Oper. Res. 35:253–266.CrossrefGoogle Scholar
  • Hladíc M (2008) Additive and multiplicative tolerance in multiobjective linear programming. Oper. Res. Lett. 36:393–396.CrossrefGoogle Scholar
  • Hladíc M, Sitarz S (2013) Maximal and supremal tolerances in multiobjective linear programming. Eur. J. Oper. Res. 228(1):93–101.CrossrefGoogle Scholar
  • Jenkins L (1990) Parametric methods in integer linear programming. Ann. Oper. Res. 27(1):77–96.CrossrefGoogle Scholar
  • Johnson MP, Hurter AP (2000) Decision support for a housing mobility program using a multiobjective optimization model. Management Sci. 46(12):1569–1584.LinkGoogle Scholar
  • Keeney R, Raiffa H (1976) Decisions with Multiple Objectives: Preferences and Value Tradeoffs (Cambridge University Press, Cambridge, UK).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:479–488.CrossrefGoogle Scholar
  • Klamroth K, Lacour R, Vanderpooten D (2015) On the representation of the search region in multi-objective optimization. Eur. J. Oper. Res. 245(3):767–778.CrossrefGoogle Scholar
  • Kornbluth J (1974) Duality, indifference and sensitivity analysis in multiple objective linear programming. Oper. Res. Quart. 25(4):599–614.CrossrefGoogle Scholar
  • Labbé M, Thisse JF, Wendell RE (1991) Sensitivity analysis in minisum facility location problems. Oper. Res. 39(6):961–969.LinkGoogle Scholar
  • Lokman B, Köksalan M (2013) Finding all nondominated points of multi-objective integer programs. J. Global Optim. 57:347–365.CrossrefGoogle Scholar
  • Mármol A, Puerto J (1997) Special cases of the tolerance approach in multiobjective linear programming. Eur. J. Oper. Res. 98(3):610–616.CrossrefGoogle Scholar
  • Norouzi MR, Ahmadi A, Nezhad AE, Ghaedi A (2014) Mixed-integer programming of multi-objective security-constrained hydro-thermal unit commitment. Renewable Sustainable Energy Rev. 29:911–923.CrossrefGoogle Scholar
  • Ravi N, Wendell R (1985) The tolerance approach to sensitivity analysis of matrix coefficients in linear programming: General perturbations. J. Oper. Res. Soc. 36:943–950.CrossrefGoogle Scholar
  • Ravi N, Wendell R (1989) The tolerance approach to sensitivity analysis of matrix coefficients in linear programming. Management Sci. 35:1106–1119.LinkGoogle Scholar
  • Rosenblatt M, Sinuany-Stern Z (1989) Generating the discrete efficient frontier to the capital budgeting problem. Oper. Res. 37(3):384–394.LinkGoogle Scholar
  • Ruben RA, Jacobs FR (1999) Batch construction heuristics and storage assignment strategies for walk/ride and pick systems. Management Sci. 45(4):575–596.LinkGoogle Scholar
  • Sitarz S (2008) Postoptimal analysis in multicriteria linear programming. Eur. J. Oper. Res. 191:7–18.CrossrefGoogle Scholar
  • Sitarz S (2010) Standard sensitivity analysis and additive tolerance approach in MOLP. Ann. Oper. Res. 181:219–232.CrossrefGoogle Scholar
  • Sitarz S (2014) Approaches to sensitivity analysis in MOLP. Internat. J. Inform. Tech. Comput. Sci. 3:54–60.Google Scholar
  • Steuer RE (1986) Multiple Criteria Optimization: Theory, Computation and Application (Wiley, New York).Google Scholar
  • Tamby S, Vanderpooten D (2020) Enumeration of the nondominated set of multiobjective discrete optimization problems. INFORMS J. Comput. 33(1):72–85.LinkGoogle Scholar
  • Topaloglu H, Powell WB (2007) Sensitivity analysis of a dynamic fleet management model using approximate dynamic programming. Oper. Res. 55(2):319–331.LinkGoogle Scholar
  • Wagner HM (1995) Global sensitivity analysis. Oper. Res. 43(6):948–969.LinkGoogle Scholar
  • Wendell R (1984) Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis. Math. Program. 29:304–322.CrossrefGoogle Scholar
  • Wendell R (1985) The tolerance approach to sensitivity analysis in linear programming. Management Sci. 31:564–578.LinkGoogle Scholar
  • Yu P, Zeleny M (1976) Linear multiparametric programming by multicriteria simplex method. Management Sci. 23(2):159–170.Google Scholar
  • Zarouk Y, Mahdavi I, Rezaeian J, Santos-Arteaga FJ (2022) A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times. Comput. Oper. Res. 19:1–19.Google Scholar
  • Zionts S (1974) Linear and Integer Programming (Prentice Hall, Englewood Cliffs, NJ).Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.