Degeneracy in a 5×6 transportation problem occurs when the number of occupied cell is less than
- A20 but greater than 10
- B10
- CZero
- DInfinity
A non-degenerate basic solution needs m+n-1 = 5+6-1 = 10 occupied cells, so fewer than 10 is degenerate.
MCQs, short and long questions from lecture 35.Lecture 35 ki MCQs, short aur long sawal.
3 MCQs · 1 long question · 3 MCQs from past papers3 MCQs · 1 long sawal · 3 MCQs past papers se
Degeneracy in a 5×6 transportation problem occurs when the number of occupied cell is less than
A non-degenerate basic solution needs m+n-1 = 5+6-1 = 10 occupied cells, so fewer than 10 is degenerate.
If a basic feasible solution contains less than "m + n – 1" (Here m is the number of rows, n is the number of columns in transportation problem) non negative allocation, then it is said to be
Fewer than m+n-1 basic allocations means the solution is degenerate.
A transportation problem is degenerate, if while deriving a feasible solution an allocation to any cell
When one allocation exhausts a row and a column together, fewer than m+n-1 cells get filled, giving degeneracy.
No MCQs match this filter.Is filter mein koi MCQ nahi.
No short questions added yet.Abhi koi short sawal shamil nahi.
How the problem of the degeneracy arises in a transportation problem?
A basic feasible solution of an m x n transportation problem must have m + n - 1 positive allocations in independent cells. Degeneracy arises when fewer than m + n - 1 cells are occupied. This happens (i) in the initial solution (NWC, LCM or VAM) when one allocation satisfies a row supply and a column demand simultaneously, so both are crossed out together, or (ii) during improvement (MODI / stepping stone) when two or more cells in the loop reach zero at the same time. With too few occupied cells the u_i, v_j cannot all be found. Remedy: put a very small quantity epsilon (treated as zero) in a suitable independent unoccupied cell (usually least cost) to make the count m + n - 1, then continue and set epsilon = 0 at the end.