{"id":21039,"date":"2025-07-29T09:47:09","date_gmt":"2025-07-29T04:17:09","guid":{"rendered":"https:\/\/eng.pdn.ac.lk\/civileng\/?page_id=21039"},"modified":"2025-07-29T10:47:53","modified_gmt":"2025-07-29T05:17:53","slug":"em527","status":"publish","type":"page","link":"https:\/\/eng.pdn.ac.lk\/civileng\/em527\/","title":{"rendered":"EM527"},"content":{"rendered":"\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Operations Research I - EM527 <\/h2><\/span><\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Credits : 3<\/p>\n

Prerequisites : –<\/p>\n

Compulsory\/Optional : Optional<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Aim(s)<\/th>\n<\/tr>\n<\/thead>\n
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<\/td>\n<\/tr>\n<\/tbody>\n
Intended Learning Outcomes<\/th>\n<\/tr>\n<\/thead>\n
\n

On successful completion of the course, the students should be able to;<\/p>\n

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

    <\/td>\n
    <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
    \n\n\n\n\n\n\n\n\n
    Assessment<\/th>\nPercentage Marks<\/th>\n<\/tr>\n<\/thead>\n
    In-course<\/td>\n<\/tr>\n
    Tutorials<\/td>\n20<\/td>\n<\/tr>\n
    Mid-semester<\/td>\n30<\/td>\n<\/tr>\n
    End-semester<\/strong><\/td>\n50<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

    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 … <\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-21039","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/eng.pdn.ac.lk\/civileng\/wp-json\/wp\/v2\/pages\/21039","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/eng.pdn.ac.lk\/civileng\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/eng.pdn.ac.lk\/civileng\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/eng.pdn.ac.lk\/civileng\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/eng.pdn.ac.lk\/civileng\/wp-json\/wp\/v2\/comments?post=21039"}],"version-history":[{"count":0,"href":"https:\/\/eng.pdn.ac.lk\/civileng\/wp-json\/wp\/v2\/pages\/21039\/revisions"}],"wp:attachment":[{"href":"https:\/\/eng.pdn.ac.lk\/civileng\/wp-json\/wp\/v2\/media?parent=21039"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}