Problem 6-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Product Order (Units) 1950 A B 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 1 2 3 1000 Product Machine A B $1.30 1 $1.00 $1.30 $0.80 $0.90 $1.30 2 $1.30 3 $0.90 $1.20 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. The linear programming formulation and optimal solution are shown. Let xij = Units of product on machine i. Min X1A |X1B X1C X2A X2B x2C |x X3B X3C s.t. VI X1A |X1B X1C Is X2A X2B |x20 VI |x3 X3B |x3C X1A X2A |x X1B |X2B X3B X1C |X2C |x30 Xij 2 0 for all i, j If required, round your answers to the nearest whole number. If required, round your answers to the nearest whole number. Optimal Solution Units Cost 1-A 300 $ 300 1-B o $ 0 1-C 1,300 $ 1,170 2-A 1,050 x $ 1,365 2-B 0 X $ 0 2-C $ 3-A $ 3-B $ 3-C $ Total $