Course Details
Subject {L-T-P / C} : MA3202 : Linear Programming { 3-1-0 / 4}
Subject Nature : Theory
Coordinator : Dr. Ankur Kanaujiya
Syllabus
Basic linear algebra, Lines and hyperplanes, convex sets, convex hull and their properties, Formulation of a Linear Programming Problem, Theorems dealing with vertices of feasible regions and optimality, Graphical solution, Simplex method (including Big M method and two phase method), infeasible and unbounded LPP's, alternate optima, Dual problem and duality theorem. Transportation problems, existence of solution, degeneracy, MODI method, Assignment problem, Travelling salesman problem. Introduction to theory of games, Minimax (max-min) criterion and optimal strategy, Solution of games with saddle points.
Course Objectives
- To learn Linear Programming
Course Outcomes
NA
Essential Reading
- H. A. Taha, Operations Research: An Introduction, , Pearson Education Limited, 2011
- N. S. Kambo, Mathematical Progamming Techniques, , Affiliated East-West Press, 1984.
Supplementary Reading
- W. L.Winston, Operation Research, Thomson Learning EMEA, Limited, 1998
- S. Hillier and G. J. Lieberman,, Introduction to Operation Research, Tsinghua University Press, 2006.