This paper deals with some problems in numerical simulation for convex quadratic programming with nonnegative constraints. For systems of ordinary differential equations which derived from the above mentioned problem, we construct a kind of new numerical method: the modified implicit Euler method. Under some restrictions for step-size, we obtained the numerical solution which satisfied with the termination condition. Compared with the classical Matlab command ODE23, the new method has ideal computation cost