0/0.9 points v. Previous Answers 1/6 Submissions Used Use the simplex method to solve the linear programming problem. Maximize P = 5x + 2y subject to 4x + 5y = 40 x + ys 9 3x + ys 21 x 20, Y 20 The maximum is P = 42 * at (x, y) = ( -1, 10 * ). Viewing Saved Work Revert to Last Response Submit Answer 0.45/0.9 points Previous Answers TANFIN11 4.R.006. 2/6 Submissions Used Use the simplex method to solve the linear programming problem. Maximize P = x + 2y + 3z subject to 2x + y + ZS 7 3x + 2y + 4z s 12 2x + 5y – 2zs 5 x 20, y = 0,220 The maximum is P = 119/12 1912 v at (x, y, z) = ( 23 55 12 ). at (x, y, z) =( 25 11 37 12' 6' 12