The vector linear program solver Bensolve -- notes on theoretical background
arXiv:1510.04823 · doi:10.1016/j.ejor.2016.02.039
Abstract
Bensolve is an open source implementation of Benson's algorithm and its dual variant. Both algorithms compute primal and dual solutions of vector linear programs (VLP), which include the subclass of multiple objective linear programs (MOLP). The recent version of Bensolve can treat arbitrary vector linear programs whose upper image does not contain lines. This article surveys the theoretical background of the implementation. In particular, the role of VLP duality for the implementation is pointed out. Some numerical examples are provided.
arXiv comment17 pages, 5 tables, 1 figure
References in corpus (3)
Cited by in corpus (14)
- A Survey of Multi-Objective Optimization in Wireless Sensor Networks: Metrics, Algorithms and Open Problems
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- A Parametric Simplex Algorithm for Linear Vector Optimization Problems
- Computing Convex Hulls of Trajectories
- Multi-Objective Mixed Integer Programming: An Objective Space Algorithm
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
- Feasibility Governor for Linear Model Predictive Control
- Geometric duality and parametric duality for multiple objective linear programs are equivalent
- Characterizing and Computing the Set of Nash Equilibria via Vector Optimization
- On unbounded polyhedral convex set optimization problems
- A set optimization approach to zero-sum matrix games with multi-dimensional payoffs
- On Parallel and Batch-Cutting Strategies for Norm-Minimization-Based Convex Vector Optimization
- Computation of quantile sets for bivariate data
- A LP relaxation based matheuristic for multi-objective integer programming