Abstract

By using the concepts of local cone approximations and K-directional derivatives, we obtain necessary conditions of optimality for the weak efficiency of the vectorial optimization problems with the inequalities and abstract constraints. We introduce the notion of stationary point (weak and strong) and we prove that, under suitable hypotheses of K-invexity, the stationary points are weakly efficient solutions (global). © 2009 Taylor & Francis.