Question: LINEAR PROGRAMMING Based on the sensitivity report,discuss the sensitivity in details by giving an example for each case: i. All conditions are feasible ii. At

LINEAR PROGRAMMING
Based on the sensitivity report,discuss the sensitivity in details by giving an example for each case:
i. All conditions are feasible
ii. At least one of the condition is infeasible  LINEAR PROGRAMMING Based on the sensitivity report,discuss the sensitivity in details
by giving an example for each case: i. All conditions are feasible

Shoe racks (x1) Dining table (x2) Bookshelf (x3) 0 200 100 Total Profit 80 200 130 53000 RHS 1 1 3 500 600 Cutting Assembly Finishing 1 2 1 500 500 1 1 1 300 300 Variable Cells Final Reduced Allowable Allowable Objective Coefficient Cell Name Value Cost Increase Decrease 0 -50 80 50 1.0E+30 $B$2 Shoe racks (xl) $C$2 Dining table (x2) $D$2 Bookshelf (x3) 200 0 200 60 70 100 0 130 70 30 Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease 500 0 600 1.0E+30 100 $E$5 Cutting Total SE$6 Assembly Total $E$7 Finishing Total 500 70 500 50 100 20 300 60 300 50 Shoe racks (x1) Dining table (x2) Bookshelf (x3) 0 200 100 Total Profit 80 200 130 53000 RHS 1 1 3 500 600 Cutting Assembly Finishing 1 2 1 500 500 1 1 1 300 300 Variable Cells Final Reduced Allowable Allowable Objective Coefficient Cell Name Value Cost Increase Decrease 0 -50 80 50 1.0E+30 $B$2 Shoe racks (xl) $C$2 Dining table (x2) $D$2 Bookshelf (x3) 200 0 200 60 70 100 0 130 70 30 Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease 500 0 600 1.0E+30 100 $E$5 Cutting Total SE$6 Assembly Total $E$7 Finishing Total 500 70 500 50 100 20 300 60 300 50

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 Finance Questions!