In the transportation problem, if the number of allocation is less than m+n-1 then it is called as non-degenerate basic feasible solution. In the transportation problem, the lowest cost entry method...

state true or false if false correct it

Extracted text: In the transportation problem, if the number of allocation is less than m+n-1 then it is called as non-degenerate basic feasible solution. In the transportation problem, the lowest cost entry method depend on determining the smallest cost in the cost matrix of the transportation table and allocate xij=min (ai,bj) in the cell (ij). For an assignment problem with 3 agents and 4 tasks, the assignment matrix will have 3 rows and 4 columns.