This document outlines the topics and schedule for the MAT2003 Operations Research course. The course is 3 credit hours and covers 8 topics related to operations research over 45 total lecture hours. Topics include linear programming, duality, transportation problems, dynamic programming, inventory models, queuing models, and project networks. Student learning outcomes include understanding linear programming formulations, duality, and applications of operations research topics to solve problems. Evaluation includes a CAT exam, digital assignments, and a final exam.
This document outlines the topics and schedule for the MAT2003 Operations Research course. The course is 3 credit hours and covers 8 topics related to operations research over 45 total lecture hours. Topics include linear programming, duality, transportation problems, dynamic programming, inventory models, queuing models, and project networks. Student learning outcomes include understanding linear programming formulations, duality, and applications of operations research topics to solve problems. Evaluation includes a CAT exam, digital assignments, and a final exam.
This document outlines the topics and schedule for the MAT2003 Operations Research course. The course is 3 credit hours and covers 8 topics related to operations research over 45 total lecture hours. Topics include linear programming, duality, transportation problems, dynamic programming, inventory models, queuing models, and project networks. Student learning outcomes include understanding linear programming formulations, duality, and applications of operations research topics to solve problems. Evaluation includes a CAT exam, digital assignments, and a final exam.
Prerequisites MAT1011 Calculus for Engineers v.1.0
Module No. Topic Lecture Hours SLO 1 Linear Programming problem: Linear Programming 5 1,2,7,9 Problem- Formulation – Simplex method- Big M method – Revised Simplex method. 2 Duality and Integer programming problem: Duality-Primal 6 1,2,7,9 and Dual problems- Dual simplex method- Integer linear programming problem- Cutting plane method - Branch and Bound Method. 3 Allocation problems and Game Theory: Transportation 7 1,2,7,9 problem – Methods of basic feasible solution - Optimal solution– MODI Method. Assignment problem - Hungarian method. Game theory: Two people- zero sum game- mixed stages - Dominance properties. 4 Non-Linear programming problem: Kuhn-Tucker 5 1,2,7,9 conditions –Quadratic programming problem-Wolfe’s method-Simplex method-Beale’s method. 5 Dynamic programming problem: Dynamic Programming – 5 1,2,7,9 Principle of optimality- solution of problem with finite number of stages. 6 Inventory Models and Replacement Models: Inventory 9 1,2,7,9 models – Calculation of EOQ – Deterministic inventory models with or without shortage – Probabilistic Inventory models with or without shortage. Replacement models – Items that deteriorate with time - When money value changes –Items that fail completely – Individual replacement and Group replacement. 7 Queuing Model: Queuing models –Poisson arrivals and 6 1,2,7,9 Exponential service times – Single channel models and Multichannel models. CPM and PERT - 8 Expert Lecture: Project Network –Critical Path Scheduling 2 1,2,7,9 Total Lecture Hours 45 Text Book Kanti Swarup, Gupta P.K., and Manmohan, (2008), Operations Research, S.Chand & sons. Reference 1. Hamdy Taha, (1999), Operations Research, PHI. Books 2. S.D.Sharma , Operations Research , Kedamanth Ramnath & Co., 2006 3. Hira and Gupta, (2001), Operations Research,S.Chand & Sons. 4. Panneerselvan. R. (2006), Operation Research, Prentice Hall of India Pvt Ltd Mode of CAT, Digital Assignments, FAT Evaluation Proposed by A. Anurada, A.Kavitha, S. Purusothaman, B.Venketeswaralu
Approved by Academic Council No.:40 Date:18.03.2016
Proceedings of the Academic Council [18.03.2016] 1948