A parametric simplex algorithm for linear vector optimization problems
213 - 242
Item Usage Stats
MetadataShow full item record
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. © 2016, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society.
Linear vector optimization
Multiple objective optimization
Parameter space segmentation
Linear optimization problems
Published Version (Please cite this version)http://dx.doi.org/10.1007/s10107-016-1061-z
Showing items related by title, author, creator and subject.
Madsen, K.; Nielsen H. B.; Pınar, M. Ç. (Elsevier, 1994)New characterizations of the ℓ1 solutions to overdetermined system of linear equations are given. The first is a polyhedral characterization of the solution set in terms of a special sign vector using a simple property of ...
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming Sayın, S. (Elsevier, 1996)We propose a method for finding the efficient set of a multiple objective linear program based on the well-known facial decomposition of the efficient set. The method incorporates a simple linear programming test that ...
Aykanat, C.; Özgü, Ö.; Güven, N. (IEEE, 1995)Standard sparsity-based algorithms used in power system appllcations need to be restructured for efficient vectorization due to the extremely short vectors processed. Further, intrinsic architectural features of vector ...