A linear programming model is given as follows:

Maximize = 201 + 472

Subject to 501 + 242 1200

771 502 300

31 50

1, 2 0

(a) Solve the problem by using the computer. What are the maximum Z and the optimal point?

(b) Obtain the values of the slack/surplus variables at the optimal solution in (a)

(c) Identify the sensitivity range of the objective function coefficient of 1.

(d) Identify the sensitivity range of the value of the 1st resource constraint (right-hand side).

(e) Identify the sensitivity range of the value of the 2nd resource constraint (right-hand side).

(f) which of the following makes the model infeasible? (Choose one)

i. Increase of the coefficient of 1 on the objective function to 3000

ii. Decrease of the coefficient of 1 on the 2nd constraint to -5000

iii. Addition of a new constraint, 2 50 iv. Removal of the non-negativity constraints for 1, 2 v. None