The following transportation problem :
$\begin{array}{|l|l|l|l|l|} \hline & \text{A} & \text{B} & \text{C} & \text{Supply} \\\hline \text{I} & \text{50} & \text{30} & \text{220} & \text{1} \\\hline \text{II} & \text{90} & \text{45} & \text{170} & \text{3} \\\hline \text{III} & \text{250} & \text{200} & \text{50} & \text{4} \\\hline \text{Demand} & \text{4} & \text{2} & \text{2} & \text{0} \\\hline \end{array}$
Has a solution
$\begin{array}{|l|l|l|}\hline \text{} & \text{A} & \text{B} & \text{C} \\\hline \text{I} & \text{1} & \text{} & \text{} \\\hline\text{II} & \text{3} & \text{0} & \text{} \\\hline\text{III} & \text{} & \text{2} & \text{2} \\\hline\end{array}$
The above solution of a given transportation problem is
- Infeasible solution
- optimum solution
- non-optimum solution
- unbounded solution