Linear programming- methods- Simplex method – Big M method – Two phase method – Special cases - Goal programming.
Duality analysis-sensitivity analysis-changes in right- hand side constants of constraints- changes in objective function co-efficient-adding a new constraints-adding a new variable.
Dual simplex method- Cutting plane algorithm- Branch and Bound technique-Zero-one implicit enumeration algorithm - applications of dynamic programming – Cargo loading model – Work force size model – Equipment replacement model – Inventory model.
Shortest path model – Maximal flow problem - Crashing of project network – Resource leveling & Resource allocation technique.
Unconstrained nonlinear algorithms-Constrained algorithms- Separable programming -Quadratic programming-Geometric programming-Stochastic programming.
REFERENCES
Handy M. Taha, Operations Research, An introduction, 6th Prentice Hall of India, New Delhi,2001
Don. T. Philips, A.Ravindram and J. Soleberg, Operations Research, Principles & Practice, John Wiley & sons, 1992.
Panneerselvam ,R, "Operations Research”, Prentice – Hall of India, New Delhi,2002
