Subject Code: MA6L002  Name: Advanced Techniques in Operation Research  LTP: 310  Credit: 4 

Prerequisite: None  
One variable unconstrained optimization, multivariable unconstrained optimisation, KarushKuhnTucker (KKT) conditions for constrained optimization, quadratic programming, separable programming, convex and non convex programming, steepest and QuasiNewton method. Dynamic Programming: Characteristics of dynamic problems, deterministic dynamic programming and probabilitistic dynamic programming, Network analysis, Shortest path problems, minimum spanning tree problem, maximum flow problem, minimum cost flow problem, network simplex, interior point methods, stochastic programming, Nonlinear goal programming applications, Geometric Programming. Multiobjective Optimization Problems: Linear and non linear programming problems, Weighting and Epsilon method, Pnorm methods, Gradient Projection Method, STEM method, Convex Optimization. Text Book:
