A computational procedure is given 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, being based on the Barankin-Dorfman procedure for this problem.
No takes yet. Share an insight, caveat, or question.
Philip Wolfe (1960) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: