Show transcribed image text 7.4.21 Solve the linear programming problem using the simplex method. Maximize z=2×1 +7×2 subject to 5×1 +x2 s40 7×1 +2×2 S60 x1 +X23 50 X1, X2 20 Select the correct choice below and, if necessary, fill in the answer box to complete your choice. ○ A. The maximum is z=□ when x1 = □, x,-厂1. s1 =厂1, s2 =[ 7, and s3 = B. There is no maximum solution for this linear programming problem Click to select and enter your answer(s) and then click Check Answer
7.4.21 Solve the linear programming problem using the simplex method. Maximize z=2×1 +7×2 subject to 5×1 +x2 s40 7×1 +2×2 S60 x1 +X23 50 X1, X2 20 Select the correct choice below and, if necessary, fill in the answer box to complete your choice. ○ A. The maximum is z=□ when x1 = □, x,-厂1. s1 =厂1, s2 =[ 7, and s3 = B. There is no maximum solution for this linear programming problem Click to select and enter your answer(s) and then click Check Answer





