Resource Management Techniques

CS6704
CSE

Unit 1

LINEAR PROGRAMMING

Principal components of decision problem – Modeling phases – LP Formulation and graphic solution – Resource allocation problems – Simplex method – Sensitivity analysis. I

Part A (2m) Part B (16m)

Unit 2

DUALITY AND NETWORKS

Definition of dual problem – Primal – Dual relation ships – Dual simplex methods – Post optimality analysis – Transportation and assignment model - Shortest route problem. I

Part A (2m) Part B (16m)

Unit 3

INTEGER PROGRAMMING

Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming.

Part A (2m) Part B (16m)

Unit 4

CLASSICAL OPTIMISATION THEORY:

Unconstrained external problems, Newton – Ralphson method – Equality constraints – Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems. 75

Part A (2m) Part B (16m)

Unit 5

OBJECT SCHEDULING:

Network diagram representation – Critical path method – Time charts and resource leveling – PERT.

Part A (2m) Part B (16m)
Related Notes