Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces

DOI10.1007/S10957-008-9443-XzbMath1170.90473OpenAlexW2033930428MaRDI QIDQ1024244

J. Martínez

Publication date: 16 June 2009

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

Full work available at URL: https://doi.org/10.1007/s10957-008-9443-x

zbMATH Keywords

recession coneweakly efficient solutionconvex vector optimizationrecession function

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Related Items (9)

Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization ⋮ On the existence of weak efficient solutions of nonconvex vector optimization problems ⋮ Asymptotic analysis in convex composite multiobjective optimization problems ⋮ Existence and boundedness of solutions in infinite-dimensional vector optimization problems ⋮ Nonemptiness and boundedness of solution sets for vector variational inequalities via topological method ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ Boundedness and nonemptiness of solution sets for set-valued vector equilibrium problems with an application ⋮ Recession function and its applications in optimization ⋮ Improvement sets and convergence of optimal points

Cites Work

• Unnamed Item
• General existence theorems for unilateral problems in continuum mechanics
• A simple characterization of solutions sets of convex programs
• Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
• Vector equilibrium problems under asymptotic analysis
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Characterization of solution sets of convex programs
• Level Sets and Continuity of Conjugate Convex Functions
• Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications

This page was built for publication: Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces