Compactness, Contractibility and Fixed Point Properties of the Pareto Sets in Multi-Objective Programming

HTML  Download Download as PDF (Size: 110KB)  PP. 556-561  
DOI: 10.4236/am.2011.25073    5,958 Downloads   10,449 Views  Citations

Affiliation(s)

.

ABSTRACT

This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, and compactness, contractibility and fixed point properties of the Pareto sets. The authors have tried to remove the concavity assumptions on the objective functions which are usually used in multi-objective maximization problems. The results are based on constructing a retraction from the feasible domain onto the Pareto-optimal set.

Share and Cite:

Z. Slavov and C. Evans, "Compactness, Contractibility and Fixed Point Properties of the Pareto Sets in Multi-Objective Programming," Applied Mathematics, Vol. 2 No. 5, 2011, pp. 556-561. doi: 10.4236/am.2011.25073.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.