Operation Research Applications
Subject Overview
The second Operations Management group elective, covering the historical development and modeling art of OR, linear programming and its applications, transportation/assignment models and queuing theory, and network models and non-linear programming. A 4-credit elective theory paper.
Unit-wise Syllabus
4 units — click WhatsApp below to get the full notes for each
Unit 1: Introduction to operations research
Historical development, managerial applications of optimization, classical and advanced optimization techniques, origin of OR, general approach for solving OR problems, classification of mathematical models and decision-making environments
Unit 2: Linear programming applications
Formulation of linear mathematical models, graphical and simplex techniques, simplex algorithm and tableau construction, minimization vs maximization, Big-M and two-phase methods, duality theory and sensitivity analysis
Unit 3: Transportation, assignment and queuing models
Initial basic feasible solution methods, optimization of transportation and assignment problems, dynamic programming (deterministic and probabilistic), queuing theory — basic structure, Poisson input and exponential service models
Unit 4: Network and non-linear models
Shortest route and traveling salesman problems, PERT and CPM, network construction, critical path identification, slack and float, crashing for cost reduction, graphical illustration of non-linear programming problems
