6-12418M Tech ECE Scheme and Syllabus Final
6-12418M Tech ECE Scheme and Syllabus Final
OPEN ELECTIVE
(Operations Research) 3 3 0 0 40 60
Course Outcomes: At the end of the course, the student should be able to
1. Students should able to apply the dynamic programming to solve problems of discreet and
continuous variables.
2. Students should able to apply the concept of non-linear programming
3. Students should able to carry out sensitivity analysis
4. Student should able to model the real world problem and simulate it.
Syllabus Contents:
Unit 1: Optimization Techniques, Model Formulation, models, General L.R Formulation,
Simplex Techniques, Sensitivity Analysis, Inventory Control Models
Unit 2: Formulation of a LPP - Graphical solution revised simplex method - duality theory -
dual simplex method - sensitivity analysis - parametric programming
Unit 3: Nonlinear programming problem - Kuhn-Tucker conditions min cost flow problem -
max flow problem - CPM/PERT
Unit 4: Scheduling and sequencing - single server and multiple server models - deterministic
inventory models - Probabilistic inventory control models - Geometric Programming.
Unit 5: Competitive Models, Single and Multi-channel Problems, Sequencing Models,
Dynamic Programming, Flow in Networks, Elementary Graph Theory, Game Theory
Simulation
References:
1. H.A. Taha, Operations Research, An Introduction, PHI, 2008
2. H.M. Wagner, Principles of Operations Research, PHI, Delhi, 1982.
3. J.C. Pant, Introduction to Optimisation: Operations Research, Jain Brothers, Delhi, 2008
4. Hitler Libermann Operations Research: McGraw Hill Pub. 2009
5. Pannerselvam, Operations Research: Prentice Hall of India 2010
6. Harvey M Wagner, Principles of Operations Research: Prentice Hall of India 2010