Solution concepts in vector optimization: a fresh look at an old story

DOI10.1080/02331931003665108zbMath1258.90064OpenAlexW2017609413MaRDI QIDQ3111144

Andreas Löhne, Frank Heyde

Publication date: 18 January 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331931003665108

zbMATH Keywords

lower semicontinuitysolution conceptinfimal setattainment of infimumWeierstrass existence result

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48) Existence theories for problems in abstract spaces (49J27)

Related Items (29)

Robust optimization revisited via robust vector Farkas lemmas ⋮ Farkas-type results for vector-valued functions with applications ⋮ Applying set optimization to weak efficiency ⋮ A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ A set optimization approach to zero-sum matrix games with multi-dimensional payoffs ⋮ A norm minimization-based convex vector optimization algorithm ⋮ Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ A set optimization approach to utility maximization under transaction costs ⋮ SET-VALUED SHORTFALL AND DIVERGENCE RISK MEASURES ⋮ A Minty variational principle for set optimization ⋮ Primal and dual approximation algorithms for convex vector optimization problems ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ Variational inequalities characterizing weak minimality in set optimization ⋮ Lagrange duality in set optimization ⋮ The vector linear program solver Bensolve -- notes on theoretical background ⋮ An algorithm to solve polyhedral convex set optimization problems ⋮ Tractability of convex vector optimization problems in the sense of polyhedral approximations ⋮ Set Optimization—A Rather Short Introduction ⋮ A Survey of Set Optimization Problems with Set Solutions ⋮ Benson type algorithms for linear vector optimization and applications ⋮ Editorial. Choosing sets: preface to the special issue on set optimization and applications ⋮ A new concept of slope for set-valued maps and applications in set optimization studied with Kuroiwa's set approach ⋮ New Farkas-type results for vector-valued functions: a non-abstract approach ⋮ Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization ⋮ Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization ⋮ A Fenchel–Rockafellar duality theorem for set-valued optimization ⋮ The Hopf-Lax formula for multiobjective costs with non-constant discount via set optimization

Uses Software

• BENSOLVE

Cites Work

• A duality theory for set-valued functions. I: Fenchel conjugation theory
• Set-valued duality theory for multiple objective linear programs and application to mathematical finance
• On supremum of a set in a multidimensional space
• Semi-continuous mappings in general topology
• Lattice-valued mappings, completely distributive law and induced spaces
• Conjugate duality in vector optimization
• A duality theorem for a convex programming problem in order complete vector lattices
• Geometric Duality in Multiple Objective Linear Programming
• Supremal points and generalized duality
• A Generalization of a Theorem of Arrow, Barankin, and Blackwell
• General duality in vector optimization
• The geometry of Pareto efficiency over cones
• A new ABB theorem in normed vector spaces
• On the density of proper efficient points
• A New Abb Theorem In Banach Spaces
• A new approach to duality in vector optimization
• Semicontinuity of vector-valued mappings

This page was built for publication: Solution concepts in vector optimization: a fresh look at an old story