Academia.eduAcademia.edu

To this effect, a recent study [32] has demonstrated that a particular EMO procedure,
starting from random non-optimal solutions, can progress towards the theoretical
Karush-Kuhn-Tucker (KKT) points with iterations in real-valued multi-objective
optimization problems. The main difference and advantage of using an EMO com-
pared to a posteriori MCDM procedures is that multiple trade-off solutions can be
found in a single run of an EMO algorithm, whereas most a posteriori MCDM
methodologies would require multiple independent runs.

Tee QGaencee 1 Af thw CRAATL *\.. hee eee bee ils eee Ae BRA Hee Sie bcaw

Figure 41 To this effect, a recent study [32] has demonstrated that a particular EMO procedure, starting from random non-optimal solutions, can progress towards the theoretical Karush-Kuhn-Tucker (KKT) points with iterations in real-valued multi-objective optimization problems. The main difference and advantage of using an EMO com- pared to a posteriori MCDM procedures is that multiple trade-off solutions can be found in a single run of an EMO algorithm, whereas most a posteriori MCDM methodologies would require multiple independent runs. Tee QGaencee 1 Af thw CRAATL *\.. hee eee bee ils eee Ae BRA Hee Sie bcaw