A formula for computing the diretional derivative of
the optimal value function of a convex quadratic programming problem is given.
Pertubations in the constrained matrix are not allowed. For
this situation three equvalent necessary and sufficient criteria for the existence of
the directional derivative together with an upper and lower bound for the expansion of optimal value are proved.