Page 109 - Microsoft Word - B.Tech. Course Structure (R20) WITH 163 CREDITS

Constrained Optimization Techniques: Introduction, Characteristics of a Constrained
Problem, Direct Search Methods - Random Search Methods, Basic Approach in the Methods of
Feasible Directions, Rosen’s Gradient Projection Method, Generalized Reduced Gradient
Method and Sequential Quadratic Programming.

UNIT-V:Dynamic Programming
Dynamic programming multistage decision processes – types – concept of sub optimization and the
principle of optimality – computational procedure in dynamic programming – examples illustrating the
calculus method of solution - examples illustrating the tabular method of solution – Numerical
examples.

Textbooks:
1.S . S. Rao, “Engineering optimization”: Theory and practice 3rd edition, New Age
International (P) Limited, 1998.
2. H.S. Kasana& K.D. Kumar, “Introductory Operations Research Springer (India)”, 2004

Reference Books:
1.R Fletcher, “Practical Methods of Optimization” , 2 ndEdition, Wiley Publishers, 2000.
2. Jorge Nocedal and Wright S, “Numerical Optimization Springer”, 1st Edition, 1999.
3. by K.V. Mital and C. Mohan, “Optimization Methods in Operations Research and systems
Analysis” 3 rdEdition, New Age International (P) Limited, 1996.
4. by S.D. Sharma, “Operations Research”, Kedar Nath, 2012.
5. by H.A. Taha, “Operations Research”, 9 thEdition, An Introduction Pearson, 2010.
6. G. Hadley, “Linear Programming”, Narosa, 2002.

Mdv
Mdv