Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
From MaRDI portal
Publication:343821
DOI10.1007/s00186-016-0554-0zbMath1370.90250arXiv1507.00228OpenAlexW2212241622MaRDI QIDQ343821
Andreas Löhne, Benjamin Weißing
Publication date: 29 November 2016
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.00228
Computational aspects related to convexity (52B55) Multi-objective and goal programming (90C29) Linear programming (90C05)
Related Items (15)
Time Consistency of the Mean-Risk Problem ⋮ Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ Convex projection and convex multi-objective optimization ⋮ A norm minimization-based convex vector optimization algorithm ⋮ Acceptability maximization ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ On the approximation of unbounded convex sets by polyhedra ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ A vector linear programming approach for certain global optimization problems ⋮ Locating a semi-obnoxious facility in the special case of Manhattan distances ⋮ Approximation of convex bodies by multiple objective optimization and an application in reachable sets ⋮ Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver ⋮ The polyhedral projection problem ⋮ Inner approximation algorithm for solving linear multiobjective optimization problems
Uses Software
Cites Work
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- Solving multiple objective linear programs in objective space
- On polyhedral projection and parametric programming
- Theory of multiobjective optimization
- Analysis of the objective space in 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
- The vector linear program solver Bensolve -- notes on theoretical background
- Interactive decision maps. Approximation and visualization of Pareto frontier
- On the dual of the solvency cone
- Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs
- Vector Optimization with Infimum and Supremum
- Solution concepts in vector optimization: a fresh look at an old story
- Vektormaximumproblem und parametrische optimierung
- State Constraints in Convex Control Problems of Bolza
This page was built for publication: Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
