0x Ctrl TE Consider the following linear programming problem Max. Z = 15X1 + 21X2 f Subject to: C1: X1 = C5: X2 >= 0 This problem was solved using MS Solver of MS Excel. Following is the output of the solution. Microsoft Excel 16.0 Sensitivity Report Worksheet: (LPP sensitive analysis 1 Ramaswami.xlsx]Sheet2 Report Created: 10/27/2021 2:32:54 PM Variable Cells Type here to search BE 28C Haze hp X CA All Report Created: 10/27/2021 2:32:54 PM Variable Cells Final Reduced Objective Cell Name Value Cost Coefficient $B$5 Values x1 5 0 15 $C$5 Values x2 2.666666667 o 21 Allowable Decrease Allowable Increase 1E+30 1.5 1 21 Constraints Cell Name $D$10 C5 $D$6 C1 $D$7 C2 $D$8 C3 $D$9 C4 Final Value 2.666666667 5 18 7.666666667 Shadow Constraint Allowable Allowable Price R.H. Side Increase Decrease 0 0 2.666666667 1E+30 1 5 1 5 7 18 1 8 0 8 1E+30 0.333333333 0 0 5 1E+30 5 Use the above output and write your report on the sensitivity analysis of constraints CI and C2 Type here to search s 28C He 16 0x Ctrl TE Consider the following linear programming problem Max. Z = 15X1 + 21X2 f Subject to: C1: X1 = C5: X2 >= 0 This problem was solved using MS Solver of MS Excel. Following is the output of the solution. Microsoft Excel 16.0 Sensitivity Report Worksheet: (LPP sensitive analysis 1 Ramaswami.xlsx]Sheet2 Report Created: 10/27/2021 2:32:54 PM Variable Cells Type here to search BE 28C Haze hp X CA All Report Created: 10/27/2021 2:32:54 PM Variable Cells Final Reduced Objective Cell Name Value Cost Coefficient $B$5 Values x1 5 0 15 $C$5 Values x2 2.666666667 o 21 Allowable Decrease Allowable Increase 1E+30 1.5 1 21 Constraints Cell Name $D$10 C5 $D$6 C1 $D$7 C2 $D$8 C3 $D$9 C4 Final Value 2.666666667 5 18 7.666666667 Shadow Constraint Allowable Allowable Price R.H. Side Increase Decrease 0 0 2.666666667 1E+30 1 5 1 5 7 18 1 8 0 8 1E+30 0.333333333 0 0 5 1E+30 5 Use the above output and write your report on the sensitivity analysis of constraints CI and C2 Type here to search s 28C He 16