A complete justification is given for the complementary basis method in quadratic programming. The method is based on the ideas of Lemke, Wolfe and Dantzig and can be applied to any problem of convex quadratic programming without reducing it to standard form.