Back

Operations Research I - EM527

Credits : 3

Prerequisites : –

Compulsory/Optional : Optional

Aim(s)
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;

  1.  Construct mathematical models of standard problems of operations research.
  2.  Select suitable standard algorithms and apply them in solving problems given in the mathematical, graphical or tabular forms.
  3.  Apply similar algorithms in solving a variety of multidisciplinary problems.
Course content/Course description
  1. Introduction to Operations Research.
  2. Introduction to Linear Programming (LP) : General form of LP problem,graphical method, duality, feasible region, redundant constraints.
  3. Analytical Methods for LP Problem : Simplex, slack and artificial variables, simplex method, dual simplex method, big-M method, use of Matlab in solving LPPs.
  4. Transportation Problem : Mathematical model, tabular representation, north-west corner method, table minimum method, Vogel method, stepping stone algorithm.
  5. 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.
  6. Assignment Problem : Balanced and unbalanced assignment problems, methods of row and column reduction, Hungarian algorithm.
  7. Network Techniques : Minimum spanning tree problem, Kruskal algorithm, Shortest distance problem by systematic approach, maximum flow problem, labeling technique, minimum-cut maximum flow theorem.
  8. Inventory Control : Inventory models, inventory models for manufacturing organizations, Economic Order Quantity(EOQ), frequency of ordering.
  9. Queuing Theory : Kendall’s notation, M/M/1 and M/G/1 queues, average waiting times, servicing times.
  10. Dynamic Programming (DP) : States and stages of DP, Knapsack problem, Shortest distance problem
Recommended Texts
  1.  F.S. Hillier and G.J. Lieberman, Introduction to Operations Research, 7th
    edition,2001, McGraw-Hill Inc. NY.
  2.  F.S. Hillier and G.J. Lieberman,Introduction to Mathematical rogramming,2
    nd
    edition, 1995, McGraw-Hill Inc. NY.
  3.  H.A.Taha,Operations research an introduction, 10th edition,2010, Pearson.
Time Allocation Hours
Lectures 36
Tutorials 09
Assignments –


Assessment Percentage Marks
In-course
Tutorials 20
Mid-semester 30
End-semester 50

Copyright © 2025 Department of Civil Engineering – University of Peradeniya – All Rights Reserved