# Question: Consider the following problem Maximize Z 3x1 5x2

Consider the following problem.

Maximize Z = 3x1 + 5x2 + 6x3,

Subject to

and

x1 ≥ 0, x2 ≥ 0, x3 ≥ 0,

(a) Work through the simplex method step by step in algebraic form.

(b) Work through the simplex method in tabular form.

(c) Use a computer package based on the simplex method to solve the problem.

Maximize Z = 3x1 + 5x2 + 6x3,

Subject to

and

x1 ≥ 0, x2 ≥ 0, x3 ≥ 0,

(a) Work through the simplex method step by step in algebraic form.

(b) Work through the simplex method in tabular form.

(c) Use a computer package based on the simplex method to solve the problem.

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

Work through the simplex method step by step (in tabular form) to solve the following problem. Maximize Z = 2x1 – x2 + x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Follow the instructions of Prob. 4.5-2 when the constraints are the following: and x1 ≥ 0, x2 ≥ 0, In problem (a) Demonstrate graphically that the feasible region is unbounded. Consider the following problem. Maximize Z = 4x1 + 2x2 + 3x3 + 5x4, Subject to and xj ≥ 0, for j = 1, 2, 3, 4. Consider the following problem. Minimize Z = 3x1 + 2x2 + 4x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. (a) Using the Big M method, work through the simplex method step by step to solve the problem. (b) Using the ...Consider the following problem. Maximize Z = 4x1 + 5x2 + 3x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.Post your question