Consider the Transportation Data Set for a Minimization Problem Below

Essay

Consider the transportation data set for a minimization problem below. $$\begin{array} { | l | r | r | r | r | } \hline \text { COSTS } & \text { Dest. 1 } & { \text { Dest. 2 } } & { \text { Dest. 3 } } &{ \text { Supply } } \\\hline \text { Source 1 } & 2 & 1 & 3 & 30 \\\hline \text { Source 2 } & 4 & 2 & 1 & 40 \\\hline \text { Source 3 } & 3 & 8 & 6 & 20 \\\hline\text { Demand } & 15 & 50 & 25 & 90 \backslash 90 \\\hline\end{array}$$ a. Calculate the initial solution using the northwest-corner rule.
b. Calculate improvement indices, iterate, and solve for the optimal shipping pattern.