Abstract: This paper studies super efficient solution of the problem of minimizing a set-valued map subject to set-valued constraints in locally convex space. An useful property of ic-cone-convexlike set-valued maps is obtained. By using this property as the main tool, the optimality conditions and saddle point theorem for super efficient solution are proposed.

Key words: Set-valued mapping, ic-cone-convexlikeness, Super efficiency, Saddle point