Wolfe's quadratic-programming problemalgorithm
An adaptation of the simplex method that solves quadratic-programming problems with positive definite or positive semidefinite quadratic forms. It is based on the simultaneous solution of the linear constraints of the problems and associated Karush-Kuhn-Tucker conditions. It uses a restricted basis entry for the solution of necessary complementarity conditions. Quadratic programming.