On unbounded polyhedral convex set optimization problems

MaRDI QIDQ6621985FDOQ6621985

Andreas Löhne, Author name not available (Why is that?)

Publication date: 21 October 2024

Published in: Minimax Theory and its Applications (Search for Journal in Brave)

zbMATH Keywords

set optimizationsolution methodsmultiple objective linear programmingvector linear programming

Mathematics Subject Classification ID

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

Cites Work

• Vector Optimization with Infimum and Supremum
• Duality for Set-Valued Measures of Risk
• An algorithm to solve polyhedral convex set optimization problems
• AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS
• Set-valued risk measures for conical market models
• The vector linear program solver Bensolve -- notes on theoretical background
• Solution concepts in vector optimization: a fresh look at an old story
• Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
• Set Optimization—A Rather Short Introduction
• Undergraduate Convexity
• Cone distribution functions and quantiles for multivariate random variables
• A new approach to duality in vector optimization
• The polyhedral projection problem
• Note: An algorithm to solve polyhedral convex set optimization problems

This page was built for publication: On unbounded polyhedral convex set optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621985)