Existence of solutions for polyhedral convex set optimization problems

DOI10.1080/02331934.2023.2280018MaRDI QIDQ6632223

Andreas Löhne

Publication date: 4 November 2024

Published in: Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

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
• Analysis of the objective space in multiple objective linear programming
• Vector-valued coherent risk measures
• Set-valued risk measures for conical market models
• The polyhedral projection problem
• Set Optimization—A Rather Short Introduction
• Vector Optimization with Infimum and Supremum
• Solution concepts in vector optimization: a fresh look at an old story
• Duality for Set-Valued Measures of Risk
• An algorithm to solve polyhedral convex set optimization problems
• Set-valued Optimization
• Convex Analysis
• A new approach to duality in vector optimization

This page was built for publication: Existence of solutions for polyhedral convex set optimization problems