IE3491 Operations Research Syllabus:
IE3491 Operations Research Syllabus – Anna University Regulation 2021
COURSE OBJECTIVES:
• Provide knowledge of optimization techniques and approaches.
• Formulate a real-world problem as a mathematical programming model.
• Enable the students apply mathematical, computational and communication skills neededfor the practical utility of Operations Research.
• Knowledge to solve networking problems.
• Knowledge to solve various inventory problems.
• Gain knowledge on solving different waiting line models.
UNIT I LINEAR PROGRAMMING
Introduction to Operations Research – assumptions of linear programming problems – Formulations of linear programming problem – Graphical method. Solutions to LPP using simplex algorithm – Two phase method – Big M method
UNIT II ADVANCES IN LINEAR PROGRAMMING
Revised simplex method – primal dual relationships – Dual simplex algorithm – Sensitivity analysis– changes in RHS value – changes in Coefficient of constraint – Adding new constraint – Adding new variable.
UNIT III NETWORK ANALYSIS
Transportation problems: Northwest corner rule, least cost method, Vogel’s approximation method- stepping stone method – MODI method – Unbalanced transportation – Assignment problem – Hungarian algorithm –Project Management CPM & PERT. Minimum spanning tree problem: Prim’salgorithm, Kruskal’s algorithm – Shortest path problem: Dijkstra’s algorithms, Floyds algorithm – maximal flow problem: Maximal-flow minimum cut theorem – Maximal flow algorithm
UNIT IV INVENTORY MODELS
Purchase model with no shortages – Manufacturing model with no shortages – Model with price breaks – Reorder point model – Probabilistic inventory model
UNIT V QUEUING THEORY
Queuing theory terminology – Single server, multi server- limited and unlimited queue capacity- limited and unlimited population –limited and infinite queue length.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Learned to translate a real-world problem, given in words, into a mathematical Formulation.
CO2: An understanding of the role of algorithmic thinking in the solution of operations research problems.
CO3: Be able to build and solve Transportation Models and Assignment Models, maximal flow problem, minimum spanning tree and shortest path problem.
CO4: Able to handle issues in various Inventory models.
CO5: The students acquire capability in applying and using of queuing models for day today problem
TEXT BOOKS:
1. Panneerselvam R, “Operations Research”, PHI, 2009.
2. Srinivasan G., “Operations Research Principles and Applications”, PHI, 2017.
REFERENCES:
1. Hamdy A Taha, “Operations Research – An Introduction”, Pearson, 2017.
2. Philips, Ravindran and Solberg, “Operations Research principle and practise”, John Wiley, 2007.
3. Ronald L Rardin, “Optimisation in Operations Research”, Pearson, 2018.