Network Analysis: Terminology of network, shortest route problem, minimal spanning tree problem, maxflow
Project Scheduling by PERT, CPM: Diagram, representation, critical path calculation, construction of time
chart and resource labeling, probability and cost consideration in project scheduling, project control.
Linear Programming: Simplex Method, Revised simplex method, Duality in Linear programming,
Application of Linear Programming to Economic and Industrial Problems.
Nonlinear Programming: The Kuhn-Tucker conditions, Quadratic programming, Convex programming.
Replacement Models: Introduction, Replacement policies for items whose efficiency deteriorates with time,
Replacement policies for items that fail completely.
Sequencing Model: Masters Degreeification of self problems, processing of n jobs through two machines, three
machines, processing of two jobs through m machines.