Optimality conditions in multiobjective differentiable programming (Q1076613): Difference between revisions

Necessary conditions not requiring convexity are based on the convergence of a vector at a point and on Motzkin's theorem of the alternative. A constraint qualification is also involved in the establishment of necessary conditions. Three theorems on sufficiency require various levels of convexity on the component of the functions involved, and the equality constraints are not necessarily linear. Scalarization of the objective function is used only in the last sufficiency theorem.