Optimality conditions in multiobjective differentiable programming |
| |
Authors: | C Singh |
| |
Institution: | (1) St. Lawrence University, Canton, New York |
| |
Abstract: | 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.The author is thankful to the unknown referce whose comments improved the quality of the paper. |
| |
Keywords: | Constraint qualification convergence of a vector convexity necessary and sufficient conditions Pareto minimal solutions pseudoconvexity quasiconvexity |
本文献已被 SpringerLink 等数据库收录! |