p.464

Binding Constraint Procedures of Quadratic Programming

J. C. G. Boot

Abstract

The quatratic function Q(x) to be maximized subject to linear constraints C'x < d is considered as a function of the sources d. This leads to dual solution techniques, for example, the Houthakker capacity method and the Theilvan de Panne procedure. These algorithms are surveyed, some subtle points are clarified, and a new algorithm is illustrated.