Nearly subconvexlike set-valued maps and vector optimization problems

DOI10.1023/B:JOTA.0000005449.20614.41zbMath1055.90066MaRDI QIDQ597175

Pham Hu'u Sach

Publication date: 6 August 2004

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

vector optimizationsaddle pointsBenson proper efficiencyNear cone-subconvexlikeness

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Set-valued and variational analysis (49J53)

Related Items (22)

Approximate weakly efficient solutions of set-valued vector equilibrium problems ⋮ On super efficiency in set-valued optimization ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior ⋮ Duality results for generalized vector variational inequalities with set-valued maps ⋮ Superefficiency in vector optimization with nearly subconvexlike set-valued maps ⋮ Lagrangian duality in set-valued optimization ⋮ Strong duality with super efficiency in set-valued optimization ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ The effects of adding objectives to an optimisation problem on the solution set ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ Approximate duality for vector quasi-equilibrium problems and applications ⋮ New generalized convexity notion for set-valued maps and application to vector optimization ⋮ Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis ⋮ Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints ⋮ An optimal alternative theorem and applications to mathematical programming ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Improved \(\varepsilon\)-constraint method for multiobjective programming ⋮ Higher-order variational sets and higher-order optimality conditions for proper efficiency in set-valued nonsmooth vector optimization ⋮ Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Approximate Benson efficient solutions for set-valued equilibrium problems

Cites Work

• Unnamed Item
• Alternative theorems and optimality conditions with weakened convexity
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Benson proper efficiency in the vector optimization of set-valued maps
• A theorem of the alternative and its application to the optimization of set-valued maps
• A characterization of proper minimal points as solutions of sublinear optimization problems
• Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
• Lagrange multipliers and saddle points in multiobjective programming
• Near-subconvexlikeness in vector optimization with set-valued functions
• Theorems of the alternative and optimization with set-valued maps
• Convexlike alternative theorems and mathematical programming
• Minimax Theorems

This page was built for publication: Nearly subconvexlike set-valued maps and vector optimization problems