# Question: Consider the following problem Maximize Z 8x1 24x2

Consider the following problem. Maximize Z = 8x1 + 24x2, Subject to

And x1 ≥ 0, x2 ≥ 0.

Suppose that Z represents profit and that it is possible to modify the objective function somewhat by an appropriate shifting of key personnel between the two activities. In particular, suppose that the unit profit of activity 1 can be increased above 8 (to a maximum of 18) at the expense of decreasing the unit profit of activity 2 below 24 by twice the amount. Thus, Z can actually be represented as Z(θ) (8 + θ)x1 + (24 – 2θ)x2, where θ is also a decision variable such that 0 ≤ θ ≤ 10.

And x1 ≥ 0, x2 ≥ 0.

Suppose that Z represents profit and that it is possible to modify the objective function somewhat by an appropriate shifting of key personnel between the two activities. In particular, suppose that the unit profit of activity 1 can be increased above 8 (to a maximum of 18) at the expense of decreasing the unit profit of activity 2 below 24 by twice the amount. Thus, Z can actually be represented as Z(θ) (8 + θ)x1 + (24 – 2θ)x2, where θ is also a decision variable such that 0 ≤ θ ≤ 10.

## Answer to relevant Questions

Consider the following problem. Maximize Z = x1 – x2, Subject to and x1 ≥ 0, x2 ≥ 0, (a) Solve this problem graphically. (b) Use the dual simplex method manually to solve this problem. (c) Trace graphically the path ...Consider part (a) of Prob. 7.2-2. Use the dual simplex method manually to reoptimize, starting from the revised final tableau. Reconsider the example used to illustrate the interiorpoint algorithm in Sec. 8.4. Suppose that (x1, x2) = (1, 3) were used instead as the initial feasible trial solution. Perform two iterations manually, starting from this ...Use parametric linear programming to find an optimal solution for the following problem as a function of θ, for 0 ≤ θ ≤ 30. Maximize Z (θ) = 5x1 + 6x2 + 4x3 + 7x4, Subject to and xj ≥ 0, for j = 1, 2, 3, 4. Then ...Reconsider Prob. 9.1-4. Starting with the northwest corner rule, interactively apply the transportation simplex method to obtain an optimal solution for this problem. In problem Consider the transportation problem having the ...Post your question