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 ...

This paper describes a method to arrive at a feasible solution which can not be found in the linearly approximated constrained domain and a process which would reduce the number of finite element ...