Globally proper efficiency of set optimization problems based on the certainly set less order relation

DOI10.1080/00036811.2023.2181165MaRDI QIDQ6549309zbMATH OpenFDO

Authors Zhiang Zhou, Min Huang, Elisabeth Köbis

Publication date 3 June 2024

Published in Applicable Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces
• Approximate solutions of vector optimization problems via improvement sets in real linear spaces
• Arcwise connectedness of the solution sets for set optimization problems
• Benson proper efficiency in the vector optimization of set-valued maps
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Connectedness of Henig weakly efficient solution set for set-valued optimization problems
• Connectedness of weak minimal solution set for set optimization problems
• Convergence of the solution sets for set optimization problems
• Existence theorems for set optimization problems
• Existence theorems of set optimization with set-valued maps
• Lagrangian duality in set-valued optimization
• New order relations in set optimization
• Nonconvex scalarization in set optimization with set-valued maps
• Nonlinear scalarizing functions in set optimization problems
• On cone convexity of set-valued maps
• Proper efficiency in vector optimization on real linear spaces.
• Set optimization using improvement sets
• Set-valued optimization. An introduction with applications
• Superefficiency in vector optimization with nearly subconvexlike set-valued maps
• The global proper efficiency for set-valued optimization problems via improvement sets
• Theorems of the alternative and optimization with set-valued maps
• Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
• Vector optimization problems via improvement sets
• Vector variational inequalities and vector optimization. Theory and applications
• Vectorization in set optimization

Cited in

(1)

• Pareto well-posedness for set-valued optimization problems in Geoffroy spaces

This page was built for publication: Globally proper efficiency of set optimization problems based on the certainly set less order relation

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