Pareto optimality in multiobjective problems |
| |
Authors: | Yair Censor |
| |
Institution: | (1) Department of Mathematics, University of Haifa, Mt. Carmel, Haifa, Israel;(2) Present address: Dept. of Computer Science, State University of New York at Buffalo, 4226 Ridge Lea Rd., 14226 Amherst, N.Y., USA |
| |
Abstract: | In this study, the optimization theory of Dubovitskii and Milyutin is extended to multiobjective optimization problems, producing new necessary conditions for local Pareto optima. Cones of directions of decrease, cones of feasible directions and a cone of tangent directions, as well as, a new cone of directions of nonincrease play an important role here. The dual cones to the cones of direction of decrease and to the cones of directions of nonincrease are characterized for convex functionals without differentiability, with the aid of their subdifferential, making the optimality theorems applicable. The theory is applied to vector mathematical programming, giving a generalized Fritz John theorem, and other applications are mentioned. It turns out that, under suitable convexity and regularity assumptions, the necessary conditions for local Pareto optima are also necessary and sufficient for global Pareto optimum. With the aid of the theory presented here, a result is obtained for the, so-called, scalarization problem of multiobjective optimization.The author's work in this area is now supported by NIH grants HL 18968 and HL 4664 and NCI contract NO1-CB-5386. |
| |
Keywords: | Multiobjective optimization Pareto optimality cones of directions dual cones convexity sub-differential vector mathematical programming scalarizationgif" alt="ldquo" align="MIDDLE" BORDER="0">scalarization" target="_blank">gif" alt="rdquo" align="MIDDLE" BORDER="0"> |
本文献已被 SpringerLink 等数据库收录! |
|