Question: Consider the following linear programming: MIN 4X1+5X2+6X3 Solver Sensitivity Report: Variable Cells S.T. Name 1) X1+X2+X3 280 3) 2X1+4x2+4X3 > 320 Constraints Final Shadow Constraint

Consider the following linear programming: MIN
Consider the following linear programming: MIN 4X1+5X2+6X3 Solver Sensitivity Report: Variable Cells S.T. Name 1) X1+X2+X3 280 3) 2X1+4x2+4X3 > 320 Constraints Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 80 0 85 1E+30 5 320 0 280 40 1E430 320 1.25 320 20 40 Name Constraint 1 Constraint 2 Constraint 3 a. What is the optimal solution? b. Which constraints are binding? c. What are the dual prices (shadow price) for each resource? Interpret d. Compute and interpret the range of optimality

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!