In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (the Evans–Steuer) algorithm (Math Program 5(1):54–72, 1973). Different from it, the proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions. Instead, it finds a solution in the sense of Löhne (Vector optimization with infimum and supremum. Springer, Berlin, 2011), that is, it finds a subset of efficient solutions that allows to generate the whole efficient frontier. In that sense, it can also be seen as a generalization of the parametric self-dual simplex algorithm, which originally is designed for solving single objective linear optimization problems, and is modified to solve two objective bounded LVOPs with the positive orthant as the ordering cone in Ruszczyński and Vanderbei (Econometrica 71(4):1287–1297, 2003). The algorithm proposed here works for any dimension, any solid pointed polyhedral ordering cone C and for bounded as well as unbounded problems. Numerical results are provided to compare the proposed algorithm with an objective space based LVOP algorithm [Benson’s algorithm in Hamel et al. (J Global Optim 59(4):811–836, 2014)], that also provides a solution in the sense of Löhne (2011), and with the Evans–Steuer algorithm (1973). The results show that for non-degenerate problems the proposed algorithm outperforms Benson’s algorithm and is on par with the Evans–Steuer algorithm. For highly degenerate problems Benson’s algorithm (Hamel et al. 2014) outperforms the simplex-type algorithms; however, the parametric simplex algorithm is for these problems computationally much more efficient than the Evans–Steuer algorithm.
Linear vector optimization Multiple objective optimization Algorithms Parameter space segmentation
Mathematics Subject Classification
90C29 90C05 90-08
This is a preview of subscription content, log in to check access.
We would like to thank Andreas Löhne, Friedrich-Schiller-Universität Jena, for helpful remarks that greatly improved the manuscript, and Ralph E. Steuer, University of Georgia, for providing us the ADBASE implementation of the algorithm from . Vanderbei’s research was supported by the Office of Naval Research under Award Number N000141310093 and N000141612162.
Bencomo, M., Gutierrez, L., Ceberio, M.: Modified Fourier-Motzkin elimination algorithm for reducing systems of linear inequalities with unconstrained parameters. Departmental Technical Reports (CS) 593, University of Texas at El Paso (2011)Google Scholar
Benson, H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Global Optim. 13, 1–24 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
Przybylski, A., Gandibleux, X., Ehrgott, M.: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J. Comput. 22, 371–386 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
Schechter, M., Steuer, R.E.: A correction to the connectedness of the Evans–Steuer algorithm of multiple objective linear programming. Found. Comput. Decis. Sci. 30(4), 351–359 (2005)MathSciNetzbMATHGoogle Scholar
Shao, L., Ehrgott, M.: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Math. Methods Oper. Res. 68(2), 257–276 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
Shao, L., Ehrgott, M.: Approximating the nondominated set of an MOLP by approximately solving its dual problem. Math. Methods Oper. Res. 68(3), 469–492 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
Steuer, R.E.: A Multiple Objective Linear Programming Solver for All Efficient Extreme Points and All Unbounded Efficient Edges. Terry College of Business, University of Georgia, Athens (2004)Google Scholar
Vanderbei, R.J.: Linear Programming: Foundations and Extensions. Kluwer Academic Publishers, Dordrecht (2013)zbMATHGoogle Scholar
Zionts, S., Wallenius, J.: Identifying efficient vectors: some theory and computational results. Oper. Res. 28(3), 786–793 (1980)zbMATHGoogle Scholar