# UGCNET-Dec2015-III: 52

1 vote
3k views

A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zero

1. generate
2. degenerate
3. infeasible
4. unbounded

recategorized

1 vote

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

0
Thank you so much Sir.

Sir can you please provide the PDF's for other topics of LPP too. Like Big M, simplex and dual simple etc.

Thanks and regards

Shreya

## Related questions

1
3.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$
Consider the following conditions: The solution must be feasible, i.e. it must satisfy all the supply and demand constraints 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 All the positive allocations must be in independent ... solution if it satisfies: $a$ and $b$ only $a$ and $c$ only $b$ and $c$ only $a$, $b$ and $c$