RESOURCE MANAGEMENT TECHNIQUES

ANNA UNIVERSITY TIRUCHIRAPPALLI
Tiruchirappalli - 620 024 Regulations 2007
Syllabus B.E. COMPUTER SCIENCE AND ENGINEERING SEMESTER VIII
RESOURCE MANAGEMENT TECHNIQUES
(Common to CSE and IT)

UNIT I LINEAR PROGRAMMING 9
Principal components of decision problem − Modeling phases − LP formulation and graphic solution −
Resource allocation problems − Simplex method − Sensitivity analysis.

UNIT II DUALITY AND NETWORKS 9
Definition of dual problem − Primal − Dual relation ships − Dual simplex methods − Post optimality
analysis − Transportation and assignment model − Shortest route problem.

UNIT III INTEGER PROGRAMMING 9
Cutting plan algorithm − Branch and bound methods − Multistage (dynamic) programming.

UNIT IV CLASSICAL OPTIMISATION THEORY 9
Unconstrained external problems − Newton-Ralphson method − Equality constraints − Jacobean
methods − Lagrangian method − Kuhn-Tucker conditions − Simple problems.

UNIT V OBJECT SCHEDULING 9
Network diagram representation − Critical path method − Time charts and resource leveling − PERT.


Total: 45
TEXT BOOKS
1. Taha, H.A., “Operation Research”, PHI, 2002.
2. Anderson, “Quantitative Methods for Business”, 8th Edition, Thomson Learning, 2002.

REFERENCES
1. Winston, “Operation Research”, Thomson Learning, 2003.
2. Vohra, “Quantitative Techniques in Management” , TMH, 2002.
3. Anand Sarma, “Operation Research”, Himalaya Publishing House, 2003.

FEEL USEFUL PLEASE GIVE +1