Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces

DOI10.1007/s11741-010-0662-3zbMath1240.90365OpenAlexW2075470519MaRDI QIDQ3016911

Zhiang Zhou

Publication date: 19 July 2011

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-010-0662-3

zbMATH Keywords

set-valued mapsvector closuregeneralized subconvexlikenessBenson proper efficient solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (1)

Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces

Cites Work

• Unnamed Item
• Proper efficiency in vector optimization on real linear spaces.
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• 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
• The optimality conditions for vector optimization of set-valued maps
• Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
• Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
• Near-subconvexlikeness in vector optimization with set-valued functions

This page was built for publication: Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces