Another pedagogy for pure-integer Gomory

We present pure‐integer Gomory cuts in a way so that they are derived with respect to a ‘dual form’ pure‐integer optimization problem and applied on the standard‐form primal side as columns, using the primal simplex algorithm. The input integer problem is not in standard form, and so the cuts are derived a bit differently. In this manner, we obtain a finitely‐terminating version of pure‐integer Gomory cuts that employs the primal rather than the dual simplex algorithm.