Problem 6-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Product B C Order (Units) | 2250 500 1100 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) 1500 1550 1050 Product Machine $0.90 A $1.00 $1.20 $1.00 T 2 3 $1.30 $1.40 $0.80 $1.30 $1.30 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 "1" it must be entered in the box. If your answer is zero enter "0". The linear programming formulation and optimal solution are shown. Let xij = Units of product j on machine i. Min X1A X10 X2A X2B x20 | |x3B |X1A X1B X1C + 2A 2B 20 - + X1A |x + - X1B 2B X1C 2 Xij 2 0 for all i, j If required, round your answers to the nearest whole number. Optimal Solution Units Cost 1-A 1-B $ 1-C 2-A 2-B 2-C 3-A 3-B - 3-c 3-C Total $ Problem 6-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Product B C Order (Units) | 2250 500 1100 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) 1500 1550 1050 Product Machine $0.90 A $1.00 $1.20 $1.00 T 2 3 $1.30 $1.40 $0.80 $1.30 $1.30 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 "1" it must be entered in the box. If your answer is zero enter "0". The linear programming formulation and optimal solution are shown. Let xij = Units of product j on machine i. Min X1A X10 X2A X2B x20 | |x3B |X1A X1B X1C + 2A 2B 20 - + X1A |x + - X1B 2B X1C 2 Xij 2 0 for all i, j If required, round your answers to the nearest whole number. Optimal Solution Units Cost 1-A 1-B $ 1-C 2-A 2-B 2-C 3-A 3-B - 3-c 3-C Total $