684
Page views
5
Files
0
Videos
0
R.Links

Icon
Syllabus

UNIT
1
Linear Programming Problem

Linear Programming - Formulation - Graphical method and Simplex Method-Formation of Primal and Dual.

UNIT
2
Transportation Problems and Assignment Problems

Transportation Problems: NWC - LCM - VAM - Starting Solution - MODI method - Optimal solution – balanced and unbalanced Transportation problems (non degeneracy case only) - Assignment problems: Solving balanced and unbalanced assignment problems using Hungarian method.

UNIT
3
Queuing Theory

Queuing Theory - definitions of Waiting Line Model- Queue Discipline - traffic intensity -Poisson Arrival - Birth Death Process - Problems from Single Server - Finite and infinite Population Model

UNIT
4
CPM and PERT

CPM - Principles - Construction of Network for projects - Types of Floats PERT - Time scale analysis - critical path - probability of completion of project.

UNIT
5
Simulation

Simulation: Examples, advantages- limitations - Monte - Carlo simulation - Generation of random numbers - steps in simulation - uses of simulation - Simulation applied to queuing problems - simulation applied to some other types of problems.

Reference Book:

1. Operations ResearchbyKantiSwarup, Gupta R.K, Manmohan, S .Chand & Sons Education Publications, New Delhi, 16th Edition. 2012, Reprint 2013. 2. Tracts in Operations ResearchbyKantiSwarup, P.K. Gupta, Manmohan, S.Chand& Sons Education Publications, New Delhi, 11th Edition. 2003,Reprint 2003.

Text Book:

Text Book: “Recourse Management Techniques” by Prof.V.Sundaresan, K.S.Ganapathy Subramanian and K.Ganesan, .A.R. Publications, March 2011. Unit I: Chapter 2: Sections: 2.1, 2.3, 2.5, 2.6. Chapter3: Sections: 3.1.3, 3.1.4. Unit II: Chapter 7: Sections: 7.1 – 7.4, Chapter 8: Sections: 8.1 – 8.6. Unit III: Chapter13: Sections: 13.1 to 13.3, 13.5, 13.6and 13.8. Unit IV: Chapter 15: Sections: 15.1 to 15.7. Unit IV: Chapter 17: Sections: 17.1 to 17.7.

 

Print    Download