×

zbMATH — the first resource for mathematics

Pareto reducible multicriteria optimization problems. (English) Zbl 1087.90070
Summary: A multicriteria optimization problem is said to be Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself or for a subproblem obtained from it by selecting certain criteria. The aim of this article is to provide sufficient conditions for Pareto reducibility in a general framework, recovering in particular some known results concerning convex or explicitly quasiconvex criteria.

MSC:
90C29 Multi-objective and goal programming
90C26 Nonconvex programming, global optimization
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] DOI: 10.1287/mnsc.30.11.1346 · Zbl 0553.90095
[2] Malivert C, Journal of Convex Analysis 1 pp 143– (1994) · Zbl 0836.90130
[3] DOI: 10.1023/A:1022448811953 · Zbl 1090.90169
[4] DOI: 10.1006/jmaa.2000.6960 · Zbl 1009.90104
[5] DOI: 10.1023/A:1017571214523 · Zbl 1054.90065
[6] Benoist J, Nonlinear Analysis Forum 7 pp 67– (2002)
[7] Luc DT, Springer-Verlag (1989)
[8] DOI: 10.1080/02331930310001637396 · Zbl 1049.06014
[9] Debreu G, Theory of Value (1959)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.