Trending: Anna University 8th Sem Results April 2014 May/June 2014 Time Table/ Internal Marks Calculate CGPA Online SSLC Results 2014 12th Result 2014

Test Footer 1

Wednesday, February 20, 2013

MF9258 OPTIMISATION TECHNIQUES IN ENGINEERING SYLLABUS | ANNA UNIVERSITY ME MANUFACTURING ENGINEERING ELECTIVES SYLLABUS REGULATION 2009 2011 2012-2013

Latest: TNEA 2014 Engineering Application Status, Counselling Date, Rank List
MF9258 OPTIMISATION TECHNIQUES IN ENGINEERING SYLLABUS | ANNA UNIVERSITY ME MANUFACTURING ENGINEERING ELECTIVES SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY M.E MANUFACTURING ENGINEERING DEPARTMENT ELECTIVES 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), 2009 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2010

MF9258 OPTIMISATION TECHNIQUES IN ENGINEERING L T P C
3 0 0 3
AIM:
To introduce the various optimization techniques and their advancements.
OBJECTIVES:
 To make use of the above techniques while modeling and solving the engineering
problems of different fields.
UNIT I INTRODUCTION 5
Optimization – Historical Development – Engineering applications of optimization –
Statement of an Optimization problem – classification of optimization problems.
UNIT II CLASSIC OPTIMIZATION TECHNIQUES 10
Linear programming - Graphical method – simplex method – dual simplex method –
revised simplex method – duality in LP – Parametric Linear programming – Goal
Programming.
UNIT III NON-LINEAR PROGRAMMING 9
Introduction – Lagrangeon Method – Kuhn-Tucker conditions – Quadratic programming
– Separable programming – Stochastic programming – Geometric programming
UNIT IV INTEGER PROGRAMMING AND DYNAMIC PROGRAMMING
AND NETWORK TECHNIQUES 12
Integer programming - Cutting plane algorithm, Branch and bound technique, Zero-one
implicit enumeration – Dynamic Programming – Formulation, Various applications using
Dynamic Programming. Network Techniques – Shortest Path Model – Minimum
Spanning Tree Problem – Maximal flow problem.
UNIT V ADVANCES IN SIMULATION 9
Genetic algorithms – simulated annealing – Neural Network and Fuzzy systems
TOTAL: 45 PERIODS
REFERENCES:
1. R. Panneerselvam, “Operations Research”, Prentice Hall of India Private Limited,
New Delhi 1 – 2005
2. P.K. Guptha and Man-Mohan, Problems in Operations Research – Sultan chand &
Sons, 1994
3. Ravindran, Philips and Solberg, Operations Research Principles and Practice, John
Wiley & Sons, Singapore, 1992
4. J.K.Sharma, Operations Research – Theory and Applications – Macmillan India Ltd.,
1997
5. Hamdy A. Taha, Operations Research – An Introduction, Prentice Hall of India, 1997

No comments:

Post a Comment

Any doubt ??? Just throw it Here...