Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142434 | Operations Research Letters | 2014 | 8 Pages |
Abstract
This paper proposes a new classical method to capture the complete Pareto set of a multi-criteria optimization problem (MOP) even without having any prior information about the location of Pareto surface. The solutions obtained through the proposed method are globally Pareto optimal. Moreover, each and every global Pareto optimal point is within the attainable range. This paper also suggests a procedure to ensure the proper Pareto optimality of the outcomes if slight modifications are allowed in the constraint set of the MOP under consideration. Among the set of all outcomes, the proposed method can effectively detect the regions of unbounded trade-offs between the criteria, if they exist.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Debdas Ghosh, Debjani Chakraborty,