Existence and optimality conditions for approximate solutions to vector optimization problems

DOI10.1007/s10957-011-9891-6zbMath1246.90134OpenAlexW1973382558MaRDI QIDQ2429404

Yanyan Li

Publication date: 27 April 2012

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

Full work available at URL: https://doi.org/10.1007/s10957-011-9891-6

zbMATH Keywords

vector optimization problemsapproximate solutionsscalarizationlimiting subdifferentials\(\epsilon \)-efficiency

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (24)

Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces ⋮ Some properties of generalized oriented distance function and their applications to set optimization problems ⋮ A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ Properties of the nonlinear scalar functional and its applications to vector optimization problems ⋮ Conditional gradient method for vector optimization ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ On \(\epsilon\)-solutions for robust semi-infinite optimization problems ⋮ E-Benson proper efficiency in vector optimization ⋮ Approximate proper efficiency for multiobjective optimization problems ⋮ Generalized \({\varepsilon }\)-quasi solutions of set optimization problems ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems ⋮ Optimality conditions for quasi-solutions of vector optimization problems ⋮ Approximate solutions for nonconvex set-valued optimization and vector variational inequality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ekeland's variational principle in locally convex spaces and the density of extremal points
• A generalized Ekeland vector variational principle and its applications in optimization
• On approximate efficiency in multiobjective programming
• Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
• Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
• Epsilon efficiency
• General Ekeland's variational principle for set-valued mappings.
• Near-subconvexlikeness in vector optimization with set-valued functions
• Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• Two Types of Approximate Saddle Points
• Lipschitz properties of the scalarization function and applications
• Strict Efficiency in Set-Valued Optimization
• A Set-Valued Ekeland's Variational Principle in Vector Optimization
• Fuzzy necessary optimality conditions for vector optimization problems
• Necessary conditions for ε-optimality
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• On lagrange-kuhn-tucker multipliers for pareto optimization problems
• On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
• Degrees of Efficiency and Degrees of Minimality
• OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems

This page was built for publication: Existence and optimality conditions for approximate solutions to vector optimization problems