search
Log In
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
2 votes
978 views

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 Optimization
edited by
978 views

1 Answer

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

hence ans is D
Answer:

Related questions

3 votes
1 answer
1
3k views
Consider the following transportation problem: The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's Approximation method is $1450$ $1465$ $1480$ $1520$
asked Aug 11, 2016 in Optimization jothee 3k views
1 vote
1 answer
2
1.9k views
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zero generate degenerate infeasible unbounded
asked Aug 11, 2016 in Optimization jothee 1.9k views
3 votes
2 answers
3
795 views
In constraint satisfaction problem, constraints can be stated as Arithmetic equations and inequalities that bind the values of variables Arithmetic equations and inequalities that does not bind any restriction over variables Arithmetic equations that impose restrictions over variables Arithmetic equations that discard constraints over the given variables
asked Aug 11, 2016 in Optimization jothee 795 views
3 votes
3 answers
4
2.2k views
Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution
asked Aug 2, 2016 in Optimization jothee 2.2k views
...