Principal components of decision problem – Modeling phases – LP Formulation and graphic solution – Resource allocation problems – Simplex method – Sensitivity analysis.
UNIT II DUALITY AND NETWORKS
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
Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming.
UNIT IV CLASSICAL OPTIMISATION THEORY
Unconstrained external problems, Newton – Ralphson method – Equality constraints – Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems.
UNIT V OBJECT SCHEDULING
Network diagram representation – Critical path method – Time charts and resource leveling – PERT.
IT Regulation 2008 1st 3rd 7th 7th Semester Notes - Click here
IT Regulation 2008 Question Papers - Click here
Anna University CSE 7th Semester notes