• recategorized by
653 views
0 0 votes

At which of the following stage(s), the degeneracy do not occur in transportation problem?

($m,n$ represents number of sources and destinations respectively)

  1. While the values of dual variables $u_{i}$ and $v_{j}$ cannot be computed
  2. While obtaining an initial solution, we may have less than $m+n-1$ allocations
  3. At any stage while moving towards optimal  solution, when two or more occupied cells with the same minimum allocation become unoccupied simultaneously.
  4. At a stage when the no, of $+$ve allocation is exactly $m+n-1$.
  1. (i), (ii) and (iii)
  2. (i),(iii) and (iv)
  3. (i) and (iv)
  4. (i),(ii),(iii) and (iv)

1 Answer

Answer:
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.3k
1.3k views
go_editor asked Mar 24, 2020
1,299 views
With respect to a loop in the transportation table, which one of following is not correct?Every loop has an odd no.of cells and atleast $5$.Closed loops may or may not be...
3 3 votes
1 answers 1 answer
7.1k
7.1k views
go_editor asked Aug 11, 2016
7,109 views
Consider the following transportation problem:FactoriesStores IIIIIIIVSupplyA4681350B131110870C144101330D91113850Demand253510520  The transportation cost in the initial b...
2 2 votes
1 1 answer
3.5k
3.5k views
go_editor asked Aug 11, 2016
3,547 views
Consider the following conditions:The solution must be feasible, i.e. it must satisfy all the supply and demand constraintsThe number of positive allocations must be equa...
3 3 votes
3 answers 3 answers
12.2k
12.2k views
go_editor asked Aug 2, 2016
12,241 views
Consider the following transportation problem:The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given be...