Operation Research

Paper Code: 
STT 323
Credits: 
5
Contact Hours: 
75.00
Max. Marks: 
100.00
Objective: 

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.

 

Students will able to

Course

Learning outcomes (at course level

Learning and teaching strategies

Assessment Strategies

 

Paper Code

Paper Title

STT-323

Operation Research

CO  61: Learn about the scope, principles and models of Operation Research, concept of duality and simulation and able to solve linear programming problems

 

CO 62: Describe the concept of decision theory and sensitivity analysis and Discuss various methods to solve dynamic programming problems.

 

CO 63: Determine the inventory level of an industry for the smooth functioning and Understand the concept of probability inventory problems.

 

CO 64: Ability to apply the concept of queuing theory and solve related problems.

 

CO 65: Explain problems related to sequencing and PERT-CPM to solve network analysis problems.

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

 

15.00
Unit I: 
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.

 

15.00
Unit II: 
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.

 

15.00
Unit III: 
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.

 

 

15.00
Unit IV: 
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.

 

15.00
Unit V: 
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.

 

Essential Readings: 
  • Taha, H.A.(2007): Operation Research, McMillan Publishing Co. Inc 8thEdition,
  • Kanti Swaroop et. al(2007): Operation Reseach ,Sultan chand & Sons, 13th edition.
  • Gross, D. & Harris C.M. 1975): Fundamentals of Queueing Theory, John Wiley & Sons.
  • Sharma, S.D. (2000):  Operation Research, Kedar Nath Pub. Meerut.
  • Bronso,.R. et.al.(1983) , Schaum’s outlines Operation Research, Tata McGraw Hill Edition
  • Klienrock, L.(1975): Queueing System , Vol. 1 Theory , John Wiley.
  • Starr, M.K. and Miller, D.W. (1962): Inventory Control-Theory and Practice, Prentice Hall

 

 

Academic Year: 
2021-2022
  • Printer-friendly version
  • PDF version