Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications

DOI10.1006/jmaa.2001.7635zbMath1018.90048OpenAlexW2076676994MaRDI QIDQ5957151

Xiao Qi Yang, Xue Xiang Huang

Publication date: 17 September 2002

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.2001.7635

zbMATH Keywords

vector optimizationcoercivityconvexitynonlinear Lagrangianweakly efficient solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)

Related Items (15)

Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization ⋮ Convergence of a class of penalty methods for constrained scalar set-valued optimization ⋮ On the existence of weak efficient solutions of nonconvex vector optimization problems ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ Asymptotic analysis in convex composite multiobjective optimization problems ⋮ Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems ⋮ Existence and boundedness of solutions in infinite-dimensional vector optimization problems ⋮ Characterizations of solution sets for parametric multiobjective optimization problems ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ On the structure of the weakly efficient set for quasiconvex vector minimization ⋮ Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ Coercivity properties and well-posedness in vector optimization ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of multiobjective optimization
• A unified approach to the existing three types of variational principles for vector valued functions
• Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
• Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
• Variational Analysis
• Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization

This page was built for publication: Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications