Consider the following linearly constrained convex programming problem:

Maximize f(x) 4x1  x1 4 2x2  x2 2

, subject to 4x1 2x2 5 and x1  0, x2  0.

(a) Starting from the initial trial solution (x1, x2) (

1 2

, 1 2

), apply four iterations of the Frank-Wolfe algorithm.

(b) Show graphically how the sequence of trial solutions obtained in part

(a) can be extrapolated to obtain a closer approximation of an optimal solution. What is your resulting estimate of this solution?

(c) Use the KKT conditions to check whether the solution you obtained in part

(b) is, in fact, optimal. If not, use these conditions to derive the exact optimal solution.