# Question: Consider the following linearly constrained programming problem Minimize f x x31

Consider the following linearly constrained programming problem:

Minimize f(x) = x31 + 4x22 + 16x3,

subject to

x1 + x2 + x3 = 5 and

x1 ≥ 1, x2 ≥ 1, x3 ≥ 1.

(a) Convert this problem to an equivalent nonlinear programming problem that fits the form given at the beginning of the chapter (second paragraph), with m = 2 and n = 3.

(b) Use the form obtained in part (a) to construct the KKT conditions for this problem.

(c) Use the KKT conditions to check whether (x1, x2, x3) = (2, 1, 2) is optimal.

Minimize f(x) = x31 + 4x22 + 16x3,

subject to

x1 + x2 + x3 = 5 and

x1 ≥ 1, x2 ≥ 1, x3 ≥ 1.

(a) Convert this problem to an equivalent nonlinear programming problem that fits the form given at the beginning of the chapter (second paragraph), with m = 2 and n = 3.

(b) Use the form obtained in part (a) to construct the KKT conditions for this problem.

(c) Use the KKT conditions to check whether (x1, x2, x3) = (2, 1, 2) is optimal.

**View Solution:**## Answer to relevant Questions

Consider the following linearly constrained convex programming problem: Minimize Z = x21 – 6x1 + x32 – 3x2, Subject to x1 + x2 ≤ 1 and x1 ≥ 0, x2 ≥ 0. (a) Obtain the KKT conditions for this problem. Consider the following function: f (x) = 48x – 60x2 + x3. (a) Use the first and second derivatives to find the local maxima and local minima of f (x). (b) Use the first and second derivatives to show that f (x) has neither ...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 ...The MFG Company produces a certain subassembly in each of two separate plants. These subassemblies are then brought to a third nearby plant where they are used in the production of a certain product. The peak season of ...Reconsider the quadratic programming model given in Prob. 13.7-4.Post your question