Operations Research208110 marksNumerical: Transportation problem costMinimization and maximization of transportation costs
Transportation Problem - Minimum Cost Solution Obtain the minimum transportation cost for the following transportation problem.
Transportation Problem - Minimum Cost Solution
Obtain the minimum transportation cost for the following transportation problem.
$$\begin{array}{|c|ccc|c|}\hline \text{Destination/Source} & S1 & S2 & S3 & \text{Units Demanded} \ \hline D1 & 12 & 16 & 10 & 200 \ \hline D2 & 15 & 12 & 10 & 200 \ \hline D3 & 11 & 12 & 12 & 50 \ \hline \text{Units Available} & 200 & 150 & 100 & 450 \ \hline \end{array}$$
[10]
I must read the matrix carefully. The LaTeX has two conflicting layouts. The trailing (cleaner) array is: $$ \begin{array}{ccccc}\hline \text{Destination/Source} & D1 & D2 & D3 & \text{Units Available} \ \hline S1 & 12 & 15 & 11 & 200 \ S2 & 16 & 12 & 12 & 150 \ S3 & 10 & 10 & 12 & 100 \ \hli...