Solve Linear Programming Problem using Simplex Methe Problem 1: Use the simplex method to find the maximum value of: 2 - 2x - x + 2xy Objective function subject to the constraints 2x + x S 10 X1 + 2x2 - 2xy S 20 + 2xy S5 where x, 20, 20, and x, 20. Problem 2: A manufacturer produces three types of plastic fixtures. The time required for molding. trimming, and packaging is given in the following Table (Times are given in hours per dozen fixtures.) Process Type Type B Type C Total time available Molding 1 2 12,000 Trimming 4,600 Packaging 2,400 Profit $11 $16 $15 How many dozen of each type of fixture should be produced to obtain a maximum profit