Analytical method necessary and sufficient conditions for optimum in single and multi-variable unconstrained and constrained problems
Unconstrained one dimensional search, Newton, Quasi-Newton and Secant method for Uni-dimensional search, region elimination methods (Golden Section, Fibonacci, Dichotomus etc)
Linear Programming, Graphical simplex method, revised simplex method, duality and transportation problems
Unconstrained multi-variable search, Direct methods, Indirect method, Finite difference approximation
Dynamic Programming, Principle of optimality, Discrete and continuous dynamic programming
- Teacher: Abhishek Chandra