We establish that any nonconvex quadratic program having a mix of binary and continuous variables over a bounded feasible set can be represented as a linear program over the dual of the cone of copositive matrices. This result can be viewed as an extension of earlier separate results, which have established the copositive representation of a small collection of NP-hard problems.
Citation
Manuscript, Department of Management Sciences, University of Iowa, October 2006.
Article
View On the Copositive Representation of Binary and Continuous Nonconvex Quadratic Programs