# Question

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.

Maximize f(x) = 8x1 – x21 + 2x2 + x3,

Subject to

x1 + 3x2 + 2x3 ≤ 12 and

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

## Answer to relevant Questions

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. Consider the following quadratic programming problem: Maximize f (x) = 8x1 – x12 + 4x2 – x22, subject to x1 + x2 ≤ 2 and x1 ≥ 0, x2 ≥ 0. The Dorwyn Company has two new products that will compete with the two new products for the Wyndor Glass Co. (described in Sec. 3.1). Using units of hundreds of dollars for the objective function, the linear programming ...Consider the following convex programming problem: Maximize Z = 32x1 – x41 + 4x2 – x22, Subject to x21 + x22 ≤ 9 and x1 ≥ 0, x2 ≥ 0. (a) Apply the separable programming technique discussed at the end of Sec. 13.8, ...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.Post your question

0