Reconsider the linearly constrained convex programming model given in Prob. 13.6-5. Starting from the initial trial solution (x1, x2) ≥ (0, 0), use one iteration of the Frank-Wolfe algorithm to obtain exactly the same solution you found in part (b) of Prob. 13.6-5, and then use a second iteration to verify that it is an optimal solution (because it is replicated exactly).