Syllabus

JNTUK B.Tech Power Advanced Optimization Techniques (Departmental Elective – IV) for R13 Batch.

JNTUK B.Tech Advanced Optimization Techniques gives you detail information of Advanced Optimization Techniques R13 syllabus It will be help full to understand you complete curriculum of the year.

Course objectives

To enable the students learn the latest non-linear optimization techniques such as classical optimization methods, dynamic programming, integer programming etc. Provide basic knowledge and enough competence to formulate the optimization problems.

UNIT I : INTRODUCTION TO OPTIMIZATION: Engineering applications of optimization- statement of an optimization problem- classification of optimization problem- optimization techniques.
CLASSICAL OPTIMIZATION TECHNIQUES: Single variable optimization- multivariable optimization with equality constraints- multivariable optimization with inequality constraints.

UNIT-II : UNCONSTRAINED OPTIMIZATION TECHNIQUES: pattern search method- rosenbrock’s method of rotating coordinates- the simplex method- descent methods- gradient of function- steepest descent method.

UNIT-III : CONSTRAINED OPTIMIZATION TECHNIQUES: characteristics of a constrained problem- methods of feasible directions – basic approach in the penalty function method- interior penalty function method- convex programming problem- exterior penalty function method.

UNIT-IV : GEOMETRIC PROGRAMMING (G.P): Solution of an unconstrained geometric programming, differential calculus method and arithmetic method. primal dual relationship and sufficiency conditions. Solution of a constrained geometric programming problem (G.P.P). Complimentary geometric programming (C.G.P).

UNIT-V : DYNAMIC PROGRAMMING (D.P): Multistage decision processes. concepts of sub optimization, computational procedure in dynamic programming calculus method and tabular methods. Linear programming as a case of D.P., Continuous D.P.

UNIT-VI : INTEGER PROGRAMMING (I.P): Graphical representation. Gomory’s cutting plane method. Bala’s algorithm for zero-one programming problem. Integer non linear programming.

TEXT BOOK

Optimization Theory and Applications, by S.S.Rao, Wiley Eastern Limited, New Delhi.

REFERENCES

  • Engineering Optimization By Kalyanmanai Deb, Prentice Hall of India, New Delhi.
  • Optimization Techniques, C.Mohan, Kusum Deep.
  • Operations Research by S.D.Sharma

Course Out comes

  • Students at the end of the course learn advanced optimization techniques to show real-life problems.
  • Students can able to formulate and solve various practical optimization problems in manufacturing and service organizations.

For more information about all JNTU updates please stay connected to us on FB and don’t hesitate to ask any questions in the comment.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

This site uses Akismet to reduce spam. Learn how your comment data is processed.