Optimization Techniques Detailed Syllabus for B.Tech third year first sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.
The detailed syllabus for Optimization Techniques B.Tech 2016-2017 (R16) third year first sem is as follows.
B.Tech. III Year I Sem. L/T/P/C
Course Code: ME511OE 3/0/0/3
Prerequisite: Mathematics –I & Mathematics –II
Course Objectives:
- To introduce various optimization techniques i.e classical, linear programming, transportation problem, simplex algorithm, dynamic programming
- Constrained and unconstrained optimization techniques for solving and optimizing an electrical and electronic engineering circuits design problems in real world situations.
- To explain the concept of Dynamic programming and its applications to project implementation.
Course Outcomes: After completion of this course, the student will be able to
- explain the need of optimization of engineering systems
- understand optimization of electrical and electronics engineering problems
- apply classical optimization techniques, linear programming, simplex algorithm,
transportation problem - apply unconstrained optimization and constrained non-linear programming and dynamic programming
- Formulate optimization problems.
UNIT – I Introduction and Classical Optimization Techniques: Statement of an Optimization problem – design vector – design constraints – constraint surface – objective function – objective function surfaces – classification of Optimization problems. Classical Optimization Techniques: Single variable Optimization – multi variable Optimization without constraints – necessary and sufficient conditions for
minimum/maximum – multivariable Optimization with equality constraints. Solution by method of Lagrange multipliers – Multivariable Optimization with inequality constraints – Kuhn – Tucker conditions.
UNIT – II Linear Programming: Standard form of a linear programming problem – geometry of linear programming problems – definitions and theorems – solution of a system of linear simultaneous equations – pivotal reduction of a general system of equations – motivation to the simplex method – simplex algorithm. Transportation Problem: Finding initial basic feasible solution by north – west corner rule, least cost method and Vogel’s approximation method – testing for optimality of balanced transportation problems.
UNIT – III Unconstrained Nonlinear Programming: One dimensional minimization methods, Classification, Fibonacci method and Quadratic interpolation method Unconstrained Optimization Techniques: Univariant method, Powell’s method and steepest descent method.
TEXT BOOKS:
- Singiresu S. Rao, Engineering Optimization: Theory and Practice by John Wiley and Sons, 4th edition, 2009.
- H. S. Kasene & K. D. Kumar, Introductory Operations Research, Springer (India), Pvt. Ltd., 2004
REFERENCE BOOKS:
- George Bernard Dantzig, Mukund Narain Thapa, “Linear programming”, Springer series in operations research 3rd edition, 2003.
- H.A. Taha, “Operations Research: An Introduction”, 8th Edition, Pearson/Prentice Hall, 2007.
- Kalyanmoy Deb, “Optimization for Engineering Design – Algorithms and Examples”, PHI Learning Pvt. Ltd, New Delhi, 2005.
For all other B.Tech 3rd Year 1st Sem syllabus go to JNTUH B.Tech Mechanical Engineering 3rd Year 1st Sem Course Structure for (R16) Batch.
All details and yearly new syllabus will be updated here time to time. Subscribe, like us on facebook and follow us on google plus for all updates.
Do share with friends and in case of questions please feel free drop a comment.