The vector linear program solver Bensolve – notes on theoretical background

European Journal of Operational Research

Volumn 260, Issue 3, 2017, Pages 807-813

  Löhne, Andreas ^a   Weißing, Benjamin ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Linear vector optimization; Multi objective optimization; Vector linear programming

Indexed keywords

ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; OPEN SOURCE SOFTWARE; OPTIMIZATION; VECTORS;

ARBITRARY VECTORS; DUAL SOLUTIONS; LINEAR PROGRAMS; LINEAR VECTORS; MULTIPLE OBJECTIVE LINEAR PROGRAMS; OPEN SOURCE IMPLEMENTATION;

LINEAR PROGRAMMING;

EID: 84961223706     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2016.02.039     Document Type: Article

References (19)

1. Benson, H., Further analysis ofan outcome set-based algorithm for multiple-objective linear programming. Journal of Optimization Theory and Applications 97:1 (1998), 1–10.
2. Benson, H., An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. Journal of Global Optimization 13 (1998), 1–24.
3. Bökler, F., Mutzel, P., 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, 2015, Springer Berlin Heidelberg, 288–299.
4. Csirmaz, L., Using multiobjective optimization to map the entropy region. Computational Optimization and Applications, 2015, 1–23.
5. Dauer, J.P., Analysis of the objective space in multiple objective linear programming. Journal of Mathematical Analysis and Applications 126:2 (1987), 579–593.
6. Dauer, J.P., Liu, Y.-H., Solving multiple objective linear programs in objective space. European Journal of Operational Research 46:3 (1990), 350–357.
7. Dyer, M.E., The complexity of vertex enumeration methods. Mathematics of Operations Research 8:3 (1983), 381–402.
8. Ehrgott, M., Löhne, A., Shao, L., A dual variant of Benson's outer approximation algorithm. Journal of Global Optimization 52:4 (2012), 757–778.
9. Evans, J., Steuer, R., A revised simplex method for linear multiple objective programs. Mathematical Programming 5 (1973), 54–72.
10. Fukuda, K., Prodon, A., Double description method revisited. Combinatorics and computer science (Brest, 1995) Lecture Notes in Comput. Sci., Vol. 1120, 1996, Springer, Berlin, 91–111.
11. Hamel, A.H., Löhne, A., Rudloff, B., Benson type algorithms for linear vector optimization and applications. Journal of Global Optimization 59:4 (2014), 811–836.
12. Heyde, F., Löhne, A., Geometric duality in multiple objective linear programming. SIAM Journal on Optimization 19:2 (2008), 836–845.
13. Heyde, F., Löhne, A., Solution concepts in vector optimization: a fresh look at an old story. Optimization 60:12 (2011), 1421–1440.
14. Löhne, A., Vector optimization with infimum and supremum Vector Optimization, 2011, Springer, Berlin.
15. Löhne, A., & Weißing, B. (2015). Bensolve – VLP solver, version 2.0.1. http://bensolve.org (accessed 08.03.16).
16. Löhne, A., & Weißing, B. (2015). Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming. arXiv:1507.00228.
17. Schrijver, A., Theory of linear and integer programming Wiley-Interscience Series in Discrete Mathematics, 1986, John Wiley & Sons, Ltd., Chichester A Wiley-Interscience Publication.
18. Shao, L., Ehrgott, M., Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Mathematical Methods of Operations Research 68:2 (2008), 257–276.
19. Steuer, R., ADBASE multiple objective linear programming package. Technical Report, 1989, University of Georgia, Athens, Georgia.