Many solution algorithms for multiobjective optimization problems are based on scalarization methods that transform the multiobjective problem into a scalar-valued optimization problem. In this article, we study the theory of weighted \(p\) -norm scalarizations. These methods minimize the distance induced by a weighted \(p\) -norm between the image of a feasible solution and a given reference point. We provide a comprehensive theory of the set of eligible weights and, in particular, analyze the topological structure of the normalized weight set. This set is composed of connected subsets, called weight set components which are in a one-to-one relation with the set of optimal images of the corresponding weighted \(p\) -norm scalarization. Our work generalizes and complements existing results for the weighted sum and the weighted Tchebycheff scalarization and provides new insights into the structure of the set of all Pareto optimal solutions.
