Super efficiency in vector optimization with nearly convexlike set-valued maps

AbstractIn this paper, we establish a scalarization theorem and a Lagrange multiplier theorem for super efficiency in vector optimization problem involving nearly convexlike set-valued maps. A dual is proposed and duality results are obtained in terms of super efficient solutions. A new type of saddle point, called super saddle point, of an appropriate set-valued Lagrangian map is introduced and is used to characterize super efficiency