Operations Research |
UNIT I |
Linear Programming - Formulation - Graphical solution (2 variables
only) of LPP - Development of simplex method - Artificial variable Techniques
- Big - M method - Two phase method - Revised simplex method |
UNIT II |
Duality in Linear Programming and its formulation - Dual simplex
method - Bounded variables method - Applications of LPP - Transportation
problem - Assignment Problem - Traveling Salesman Problem. |
UNIT III |
Integer Programming Problem (IPP) - cutting plane Algorithm - Branch
and Method of solving IPP - Dynamic programming problem and its
characteristics - Deterministic Dynamic programming problem |
UNIT IV |
Sequencing problem - processing n jobs through two machines and
three machines - processing n jobs through m machines - processing 2 jobs
through m machines - project scheduling by PERT/CPM - Difference between
PERT and CPM - Constructing the network - critical path analysis - Float of an
Activity - Three time Estimated for PERT - Project cost by CPM |
UNIT V |
Stochastic processes - Classification of stochastic processes - Discrete
parameter Markov chains - continuous parameter Markov chains - Birth and
death processes - Queuing models and its characteristics - classification of
Queuing models - (M/M/1) : (FCFS) (Birth and death model) |
Text Books |
(i) Taha, H.A, 1995, Operations Research, 3rd Edition, Prentice Hall of India, New
Delhi.
(ii) Trivedi K.S, 1994, Probability and Statistics with Reliability, Queuing and
Computer Science Applications, Prentice Hall of India, New Delhi. |
Reference Books |
(i) Sharma J.K, 1989, Mathematical Models in Operations Research, Tata McGraw
Hill, New Delhi. |
Website, E-learning resources |
(i) http://www.imageprocesssingplace.com/DIP/dip-downloads |