# Question

Use the KKT conditions to determine whether (x1, x2, x3) = (1, 1, 1) can be optimal for the following problem:

Minimize Z = 2x1 + x32 + x23,

Subject to

x21 + 2x22 + x23 ≥ 4 and

x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.

Minimize Z = 2x1 + x32 + x23,

Subject to

x21 + 2x22 + x23 ≥ 4 and

x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.

## Answer to relevant Questions

Reconsider the model given in Prob. 13.2-10. What are the KKT conditions for this problem? Use these conditions to determine whether (x1, x2) = (1, 1) can be optimal. 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 ...The B. J. Jensen Company specializes in the production of power saws and power drills for home use. Sales are relatively stable throughout the year except for a jump upward during the Christmas season. Since the production ...Reconsider the integer nonlinear programming model given in Prob. 11.3-9. (a) Show that the objective function is not concave. (b) Formulate an equivalent pure binary integer linear programming model for this problem as ...Consider the following linearly constrained convex programming problem: Maximize f(x) = 3x1 + 4x2 – x31 – x32, subject to x1 +x2 ≤ 1 and x1 ≥ 0, x2 ≥ 0.Post your question

0