Problem 10-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Product A Order (Units) 2150 550 1200 B Three machines are available for the manufacturing operations. All three machines can produce all the products at the same production rate. However, due to varying defect percentages of each product on each machine, the unit costs of the products vary depending on the machine used. Machine capacities for the next week and the unit costs are as follows: Machine Capacity (Units) 1 1450 2 1600 3 900 Product Machine A B 1 2 $0.80 $1.20 $0.90 $1.20 $1.30 $0.90 $0.70 $1.20 $1.20 3 Use the transportation model to develop the minimum cost production schedule for the products and machines. Show the linear programming formulation. If required, round your answers to one decimal place. The linear programming formulation and optimal solution are shown. Let|x1A Units of product A on machine 1 X1B = Units of product B on machine 1 . . *3C = units of product C on machine 3 Min X1A+ X1B + Ixic+ Xa+| *28 + *2c + *3A + X3B + %3C s.t. X1B + X1c X2A+ *20 X2C S X3A + *38+ *3CS XIA XA X3A X1B X2B Xic X2C *30 Xij 20 for all i, j Optimal Solution Units Cost 1-A $ 1-B 1-C 2-A 2-B $ 2-C $ 3-A 3-B 3-C $ Total $