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

DOI10.1080/02331931003665108zbMATH Open1258.90064OpenAlexW2017609413MaRDI QIDQ3111144FDOQ3111144

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

Recommendations

• Publication:5753753
• Publication:4945541
• On the notion of proper efficiency in vector optimization
• Proper solutions of vector optimization problems
• Weak \(S\)-efficient solution of vector optimization

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)

Cites Work

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

Cited In (34)

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

Uses Software

• BENSOLVE

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)