P 30x 40×2 Maximize Solve the linear programming problem using the simplex method. + 2x,+x2560 subject…

P 30x 40×2 Maximize Solve the linear programming problem using the simplex method. + 2x,+x2560 subject to X1+x2542 X1+2×2572 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 O A. The maximum value of P is when x1 O B. There is no optimal solution. C 35×1+45×2 3×1+X2 23 -8×1-2×2 26 Minimize subject to X1, X2 20 a. Form the dual problem. e Maximize P-y1+6 y2 y1-8 Y2 y 245 y1. Y220 subject to b. Find the solution to the original problem by applying the simplex method to the dual problem. Select the correct choice below and fill in any answer boxes within your choice. Min C at x and x2 O The optimal solution does not exist. 00