# Question

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.

Maximize f(x) = 3x1 x2 + 40x1 + 30x2 – 4x21 – x41 – 3x22 – x42,

Subject to

4x1 + 3x2 ≤ 12

x1 + 2x2 ≤ 4

and

x1 ≥ 0, x2 ≥ 0.

## Answer to relevant Questions

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. Consider the example for applying SUMT given in Sec. 13.9. (a) Show that (x1, x2) = (1, 2) satisfies the KKT conditions. (b) Display the feasible region graphically, and then plot the locus of points x1x2 = 2 to demonstrate ...Consider the following nonconvex programming problem: Maximize f(x) = 1,000x – 400x2 + 40x3 – x4, Subject to x2 + x ≤ 500 and x ≥ 0. (a) Identify the feasible values for x. Obtain general expressions for the first ...Consider the following problem: Maximize Z = 4x1 – x12 + 10x2 – x22, subject to x12 + 4x22 ≤ 16 and x1 ≥ 0, x2 ≥ 0. (a) Is this a convex programming problem? Answer yes or no, and then justify your answer. (b) Can ...Consider the example of a nonconvex programming problem presented in Sec. 13.10 and depicted in Fig. 13.18.Post your question

0