# Question: Consider the following problem Maximize Z x1 x2 Subject to and x1

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 taken by the dual simplex method.

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 taken by the dual simplex method.

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

Use the dual simplex method manually to solve the following problem. Minimize Z = 5x1 + 2x2 + 4x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Consider the following problem. Maximize Z = 2x1 + x2, Subject to and x1 ≥ 0, x2 ≥ 0. I (a) Solve this problem graphically. (b) Use the upper bound technique manually to solve this problem. (c) Trace graphically the path ...Consider the following problem. Maximize Z = 3x1 + x2, Subject to x1 + x2 ≤ 4 and x1 ≥ 0, x2 ≥ 0. Consider Prob. 7.2-3. Use parametric linear programming to find an optimal solution as a function of θ for -20θ ≤ θ ≤ 0. Reconsider Prob. 9.1-6. Starting with Russell's approximation method, interactively apply the transportation simplex method to obtain an optimal solution for this problem. In problem After several iterations of the ...Post your question