Under study are some vector optimization problems over the space of Minkowski balls, i. e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals; e.g., given the surface area of a symmetric convex body x, we try to maximize the volume of x and minimize the width of x simultaneously.Date: March 22, 2013.