L T P J C

MEE1024 OPERATIONS RESEARCH

2 2 0 0 3
Pre-requisite MAT2001 Statistics for Engineers Syllabus version
Anti-requisite Nil 1.1
Course Objectives:
 To provide students the knowledge of optimization techniques and approaches.
 To enable the students apply mathematical and computational needed for the practical utility
of Operations Research.
 To teach students about networking, inventory, queuing, decision and replacement models.
Expected Course Outcome:
Student will be able to
1. Illustrate the use of OR models like LPP, Transportation etc., in a wide range of applications
in industries.
2. Analyze various OR models like inventory, queuing, simulation, and decision etc and apply
them for optimization.
3. Gain knowledge on current topics and advanced techniques of Operations Research for
industrial solutions.
Student Learning Outcomes (SLO): 1,7,17
Module:1 Linear Programming Problem 4 hours SLO: 1, 7
Introduction to Operations Research – Linear Programming - Mathematical Formulation – Graphical
method – Simplex method – Penalty methods: M-method, Two Phase method- Duality.
Module: 2 Transportation Problem 4 hours SLO: 1, 7
Introduction - Formulation - Solution of the transportation problem (Min and Max): Northwest Corner
rule, row minima method, column minima method, Least cost method, Vogel’s approximation method
– Optimality test: MODI method.
Module: 3 Assignment and Sequencing Models: 3 hours SLO: 1, 17
Assignment problems – Applications - Minimization and Maximization; Sequencing - Problem with
N jobs and 2 machines – n jobs and 3 machines problem - n jobs and m machines problem.
Module: 4 Project Management 4 hours SLO: 1, 7
Introduction - Phases of project management-Construction of Network diagrams- Critical path
method (CPM) and Project evaluation and review technique (PERT) - Crashing of project network.
Module: 5 Inventory Control 4 hours SLO: 1, 17
Necessity for maintaining inventory - Inventory costs -Inventory models with deterministic demand -
inventory models with probabilistic demand - Inventory models with price breaks - Buffer stock.
Module: 6 Queuing Models 4 hours SLO: 1, 17
Poisson arrivals and Exponential service times – Single channel models and Multi-channel models -
Simulation: Basic concepts, Advantages and disadvantages - Random number generation - Monte
Carlo Simulation applied to queuing problems.
Module: 7 Game theory and Replacement Models 5 hours SLO: 1, 17
Game theory: Competitive games - Useful terminology - Rules for game theory - Two person zero
sum game – Property of dominance - Graphic solution – Algebraic method.
Replacement models: Replacement of items that deteriorate with time: No changes in the value of
money, changes in the value of money - Items that fail completely: Individual replacement and group
replacement policies.
Module: 8 Contemporary issues 2 hours
Total Lecture hours 30 hours
Tutorial
 A minimum of 3 problems to be worked out by students in every tutorial class. SLO:
 5 problems to be given as homework per tutorial class. 1,7,17
 At least one open ended design problem to be given.
Tutorial Class for Module 1
Tutorial Class for Module 2
Tutorial Class for Module 3
Tutorial Class for Module 4
Tutorial Class for Module 5
30 hours
Tutorial Class for Module 6
Tutorial Class for Module 7
# A minimum of 3 problems to be worked out by students in every tutorial class.
Another 5 problems per tutorial class to be given as home work.
# Mode: Individual exercises, Team exercises.
Text Book(s)
Hamdy A Taha, Operations Research: An Introduction, 9th edition, Pearson Education, Inc.,
1.
(2014)
Reference Books
1. Hira D S and Gupta P K, Operations Research, Revised edition, S. Chand & Sons, (2014)
Kanti Swarup, Gupta P.K., and Man Mohan, Operations Research, 18th edition, S. Chand &
2.
Sons, (2015).
3. Manohar Mahajan, Operations Research, Dhanpat Rai & Co., (2013).
Recommended by Board of Studies 17-08-2017
Approved by Academic Council No. 47 Date 05-10-2017