The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+2 votes

Consider the following conditions:

  1. The solution must be feasible, i.e. it must satisfy all the supply and demand constraints
  2. 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
  3. All the positive allocations must be in independent positions

The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:

  1. a and b only
  2. a and c only
  3. b and c only
  4. a, b and c
in Others by Veteran (103k points)
recategorized by | 715 views

1 Answer

+2 votes
all conditions must be true (all these are basic constraints)

hence ans is D
by Boss (48.5k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,362 questions
55,786 answers
90,919 users