edited by
2,754 views
2 votes
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. $i$ and $ii$ only
  2. $i$ and $iii$ only
  3. $ii$ and $iii$ only
  4. $i$, $ii$ and $iii$
edited by

1 Answer

Answer:

Related questions

3 votes
3 votes
1 answer
1
go_editor asked Aug 11, 2016
5,548 views
Consider the following transportation problem:The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's Approximati...
1 votes
1 votes
2 answers
3
go_editor asked Jul 12, 2016
4,743 views
The initial basic feasible solution to the following transportation problem using Vogel’s approximation method is$\begin{array}{|c|c|c|c|c|c|} \hline \text{} & \textbf{...
1 votes
1 votes
1 answer
4
go_editor asked Aug 11, 2016
14,579 views
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zerogeneratedegenerateinfeasibleunbounded