A Different Approach to Cone-Convex Optimization

Abstract

In classical convex optimization theory, the Karush-Kuhn-Tucker (KKT) optimality conditions are necessary and suffi cient for optimality if the objective as well as the constraint functions involved is convex. Recently, Lassere [1] con sidered a scalar programming problem and showed that if the convexity of the constraint functions is replaced by the convexity of the feasible set, this crucial feature of convex programming can still be preserved. In this paper , we gener alize his results by making them applicable to vector optimization problems (VOP) over cones. We consider the mini mization of a cone-convex function over a convex feasible set described by cone constraints that are not necessarily cone-convex. We show that if a Slater-type cone constraint qualification holds, then every weak minimizer of (VOP) is a KKT point and conversely every KKT point is a weak minimizer. Further a Mond-Weir type dual is formulated in the modified situation and various duality results are established.