UGC/CBSE NET SOLVED QUESTION PAPERS.(Computer Science): Q24,Paper 3,J13. A basic feasible solution to a m-origin, n-destination transportation problem is said to be _________ if the number of positive allocations are less than m + n – 1.

Saturday 30 May 2015

Q24,Paper 3,J13. A basic feasible solution to a m-origin, n-destination transportation problem is said to be _________ if the number of positive allocations are less than m + n – 1.

(A) degenerate

(B) non-degenerate

(C) unbounded

(D) unbalanced

Answer C

1 comment:

Mamta19 May 2017 at 19:30
degenerate
ReplyDelete
Replies

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)