Q.The transportation problem is said to be unbalanced if ________.

The north-west corner of a transportation table is its top-left cell.

The North-West Corner Rule is a method for finding an initial basic feasible solution of a transportation problem. "North-west" refers to the geographical top-left of a map, so in the transportation matrix it means the **top-left corn …

A non-degenerate solution has the number of allocations equal to $m+n-1$.

For a transportation problem with $m$ origins and $n$ destinations, a basic feasible solution has at most $m+n-1$ basic (occupied) cells. The solution is:

• non-degenerate when the number of allocations is exactly $m+n-1$, and …

A transportation problem is balanced when total supply equals total demand; if they differ it is unbalanced, option (b).

Definition. A transportation problem is balanced when

$\sum(\text{supply})=\sum(\text{demand}).$

It is therefore unbalanced when

$\text{Total supply} e\text{Total demand}.$

…

Non-degenerate $\Rightarrow$ allocations $=m+n-1$.

For an $m\times n$ transportation problem, a basic feasible solution has $m+n-1$ independent allocations. If the number of occupied cells equals $m+n-1$ the solution is non-degenerate …

A transportation problem is balanced when total supply $=$ total demand; it is unbalanced when they are unequal.

In a transportation problem the availability at the sources (supply) and the requirement at the destinations (demand) are compared:

$\text{Balanced}:\ \sum a_i=\sum b_j,\qquad \text{Unbalanced}:\ \sum a_i\neq\sum b_j.$ …

The North-West corner of a transportation table is its top-left cell, the starting point of the North-West Corner Method.

In the North-West Corner Method for finding an initial basic feasible solution, allocation starts at the north-west (top-left) corner cell of the transportation matrix and proceeds t …

A basic feasible solution of an $m$-origin, $n$-destination transportation problem has $m + n - 1$ basic (allocated) cells; when exactly that many independent allocations exist, the solution is non-degenerate.

Reasoning. For a transportation problem with $m$ sources and $n$ destinations, the number of independent constraints is $m + n - 1$, so a basic feasible solution requires exactly $m + n - 1$ allocations. …