Pareto reducible multicriteria optimization problems

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 red...

Full description

Saved in:
Bibliographic Details
Published inOptimization Vol. 54; no. 3; pp. 253 - 263
Main Author Popovici, Nicolae
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis Group 01.06.2005
Taylor & Francis LLC
Subjects
Cone-radiant sets
Hierarchies
Mathematics Subject Classifications 2000: 90C29
Multicriteria optimization
Optimization
Pareto optimum
Pareto reducibility
Studies
Online AccessGet full text
ISSN0233-1934
1029-4945
DOI10.1080/02331930500096213

Cover

More Information
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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0233-1934
1029-4945
DOI:10.1080/02331930500096213