720*90

Custom Search

S7 - OPTIMIZATION TECHNIQUES (ELECTIVE – I)

MG University S7 computer Science and Engineering B.Tech Syllabus 
Module1: Classical optimization techniques
Single variable optimization – Multivariable optimization with no constraints – Hessian matrix – Multivariable saddle point – Optimization with equality constraints – Lagrange multiplier method- Multivariable optimization with inequality constrains – Kuhn-Tucker conditions.
Module 2: One-dimensional unconstrained minimization
Elimination metods – unrestricted search method – Fibonacci method – Interpolation methods – Quadratic interpolation and cubic interpolation metods.
Module 3 Unsonstrained minimization
Gradient of function – Steepest descent method – Newton’s method – Powells method – Hooke and Jeeve’s method.
Module 4 Interger – Linear programming problem
Gomory’s cutting plane method – Gomery’s method for all integer programming problems, mixed integer programming problems
Module 5 Network Technique
Shortest path model – Dijkstra’s Algorithm Floyd’s Algorithm – minimum spanning tree problem – PRIM algorithm – Maximal Flow Problem algorithm
References
Optimization theory and application – S.S. Rao, New Age International P. Ltd.
Optimization Concepts and applications in Engineering – A. D. Belegundu, T.R. Chandrupatla, Pearson Education Asia.
Principles of Operations Research for Management – F. S. Budnick, D. McLeavey, R. Mojena, Richard D. Irwin, INC.
Operation Research an introduction – H. A. Taha, Eastern Economy Edition.
Operation Research – R. Pannerselvam, PHI