Visual Proof: Gomory's Cutting Plane Algorithm for Integer Programming
It's easy to confuse the relaxation's feasible region with the integer problem's. The algorithm terminates because cuts only remove fractional vertices, never integer ones, and the number of integer vertices is finite.
Institutional Reference: Linear and Integer Programming
View Full Proof →