From the LA warehouse, it wants to ship 5 tons to each of three distributions centers From the Chicago warehouse, it wants to ship 6 tons to Denver distribution center, 7 tons to Austin distribution center, and 7 tons to Washington distribution center From the New York City warehouse, it wants to ship 10 tons to each of three distribution centers Is this a feasible shipping plan?

This question relates to the KDGL example introduced in Session 3, and tests your understanding of the algebraic model formulation. You can answer it without using Excel. Only use Excel if you cannot answer this question otherwise.

Suppose that KDGL considers the following shipping policy: it would like to ship integer numbers of tons of product from all warehouses to all distribution centers, and the amounts shipped from a particular warehouse to all three distribution centers must be as close as possible. In particular, it considers the following shipping plan:

• From the LA warehouse, it wants to ship 5 tons to each of three distributions centers
• From the Chicago warehouse, it wants to ship 6 tons to Denver distribution center, 7 tons to Austin distribution center, and 7 tons to Washington distribution center
• From the New York City warehouse, it wants to ship 10 tons to each of three distribution centers

Is this a feasible shipping plan?