A computational procedure for finding the minimum of a quadratic function of variables subject to linear inequality constraints. The procedure is analogous to the simplex method for linear programming and is based on the Barankin-Dorfman procedure fo...
