Consider the following conditions:
- The solution must be feasible, i.e. it must satisfy all the supply and demand constraints
- The number of positive allocations must be equal to $m+n-1$, where $m$ is the number of rows and $n$ is the number of columns
- All the positive allocations must be in independent positions
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
- $i$ and $ii$ only
- $i$ and $iii$ only
- $ii$ and $iii$ only
- $i$, $ii$ and $iii$