Proof of Validity for Gomory Fractional Cuts
Students often struggle to see why doesn't exclude integer points. Crucially, the cut relies on and the fact that ; any integer point that satisfies the original constraints will automatically satisfy the inequality, leaving the feasible set intact while pruning the non-integer vertex.
Institutional Reference: Linear and Integer Programming
View Full Proof →