IE3202 OPERATIONS RESEARCH – I SYLLABUS | ANNA UNIVERSITY BE INDUSTRIAL ENGINEERING 3RD SEMESTER SYLLABUS REGULATION 2008 2011-2012 BELOW IS THE ANNA UNIVERSITY THIRD SEMESTER BE INDUSTRIAL ENGINEERING DEPARTMENT SYLLABUS IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011-2012 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI,TIRUNELVELI,COIMBATORE), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
IE3202 OPERATIONS RESEARCH – I L T P C
3 1 0 4
OBJECTIVE:
To learn the basics of deterministic optimization tools
UNIT I LINEAR PROGRAMMING 10
Introduction - Formulation of linear programming models – Assumptions-Graphical
solution procedure – solving LPP using simplex algorithm – Degeneracy, Alternative
Optima, Unbounded identification- LP Applications- Data Envelopment Analysis-
Revised Simplex Method
UNIT II ADVANCES IN LPP - I 10
Duality theory - Interpretation of dual variables- Primal Dual Relationships – Role of
duality in sensitivity analysis - Dual simplex method – Graphical based and Simplex
based Sensitivity analysis –- Transportation problems, transportation simplex
method– Assignment problems, Hungarian method- LP formulation of transportation
and Assignment networks- Traveling sales man problem
UNIT III ADVANCES IN LPP - II 6
Integer Linear programming formulations, graphical solution of the LP relaxation,
Graphical solution to all integer problem, applications involving 0-1 variables,
introduction to cutting plane and branch & bound methods – Multi objective
optimization - Goal programming problem formulation.
UNIT IV NETWORK MODELS 12
Maximal flow problem – Shortest route problem – Minimal spanning tree problem -
Project networks, CPM, PERT, Crashing of networks, L P model for crashing –
project costing and control.
UNIT V DYNAMIC PROGRAMMING 7
Elements of dynamic programming – stage and state, characteristics of DP
problems, recursive relationship, Bellman’s principle of optimality – computational
procedure for shortest route problem, knapsack problem, production and inventory
control problem.
L: 45, T: 15, TOTAL : 60PERIODS
27
TEXT BOOKS
1. Hillier and Lieberman Introduction to Operations Research, TMH, 2000
2. R.Panneerselvam, Operations Research,PHI,2006
REFERENCES
1. Philips, Ravindran and Solberg, Operations Research, John Wiley,2002
2. Hamdy A Taha, Operations Research – An Introduction, Prentice Hall
India,2003
3. Ronald L Rardin, Optimisation in Operations Research, Pearson, 2003
4. David R. Anderson, et al , An Introduction to Management Science –
Quantitative approaches to Decision Making, Thomson,2003
IE3202 OPERATIONS RESEARCH – I L T P C
3 1 0 4
OBJECTIVE:
To learn the basics of deterministic optimization tools
UNIT I LINEAR PROGRAMMING 10
Introduction - Formulation of linear programming models – Assumptions-Graphical
solution procedure – solving LPP using simplex algorithm – Degeneracy, Alternative
Optima, Unbounded identification- LP Applications- Data Envelopment Analysis-
Revised Simplex Method
UNIT II ADVANCES IN LPP - I 10
Duality theory - Interpretation of dual variables- Primal Dual Relationships – Role of
duality in sensitivity analysis - Dual simplex method – Graphical based and Simplex
based Sensitivity analysis –- Transportation problems, transportation simplex
method– Assignment problems, Hungarian method- LP formulation of transportation
and Assignment networks- Traveling sales man problem
UNIT III ADVANCES IN LPP - II 6
Integer Linear programming formulations, graphical solution of the LP relaxation,
Graphical solution to all integer problem, applications involving 0-1 variables,
introduction to cutting plane and branch & bound methods – Multi objective
optimization - Goal programming problem formulation.
UNIT IV NETWORK MODELS 12
Maximal flow problem – Shortest route problem – Minimal spanning tree problem -
Project networks, CPM, PERT, Crashing of networks, L P model for crashing –
project costing and control.
UNIT V DYNAMIC PROGRAMMING 7
Elements of dynamic programming – stage and state, characteristics of DP
problems, recursive relationship, Bellman’s principle of optimality – computational
procedure for shortest route problem, knapsack problem, production and inventory
control problem.
L: 45, T: 15, TOTAL : 60PERIODS
27
TEXT BOOKS
1. Hillier and Lieberman Introduction to Operations Research, TMH, 2000
2. R.Panneerselvam, Operations Research,PHI,2006
REFERENCES
1. Philips, Ravindran and Solberg, Operations Research, John Wiley,2002
2. Hamdy A Taha, Operations Research – An Introduction, Prentice Hall
India,2003
3. Ronald L Rardin, Optimisation in Operations Research, Pearson, 2003
4. David R. Anderson, et al , An Introduction to Management Science –
Quantitative approaches to Decision Making, Thomson,2003
No comments:
Post a Comment
Any doubt ??? Just throw it Here...