......................

Solve the linear programming problem by the method of corners. Minimize C = 9x + 3y subject to x+ ys 48 x + 3y 2 60 9x + 5y s 320 x 2 10, y 2 0 The minimum is C = 264 X at (x, y) = 0,20 x ). Need Help? Read It + Show My Work (Optional) @ + 0/1 points Previous Answers TanFin12 3.3.031.CMI. My Notes + Ask Your Teache A company manufactures x units of Product A and y units of Product B, on two machines, I and II. It has been determined that the company will realize a profit of $4/unit of Product A and a profit of $7/unit of Product B. To manufacture a unit of Product A requires 6 min on Machine I and 5 min on Machine II. To manufacture a unit of Product B requires 9 min on Machine I and 4 min on Machine II. There are 5 hr of machine time available on Machine I and 3 hr of machine time available on Machine II in each work shift. How many units of each product should be produced in each shift to maximize the company's profit? ( x, V ) = 20,20 x What is the optimal profit? (Round your answer to the nearest whole number.) $ 220