Simplex Method in Nepali
Solve by simplex method the LP problem to maximize Z = 7x + y
subject to 3x + 4y ≤ 12, y - x ≤ 2, x ≥ 0, y ≥ 0.
0:09 Intro
1:18 Converting inequalities into equations introducing slack variable
2:29 Expressing LPP in Standard Form
3:26 Constructing Initial Simplex Tableau
6:24 Pivot Column in Simplex Method
7:50 Pivot Row in Simplex Method
11:11 Pivot Element in Simplex Method
11:29 Pivoting
16:05 Checking Optimal Solution
