Nearly Subconvexlike Set-Valued Maps and Vector Optimization Problems

摘要

This paper gives several characterizations of nearly subconvexlike set-valued maps (see Ref. 1) and shows that a weakly efficient solution and a Benson properly efficient solution of a vector optimization problem with nearly-subconvexlike objectives and constraints can be expressed in terms of saddle points defined in a suitable sense.