A simplified completely positive reformulation for binary quadratic programs

In this paper, we propose a simplified completely positive programming reformulation for binary quadratic programs. The linear equality constraints associated with the binary constraints in the original problem can be aggregated into a single linear equality constraint without changing the feasible set of the classic completely positive reformulation proposed in the literature. We also show that the dual of the proposed simplified formulation is strictly feasible under a mild assumption.