The natural ordering cone of a polyhedral convex set-valued objective mapping
From MaRDI portal
Publication:6648849
DOI10.1080/02331934.2024.2377237MaRDI QIDQ6648849
Publication date: 5 December 2024
Published in: Optimization (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Linear programming (90C05) Mathematical programming (90C99)
Cites Work
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- Linear multiobjective programming
- The polyhedral projection problem
- Set Optimization—A Rather Short Introduction
- Multiobjective Linear Programming
- Vector Optimization with Infimum and Supremum
- Solution concepts in vector optimization: a fresh look at an old story
- An algorithm to solve polyhedral convex set optimization problems
This page was built for publication: The natural ordering cone of a polyhedral convex set-valued objective mapping