Examination like tasks workshop 3 (Lecture 5 and 6)

A cutting-plane algorithm terminates when: 1 an integer solution is found we have successfully solved the problem; 2 the linear program is infeasible and therefore the integer problem