Inner approximation algorithm for solving linear multiobjective optimization problems

DOI10.1080/02331934.2020.1737692zbMath1475.90089arXiv1808.01786OpenAlexW3012502442MaRDI QIDQ5009156

László Csirmaz

Publication date: 19 August 2021

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

dualitymultiobjective optimizationdouble descriptionobjective spacevertex enumeration

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items (1)

Twenty years of continuous multiobjective optimization in the twenty-first century

Uses Software

• GLPK
• BENSOLVE

Cites Work

• Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• Primal and dual approximation algorithms for convex vector optimization problems
• Benson type algorithms for linear vector optimization and applications
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• How good are convex hull algorithms?
• The vector linear program solver Bensolve -- notes on theoretical background
• New modification of the double description method for constructing the skeleton of a polyhedral cone
• Lectures on Polytopes
• Geometric duality and parametric duality for multiple objective linear programs are equivalent

This page was built for publication: Inner approximation algorithm for solving linear multiobjective optimization problems