Characterizations on -strictly efficient elements for binary set-valued functions with saddle points

zbMATH Open1363.90273MaRDI QIDQ3179855FDOQ3179855

Yihong Xu, Aihong Zhang

Publication date: 6 January 2017

Recommendations

• Generalized saddle point characterization of strictly efficient solutions in nearly cone-subconvexlike set-valued optimization problems
• Optimality conditions for set-valued optimization in the sense of \(\varepsilon\)-strict efficiency
• The saddle point and duality of set-valued optimization problem in the sense of strict efficiency
• scientific article; zbMATH DE number 1839662
• Strict efficiency of set-valued optimization and scalar set-valued Lagrange mapping

zbMATH Keywords

near cone-subconvexlikeness\(\varepsilon\)-strictly efficient elementbinary set-valued function

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Cited In (1)

• DEMICONTINUITY, GENERALIZED CONVEXITY AND LOOSE SADDLE POINTS OF SET-VALUED MAPS

This page was built for publication: Characterizations on \(\varepsilon\)-strictly efficient elements for binary set-valued functions with saddle points

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