Separation functions and optimality conditions in vector optimization (Q1686672): Difference between revisions

The authors consider a constrained vector optimization problem with nonconvex data. They introduce a class of nonconvex separation functions and use them to establish a relationship between efficient/weakly efficient solutions of the problem and associated Lagrangian functions. They derive also Karush-Kuhn-Tucker conditions for the problem when the data are Lipschitz continuous.