AI-Powered Learning Platform

Subject Syllabus

AD-504 (C) - Operations Research

AIDS · Semester 5

Course Modules

Learn topic-wise with Hyper AI and revise using mapped PYQs.

Origin and development of OR Different phases of OR study Methodology of OR Scope and limitations of OR OR in decision making Linear programming: introduction Mathematical formulation of a problem Graphical solutions Standard form of the simplex method for maximization and minimization problems Interpretation of duality Dual simplex method

Transportation problem (TP) and its formulation Finding a basic feasible solution and optimal solution for the transportation problem Assignment problem and its formulation Hungarian method for solving the assignment problem Travelling salesman problem

PERT and CPM with known activity times Critical path analysis Various types of floats Probability considerations in PERT Updating of PERT charts Project crashing Formulation of CPM as a linear programming problem Resource levelling and resource scheduling

Introduction to the sequencing problem Flow shop problem: processing n jobs through 2, 3, and m machines General n/m job-shop problem Introduction to dynamic programming Dynamic programming approach for solving linear programming problems Applications of dynamic programming

Introduction to queuing theory Queuing systems and their characteristics Pure-birth and pure-death models Kendall and Lee's notation of queuing Empirical queuing models Numerical problems on M/M/1 and M/M/C queuing models