Shown below is the data for a Transportation Problem with 5 origins (Dallas, Denver, Juarez, Tucson and Wichita) and 6 destinations (Store 1-Store 6). The supply at each origin, demand at each store, and the unit costs are shown in the following table.

$/unit	Store 1	Store 2	Store 3	Store 4	Store 5	Store 6	Supply
Dallas	112	145	156	171	210	185	1000
Denver	123	154	217	232	164	155	1500
Juarez	96	83	152	125	154	85	2000
Tucson	126	153	177	169	173	125	1000
Wichita	104	132	187	154	157	162	1500
Demand	1000	1000	1000	1000	1200	1300

Suppose now that Denver cannot serve Store 1, 2 or 3, and Dallas can serve only Stores 1 and 2 (that is, Dallas can ship to Store 1, Store 2 or both). Solve the Transportation Problem to find the minimum cost shipping pattern for this situation.

Minimum Cost = _____________

Fill in the table with the optimal flows for this situation:

$/unit	Store1	Store2	Store3	Store4	Store5	Store6	Supply	Rowsum
Dallas							1000
Denver							1500
Juarez							2000
Tucson							1000
Wichita							1500
Demand	1000	1000	1000	1000	1200	1300
colsum

Which origins, if any, do not send all their supply? ___________________________

Which destinations, if any, do not receive all their demand? ___________________________

Read the question in bold above very well please. Also, a screenshot of the solver too.

Thanks