Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Consider the sensitivity report below for the problems which follow. The optimal

ID: 3220606 • Letter: C

Question

Consider the sensitivity report below for the problems which follow.

The optimal solution to this linear program is

x1 = 0, x2 = 0.

x1 = 34, x2 = 40.

x1 = 6, x2 = 11.

x1 = 7.33, x2 = 6.

x1 = 3, x2 = 6.

6 Variable Cells Final Reduced objective Allowable Allowable Ce Name Value Cost Coefficient Increase Decrease 9 $B$3 x1. 6 7.333333333 10 $C$3 x2 11 12 Constraints 13 Final Shadow Constraint Allowable Allowable 14 Cell Name Value Price R.H. Side Decrease 15 $D$10 Extrusion Used 48 16 $D$11 Packaging Used 18 11 17 $D$12 Additive Used 12 16 1E+30

Explanation / Answer

From the above Linear programing results

The optimal solution for the problem is

x1=3

x2=6

with costs are 0,0