6
Page views
0
Files
0
Videos
0
R.Links

Icon
Syllabus

UNIT
1
LINEAR PROGRAMMING

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

UNIT
2
DUALITY AND NETWORKS

Definition of dual problem – Primal – Dual relationships – Dual simplex methods – Post optimality analysis – Transportation and assignment model - Shortest route problem

UNIT
3
INTEGER PROGRAMMING

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

UNIT
4
CLASSICAL OPTIMISATION THEORY

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

UNIT
5
OBJECT SCHEDULING

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

Reference Book:

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.

Text Book:

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

 

Print    Download