Consider the following linear program.

Min 8X + 12Y

s.t.

1X + 3Y 7

2X + 2Y 10

6X + 2Y 14

X, Y 0

(a). Use the graphical solution procedure to find the optimal solution. (Graph the constraint lines, the feasible region, the objective function line, and the optimal solution.)

What is the value of the objective function at the optimal solution?

(b.) Assume that the objective function coefficient for X changes from 8 to 6. Use the graphical solution procedure to find the new optimal solution. (Graph the constraint lines, the feasible region, the objective function line, and the optimal solution.)

Does the optimal solution change?

The extreme point (_______) (___ remains/becomes___) optimal. The value of the objective function becomes __________

(c) Assume that the objective function coefficient for X remains 8, but the objective function coefficient for Y changes from 12 to 6. Use the graphical solution procedure to find the new optimal solution. (Graph the constraint lines, the feasible region, the objective function line, and the optimal solution.)

Does the optimal solution change?

The extreme point (_______) (___ remains/becomes___) optimal. The value of the objective function becomes __________

(d) The computer solution for the linear program in part (a) provides the following objective coefficient range information.

Variable	Objective Coefficient	Allowable Increase	Allowable Decrease
X	8.00000	4.00000	4.00000
Y	12.00000	12.00000	4.00000

How would this objective coefficient range information help you answer parts (b) and (c) prior to re-solving the problem?

The objective coefficient range for variable X is ________ to ________ . Since the change in part (b) is ---Select--- (within/outside) this range, we know the optimal solution ---Select--- (will/will not change). The objective coefficient range for variable Y is _______ to _________ . Since the change in part (c) is ---Select--- (within/outside) this range, we know the optimal solution ---Select--- (will/will not change).