On the Equivalence of Convex Programming Bounds for Boolean Quadratic Programming

Kurt M. Anstreicher

Recent papers have shown the equivalence of several tractable bounds for Boolean quadratic programming. In this note we give simplified proofs for these results, and also show that all of the bounds considered are simultaneously attained by one diagonal perturbation of the quadratic form.

Contact: kurt-anstreicher@uiowa.edu


 [POSTSCRIPT]  [IP PAGE]  [SEARCH AGAIN]