Consider the following problem.

Maximize Z  3x1  5x2  6x3, subject to 2x1  x2  x3 4 x1  2x2  x3 4 x1  x2  2x3 4 x1  x2  x3 3 and x1  0, x2  0, x3  0.

D,I

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

D,I

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

C

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