Lin [1] has shown that general multiple-objective (MO) optimization problems can be solved by transforming them into single-objective (SO) optimization problems with all but one of the multiple objectives converted to proper equality constraints. This paper continues the development of such a general-purpose MO optimization method. It is shown here that Lagrange multipliers, which are intermediate by-products in the process of solving SO constrained optimization problems (by analytical or numerical methods), can be effectively utilized for testing/verifying whether the objective-converted equality constraints are proper or not. Several useful necessary and sufficient conditions for properness are derived and expressed in terms of Lagrange multipliers. These necessary and sufficient conditions are derived using no convexity or concavity assumptions. They are suitable for general analytical characterization of Pareto-optimal solutions, as well as for numerical generation of Pareto-optimal solutions by penalty methods, primal-dual methods, and Hestenes-Powell-Rockafellar methods of multipliers.
[1]
Jiguan G. Lin.
Three Methods for Determining Pareto-Optimal Solutions of Multiple-Objective Problems
,
1976
.
[2]
Dimitri P. Bertsekas,et al.
Multiplier methods: A survey
,
1975,
at - Automatisierungstechnik.
[3]
L. Hurwicz,et al.
Constraint Qualifications in Maximization Problems
,
1961
.
[4]
J. Lin.
Maximal vectors and multi-objective optimization
,
1976
.
[5]
Multiple-objective programming: Lagrange multipliers and method of proper equality constraints
,
1976
.
[6]
Olvi L. Mangasarian,et al.
Nonlinear Programming
,
1969
.
[7]
JiGuan G. Lin.
Multiple-objective problems: Pareto-optimal solutions by method of proper equality constraints
,
1976
.