Simplex Method (in Nepali)
Solve by simplex method the LP problem to maximize Z = 7x + 5y
subject to x + 2y ≤ 6, 4x + 3y ≤ 12, x ≥ 0, y ≥ 0.
0:09 Intro
2:14 Formulation of Linear Programming Problems
4:12 Objective Function in LPP
4:56 Constraints in LPP
8:26 Slack Variable in Simplex Method
10:11 Converting inequalities into equations introducing slack variable
11:59 Expressing LPP in Standard Form
13:$9 Constructing Initial Simplex Tableau
18:16 Determining Pivot Column in Simplex Method
20:42 Determining Pivot Row in Simplex Method
24:48 Determining Pivot Element in Simplex Method
25:57 Pivoting
31:50 Checking Optimal Solution
