Vectorization in set optimization (Q261980): Difference between revisions

This paper presents a method to convert a set optimization problem to a vector optimization problem. The author introduces two vector maps from a family of subsets of a locally convex space equipped with an ordering cone, to the 2-dimensional and 4-dimensional spaces of functions over the positive polar cone of the ordering cone. These two maps are used to construct two vector optimization problems associated with the set optimization problem with respect to the set less order relation and the minimax order relation. Equivalence between the vector optimization problems and the set optimization problem is established under certain convexity hypotheses.