# Question

Consider the quadratic programming example presented in Sec. 13.7.

(a) Use the test given in Appendix 2 to show that the objective function is strictly concave.

(b) Verify that the objective function is strictly concave by demonstrating that Q is a positive definite matrix; that is, xTQx 0 for all x 0.

(c) Show that x1 = 12, x2 = 9, and u1 = 3 satisfy the KKT conditions when they are written in the form given in Sec. 13.6.

(a) Use the test given in Appendix 2 to show that the objective function is strictly concave.

(b) Verify that the objective function is strictly concave by demonstrating that Q is a positive definite matrix; that is, xTQx 0 for all x 0.

(c) Show that x1 = 12, x2 = 9, and u1 = 3 satisfy the KKT conditions when they are written in the form given in Sec. 13.6.

## Answer to relevant Questions

Consider the following quadratic programming problem: Maximize f (x) = 8x1 – x12 + 4x2 – x22, subject to x1 + x2 ≤ 2 and x1 ≥ 0, x2 ≥ 0. The management of the Albert Hanson Company is trying to determine the best product mix for two new products. Because these products would share the same production facilities, the total number of units produced of the two ...For each of the following cases, prove that the key property of separable programming given in Sec. 13.8 must hold. (a) The special case of separable programming where all the gi(x) are linear functions. (b) The general case ...For each of the following functions, use the test given in Appendix 2 to determine whether it is convex, concave, or neither. (a) f (x) = x1x2 – x21 – x22 (b) f (x) = 3x1 + 2x21 + 4x2 + x22 – 2x1x2 (c) f (x) = x21 + ...Reconsider the model given in Prob. 13.3-3. (a) If SUMT were to be applied directly to this problem, what would be the unconstrained function P(x; r) to be minimized at each iteration?Post your question

0