Characterization of the Convex Hull of Integer Feasible Solutions

Distinguishing between the feasible region

P

(continuous) and its integer hull

P_I

(discrete points and their convex cover) is key. It's easy to conflate

P_I

with

P \cap \mathbb{Z}^n

(the set of integer points themselves, not their hull).

Institutional Reference: Linear and Integer Programming