Existence and optimality conditions for approximate solutions to vector optimization problems

From MaRDI portal
Publication:2429404


DOI10.1007/s10957-011-9891-6zbMath1246.90134MaRDI 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


90C29: Multi-objective and goal programming

90C59: Approximation methods and heuristics in mathematical programming


Related Items

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



Cites Work