EURO 2024 Copenhagen
Abstract Submission

• Home
• Abstract submission
• Search abstract
• Topic keywords
• Streams
• F.A.Q.
• Program
• Help

51. A survey on polyhedral convex set optimization

Invited abstract in session TA-37: Objective Space-Based Approaches in Multiobjective Optimization, stream Multiobjective Optimization.

Tuesday, 8:30-10:00
Room: 33 (building: 306)

Authors (first author is the speaker)

1.	Andreas Löhne
	Institut für Mathematik, FSU Jena

Abstract

Set optimization is a generalization of multiobjective optimization where a value of the objective mapping is not a single vector but a set of vectors. Polyhedral convex set optimization is the simplest class of set optimization problems comparable to linear programming in the field of scalar optimization. We survey some recent developments including solution concepts, solution methods and applications.

Keywords

• Programming, Linear
• Programming, Multi-Objective
• Decision Support Systems

Status: accepted

---

Back to the list of papers

---