Optimality Conditions For Strictly Efficient Solutions Of Preinvex Set-Valued Optimization

In normed linear spaces, the set-valued optimization problem is considered in the sense of strictly efficiency with contingent tangent derivative.When both the objective function and constrained function are preinvex set-valued functions with the same vector function, by applying separation theorem for convex sets, Kuhn-Tucker type necessary optimality condition is attained for set-valued optimization problem to obtain its strictly efficient solutions. By using properties of contingent tangent derivative,with constructive method, the sufficiency optimality condition is also attained.