Problem 10-09 (Algorithmic) The Ace Manufacturing Company has orders for three similar products: Machine capacities for the next week and the unit costs are as follows: The linear programming formulation and optimal solution are shown. \begin{tabular}{|c|c|c|l|} \hline Let & x1A & & Units of product A on machine 1 \\ \hline & 1B & = & Units of product B on machine 1 \\ \hline & & \\ \hline & & & \\ \hline & & & \\ \hline & 3C & = & Units of product C on machine 3 \\ \hline \end{tabular}