ME482 OPERATIONS RESEARCH 3-0-0 3

Introduction to OR - Models in OR – A brief review of Linear algebra and Interior point methods - Linear
Programming –Review of linear vector spaces - linear independence - linear dependence – basis of a vector
space - Convex sets - convex combinations – supporting hyperplanes – Fundamental theorem on Linear
programming – Classical statement of LPP – Formulation of the problem from physical realities.
Simplex Method – Simplex algorithm - two phase method - Duality Theory – Dual Simplex Method –
Formulation of Transportation and Assignment problems as LPP / Traveling Salesman Problem - Special
adaptation of simplex method of solution – Sensitivity Analysis – Integer Programming
Network Analysis – Project Management – CPM/PERT – Minimal Spanning Tree Problem – Maximal Flow
Problem. Decision Analysis - Decision Trees
Queuing Models – Markovian Queuing Models – M/M1 Model – Limited Queue Capacity – Multiple Servers
Inventory Models – Deterministic Model – Probabilistic Models
Simulation – Basic Concepts – Pseudo-Random Numbers – Techniques for Generating Random Derivatives -
Dynamic Programming - Basic Concepts – Development – Continuous State DP– Multi-State Variables. Goal
Programming
TEXTBOOK:
1. Hillier, Frederick S And Lieberman, Gerald J., “Operations Research” 8th Ed Tata McGraw Hill
education Private Ltd 2010
REFERENCES:
1. A Ravindran, Don T Philips, James J Solberg “Operations Research: Principles and Practice”, 2nd
Edition, Prentice Hall , 1996
2. Hamdy Taha “Operations Research: An Introduction” 4th ed. PHI, New Delhi 2007.
 Course Plan ME 482 OPERATIONS RESEARCH (for both
Mech.Engg&Aero)
Text Work
Lectu
chapte to Remar
re Topics Key-words Objectives
rs studen ks
No(s)
ts
OR Applications in
Operations
OR –Def, principles, practice. LPP
research -
modeling approach. LLP – assumptions,
1-6 Linear
problem formulations and formulation &
Programmin
graphical solutions Identification of feasible
g
solutions.
LPP –
Simplex The simplex method in
To solve given LPP using
method – Big tabular form, constraints,
7-14 simplex algorithm and

Test I
M method, 2 standard from, canonical
conclusions.
Phase form
Method
Duality in LP, The essence of duality
To solve given LPP using
15-17 dual simplex theory, primal-dual
dual simplex method
method relationships
18-22 TP,AP Initial basic solution To find minimum
methods and optimality in transportation cost and
TP. Hungarian algorithm in minimum assignment
AP and Travelling Sales cost or maximum profit.
 man Problem

Project networks, CPM- To find the critical path

Network
23-25 earliest and latest time and total project
models
estimates completion time.
To find the probability of
project completion time
Project PERT network, project
26-31 and estimation of
network scheduling
optimum cost using
crashing.
The shortest-path,
Network
minimum spanning tree Applications of these
32,33 Optimization

Test II
and maximum flow algorithms
models
algorithm.
Decision tree, game
Rational decision-making
Decision theory, saddle point,
34-39 and to solve the
theory mixed strategies, conflict
competitive situations.
and competition.
Johnson’s algorithm, 2 m/c
Sequencing To find the optimal
40-42 n jobs, 3 m/c n jobs and m
model sequence of given jobs.
m/c n jobs
To find EOQ of
Concept, inventory policy,
Inventory deterministic and
43-48 cost of order, holding and
Theory probabilistic inventory
shortage and EOQ.
problems
 Basic queueing models,
Queueing To estimate the queue
49-52 single server and multi-
theory characteristics.
server models.
The essence and role of
Applications of
53-56 Simulation simulation, MonteCarlo
simulation in OR
simulation.
Dynamic Introduction To find the
Concepts, Bellman’s
57-60 programmin optimal combination of
principles.
g decisions.