Linear Programming (GATE MA) — GATE Mathematics (MA) Prep
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.
- Exam: GATE Mathematics (MA)
- Section: Linear Programming