∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS

In this paper, the notion of ∊-strictly efficient solution for vector optimization with set-valued maps is introduced. Under the assumption of the ic-cone-convexlikeness for set-valued maps, the scalarization theorem, ∊-Lagrangian multiplier theorem, ∊-saddle point theorems and ∊-duality assertions are established for ∊-strictly efficient solution.