Syllabus

Optimization: Need for unconstrained methods in solving constrained problems, Necessary conditions of unconstrained optimization, Structure methods, Quadratic models, Methods of line search, Steepest descent method, Quasi-Newton methods: DFP, BFGS, Conjugate-direction methods:, Methods for sums of squares and nonlinear equations ,Linear Programming: Simplex Methods, Duality ii LPP, Transportation problem, Nonlinear programming: Lagrange Multiplier, KKT conditions, Convex programming.