LINEAR PROGRAMMING : BASIC FEASIBLE SOLUTION

This is the first video of the chapter Linear Programming problem. In this chapter we discuss two questions on basic feasible solution, degenerate and non-degenerate solution. Two questions are given as homework for practice. It is an important topic of subject of operations research/linear programming/quantitative techniques/applied maths which is one of the subject in BBA, BCA, B.Tech, B.Com(H) and several other hons courses.

Join Today
Simplex method #01
▶︎

Simplex method #01

Simplex Method Problem 1- Linear Programming Problems (LPP) - Engineering Mathematics - 4
▶︎

Simplex Method Problem 1- Linear Programming Problems (LPP) - Engineering Mathematics - 4

HOW TO REDUCE A FEASIBLE SOLUTION TO A BASIC FEASIBLE SOLUTION: PROOF & EXAMPLES : in hindi
▶︎

HOW TO REDUCE A FEASIBLE SOLUTION TO A BASIC FEASIBLE SOLUTION: PROOF & EXAMPLES : in hindi

Basic Solutions |Part 1| Linear Programming Problem- Basic /Feasible Solutions
▶︎

Basic Solutions |Part 1| Linear Programming Problem- Basic /Feasible Solutions

Basic Solution, Non degenerate and degenerate basic solution, basic feasible solution with example
▶︎

Basic Solution, Non degenerate and degenerate basic solution, basic feasible solution with example

Convex Set in Hindi | Linear Programming | Operation research by Yash Vardhan#feelingwaliclass
▶︎

Convex Set in Hindi | Linear Programming | Operation research by Yash Vardhan#feelingwaliclass

(Lect-11)/reduction of feasible solution to basic solution in lpp /B.Sc. final year ccs university
▶︎

(Lect-11)/reduction of feasible solution to basic solution in lpp /B.Sc. final year ccs university

Lec-15 Primal to dual conversion || linear Programming || Operation Research || In Hindi || Part 1
▶︎

Lec-15 Primal to dual conversion || linear Programming || Operation Research || In Hindi || Part 1

Introduction to Assignment Problem Hungarian Method|Linear Programming|Dream Maths
▶︎

Introduction to Assignment Problem Hungarian Method|Linear Programming|Dream Maths

Basic Feasible Solution in Hindi | Linear Programming | Operation research by Yash vardhan tengauriy
▶︎

Basic Feasible Solution in Hindi | Linear Programming | Operation research by Yash vardhan tengauriy

Lec -6 Simplex Method Maximization Problem In Hindi || Solve an example || Operation Research
▶︎

Lec -6 Simplex Method Maximization Problem In Hindi || Solve an example || Operation Research

Operation Research | Linear Programming Graphical Method | Problems
▶︎

Operation Research | Linear Programming Graphical Method | Problems

Graphical Solution To an LPP: Operations research paper in BBA, BCA, B.Tech, and other hons. courses
▶︎

Graphical Solution To an LPP: Operations research paper in BBA, BCA, B.Tech, and other hons. courses

Simplex method | LPP on Simplex method in hindi | optimization technique (easy way)
▶︎

Simplex method | LPP on Simplex method in hindi | optimization technique (easy way)

LPP: Finding "Basic Solution" of a linear system of equation and proving them as non-degenerate
▶︎

LPP: Finding "Basic Solution" of a linear system of equation and proving them as non-degenerate

Big M Method #01 : Unique solution case: For BBA, BCA, B.Tech, B.Com(H) and other hons. courses.
▶︎

Big M Method #01 : Unique solution case: For BBA, BCA, B.Tech, B.Com(H) and other hons. courses.

Lec-1 Graphical Method In Linear Programming Problem || For Unique Solution || In Hindi
▶︎

Lec-1 Graphical Method In Linear Programming Problem || For Unique Solution || In Hindi

Introduction to linear programming|LPP|BBA|B.COM|BCA
▶︎

Introduction to linear programming|LPP|BBA|B.COM|BCA

Simplex Method #03: Case of unbounded solution and when R.H.S of any constraint is negative.
▶︎

Simplex Method #03: Case of unbounded solution and when R.H.S of any constraint is negative.