Syllabus

JNTUK B. Tech Engineering Optimization for R13 Batch.

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

Course Objectives

Introduce methods of optimization to engineering students, including linear programming, network flow algorithms, integer programming, interior point methods, quadratic programming, nonlinear programming, and heuristic methods.Numerous applications are presented in civil, environmental, electrical (control) engineering, and industrial engineering. The goal is to maintain a balance between theory, numerical computation, and problem setup for solution by optimization software, and applications to engineering systems.

UNIT-I : Introduction to Optimization: Statement of an Optimization Problem-Classification of Optimization Problems-Local and Global Optima
Classical Optimization Techniques: Single Variable Optimization-Multivariable Optimization with Equality Constraints- Direct Substitution-Method of Constrained Variation- Method of Lagrange Multipliers.

UNIT-II : Linear Programming: Applications of Linear Programming-Standard form of a Linear Programming Problem-Solution by graphical method- Simplex Method; Two phase and Big M methods-Revised simplex method- Duality in Linear Programming.

UNIT-III : Transportation and Assignment Problems:Transportation Problem- North west corner method-Vogel’s approximation method- MOD method-Assignment problems.

UNIT-IV : Non-Linear Programming-Unconstrained Optimization Techniques: Classification of Unconstrained Minimization-Powell’s M-Steepest Dscent Method- Conjugate Gradient Method- Marquardt Method,Davidon-Fletcher-Powell Method, Broyden-Fletcher-Goldfarb-Shanno Method
Non-Linear Programming -Constrained Optimization Techniques: Characteristics of a Constrained Problem-Rosen’s Gradient Projection Method- Penalty Function Method.

UNIT-V : Integer Programming: Graphical Representation-Cutting Plane Method-Branch and Bound Method.

UNIT-VI : Dynamic Programming: Multi-stage decision process-Computational Procedures in dynamic programming.

TEXT BOOKS

  • ”Engineering Optimization: Theory and Practice”, S.S.Rao, New Age International(P) Ltd.
  • “Optimization for Engineering Dsign:Algorithms and Examples”, K.Deb, Prentice-Hall, New Delhi,1995.

REFERENCE BOOKS

  • “Introduction to Optimum design”, J.S.Arora, McGraw Hill
  • “Numerical Optimization Techniques for Engineering Design”, Vanderplatts, G.N., McGraw Hill

Course Outcomes
Upon successful completion of this course, the student will be able to understand:

  • Basic theoretical principles in optimization;
  • Formulation of optimization models;
  • Solution methods in optimization;
  • Methods of sensitivity analysis and post processing of results
  • Applications to a wide range of engineering problems

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.