603
Page views
6
Files
0
Videos
0
R.Links

Icon
Syllabus

UNIT
1
Linear Programming Problems

Linear Programming Problems Graphical method - Simplex method, Big-M Method.

UNIT
2
Transportation Problems, Assignment problems

Balanced, Unbalanced Transportation Problems – Initial Solutions – NWCR, LCM, VAM method –MODI METHOD. Solving Balanced, Unbalanced assignment Problems using Hungarian method Problem.

UNIT
3
Game Theory

Game Theory - Concept of Pure and Mixed Strategies – Solving 2 x 2 matrix with and without saddle point - n x 2 - 2 x m games – solving by Graphical method.

UNIT
4
Network Representation

CPM – Basic definitions – Event - activity - Network representation - Forward pass - backward pass computation. Computation of Types of floats, Critical Path. PERT Network – Introduction – time estimates – Probability factor – Problems in PERT.

UNIT
5
Queuing Theory

Queuing Theory – definition, characteristics of queuing theory –classification of Queuing System- Queuing models-(M/M/I):(∞/FIFO); (M/M/C):(∞/FIFO) .

Reference Book:

Reference books: 1. Resource Management Techniques by Prof. V. Sundaresan, K.S. Ganapathy Subramanian, K. Ganesan, A.R. Publications Chennai, 4th Edition 2007. 2. Problems In Operations Research by P.K. Gupta, D.S. Hira, S. Chand Publications, 2001.

Text Book:

Text book: Operations Research by Manmohan, P.K. Gupta, Kanthiswarup, S. CHAND &SONS – 16th edition 2012, reprint 2013. Unit I: Chapter 3: Sections: 3.1-3.5, Chapter 4: Section: 4.3, 4.4. Unit II: Chapter 10: Sections: 10.1, 10.2, 10.4 to 10.6, 10.7 to 10.10, 10.13, 10.15, Chapter 11: Sections: 11.1 to 11.4. Unit III: Chapter17: Sections: 17.1-17.6. Unit IV: Chapter 25: Sections: 25.1-25.7. Unit V: Chapter 21: Sections: 21.1-21.9 (Model 1 & Model 5).

 

Print    Download