The vector linear program solver Bensolve -- notes on theoretical background

DOI10.1016/j.ejor.2016.02.039zbMath1403.90005arXiv1510.04823OpenAlexW2254347213MaRDI QIDQ1753500

Benjamin Weißing, Andreas Löhne

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.04823

zbMATH Keywords

linear vector optimizationvector linear programmingmulti objective optimization,

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (25)

Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ A set optimization approach to zero-sum matrix games with multi-dimensional payoffs ⋮ Convex projection and convex multi-objective optimization ⋮ A graph-based algorithm for the multi-objective optimization of gene regulatory networks ⋮ A norm minimization-based convex vector optimization algorithm ⋮ Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming ⋮ Cone distribution functions and quantiles for multivariate random variables ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ Efficient allocation of resources to a portfolio of decision making units ⋮ A new exact method for linear bilevel problems with multiple objective functions at the lower level ⋮ 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 ⋮ Solving polyhedral d.c. optimization problems via concave minimization ⋮ Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ Locating a semi-obnoxious facility in the special case of Manhattan distances ⋮ Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver ⋮ The polyhedral projection problem ⋮ Multi-criteria decision making via multivariate quantiles ⋮ Computation of quantile sets for bivariate ordered data ⋮ Incomplete risk-preference information in portfolio decision analysis ⋮ Inner approximation algorithm for solving linear multiobjective optimization problems

Uses Software

• ADBASE
• BENSOLVE

Cites Work

• Unnamed Item
• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• Benson type algorithms for linear vector optimization and applications
• Solving multiple objective linear programs in objective space
• Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
• Analysis of the objective space in multiple objective linear programming
• Further analysis of an outcome set-based algorithm for multiple-objective linear programming
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• Vector Optimization with Infimum and Supremum
• Solution concepts in vector optimization: a fresh look at an old story
• The Complexity of Vertex Enumeration Methods
• Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
• Geometric Duality in Multiple Objective Linear Programming
• A revised simplex method for linear multiple objective programs

This page was built for publication: The vector linear program solver Bensolve -- notes on theoretical background