Consider a transportation problem with 4 supply points and 5 demand points. The number of constraints in the formulation is ___________.
In the dual to the assignment problem, the dual variables are __________.
An unbalanced transportation problem can be solved by
Consider the following statements regarding the assignment problem:
1. Supply from every supply node is one.
2. Every demand node has a demand of one.
3. Solution is required to be all integers.
Which of the following statements is/are correct __________?
The solution to a transportation problem with m rows and n columns is said to be feasible when _________.
In vogels approximation method also known as penalty method, the penalty in the allocation of transportation problem means the difference between which of the following