When a non integer solution is given by LPR, it adds a new linear constraint that makes the non integer point infeasible, while still keeps the optimal integer solution in the feasible region.
the feasible region is closer to the ideal polyhedron, which is the convex hull of feasible integer solutions.