# Question: Suppose that the separable programming technique has been applied to

Suppose that the separable programming technique has been applied to a certain problem (the “original problem”) to convert it to the following equivalent linear programming problem: Maximize Z = 5x11 + 4x12 + 2x13 + 4x21 + x22,

subject to

and

What was the mathematical model for the original problem? (You may define the objective function either algebraically or graphically, but express the constraints algebraically.)

subject to

and

What was the mathematical model for the original problem? (You may define the objective function either algebraically or graphically, but express the constraints algebraically.)

## Answer to relevant Questions

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 ...Reconsider the linearly constrained convex programming model given in Prob. 13.6-5. Starting from the initial trial solution (x1, x2) ≥ (0, 0), use one iteration of the Frank-Wolfe algorithm to obtain exactly the same ...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. Consider the following convex programming problem: Maximize f(x) = –2x1 – (x2 – 3)2, Subject to x1 ≥ 3 and x2 ≥ 3. (a) If SUMT were applied to this problem, what would be the unconstrained function P(x; r) to be ...Consider the following nonconvex programming problem: Maximize Profit = 100x6 – 1,359x5 + 6,836x4 – 15,670x3 + 15,870x2 – 5,095x, subject to 0 ≤ x ≤ 5. (a) Formulate this problem in a spreadsheet, and then use the ...Post your question