CS6704 RESOURCE MANAGEMENT TECHNIQUES syllabus-subject-notes-pevious-year-questions-papers-bank

CS6704 RESOURCE MANAGEMENT TECHNIQUES syllabus-subject-notes-pevious-year-questions-papers-bank

OBJECTIVES:
The student should be made to:
 Be familiar with resource management techniques.
 Learn to solve problems in linear programming and Integer programming.
 Be exposed to CPM and PERT.

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.

OUTCOMES:
Upon Completion of the course, the students should be able to:
 Solve optimization problems using simplex method.
 Apply integer programming and linear programming to solve real-life applications.
 Use PERT and CPM for problems in project management

TEXT BOOK:
1. H.A. Taha, “Operation Research”, Prentice Hall of India, 2002.

REFERENCES:
1. Paneer Selvam, ‘Operations Research’, Prentice Hall of India, 2002
2. Anderson ‘Quantitative Methods for Business’, 8th Edition, Thomson Learning, 2002.
3. Winston ‘Operation Research’, Thomson Learning, 2003.
4. Vohra, ‘Quantitative Techniques in Management’, Tata Mc Graw Hill, 2002.
5. Anand Sarma, ‘Operation Research’, Himalaya Publishing House, 2003.