This paper describes the rationale for using clustering methods to reduce the size of the Pareto optimal set whilst retaining its shape. It proceeds lo describe an implementation of the complete-linkage clustering method and demonstrates its application. Finally, the method is incorporated into a Pareto optimal serial dynamic programming process to reduce the size of the Pareto optimal set generated at each stage of the optimization.
No takes yet. Share an insight, caveat, or question.
Rosenman et al. (1985) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: