Course Details
Subject {L-T-P / C} : MA5222 : Operation Research { 3-0-0 / 3}
Subject Nature : Theory
Coordinator : Dr. Ankur Kanaujiya
Syllabus
Nonlinear programming problem: Kuhn-Tucker optimality conditions and convex programming, Kuhn-Tucker first order optimality conditions, Second order optimality conditions, Lagrange’s method, convex programming problem, sufficiency of Kuhn-Tucker conditions, Lagrangian saddle-point and duality, duality of convex programs - quadratic programming (Wolfe’s and Beale’s methods)
Network analysis: Preliminaries, min cost flow problem, max flow problem, CPM/PERT, scheduling and sequencing.
Queuing theory: Introduction, components of a queuing problem, classification of queues, steady, transient and explosive states of a queue, Roles of Poisson process and exponential distribution in queuing theory, Queuing models, (M/M/1:¥/FIFO) model, Distribution of waiting time and time spent by an unit in the system, (M/M/1:N/FIFO) model, (M/M/c:/FIFO) model, (M/M/c:N/FIFO) model, (M/Ek/1:/FIFO) model, (M/Ek/1:/FIFO) model, (M/Ek/1:1/FIFO) model, Examples of queuing models.
Course Objectives
- NA
Course Outcomes
NA
Essential Reading
- H. A. Taha, Operations Research: An Introduction, Pearson Education Limited, 2011
- N. S. Kambo, Mathematical Progamming Techniques, Affiliated East-West Press, 1984.
Supplementary Reading
- W. L.Winston, Operation Research, Thomson Learning EMEA, Limited, 1998
- S. Hillier and G. J. Lieberman,, Introduction to Operation Research, Tsinghua University Press, 2006.