CS1001 RESOURCE MANAGEMENT TECHNIQUES

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING

CS1001 RESOURCE MANAGEMENT TECHNIQUES 3 0 0 100

1. LINEAR PROGRAMMING: 9
Principal components of decision problem – Modeling phases – LP Formulation and graphic solution – Resource allocation problems – Simplex method – Sensitivity analysis.
2. 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.
3. INTEGER PROGRAMMING: 9
Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming.
4. CLASSICAL OPTIMISATION THEORY: 9
Unconstrained external problems, Newton – Ralphson method – Equality constraints – Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems.
5. OBJECT SCHEDULING: 9
Network diagram representation – Critical path method – Time charts and resource leveling – PERT.
TOTAL = 45

REFERNECES:
1. Anderson ‘Quantitative Methods for Business’, 8th Edition, Thomson Learning, 2002.
2. Winston ‘Operation Research’, Thomson Learning, 2003.
3. H.A.Taha, ‘Operation Research’, Prentice Hall of India, 2002.
4. Vohra, ‘Quantitative Techniques in Management’, Tata McGraw Hill, 2002.
5. Anand Sarma, ‘Operation Research’, Himalaya Publishing House, 2003.

FEEL USEFUL PLEASE GIVE +1