Reconsider the linearly constrained convex programming model given in Prob. 12.6-12. 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 (c)

of Prob. 12.6-12, and then use a second iteration to verify that it is an optimal solution (because it is replicated exactly). Explain why exactly the same results would be obtained on these two iterations with any other trial solution.