Operations Research

Paper III : Operations Research 

UNIT – I

General linear programming problems and their formulations. Method for solving LPP :
Graphical Method, Simplex method, Big – M method, Two phase Method Duality in LPP
Transportation problem: North-west corner rule, Least cost method, Vogel’s approximation
method. Optimum solution : Stepping stone method, Method of Multipliers. Assignment
Problem : Hungarian Algorithm.

UNIT – II

Queueing Models – M/M/1, M/M/C models waiting time distribution for M/M/1, Little’s
formulae. M/G/1 Queueing system, cost profit models in queueing theory.

UNIT – III

Network Analysis : Minimal Spanning Tree, Model Shortest-route problems, Maximal Flow
Model.
Project Management : PERT/CPM determination of floats construction of time chart and
resources labelling.

UNIT – IV

Inventory Models : FOQ models, Non-zero, land time, EOQ with shortages allowed.
Dynamic Programming : Bellman’s optimality principle. Applications. Job sequencing : n
jobs – machines, n jobs – K machines, 2 jobs – n machines.
REFERENCES :
1. Swarup Kanti, Gupta P.K. and Man Mohan  : Operations Research, Sultan Chand & Sons.
2. Taha, H.A. : Operations Research, Mac Millan  publishing.