Optimization problems with fixed volume constraints and stability results related to rearrangement classes

The material in this paper has been divided into two main parts. In the first part we describe two optimization problems—one maximization and one minimization—related to a sharp trace inequality that was recently obtained by G. Auchmuty. In both problems the admissible set is the one comprising characteristic functions whose supports have a fixed measure. We prove the maximization to be solvable, whilst the minimization will turn out not to be solvable in general. We will also discuss the case of radial domains. In the second part of the paper, we study approximation and stability results regarding rearrangement optimization problems. First, we show that if a sequence of the generators of rearrangement classes converges, then the corresponding sequence of the optimal solutions will also converge. Second, a stability result regarding the Hausdorff distance between the weak closures of two rearrangement classes is presented.