Problem 10-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Product Order (Units) 1950 400 1300 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) 1600 1400 1000 3 Product Machine $1.00 $1.30 $0.80 $1.30 $1.30 2 3 $0.90 $1.30 $1.20 $0.90 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 X3C = Units of product Con machine 3 X1C Xy 20 for all i, j Units Cost Optimal Solution 1-A 1-B YI a 2-C Total $ Problem 10-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Product Order (Units) 1950 400 1300 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) 1600 1400 1000 3 Product Machine $1.00 $1.30 $0.80 $1.30 $1.30 2 3 $0.90 $1.30 $1.20 $0.90 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 X3C = Units of product Con machine 3 X1C Xy 20 for all i, j Units Cost Optimal Solution 1-A 1-B YI a 2-C Total $