# Question

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

(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

## Answer to relevant Questions

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. ...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, ...Reconsider the quadratic programming model given in Prob. 13.7-4. 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: Minimize f (x) = sin 3x1 + cos 3x2 + sin(x1 + x2), subject to x12 – 10x2 ≥ – 1 10x1 + x22 ≤ 100 and x1 ≥ 0, x2 ≥ 0. (a) If SUMT were applied to this problem, ...Post your question

0