ε-strictly efficient solutions of vector optimization problems with set-valued maps

In this paper, the notion of epsilon-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, epsilon-Lagrangian multiplier theorem, epsilon-saddle point theorems and epsilon-duality assertions are established for epsilon-strictly efficient solution.