Linear programming models, convex sets, extreme points;Basic feasible solution,graphical method, simplex method, two phase methods, revised simplex method ; Infeasible and unbounded linear programming models, alternate optima; Duality theory, weak duality and strong duality; Balanced and unbalanced transportation problems, Initial basic feasible solution of balanced transportation problems (least cost method, north-west corner rule, Vogel’s approximation method); Optimal solution, modified distribution method; Solving assignment problems, Hungarian method.
|Linear Programming Problem|
|LPP Lec-1 || Graphical Method- CSIR NET Mathematics||FREE||02:10:00|
|LPP Lec-2 || Convex Set – Basic Feasible Solution – Degenerate Solutions||02:00:00|
|LPP Lec-3 || Simplex method – Basic Feasible Solution – Degenerate Solutions||01:48:00|
|LPP Lec-4 || Simplex method – Alternate Optimal Solutions – Duality in Linear programming – Primal-Dual||01:16:00|
|LPP Lec-5 || Duality in Linear programming – Primal-Dual Relations||00:48:00|
|LPP Lec-6 || Duality in Linear programming – Primal Dual Relationship Duality Theorem||00:36:00|
|LPP Lec-7 || North-West Corner, Least Cost method, Vogel’s Approximation Method, Transportation Problem||01:42:00|
|LPP Lec-8 || Transportation Problem – Lec-8 – U-V Method – Vogel’s Approximation Method – LPP||01:40:00|
|LPP Lec-9 || LPP – Assignment Problem – Hungarian Method – Complete Topic||01:40:00|
|LPP Lec-10 || LPP – Questions and Solutions – Linear Programming Problem||01:19:00|
No Reviews found for this course.