Syllabus
|
Course Code: MT-602 Course Name: (A) Linear Programming |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Linear Programming Problems, Definition, objective function, constraints, Canonical and Standard forms. Graphical Approach for solving some Linear Programs, limitations of graphical method. Convex and polyhedral sets, Extreme points, Basic solutions, Basic Feasible Solutions, Correspondence between basic feasible solutions and extreme points. | |
| 2 | Theory of simplex method, concept of initial basic feasible solution, Optimality criterion, Improving a basic feasible solution, Unboundedness; Simplex algorithm and its tableau format; Artificial variables, Two-phase method, Big-M method. | |
| 3 | Formulation of the dual problem, Duality theorems, Unbounded and infeasible solutions in the primal, Solving the primal problem using duality theory. | |
| 4 | Formulation of transportation problems, Methods of finding initial basic feasible solutions: North-west corner rule, Least cost method, Vogel approximation method, Algorithm for obtaining optimal solution; Formulation of assignment problems, Hungarian method. | |
