# Question

Starting from the initial trial solution (x1, x2) = (0, 0), interactively apply the gradient search procedure with ϵ = 1 to solve (approximately) the following problem, and then apply the automatic routine for this procedure (with ϵ = 0.01).

Maximize f(x) = x1x2 + 3x2 - x21 - x22.

Maximize f(x) = x1x2 + 3x2 - x21 - x22.

## Answer to relevant Questions

Reconsider the one-variable convex programming model given in Prob. 13.4-5. Use the KKT conditions to derive an optimal solution for this model. Consider the nonlinear programming problem given in Prob. 11.3-11. Determine whether (x1, x2) = (1, 2) can be optimal by applying the KKT conditions. Consider the following linearly constrained convex programming problem: Minimize Z = x21 – 6x1 + x32 – 3x2, Subject to x1 + x2 ≤ 1 and x1 ≥ 0, x2 ≥ 0. (a) Obtain the KKT conditions for this problem. Consider the following quadratic programming problem: Maximize f(x) = 20x1 – 20x12 + 50x2 – 50x22 + 18x1x2, subject to x1 + x2 ≤ 6 x1 + 4x2 ≤ 18 and x1 ≥ 0, x2 ≥ 0. Suppose that this problem is to be solved by ...Reconsider the linearly constrained convex programming model given in Prob. 13.4-7. (a) Use the separable programming technique presented in Sec. 13.8 to formulate an approximate linear programming model for this problem. ...Post your question

0