P 30x1+40x2 Solve the linear programming problem using the simplex method Maximize subject to 2x1 +X2 70 X1 +X2 49 X1+2x2 84 X1,X2 20 Use the simplex method to solve the problem. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. and X2 A. The maximum value of P is when X1 B. There is no optimal solution Click to select and enter your answer(s) and then click Check Answer. All parts showing Check Answer Clear All

P 30x1+40x2 Solve the linear programming problem using the simplex method Maximize subject to 2x1 +X2 70 X1 +X2 49 X1+2x2 84 X1,X2 20 Use the simplex method to solve the problem. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. and X2 A. The maximum value of P is when X1 B. There is no optimal solution Click to select and enter your answer(s) and then click Check Answer. All parts showing Check Answer Clear All

College Algebra

10th Edition

ISBN:9781337282291

Author:Ron Larson

Publisher:Ron Larson

Chapter6: Systems Of Equations And Inequalities

Section6.6: Linear Programming

Problem 6E

See similar textbooks