MA 9327 OPTIMIZATION TECHNIQUES SYLLABUS | ANNA UNIVERSITY MTECH MAIN FRAME TECHNOLOGY 1ST SEM SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY FIRST SEMESTER M.TECH MAIN FRAME TECHNOLOGY 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), 2009 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
MA 9327 OPTIMIZATION TECHNIQUES L T P C
3 1 0 4
UNIT I LINEAR PROGRAMMING (12)
Linear Programming: Graphical method, Simplex method, Revised simplex method,
Duality in Linear Programming (LP), Sensitivity analysis, other algorithms for solving
problems, Transportation, assignment and other applications.
UNIT II NON LINEAR PROGRAMMING (12)
Non Linear Programming: Unconstrained optimization techniques, Direct search
methods, Descent methods, constrained optimization.
UNIT III INTEGER PROGRAMMING (12)
Formulation of Integer Programming problems, Gomory’s cutting plane methods, Branch
and Bound Techniques.
UNIT IV DYNAMIC PROGRAMMING (12)
Characteristics of Dynamic Programming, Bellman’s principle of optimality, Concepts of
dynamic programming, tabular method of solution, Calculus method of solution.
UNIT V PERT/CPM (12)
Network Construction-computation of earliest start time, latest start time, Total, free and
independent float time-Crashing-Computation of optimistic, most likely Pessimistic and
expected time-Resource analysis in Network scheduling.
L – 45 T – 15 Total – 60
REFERENCES:
1. Taha, H.A., “Operations Research: An Introduction”, Pearson Education, New Delhi,
2002.
2. S.S. Rao, “Engineering Optimization: Theory and practice”, New Age International,
New Delhi, 2000.
3. Trivedi K.S., “Probability and Statistics with Reliability , Queuing and Computer
Applications”, Prentice Hall, New Delhi, 2003.
MA 9327 OPTIMIZATION TECHNIQUES L T P C
3 1 0 4
UNIT I LINEAR PROGRAMMING (12)
Linear Programming: Graphical method, Simplex method, Revised simplex method,
Duality in Linear Programming (LP), Sensitivity analysis, other algorithms for solving
problems, Transportation, assignment and other applications.
UNIT II NON LINEAR PROGRAMMING (12)
Non Linear Programming: Unconstrained optimization techniques, Direct search
methods, Descent methods, constrained optimization.
UNIT III INTEGER PROGRAMMING (12)
Formulation of Integer Programming problems, Gomory’s cutting plane methods, Branch
and Bound Techniques.
UNIT IV DYNAMIC PROGRAMMING (12)
Characteristics of Dynamic Programming, Bellman’s principle of optimality, Concepts of
dynamic programming, tabular method of solution, Calculus method of solution.
UNIT V PERT/CPM (12)
Network Construction-computation of earliest start time, latest start time, Total, free and
independent float time-Crashing-Computation of optimistic, most likely Pessimistic and
expected time-Resource analysis in Network scheduling.
L – 45 T – 15 Total – 60
REFERENCES:
1. Taha, H.A., “Operations Research: An Introduction”, Pearson Education, New Delhi,
2002.
2. S.S. Rao, “Engineering Optimization: Theory and practice”, New Age International,
New Delhi, 2000.
3. Trivedi K.S., “Probability and Statistics with Reliability , Queuing and Computer
Applications”, Prentice Hall, New Delhi, 2003.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...