Solve the following linear program using the full tableau implementation of the Simplex Method. max 60x1 + 30х2 + 2013 s.t. 8x1 + 6x2 + x3 < 48 8x1 + 4x2 – 3x3 < 20 4.x1 + 3x2 + x3< 16 - X1, X2, X3 > 0

Linear programming question

Question 27 Variable cells Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease Cell Name $B$6 Activity 1 0 425 500 1E+30 425 $C$6 Activity 2 27.5 0.0 300 500 300 $D$6 Activity 3 0 250 400 1E+30 250 Constraints Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease Cell Name $E$2 Benefit A 110 0 60 50 1E+30 $E$3 Benefit B 110 75 110 1E+30 46 $E$4 Benefit C 137.5 0 80 57.5 1E+30 If the coefficient for Activity 2 in the objective function changes to $400, then the objective function value: A) will increase by $100. B) will increase by $7,500. OC) will remain the same. D) will increase by $2,750.