EM527: Operations Research I

Basic Details:

Course Code: EM 527
Credits: 3
Pre-requisites: None
Compulsory/Optional: Optional

Aim :

To introduce various engineering and management related problems and their mathematical models together with the appropriate algorithms and techniques employed in solving them in achieving effective decision making.

Intended Learning Outcomes:

On successful completion of the course, the students should be able to;

Construct mathematical models of standard problems of operations research.
Select suitable standard algorithms and apply them in solving problems given in the mathematical, graphical or tabular forms.
Apply similar algorithms in solvinga variety of multidisciplinary problems.

Couse Content:

Introduction to Operations Research.

Introduction to Linear Programming (LP)

General form of LP problem, graphical method, duality, feasible region, redundant constraints.

Analytical Methods for LP Problem

Simplex, slack and artificial variables, simplex method, dual simplex method, big-M method, use of Matlab in solving LPPs.

Transportation Problem

Mathematical model, tabular representation, north-west corner method, table minimum method, Vogel method, stepping stone algorithm.

Transshipment Problem

Comparison of transportation and transshipment problems, case of sources and destinations acting as intermediate nodes, case of auxiliary nodes acting as intermediate nodes.

Assignment Problem

Balanced and unbalanced assignment problems, methods of row and column reduction, Hungarian algorithm.

Network Techniques

Minimum spanning tree problem, Kruskal algorithm, shortest distance problem by systematic approach, maximum flow problem, labeling technique, minimum-cut maximum flow theorem.

Inventory Control

Inventory models, inventory models for manufacturing organizations, Economic Order Quantity (EOQ), frequency of ordering.

Queuing Theory

Kendall's notation, M/M/1 and M/G/1 queues, average waiting times, servicing times.

Dynamic Programming (DP)

States and stages of DP, Knapsack problem, Shortest distance problem.

Time Allocation (Hours):

Lectures

Tutorials

Recommended Texts:

F.S. Hillier and G.J. Lieberman, “Introduction to Operations Research”, 7th edition (2001), McGraw-Hill Inc. NY.
F.S. Hillier and G.J. Lieberman, “Introduction to Mathematical Programming”, 2nd edition (1995), McGraw-Hill Inc. NY.
H.A.Taha, “Operations Research an Introduction”, 10th edition (2010), Pearson.

Assessment:

In - course: