recategorized
14,828 views

1 Answer

1 votes
1 votes

it should be degenrate

Basic Feasible Solution: A feasible solution to LP problem which is also the basic solution is called the “basic feasible solution”. Basic feasible solutions are of two types;

(a) Degenerate: A basic feasible solution is called degenerate if value of at least one basic variable is zero.

(b) Non-degenerate: A basic feasible solution is called ‘non-degenerate’ if all values of m basic variables are non-zero and positive

refer http://www.newagepublishers.com/samplechapter/002072.pdf

Answer:

Related questions

2.5k
views
1 answers
2 votes
go_editor asked Aug 2, 2016
2,452 views
Given the following statements with respect to linear programming problem:S1: The dual of the dual linear programming problem is again the primal problemS2: If either the ... the following is true?S1 and S2S1 and S3S2 and S3S1, S2 and S3
5.7k
views
1 answers
3 votes
go_editor asked Aug 11, 2016
5,717 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$
2.9k
views
1 answers
2 votes
go_editor asked Aug 11, 2016
2,883 views
Consider the following conditions:The solution must be feasible, i.e. it must satisfy all the supply and demand constraintsThe number of positive allocations must be equal to $m+n-1$ ... and $iii$ only$ii$ and $iii$ only$i$, $ii$ and $iii$
1.9k
views
2 answers
3 votes
go_editor asked Aug 11, 2016
1,876 views
In constraint satisfaction problem, constraints can be stated asArithmetic equations and inequalities that bind the values of variablesArithmetic ... over variablesArithmetic equations that discard constraints over the given variables