Operation Research (OEC-CS701A)
4 units: Network Analysis, Game Theory, Queuing Theory · L-T-P 3L/week.
Detailed syllabus
Unit 1
Basic LPP and Applications; Various Components of LP Problem Formulation. Solution of Linear 17 Programming Problems: Solution of LPP: Using Simultaneous Equations and Graphical Method; Definitions: Feasible Solution, Basic and nonbasic Variables, Basic Feasible Solution, Degenerate and Non- degenerate Solution, Convex set and explanation with examples Solution of LPP by Simplex Method; Charnes’ Big-M Method; Duality Theory. Transportation Problems and Assignment Problems.
Unit 2: Network Analysis (9 hours)
Network Analysis:Shortest Path: Floyd Algorithm; Maximal Flow Problem (Ford-Fulkerson); PERTCPM (Cost Analysis, Crashing, Resource Allocation excluded). Inventory Control:Introduction to EOQ Models of Deterministic and Probabilistic; Safety Stock; Buffer Stock.
Unit 3: Game Theory (5 hours)
Game Theory: Introduction; 2-Person Zero-sum Game; Saddle Point; Mini-Max and Maxi-Min Theorems (statement only) and problems; Games without Saddle Point; Graphical Method; Principle of Dominance
Unit 4: Queuing Theory (5 hours)
Queuing Theory: Introduction; Basic Definitions and Notations; Axiomatic Derivation of the Arrival & Departure (Poisson Queue). Poisson Queue Models: (M/M/1): (∞ / FIFO) and (M/M/1: N / FIFO) and problems.
Source: official document