Optimization (Dept Elec - II) (2181912)   Old Code : 172503

Syllabus

Sr. Topics Teaching Hours Module Weightage
1
Introduction to Optimization:
Classification of Optimization, Design vector and constraints, Constraint surface, Objective function, Classification of Optimization Problems.
3
5 %
2
Classical Optimization Techniques:
Single variable optimization, Multi-variable: Direct substitution method, Lagrange’s method of multipliers, Karush-Kuhn-Tucker conditions
9
20 %
3
Linear Programming:
Statement of an LP problem, Simplex method, Dual simplex method.
5
10 %
4
Non-linear Programming: One-dimensional minimization:
Unimodal function, Unrestricted search, Exhaustive search, Dichotomous search, Interval halving method, Fibonacci method, Golden section method, Direct root methods: Newton-Raphson and Quasi Newton methods.
9
25 %
5
Non-linear Programming: Unconstrained Optimization Techniques:
Direct Search Methods: Random search methods, Grid search method, Univariate method, Hookes and Jeeves’ method, Powell’s method
8
25 %
6
Modern Methods of Optimization:
Genetic algorithms, simulated annealing, fuzzy optimization, neural-networkbased methods
8
15 %