ADVANCED OPERATIONS RESEARCH-II (Optional Paper)
- Understand the basic concepts of non-linear programming problems.
- Understand the quadratic programming problems, Geometric programming problems, Replacement problems, Dynamic programming problems, network analysis problems.
Course Outcomes (COs):
|
Course |
Learning outcomes (at course level) |
Learning and teaching strategies |
Assessment Strategies |
|
|---|---|---|---|---|
|
Paper Code |
Paper Title |
|||
|
MAT 423A
|
Advanced Operations Research-II (Theory)
|
The students will be able to –
CO123: Understand and Solve Replacement problems. CO124: To derive the necessary conditions (KT conditions) for constrained nonlinear optimization problems and able to solve quadratic programming problems. CO125: Derive methods to solve separable, geometric programming problems. CO126: Discuss various methods to solve linear fractional programming problems and dynamic programming problems. CO127: Explain problems related to sequencing and PERT-CPM to solve network analysis problems. |
Approach in teaching: Interactive Lectures, Discussion, Power Point Presentations, Informative videos Learning activities for the students: Self learning assignments, Effective questions, presentations, Field trips |
Quiz, Poster Presentations, Power Point Presentations, Individual and group projects, Open Book Test, Semester End Examination
|
Replacement models:Gradual failure, Sudden failure, Replacement due to efficiency deteriorates with time, Staffing problems, Equipment renewal problems.
Nonlinear Programming: Formulation and graphical method for unconstrained problem of maxima and minima, Constrained problem of maxima and minimaLagrangian method, Khun-Tucker condition, Quadratic programming: Wolf and Beals method.
Separable programming: Definition, Reduction to separable programming problem to LPP, Separable programming algorithm, Geometric programming: Formulation and solution of GPP (Unconstraint type and with quality constraint).
Linear fractional programming: Definition, Linear fractional algorithm, Computational procedure of fractional algorithm, Dynamic programming : Introduction, Bellman principle of optimality model –I, II and III, Solution of LPP by dynamic programming.
Network Scheduling by PERT-CPM, Network logical sequencing, Concurrent activities, Critical path analysis, Probability consideration in PERT, Distinction between PERT and CPM.
- S. D. Sharma, Operations Research, Kedar Nath Ram Nath and Co. 1992.
- Kanti Swarup, P.K.Gupta and Manmohan, Operations Research, S. Chand and Company Ltd, New Delhi, 2007.
- Hamady A. Taha, Operations Research an Introduction, Prentice Hall.2007.
- B.S. Goel and S.K. Mittal, Operation Research, Pragati Prakashan, 2014.
- S. I. Gass, Linear Programming, McGraw Hill Book Co.1958.
- F.S. Hiller and G.J. Lieberman, Introduction to Operations Research, Addison Wesley, 2011.
- R.S. Garfinkel and G.L. Nemhauser, Integer Programming, Wiley, New York, 1972.
- G. Hadley, Linear programming, Oxford and IBH Publishing, New Delhi, 1962.
- P.K. Gupta and D.S. Hira, Problem in Operation Research, S. Chand and Co. New Delhi, 2010.
