rgo assignment via linear programming A pharmaceutical supplier with warehouses in Manchester, Madrid, and Rotterdam must meet market demand in Amsterdam, Vienna, Zurich and Lisbon. The following table summarize data relevant to this week's distribution problem. The numbers in the first three rows and the first four columns are the transportation costs per unit from each distribution center to each market. Find the optimal allocation of inventory to minimize total transportation cost. Vienna Zurich From$/$To Manchester Madrid Amsterdam $12$ Lisbon $9108$ Supply $7506506001015107129810$ Rotterdam Demand $400600600400$rgo assignment via linear programming A pharmaceutical supplier with warehouses in Manchester, Madrid, and Rotterdam must meet market demand in Amsterdam, Vienna, Zurich and Lisbon. The following table summarize data relevant to this week's distribution problem. The numbers in the first three rows and the first four columns are the transportation costs per unit from each distribution center to each market. Find the optimal allocation of inventory to minimize total transportation cost. Vienna Zurich From$/$To Manchester Madrid Amsterdam $12$ Lisbon $9108$ Supply $7506506001015107129810$ Rotterdam Demand $400600600400$