ADVANCED OPERATIONS RESEARCH-II (Optional Paper)

Paper Code: 
MAT423A
Credits: 
5
Contact Hours: 
75.00
Max. Marks: 
100.00
15.00

Replacement models: Gradual failure, Sudden failure, Replacement due to efficiency deteriorate with time, Staffing problems, Equipment renewal problems.

15.00

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.

15.00

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).

15.00

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.

15.00

Network Scheduling by PERT-CPM, Network logical sequencing, Concurrent activities, Critical path analysis, Probability consideration in PERT, Distinction between PERT and CPM.

Essential Readings: 

1. S. D. Sharma, Operations Research, Kedar Nath Ram Nath and Co. 1992.
2. Kanti Swarup, P.K. Gupta, Manmohan, Operations Research, S. Chand and Company Ltd, New Delhi, 2007.
3. Hamady A. Taha, Operations Research an Introduction, Prentice Hall.2007.
4. B.S. Goel, S.K. Mittal, Operation Research, Pragati Prakashan, 2014.

References: 

1. S. I. Gass, Linear Programming, McGraw Hill Book Co.1958.
2. F.S.Hiller, G.J. Lieberman, Introduction to Operations Research, Addison Wesley, 2011.
3. R.S. Garfinkel and G.L. Nemhauser, Integer Programming, Wiley, New York, 1972.
4. G. Hadley, Linear programming, Oxford and IBH Publishing, New Delhi, 1962.
5. P.K. Gupta, D.S. Hira, Problem in Operation Research, S. Chand and Co. New Delhi, 2010.

(Note: Non-Programmable scientific calculator up to 100 MS is permitted)

Academic Year: