The paper gives a comparison of Beale's method for quadratic programming and the Simplex Method for quadratic programming as developed by Dantzig and Van de Panne and Whinston. After summary expositions of both methods and a reformulation of Beale's method in the framework of quadratic Simplex tableaux, the relation between the two methods is analyzed. A numerical example is used as illustration.