Course
PostgraduateSemester
ElectivesSubject Code
AE792Subject Title
Advanced Operations ResearchSyllabus
Introduction to Operations research – Formulation of optimization problems – Linear programming – Revised simplex method – Simplex method for bounded variables - – Karmarkar’s method - Dual-simplex method – Goal programming - Integer programming – Dantzig-Wolfe decomposition – Network optimization models– Travelling salesman problem and its extensions – Evolutionary algorithms.
Text Books
Same as Reference
References
1. A. Ravindran, D. T. Phillips and J. J. Solberg, Operations research: Principles and Practice, Wiley, 2nd edition, 2007.
2. H.A. Taha, Operations Research: An Introduction", Pearson, 10th edition, 2016.
3. F. S. Hillier, G. J. Lieberman, B. Nag and P. Basu, Introduction to Operations Research, 11th edition, 2021.
4. M. S. Bazaraa, J. J. Jarvis and H. D. Sherali, Linear programming and Network flows, Wiley, 4th Edition, 2010.
5. K. Deb, Optimization for Engineering Design: Algorithms and Examples, Prentice-Hall of India 2012.
Course Outcomes (COs):
CO1: Formulate operations, logistics and supply chain management problems.
CO2: Solve linear programming, integer programming, goal programming problems and the travelling salesman problem using appropriate techniques and optimization solvers, and analyze the results.
CO3: Model and solve real-world problems using network optimization and Dantzig-Wolfe decomposition methods.
CO4: Implement computer codes for mathematical and evolutionary algorithms to solve operations research problems and analyze the results.