The authors show that for any optimal solution nz for a given separable quadratic integer programming problem there exist an optimal solution nx for its continuous relaxation such that ||nz-nx||Å••nℝ(A) where n is the number of variables and ℝ(A) is the largest absolute subdeterminant of the integer constraint matrix A. Also for any feasible solution z, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution nz having greater objective function value and with ||nz-z||Å••nℝ(A). The authors further prove, under some additional assumptions, that the distance between a pair of optimal solutions to an integer quadratic programming problem with right hand side vectors b and b', respectively, depends linearly on ||b-b'||1. Finally the validity of all the results for nonseparable mixed-integer quadratic programs is established. The proximity results obtained in this paper are extensions of some of the results described in Cook et al. for linear integer programming.
