Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver
DOI10.1080/02331934.2018.1518447zbMath1425.52014arXiv1801.10584OpenAlexW2962737507WikidataQ129195065 ScholiaQ129195065MaRDI QIDQ5198001
Daniel Ciripoi, Benjamin Weißing, Andreas Löhne
Publication date: 2 October 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.10584
polyhedronpolyhedral setmultiple objective linear programmingpolyhedral convex analysispolyhedron computations
Computational aspects related to convexity (52B55) Multi-objective and goal programming (90C29) Linear programming (90C05)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- Benson type algorithms for linear vector optimization and applications
- 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
- The polyhedral projection problem
- Vector Optimization with Infimum and Supremum
- Geometric Duality in Multiple Objective Linear Programming
- Undergraduate Convexity
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver
- Foundations of Optimization
- State Constraints in Convex Control Problems of Bolza
This page was built for publication: Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver