Question: (16 POIN2 Client QUESTION 4: Sensitivity Analysis Consider the following linear programming Solver sensitivity Report: MIN 4X1+5X2+6X3 Name ST X1 X2 X3 Fal Reduced Objective

(16 POIN2 Client QUESTION 4: Sensitivity Analysis
(16 POIN2 Client QUESTION 4: Sensitivity Analysis Consider the following linear programming Solver sensitivity Report: MIN 4X1+5X2+6X3 Name ST X1 X2 X3 Fal Reduced Objective Alle Allows Vale Cost Coeffiche Increase DARASA 0 1.5 4 BE 15 NO 0 5 1 5 0 1 6 1430 1 1) X1+X24X3 280 3) 2X1+4x2+4X3 > 320 Name Constraint 1 Constraint 2 Constraint 3 Constraints Final Shadow Constraint Allowable Allowable Value Price RH. Side Increase Decrease 80 0 85 1E430 5 320 0 280 40 1E30 1.25 320 20 40 320 a. What is the optimal solution? b. Which constraints are binding? What are the dual prices (shadow price) for each resource? Interpret. d Compute and interpret the ranges of optimality. . Tante

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!