Optimality Conditions for Set-Valued Optimization Problems

In this paper, we first prove that the generalized subconvexlikeness introduced by Yang, Yang and Chen [1] and the presubconvelikeness introduced by Zeng [2] are equivalent. We discuss set-valued nonconvex optimization problems and obtain some optimality conditions.