Solving integer programming problems by rounding

A study Is made of the technique of rounding the Simplex solution of a linear integer programming problem to obtain integer solutions. Problems are obtained by random generation of matrices of size 4x4 to size 12X12. In addition to Simple rounding, the technique of adding then subtracting a constant from each X value is studied.