Consider a network with two nodes, 1 and 2, with supplies s1 = 1 and s2 = -1, and three arcs/paths connecting 1 and 2, whose flows are denoted by h1, h2, and h3. The problem is
(b) Write a computer program to carry out several iterations of the conditional gradient method starting from h0 = (1/3, 1/3, 1/3). Do enough iterations to demonstrate a clear trend in rate of convergence. Plot the successive iterates on the simplex of feasible path flows