We consider non-convex mixed-integer quadratic programs in which all variables are explicitly bounded. Many exact methods for such problems use additional variables, representing products of pairs of original variables. We study the convex hull of feasible solutions in this extended space. Some other approaches use bit representation to convert bounded integer variables into binary variables. We study the convex hulls associated with some of these formulations as well. We also present extensive computational results.
Working paper, Department of Management Science, Lancaster University, UK.