CS1001 Resource Management Techniques Syllabus

CS1001            RESOURCE MANAGEMENT TECHNIQUES                     3 0 0 100


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
   

  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.

Previous
Next Post »

If you still didn't find what you're looking for, you can search this website below: