A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs

References

• Abbas M, Chaabane D (2006) Optimizing a linear function over an integer efficient set. Eur. J. Oper. Res. 174(2):1140–1161.Crossref, Google Scholar
• Aneja YP, Nair KPK (1979) Bicriteria transportation problem. Management Sci. 25(1):73–78.Link, Google Scholar
• Belotti P, Soylu B, Wiecek M (2013) A branch-and-bound algorithm for biobjective mixed-integer programs. Accessed September 23, 2017, http://www.optimization-_online.org/DB_FILE/2013/01/3719.pdf.Google Scholar
• Benson HP (1984) Optimization over the efficient set. J. Math. Anal. Appl. 98(2):562–580.Crossref, Google Scholar
• Benson HP (1991) An all-linear programming relaxation algorithm for optimizing over the efficient set. J. Global Optim. 1(1):83–104.Crossref, Google Scholar
• Benson HP (1992) A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set. J. Optim. Theory Appl. 73(1):47–64.Crossref, Google Scholar
• Benson HP (1993) A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case. J. Global Optim. 3(1):95–111.Crossref, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2015a) A criterion space search algorithm for biobjective integer programming: The balanced box method. INFORMS J. Comput. 27(4):735–754.Link, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2015b) A criterion space search algorithm for biobjective mixed integer programming: The triangle splitting method. INFORMS J. Comput. 27(4):597–618.Link, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2016a) The L-shape search method for triobjective integer programming. Math. Programming Comput. 8(2):217–251.Crossref, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2016b) A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260(3):904–919.Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2016c) The quadrant shrinking method: A simple and efficient algorithm for solving tri-objective integer programs. Eur. J. Oper. Res. 260(3):873–885.Google Scholar
• Chaabane D, Brahmi B, Ramdani Z (2012) The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program. Internat. Trans. Oper. Res. 19(4):531–545.Crossref, Google Scholar
• Charkhgard H, Savelsbergh M, Talebian M (2018) A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. Comput. Oper. Res. 89(January):17–30.Crossref, Google Scholar
• Dächert K, Klamroth K (2014) A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J. Global Optim. 61(4):643–676.Crossref, Google Scholar
• Dächert K, Gorski J, Klamroth K (2012) An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems. Comput. Oper. Res. 39(12):2929–2943.Crossref, Google Scholar
• Dai R, Charkhgard H (2018) Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage. Comput. Oper. Res. 96(August):173–187.Crossref, Google Scholar
• Dauer JP (1991) Optimization over the efficient set using an active constraint approach. Math. Methods Oper. Res. 35(3):185–195.Crossref, Google Scholar
• Djamal C, Marc P (2010) A method for optimizing over the integer efficient set. J. Indust. Management Optim. 6(4):811–823.Crossref, Google Scholar
• Ecker J, Song J (1994) Optimizing a linear function over an efficient set. J. Optim. Theory Appl. 83(3):541–563.Crossref, Google Scholar
• Ehrgott M (2005) Multicriteria Optimization, 2nd ed. (Springer, New York).Google Scholar
• Fattahi A, Turkay M (2018) A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems. Eur. J. Oper. Res. 266(2):415–425.Crossref, Google Scholar
• Gao Y, Xu C, Yang Y (2006) An outcome-space finite algorithm for solving linear multiplicative programming. Appl. Math. Comput. 179(2):494–505.Crossref, Google Scholar
• Jorge JM (2009) An algorithm for optimizing a linear function over an integer efficient set. Eur. J. Oper. Res. 195(1):98–103.Crossref, Google Scholar
• Kirlik G, Sayın S (2014) A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3):479–488.Crossref, Google Scholar
• Kirlik G, Sayın S (2015) Computing the nadir point for multiobjective discrete optimization problems. J. Global Optim. 62(1):79–99.Crossref, Google Scholar
• Köksalan M, Lokman B (2015) Finding nadir points in multi-objective integer programs. J. Global Optim. 62(1):55–77.Crossref, Google Scholar
• Lokman B, Köksalan M (2013) Finding all nondominated points of multi-objective integer programs. J. Global Optim. 57(2):347–365.Crossref, Google Scholar
• Nicholson E, Possingham HP (2006) Objectives for multiple-species conservation planning. Conservation Biol. 20(3):871–881.Crossref, Google Scholar
• Özlen M, Burton BA, MacRae CAG (2013) Multi-objective integer programming: An improved recursive algorithm. J. Optim. Theory Appl. 160(2):470–482.Crossref, Google Scholar
• Özpeynirci Ö (2017) On nadir points of multiobjective integer programming problems. J. Global Optim. 69(3):699–712.Google Scholar
• Özpeynirci Ö, 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
• Przybylski A, Gandibleux X (2017) Multi-objective branch and bound. Eur. J. Oper. Res. 260(3):856–872.Crossref, Google Scholar
• Przybylski A, Gandibleux X, Ehrgott M (2010) A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optim. 7(3):149–165.Crossref, Google Scholar
• Sayin S (2000) Optimizing over the efficient set using a top-down search of faces. Oper. Res. 48(1):65–72.Link, Google Scholar
• Shao L, Ehrgott M (2016) Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes. Optim. J. Math. Programming Oper. Res. 65(2):415–431.Google Scholar
• Soylu B, Yıldız GB (2016) An exact algorithm for biobjective mixed integer linear programming problems. Comput Oper. Res. 72(August):204–213.Crossref, Google Scholar
• Vincent T, Seipp F, Ruzika S, Przybylski A, Gandibleux X (2013) Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for biobjective case. Comput Oper. Res. 40(1):498–509.Crossref, Google Scholar
• Yamamoto Y (2002) Optimization over the efficient set: Overview. J. Global Optim. 22(1–4):285–317.Crossref, Google Scholar