Find a cutting plane proof of the inequality ∑(x_i) ≤ 2 using sequences of C-G cuts (starting from the system (1)).
Stable Set Polytope: Consider the graph in the figure below on the vertex set V = {1, 2, 7} and the integer program for the independent set/stable set problem in that graph:
max Z_i %i subject to X_i + T_j ≤ V_i,j ∈ V such that i,j ∈ E, T_i ≥ 0, V_i ∈ V
(1)