Stability and Sensitivity Analysis in Convex Vector Optimization

In this paper we provide some theoretical results on stability and sensitivity analysis in convex vector optimization. Given a family of parametrized vector optimization problems, the perturbation maps are defined as the set-valued map which associates to each parameter value the set of minimal points (properly minimal points, weakly minimal points) of the perturbed feasible set with respect to an ordering convex cone. Sufficient conditions for the upper and lower semicontinuity of the perturbations map are obtained. We also provide quantitative properties of the perturbation maps under some convexity assumptions