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
1 vote
2k 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
in Optimization
recategorized
2k views

1 Answer

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

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

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
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
2 votes
1 answer
2
987 views
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$
asked Aug 11, 2016 in Optimization jothee 987 views
3 votes
2 answers
3
796 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 796 views
2 votes
1 answer
4
1.1k views
Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution S3: If ... the two problems are equal. Which of the following is true? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3
asked Aug 2, 2016 in Optimization jothee 1.1k views
...