On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives

摘要

In this paper, we study a nondifferentiable constrained vector optimization problem where the partial order in the image space is induced by a closed, convex and pointed cone with nonempty interior. Under the C-convexity assumption, we present necessary and sufficient KKT optimality conditions for weakly C-E-efficient solutions. In addition, we formulate a Wolfe-type dual problem, and then weak and strong duality theorems are presented.