# Question: Reconsider the linearly constrained convex programming model given in Prob

Reconsider the linearly constrained convex programming model given in Prob. 13.4-7. Starting from the initial trial solution (x1, x2) = (0, 0), use the Frank-Wolfe algorithm (four iterations) to solve this model (approximately).

## Answer to relevant Questions

Consider the following linearly constrained convex programming problem: Maximize f(x) = 3x1 x2 + 40x1 + 30x2 – 4x21 – x41 – 3x22 – x42, Subject to 4x1 + 3x2 ≤ 12 x1 + 2x2 ≤ 4 and x1 ≥ 0, x2 ≥ 0. Reconsider the model given in Prob. 13.3-3. (a) If SUMT were to be applied directly to this problem, what would be the unconstrained function P(x; r) to be minimized at each iteration? Reconsider the convex programming model with an equality constraint given in Prob. 13.6-11. (a) If SUMT were to be applied to this model, what would be the unconstrained function P(x; r) to be minimized at each iteration? Reconsider the Wyndor Glass Co. problem introduced in Sec. 3.1. (a) Solve this problem using Solver. Consider the following nonconvex programming problem. Maximize f(x) = x3 – 60x2 + 900x + 100, subject to 0 ≤ x ≤ 31. (a) Use the first and second derivatives of f(x) to determine the critical points (along with the end ...Post your question