Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces

DOI10.1080/02331934.2012.656117zbMath1320.90067OpenAlexW2079502742MaRDI QIDQ5413895

Zhi-Ang Zhou, Yang, Xinmin, Jian-Wen Peng

Publication date: 2 May 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.656117

zbMATH Keywords

optimality conditionsalternative theoremset-valued mapgeneralized cone subconvexlikenessrelative algebraic interior

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (5)

Vector optimization w.r.t. relatively solid convex cones in real linear spaces ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces ⋮ Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria

Cites Work

• Proper efficiency in vector optimization on real linear spaces.
• An optimal alternative theorem and applications to mathematical programming
• 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
• Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
• The optimality conditions for vector optimization of set-valued maps
• Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
• Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
• Efficient and weak efficient points in vector optimization with generalized cone convexity
• Near-subconvexlikeness in vector optimization with set-valued functions
• Theorems of the alternative and optimization with set-valued maps

This page was built for publication: Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces