Subject code IE3491 deals with semester IV of the Operations Research Syllabus of Anna University based on regulation 2021. In this article, we would like to discuss the syllabus of Operations Research. Let’s see.
We aim to provide the unit-wise IE3491 – Operations Research syllabus. It will avoid confusion for students during the examination period. We added the required textbooks and references to the syllabus. I hope this information is useful. You better be quick to read the syllabus prior than the others and prepare well for examinations. Kindly read this article thoroughly and then share it with your classmates. A decent qualified certificate from the university will help you to reach heights The following syllabus will assist you.
If you want to know more about the syllabus of B.E. Industrial Engineering and Management connected to an affiliated institution’s four-year undergraduate degree program. We provide you with a detailed Year-wise, semester-wise, and Subject-wise syllabus in the following link B.E. Industrial Engineering and Management Syllabus Regulation 2021 Anna University.
Aim Of 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 needed for 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.
IE3491 – Operations Research Syllabus
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’s algorithm, 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.
Text Books:
- Panneerselvam R, “Operations Research”, PHI, 2009.
- Srinivasan G., “Operations Research Principles and Applications”, PHI, 2017.
References:
- Hamdy A Taha, “Operations Research – An Introduction”, Pearson, 2017.
- Philips, Ravindran and Solberg, “Operations Research principle and practise”, John Wiley, 2007.
- Ronald L Rardin, “Optimisation in Operations Research”, Pearson, 2018.
Related Posts On Semester – IV:
Must Read: