On Pareto Sets in Multi-Criteria Optimization
Mathematics and Education in Mathematics, Tome 40 (2011) no. 1, pp. 207-212
Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library
In this work we consider the Pareto solutions in continuous multi-criteria optimization
problem. We discuss the role of some assumptions that affect the characteristics of
Pareto sets. We have tried to remove the assumptions for concavity of the objective
functions and convexity of the feasible domain which are usually used in multi-criteria
optimization problems. The results are based on the construction of a retraction from
the feasible domain onto the Pareto-optimal set. *2000 Mathematics Subject Classification: 90C29.
Keywords:
Multi-Criteria Optimization, Pareto-Optimal, Pareto-Front, Retract, Compact
@article{MEM_2011_40_1_a19,
author = {Slavov, Zdravko},
title = {On {Pareto} {Sets} in {Multi-Criteria} {Optimization}},
journal = {Mathematics and Education in Mathematics},
pages = {207--212},
publisher = {mathdoc},
volume = {40},
number = {1},
year = {2011},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MEM_2011_40_1_a19/}
}
Slavov, Zdravko. On Pareto Sets in Multi-Criteria Optimization. Mathematics and Education in Mathematics, Tome 40 (2011) no. 1, pp. 207-212. http://geodesic.mathdoc.fr/item/MEM_2011_40_1_a19/