Linear Programming: Simplex method and extensions. Network models: Shortest path, maximum flow and minimum cost problems. Dynamic programming: resource allocation, production scheduling and equipment replacement problem. Non-linear programming: selected unconstrained and constrained non-linear programming algorithms like quasi Newton, reduced gradient and gradient projection methods. Penalty function methods, Quadratic programming.