Solution concepts in vector optimization: a fresh look at an old story
From MaRDI portal
Publication:3111144
Recommendations
Cites work
- A Generalization of a Theorem of Arrow, Barankin, and Blackwell
- A New Abb Theorem In Banach Spaces
- A duality theorem for a convex programming problem in order complete vector lattices
- A duality theory for set-valued functions. I: Fenchel conjugation theory
- A new ABB theorem in normed vector spaces
- A new approach to duality in vector optimization
- Conjugate duality in vector optimization
- General duality in vector optimization
- Geometric Duality in Multiple Objective Linear Programming
- Lattice-valued mappings, completely distributive law and induced spaces
- On supremum of a set in a multidimensional space
- On the density of proper efficient points
- Semi-continuous mappings in general topology
- Semicontinuity of vector-valued mappings
- Set-valued duality theory for multiple objective linear programs and application to mathematical finance
- Supremal points and generalized duality
- The geometry of Pareto efficiency over cones
Cited in
(35)- New Farkas-type results for vector-valued functions: a non-abstract approach
- A Minty variational principle for set optimization
- Editorial. Choosing sets: preface to the special issue on set optimization and applications
- Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
- Existence of solutions for polyhedral convex set optimization problems
- Variational inequalities characterizing weak minimality in set optimization
- Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- Applying set optimization to weak efficiency
- A Fenchel-Rockafellar duality theorem for set-valued optimization
- Benson type algorithms for linear vector optimization and applications
- A set optimization approach to zero-sum matrix games with multi-dimensional payoffs
- Set-valued shortfall and divergence risk measures
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- scientific article; zbMATH DE number 4189483 (Why is no real title available?)
- A norm minimization-based convex vector optimization algorithm
- The natural ordering cone of a polyhedral convex set-valued objective mapping
- Vector optimization problems and their solution concepts
- Farkas-type results for vector-valued functions with applications
- A survey of set optimization problems with set solutions
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
- Set Optimization—A Rather Short Introduction
- A set optimization approach to utility maximization under transaction costs
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- A new concept of slope for set-valued maps and applications in set optimization studied with Kuroiwa's set approach
- The Hopf-Lax formula for multiobjective costs with non-constant discount via set optimization
- On unbounded polyhedral convex set optimization problems
- Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- An algorithm to solve polyhedral convex set optimization problems
- Lagrange duality in set optimization
- Primal and dual approximation algorithms for convex vector optimization problems
- Robust optimization revisited via robust vector Farkas lemmas
This page was built for publication: Solution concepts in vector optimization: a fresh look at an old story
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111144)
