Based on the Simplex and Gradient method, a new algorithm (EBM) is presented for solving the quadratic programming with upper and lower bounds. Firstly the ideas of Beale's method and extended LP are analysed, and then an extended Beale's method (EBM) is