Consider the following problem.

Maximize Z  2x1  4x2  3x3, subject to x1  3x2  2x3 30 x1  x2  x3 24 3x1  5x2  3x3 60 and x1  0, x2  0, x3  0.

You are given the information that x1  0, x2  0, and x3  0 in the optimal solution.

(a) Describe how you can use this information to adapt the simplex method to solve this problem in the minimum possible number of iterations (when you start from the usual initial BF solution). Do not actually perform any iterations.

(b) Use the procedure developed in part

(a) to solve this problem by hand. (Do not use your OR Courseware.)