Strong efficient solutions of nearly cone-subconvexlike set-valued vector optimization problems characterized by generalized saddle point

MaRDI QIDQ3537005zbMATH OpenFDO

Authors Guolin Yu, Sanyang Liu

Publication date 24 November 2008

zbMATH Keywords

set-valued mapstrong efficiencygeneralized saddle pointnearly cone-subconvexlike

Mathematics Subject Classification ID

Nonlinear programming (90C30) Set-valued and variational analysis (49J53) Set-valued maps in general topology (54C60)

Recommendations

• Generalized saddle point characterization of strictly efficient solutions in nearly cone-subconvexlike set-valued optimization problems
• Nearly subconvexlike set-valued maps and vector optimization problems
• Strong efficient solutions and Kuhn-Tucker saddle point of the set-valued optimization problems
• Super efficient point in vector optimization problems with set-valued maps characterized by generalized saddle point
• Scalarization and saddle-point for ic-cone-convexlike set-valued optimization problems

Cited in

(6)

• Super efficient point in vector optimization problems with set-valued maps characterized by generalized saddle point
• Strong efficient solutions and Kuhn-Tucker saddle point of the set-valued optimization problems
• Existence theorems of cone saddle-points in set optimization applying nonlinear scalarizations
• Saddle point theorems of generalized subconvexlike set-valued optimality
• Generalized saddle point characterization of strictly efficient solutions in nearly cone-subconvexlike set-valued optimization problems
• Nearly subconvexlike set-valued maps and vector optimization problems

This page was built for publication: Strong efficient solutions of nearly cone-subconvexlike set-valued vector optimization problems characterized by generalized saddle point

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537005)