The Indefinite Quadratic Programming Problem

We develop several algorithms that obtain the global optimum to the indefinite quadratic programming problem. A generalized Benders cut method is employed. These algorithms all possess ϵ-finite convergence. To obtain finite convergence, we develop exact cuts, which are locally precise representations of a reduced objective. A finite algorithm is then constructed. Introductory computational results are presented.