On unbounded polyhedral convex set optimization problems
From MaRDI portal
Publication:6621985
Authors: Andreas Löhne 
Publication date: 21 October 2024
Published in: Minimax Theory and its Applications (Search for Journal in Brave)
Recommendations
- Existence of solutions for polyhedral convex set optimization problems
- An algorithm to solve polyhedral convex set optimization problems
- Note: An algorithm to solve polyhedral convex set optimization problems
- Generalized polyhedral convex optimization problems
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
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 \textit{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. From Fourier and Motzkin to Kuhn and Tucker
- 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
Cited In (2)
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)
