Problem 6-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Product Order (Units) 1900 550 C 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) 1400 1500 1100 2 3 Product Machine $1.00 $1.30 $1.00 $1.20 $1.40 $1.00 $0.80 $1.40 $1.50 3 Use the transportation model to develop the minimum cost production schedule for the products and machines. Show the linear programming formulation. If the constant is "lit must be entered in the box. If your answer is zero enter "o". The linear programming formulation and optimal solution are shown. Let x Units of production machine i. . *18+ XIC x 20 for all I, If required, round your answers to the nearest whole number Units Cost Optimal Solution 1-A 1-B 1-C OS NIN 2-C 3-A 3-B 3-C Total $ Problem 6-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Product Order (Units) 1900 550 C 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) 1400 1500 1100 2 3 Product Machine $1.00 $1.30 $1.00 $1.20 $1.40 $1.00 $0.80 $1.40 $1.50 3 Use the transportation model to develop the minimum cost production schedule for the products and machines. Show the linear programming formulation. If the constant is "lit must be entered in the box. If your answer is zero enter "o". The linear programming formulation and optimal solution are shown. Let x Units of production machine i. . *18+ XIC x 20 for all I, If required, round your answers to the nearest whole number Units Cost Optimal Solution 1-A 1-B 1-C OS NIN 2-C 3-A 3-B 3-C Total $