Coming soon
Advanced Operation Research
This course is meant for exposing the students to the mathematical details of the techniques for obtaining optimum solutions under constraints for desired output. They will be taught numerical methods of optimization, linear programming techniques and multiple objective programming. Students will also be exposed to practical applications of these techniques.
Unit I
Integer linear programming: Gomory’scutting plane method for all integer and mixed integer, Branch and bound algorithm. Dynamic demand models (IVand V), Deterministic model with price break: one, two and any price break.
Unit II
Replacement and Reliability models: Gradual failure, sudden failure, Replacement due to efficiency deteriorate with time, Staffing problems, Equipment renewal problems.
Unit III
PERT and CPM: basic concepts, probability of projection completion, travelling salesman problem, replacement problems- block and age replacement policies. Network Scheduling by PERT-CPM, Network logical sequencing, Concurrent activities, Critical path analysis, Probability consideration in PERT, Distinction between PERT and CPM.
Unit IV
Nonlinear Programming: Formulation and graphical method for unconstrained problem of maxima and minima, constrained problem of maxima and minima Lagrangian method, Khun Tucker condition. Quadratic programming: Wolf and Beals method.
Unit V
Revised simplex method: Standard form I and II, Computational procedure, Bounded variable problems in linear programming, Dual simplex method.
- Soeren Asmussen(2003). Applied Probability and Queues (Stochastic Modeling and Applied Probability), Springer.
- S. D. Sharma(1992). Operations Research, Kedar Nath Ram Nath and Co.
- Kanti Swarup, P.K.Gupta and Manmohan(2007). Operations Research, S. Chand and Company Ltd, New Delhi, Reprint.
- Hamady A. Taha(2007). Operations Research: An Introduction, Prentice Hall.
