In this paper, sensitivity analysis of the efficient sets in parametric convex vector optimization
is considered. Namely, the perturbation, weak perturbation, and proper perturbation
maps are defined as set-valued maps. We establish the formulas for computing the Fréchet
coderivative of the profile of the above three kinds of perturbation maps. Because of the convexity
assumptions, the conditions set are fairly simple if compared to those in the general
case. In addition, our conditions are stated directly on the data of the problem. It is worth
emphasizing that our approach is based on convex analysis tools which are different from
those in the general case.