In this paper the convex quadratic programming problem with simple constraints, following judicious transformations of Karush-Kuhn-Tucker optimality conditions, is reduced to solving a system of smooth equations. In order ...