Basic Solution in LPP | Basic Feasible Solution | Basic & Non-Basic variables | Linear Programming

Basic Solution in LPP, Basic Feasible Solution, Basic & Non-Basic variables in Linear Programming
In this lesson we learn the definition of basic solution, basic feasible solution, basic and non-basic variables, degenerate and non-degenerate basic feasible solution in LPP.
All types of problems related to Basic Feasible Solution of Calcutta University(CU) are also discussed here.
Website:
#Basic_Solution #LPP #BiswadipSir

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


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

(a) generate
(b) degenerate
(c) infeasible
(d) unbounded

Basic Feasible Solution,basic solution,basic solution linear programming,basic solution and basic feasible solution,degenerate basic feasible solution,basic feasible solution linear programming,basic solution in lpp,basic feasible solution linear programming in hindi,basic feasible solution of lpp,basic feasible solution linear programming example,basic and nonbasic variables in linear programming,basic variables,lpp,bsc general math,bsc general lpp,math hons lpp,cu,