Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.

DOI10.1007/s11766-003-0089-zzbMath1052.90085OpenAlexW3013101495MaRDI QIDQ1812224

San-Yang Liu, Yi-hong Xu

Publication date: 2003

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-003-0089-z

zbMATH Keywords

Lagrangian multiplier theoremnearly cone-subconvexlike functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (5)

On super efficiency in set-valued optimization ⋮ Globally proper saddle point in ic-cone-convexlike set-valued optimization problems ⋮ Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones ⋮ Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior ⋮ Optimality conditions of vector set-valued optimization problem involving relative interior

Cites Work

• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Benson proper efficiency in the vector optimization of set-valued maps
• The optimality conditions for vector optimization of set-valued maps
• Near-subconvexlikeness in vector optimization with set-valued functions
• Unnamed Item

This page was built for publication: Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.