Tuesday, 2 June 2020

UGC NET Computer Science December 2019 | Question 51

Question 51
A basic feasible solution of an m*n transportation problem is said to be non-degenerate. if basic feasible solution contains exactly number of individual allocation in positions.
  1. 1. m+n+1, independent
  2. 2. m+n-1, independent
  3. 3. m+n-1, appropriate
  4. 4. m-n+1. independent
Explanation
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
  • The solution must be feasible, i.e. it must satisfy all the supply and demand constraints
  • The number of positive allocations must be equal to m+n−1, where m is the number of rows and n is the number of columns
  • All the positive allocations must be in independent positions
So, option 2 is correct answer

PreviousNext
UGC NET CS December 2019 - Question 50UGC NET CS December 2019 - Question 52

No comments:

Post a Comment

UGC NET Computer Science December 2019 | Question 16

Question 16 In a certain coding language. 'AEIOU' is written as 'TNHDZ'. Using the same coding language. 'BFJPV' wil...

Popular Posts