EE2030 OPERATIONS RESEARCH SYLLABUS | ANNA UNIVERSITY BE EEE 8TH SEMESTER SYLLABUS REGULATION 2008 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY 8TH SEMESTER B.E ELECTRICAL AND ELECTRONICS ENGINEERING DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI, TIRUNELVELI,COIMBATORE), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
EE2030 OPERATIONS RESEARCH L T P C
3 0 0 3 AIM:
To introduce the Linear Programming methods, Algorithms, LC PM and PERT.
OBJECTIVES:
To study various LP methods.
To study Algorithms methods.
To study case studies using CPM and PERT
UNIT I INTRODUCTION 9
Role of Operations Research - Operations Research Models and techniques. LP model and
technique – formulation and graphical Solution – graphical sensitivity Analysis. The Simplex
Algorithm – the two phase method – degeneracy – alterative optima – unbounded and/or Infeasible
Solution – redundancies.
UNIT II PROBLEM FORMULATION 9
Definitions of the Dual Problem – Primal-dual Relationship – Economic Interpretation of Duality –
Dual Simplex Method – Primal Dual Computation – Post Optimal or Sensitivity Analysis – Changes
Affecting Feasibility – Changes Affecting Optimality – Revised Simplex Method – LP Packages.
UNIT III ALGORITHMS AND MODELS 9
Definition of Transportation Model – The Transportation Algorithm – Determination of the Starting
Solution – Iterative Computations of an Algorithm – The Assignment Model – The Hungarian Method
– The Transshipment Model – Inter Programming Problem – Cutting Plane Algorithm.
UNIT IV NETWORK SOLUTIONS 9
Scope of Network Applications – Network Solution – Minimal Spanning Tree Algorithm – Shortest
Route Problem – Examples – Shortest Route Algorithm – Maximal Flow Model – Minimal cost
Capacitated Flow Problems.
UNIT V CASE STUDIES USING CPM AND PERT 9
Network Diagram Representation – Critical Path Method – Time Estimates – Crashing – Time Charts
– PERT and CPM for Project Scheduling – Resource Planning - Case Studies.
TOTAL : 45 PERIODS
103
TEXT BOOKS
1. Hamdy A. Taha, ”Operation Research – An Introduction“ ,7th Edition Person Education / Prentice
Hall of India Edition, Asia, 2002. (For All Chapters 1, 2, 3, 4 and 5)
REFERENCES
1. Ronald. L. Rardin ,”Optimization in Operation Research”, Pearson Education, Asia, 2002.
2. JIT.S Chandran, Mahendran P.Kawatra Ki Ho Kim ,”Essential of Linear Programming”, Vikas
Publishing House Pvt. Ltd., New Delhi, 1994.
3. Hiller F.S, Liberman G.J ,”Introduction to Operation Research”, 7th Edition, McGraw Hill, 2001.
(For all Chapters 1, 2, 3, 4 and 5)
4. R.Panneer Selvam ,”Operations Research”, Prentice Hall of India, 2002. (For All Chapters).
5. P.C.Tulsin,”Quantitative Technique : Theory and Problem”, Pearson Education, 2002.
6. Ravindran, Phillips, Solberg ,”Operation Research Principles and Practice”, Second Edition,
John Wiley, 1987
7. Srinivasn, “Operations Research: Principles and applications”, Prentice Hall of India, 2007 New
Edition, (For All Chapters)
EE2030 OPERATIONS RESEARCH L T P C
3 0 0 3 AIM:
To introduce the Linear Programming methods, Algorithms, LC PM and PERT.
OBJECTIVES:
To study various LP methods.
To study Algorithms methods.
To study case studies using CPM and PERT
UNIT I INTRODUCTION 9
Role of Operations Research - Operations Research Models and techniques. LP model and
technique – formulation and graphical Solution – graphical sensitivity Analysis. The Simplex
Algorithm – the two phase method – degeneracy – alterative optima – unbounded and/or Infeasible
Solution – redundancies.
UNIT II PROBLEM FORMULATION 9
Definitions of the Dual Problem – Primal-dual Relationship – Economic Interpretation of Duality –
Dual Simplex Method – Primal Dual Computation – Post Optimal or Sensitivity Analysis – Changes
Affecting Feasibility – Changes Affecting Optimality – Revised Simplex Method – LP Packages.
UNIT III ALGORITHMS AND MODELS 9
Definition of Transportation Model – The Transportation Algorithm – Determination of the Starting
Solution – Iterative Computations of an Algorithm – The Assignment Model – The Hungarian Method
– The Transshipment Model – Inter Programming Problem – Cutting Plane Algorithm.
UNIT IV NETWORK SOLUTIONS 9
Scope of Network Applications – Network Solution – Minimal Spanning Tree Algorithm – Shortest
Route Problem – Examples – Shortest Route Algorithm – Maximal Flow Model – Minimal cost
Capacitated Flow Problems.
UNIT V CASE STUDIES USING CPM AND PERT 9
Network Diagram Representation – Critical Path Method – Time Estimates – Crashing – Time Charts
– PERT and CPM for Project Scheduling – Resource Planning - Case Studies.
TOTAL : 45 PERIODS
103
TEXT BOOKS
1. Hamdy A. Taha, ”Operation Research – An Introduction“ ,7th Edition Person Education / Prentice
Hall of India Edition, Asia, 2002. (For All Chapters 1, 2, 3, 4 and 5)
REFERENCES
1. Ronald. L. Rardin ,”Optimization in Operation Research”, Pearson Education, Asia, 2002.
2. JIT.S Chandran, Mahendran P.Kawatra Ki Ho Kim ,”Essential of Linear Programming”, Vikas
Publishing House Pvt. Ltd., New Delhi, 1994.
3. Hiller F.S, Liberman G.J ,”Introduction to Operation Research”, 7th Edition, McGraw Hill, 2001.
(For all Chapters 1, 2, 3, 4 and 5)
4. R.Panneer Selvam ,”Operations Research”, Prentice Hall of India, 2002. (For All Chapters).
5. P.C.Tulsin,”Quantitative Technique : Theory and Problem”, Pearson Education, 2002.
6. Ravindran, Phillips, Solberg ,”Operation Research Principles and Practice”, Second Edition,
John Wiley, 1987
7. Srinivasn, “Operations Research: Principles and applications”, Prentice Hall of India, 2007 New
Edition, (For All Chapters)
No comments:
Post a Comment
Any doubt ??? Just throw it Here...