LINEAR PROGRAMMING: Introduction – formulation of linear programming model-Graphical solution–solving LPP using simplex algorithm – Revised Simplex Method.

ADVANCES IN LP: Duality theory- Dual simplex method – Sensitivity analysis–-Transportation problems– Assignment problems-Travelling sales man problem -Data Envelopment Analysis.

NON LINEAR PROGRAMMING: Classification of Non Linear programming – Lagrange multiplier method – Karush – Kuhn Tucker conditions–Reduced gradient algorithms–Quadratic programming method – Penalty and Barrier method.

INTERIOR POINT METHODS: Karmarkar’s algorithm–Projection Scaling method–Dual affine algorithm–Primal affine algorithm Barrier algorithm.

DYNAMIC PROGRAMMING: Formulation of Multi stage decision problem–Characteristics–Concept of sub-optimization and the principle of optimality–Formulation of Dynamic programming–Backward and Forward recursion– Computational procedure–Conversion offinal value problem in to Initial value problem.