This course is meant for exposing the students to the mathematical details of the techniques for obtaining optimum solutions under constraints for desired output. They will be taught numerical methods of optimization, linear programming techniques and multiple objective programming. Students will also be exposed to practical applications of these techniques.
Course |
Course Outcomes |
Learning and teaching strategies |
Assessment Strategies |
|
---|---|---|---|---|
Course Code |
Course Title |
|||
24STT222 |
Operation Research (Theory) |
CO 41: Outline the principles, scope, and phases of operation research. Identify and formulate real-world problems into mathematical models and apply appropriate optimization techniques to find optimal solutions. CO 42: Develop proficiency in decision-making under uncertainty and risk using decision theory techniques and understand the principles of dynamic programming. CO 43: Determine the inventory level of an industry for the smooth functioning and understand the concept of probability inventory problems. CO 44: Analyzing queuing systems to optimize system performance and improve customer service. CO 45: Explain problems related to sequencing and PERT-CPM to solve network analysis problems. CO 46: Contribute effectively in course-specific interaction. |
Approach in teaching: Interactive Lectures, Group Discussion, Classroom Assignment, Problem Solving Sessions.
Learning activities for the students: Assignments, Seminar, Presentation, Subject based Activities. |
Classroom Quiz, Assignments, Class Test, Individual Presentation. |
Operation Research: Definition and scope, phases, principles, models and their solutions. Review of linear programming problem, Duality Problems, Concept of simulation: Monte Carlo Simulation technique and its applications.
Decision theory: Decision making under uncertainty and risk, sensitivity analysis. Dynamic programming: Introduction, decision tree, Bellman principle of optimality, solution of problems with finite number stages, concept of dynamic programming, minimum path problem.
Inventory control: Introduction, costs, advantages, Static Economic-Order-Quantity (EOQ) models with and without shortage, Deterministic models of price break, probabilistic inventory model, ABC Analysis.
Queuing System: Definition, Characteristics of queuing system, Markov chain, Markov process, Poisson process: pure birth and pure death process. Kendall’s notations, Steady state solution of (M/M/1) and (M/M/s) models with associated distributions of queue length and waiting time. (M/G/1) model–Pollaczek Khintchine formula.
Sequencing Problems: Notations, terminology, and assumptions, processing n jobs through 2 machines, n jobs through 3 machines, 2 jobs through m machines with graphical method, processing n jobs through m machines. PERT and CPM: basic concepts, probability of projection completion, travelling salesman problem, replacement problems- block and age replacement policies.
SUGGESTED READINGS:
e-RESOURCES:
JOURNALS: