|
|
511112 Optimization Techniques - Elective IV
Teaching Scheme Examination Scheme
Lectures: 3 hrs/week Theory: 100 Marks
Duration: 3 hours
Credits - 3
1. Introduction to optimization
Engineering Applications, statement of an optimization problem, classification. Introduction
to optimization techniques.
2. Single variable optimization
Fabbonci search methods, golden section search methods, gradient based methods, Newton-
Raphson method, secant method.
3. Multi-variable optimization
Direct search methods: Evolutionary optimization method, Powell’s conjugate direction
method.
Gradient based methods: Steepest descent method, Newton’s method.
4. Constrained optimization
Constraint handling methods, method of feasible directions, generalized reduced gradient
method, gradient projection method.
5. Specialized algorithms: Integer programming, geometric programming.
6. Non-Traditional Optimization Algorithms
Genetic algorithms (GA) - working principle, Differences and Similarities between GA’s and
traditional methods, GA’s for constrained optimization. Simulated Annealing (SA) approach
– introduction only.
References
1. Rao S S “Optimization”, Wiley Eastern, New Delhi, 1995.
2. Kalyanamoy Deb, “Optimization for engineering design”, Prentice Hall of India, New Delhi,
2000.
3. Ravindran, Phillips and Solberg, “Operations Research: Principles and Practice”, John Wiley
& Sons (Asia), Pvt. Ltd.
4. H. S. Kasana and K. D. Kumar, “Introductory Operations Research: Theory and
Applications”, Springer International Edition.
5. Belegundu, “Optimization Concepts and Applications in Engineering”, Wiley Students
Edition.
6. Deb, “Multi Objective Optimization Using Evolutionary Algorithms”, Wiley Students
Edition.
7. Fletcher, “Practical Methods of Optimization”, Wiley Students Edition.
For more details, visit http://www.unipune.ernet.in/stud_info/Syllabi/Syllabus_2008.html
|
No responses found. Be the first to respond and make money from revenue sharing program.
|