The vector linear program solver \textit{Bensolve} -- notes on theoretical background
From MaRDI portal
Publication:1753500
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.
Recommendations
- Benson type algorithms for linear vector optimization and applications
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- On an algorithm for solving a linear vector optimization problem
- A parametric simplex algorithm for linear vector optimization problems
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
Cites work
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A revised simplex method for linear multiple objective programs
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Analysis of the objective space in multiple objective linear programming
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Benson type algorithms for linear vector optimization and applications
- Further analysis of an outcome set-based algorithm for multiple-objective linear programming
- Geometric Duality in Multiple Objective Linear Programming
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
- Solution concepts in vector optimization: a fresh look at an old story
- Solving multiple objective linear programs in objective space
- The Complexity of Vertex Enumeration Methods
- Vector Optimization with Infimum and Supremum
Cited in
(34)- A set optimization approach to zero-sum matrix games with multi-dimensional payoffs
- A graph-based algorithm for the multi-objective optimization of gene regulatory networks
- Cone distribution functions and quantiles for multivariate random variables
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
- Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
- Locating a semi-obnoxious facility in the special case of Manhattan distances
- Computation of quantile sets for bivariate ordered data
- Incomplete risk-preference information in portfolio decision analysis
- Convex projection and convex multi-objective optimization
- A norm minimization-based convex vector optimization algorithm
- Efficient allocation of resources to a portfolio of decision making units
- Solving polyhedral d.c. optimization problems via concave minimization
- The polyhedral projection problem
- Multi-criteria decision making via multivariate quantiles
- A new exact method for linear bilevel problems with multiple objective functions at the lower level
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- Inner approximation algorithm for solving linear multiobjective optimization problems
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver
- A parametric simplex algorithm for linear vector optimization problems
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- A matheuristic for tri-objective binary integer linear programming
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- Outer approximation algorithms for convex vector optimization problems
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- PaMILO: a solver for multi-objective mixed integer linear optimization and beyond
- Augmenting bi-objective branch and bound by scalarization-based information
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- On unbounded polyhedral convex set optimization problems
- Global solution algorithms for DC programming via polyhedral approximations of convex functions
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- On improvements of multi-objective branch and bound
- On parallel and batch-cutting strategies for norm-minimization-based convex vector optimization
This page was built for publication: The vector linear program solver \textit{Bensolve} -- notes on theoretical background
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753500)
