Problem 6-09 (Algorithmic) The Ace Manufacturing Company hasorders for three similar products: Product Order (Units) A 1950 B400 C 1300 Three machines are available for the manufacturingoperations. All three machines can produce all the products at thesame production rate. However, due to varying defect percentages ofeach product on each machine, the unit costs of the products varydepending on the machine used. Machine capacities for the next weekand the unit costs are as follows: Machine Capacity (Units) 1 16002 1400 3 1000 Product Machine A B C 1 $1.00 $1.30 $0.90 2 $1.30$1.30 $1.30 3 $0.80 $0.90 $1.20 Use the transportation model todevelop the minimum cost production schedule for the products andmachines. Show the linear programming formulation. If the constantis "1" it must be entered in the box. If your answer is zero enter"0". The linear programming formulation and optimal solution areshown. Let xij = Units of product j on machine i. Min x1A + x1B +x1C + x2A + x2B + x2C + x3A + x3B + x3C s.t. x1A + x1B + x1C ? x2A+ x2B + x2C ? x3A + x3B + x3C ? x1A + x2A + + x3A = x1B + x2B + x3B= x1C + x2C + x3C = xij ? 0 for all i, j If required, round youranswers to the nearest whole number. Optimal Solution Units Cost1-A $ 1-B $ 1-C $ 2-A $ 2-B $ 2-C $ 3-A $ 3-B $ 3-C $ Total $