Optimality conditions in multiobjective differentiable programming

From MaRDI portal





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.




Cited in
(73)








This page was built for publication: Optimality conditions in multiobjective differentiable programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076613)