Abstract In this paper, we investigate solution approaches in set optimization that are based on so-called vectorization strategies. Thereby, the original set-valued problems are reformulated as multi-objective optimization problems, whose optimal solution sets approximate those of the original ones in a certain sense. We consider both infinite-dimensional and finite-dimensional vectorization approaches. In doing so, we collect and discuss the most important properties and relationships between the approaches.
Eichfelder et al. (Wed,) studied this question.