The envelope theorem for multiobjective convex programming via contingent derivatives

The aim of this paper is to formulate an envelope theorem for vector convex programs. The obtained result allows to quantify the changes of a certain set of optimal values according to changes of any of the parameters which appear in the constraints. We show that the sensitivity depends on a set of associated Lagrange multipliers and its sensitivity.