Syllabus

Module-1(20 hours): 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
Module-2(18 hours): 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.
Module-3(10 hours): Introduction to theory of games, Minimax (max-min) criterion and optimal strategy, Solution of games with saddle points.

To familiarize industrial problems to students with formulation of LPP and solving Linear Programming Problems by graphical method

To introduce on simplex method of solving LPP

To familiarize with Assignment Problems and their applications

To interpret the method in Game Theory

1) More knowledge on this topic in higher studies will help students to deal industrial models
2) This is also prerequisite for studying advanced courses in Nonlinear Programming
Problems
3) Students shall obtain basic concepts on Inventory Control Problem
4) After this course students will learn application of LPP in real life optimization problems.

H. A. Taha, Operations Research: An Introduction, Pearson Education Limited, 2011

N. S. Kambo, Mathematical Progamming Techniques, Affiliated East-West Press, 1984.

W. L.Winston, Operation Research, Thomson Learning EMEA, Limited, 1998

S. Hillier and G. J. Lieberman,, Introduction to Operation Research, Tsinghua University Press, 2006.