Question: Write c = (-1 + √5)/2 and consider the network in Figure with upper bounds of con V1V2, 1 on V3V6, con V4V6 and large upper bounds on the remaining arcs. Verify that the augmenting path method may go through an endless sequence of iterations characterized in Table.

