Article ID: | iaor20091335 |
Country: | Netherlands |
Volume: | 40 |
Issue: | 1 |
Start Page Number: | 73 |
End Page Number: | 95 |
Publication Date: | May 2008 |
Journal: | Computational Optimization and Applications |
Authors: | Jacobson Sheldon H., Kao Gio K. |
Keywords: | pareto-optimality |
Multi-objective optimization algorithms can generate large sets of Pareto optimal (non-dominated) solutions. Identifying the best solutions across a very large number of Pareto optimal solutions can be a challenge. Therefore it is useful for the decision-maker to be able to obtain a small set of preferred Pareto optimal solutions. This paper analyzes a discrete optimization problem introduced to obtain optimal subsets of solutions from large sets of Pareto optimal solutions. This discrete optimization problem is proven to be