# Question: Consider the following nonlinear programming problem Maximize Subject to x1 x2

Consider the following nonlinear programming problem:

Maximize

Subject to

x1 – x2 ≤ 2 and

x1 ≥ 0, x2 ≥ 0.

(a) Use the KKT conditions to demonstrate that (x1, x2) = (4, 2) is not optimal.

Maximize

Subject to

x1 – x2 ≤ 2 and

x1 ≥ 0, x2 ≥ 0.

(a) Use the KKT conditions to demonstrate that (x1, x2) = (4, 2) is not optimal.

**View Solution:**## Answer to relevant Questions

Use the KKT conditions to derive an optimal solution for each of the following problems. (a) Maximize f(x) = x1 + 2x2 - x32, subject to x1 + x2 ≤ 1 and x1 ≥ 0, x2 ≥ 0. (b) Maximize f(x) 20x1 + 10x2, Subject to and x1 ...Consider the following linearly constrained convex programming problem: Maximize f(x) = 8x1 – x21 + 2x2 + x3, Subject to x1 + 3x2 + 2x3 ≤ 12 and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. 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 ...For each of the following functions, show whether it is convex, concave, or neither. (a) f (x) = 10x – x2 (b) f (x) = x4 + 6x2 + 12x (c) f (x) = 2x3 – 3x2 (d) f (x) = x4 + x2 (e) f (x) = x3 + x4 Reconsider the linearly constrained convex programming model given in Prob. 13.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 ...Post your question