Iteration 1 
The first solution display shows the linear programming relaxation without any restrictions. The solution objective value gives an upper bound on the optimum integer objective value. At this iteration we add the C2 because it has the largest constant value. The revised LP and it's solution is on the next page. 
LP


Gomery Cut 

Gomery Cut in Original Variables 