Generator Sets for the Minkowski Sum Problem -- Theory and Insights

This paper considers a class of multi-objective optimization problems known as Minkowski sum problems. Minkowski sum problems have a decomposable structure, where the global nondominated (Pareto) set corresponds to the Minkowski sum of several local nondominated sets. In some cases, the vectors of local sets does not contribute to the generation of the global nondominated set, and may therefore lead to wasted computational efforts. Therefore, we investigate theoretical properties of both necessary and redundant vectors, and propose an algorithm based on bounding sets for identifying unnecessary local vectors. We conduct extensive numerical experiments to test the the impact of varying characteristics of the instances on the resulting global nondominated set and the number of redundant vectors.