Supported nondominated points as a representation of the nondominated set: An empirical analysis

Abstract

The nondominated set of a multiple objective discrete optimization problem is known to contain unsupported nondominated points, which outnumber the supported ones and are more difficult to obtain. We treat supported nondominated points as a representation and analyse their quality using different metrics beyond their sheer numbers. Under different data generation schemes on multiobjective knapsack and assignment problems, we observe that supported nondominated points almost always provide a good representation of the entire nondominated set.