Graphically solve the following problem:

(a) What is the optimal solution?
(b) Change the right-hand side of constraint 1 to 11 (instead of 10) and resolve the problem.
How much did the profit increase as a result of this?
(c) Change the right-hand side of constraint 1 to 6 (instead of 10) and resolve the problem. How much did the profit decrease as a result of this? Looking at the graph, what would happen if the right-hand-side value were to go below 6?
(d) Change the right-hand-side value of constraint 1 to 5 (instead of 10) and resolve the problem.
How much did the profit decrease from the original profit as a result of this?
(e) Using the computer output on this page, what is the dual price of constraint 1? What is the lower bound on this?
(f) What conclusions can you draw from this regarding the bounds of the right-hand-side values and the dual price?

Maximize profit = 8X1 + 5X2 subject to Xj X1, X2 3 0 Linnai Programming Resu Solved Problem 7-2 Solution RHS Dual Maximize Constraint 1 Constraint 2 Constraint 3 Solution 50 100 60 20 400 8,000 0. 0.4 10. 40 3 300 Solved Problem 7-2 Solution Velel-Reduced Costl_Ongtnal Vall Lower Eound i Upper Bound Infinity Variabla 60 50. 20 40 Constraint Constraint 1 Constraint 2 Constraint 3 usl Volue SlackoSurplusOeginal Val Lower Bound Upper Bound Infinit 9,500 80 120 0.4 t0 8,000 60 6,000 40