{"id":4666,"date":"2018-01-10T07:16:45","date_gmt":"2018-01-10T07:16:45","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuh\/?p=4666"},"modified":"2019-07-15T07:36:49","modified_gmt":"2019-07-15T07:36:49","slug":"jntuh-b-tech-2016-2017-r16-detailed-syllabus-optimization-techniques","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-b-tech-2016-2017-r16-detailed-syllabus-optimization-techniques\/","title":{"rendered":"JNTUH B.Tech 2016-2017 (R16) Detailed Syllabus Optimization Techniques"},"content":{"rendered":"<p>Optimization Techniques Detailed Syllabus for B.Tech third year second sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.<\/p>\n<p>The detailed syllabus for Optimization Techniques B.Tech 2016-2017 (R16) third year second sem is as follows.<\/p>\n<p>B.Tech. III Year I Sem. \u00a0 \u00a0 L\/T\/P\/C<br \/>\nCourse Code: PE622OE \u00a0\u00a0 \u00a0 \u00a03\/0\/0\/3<br \/>\nPrerequisite: Mathematics \u2013I &amp; Mathematics \u2013II<\/p>\n<p><strong>Course Objectives:<\/strong><\/p>\n<ul>\n<li>To introduce various optimization techniques i.e classical, linear programming,\u00a0transportation problem, simplex algorithm, dynamic programming<\/li>\n<li>Constrained and unconstrained optimization techniques for solving and optimizing an\u00a0electrical and electronic engineering circuits design problems in real world situations.<\/li>\n<li>To explain the concept of Dynamic programming and its applications to project\u00a0implementation.<\/li>\n<\/ul>\n<p><strong>Course Outcomes:<\/strong> After completion of this course, the student will be able to<\/p>\n<ul>\n<li>explain the need of optimization of engineering systems<\/li>\n<li>understand optimization of electrical and electronics engineering problems<\/li>\n<li>apply classical optimization techniques, linear programming, simplex algorithm,\u00a0transportation problem<\/li>\n<li>apply unconstrained optimization and constrained non-linear programming and\u00a0dynamic programming<\/li>\n<li>Formulate optimization problems.<\/li>\n<\/ul>\n<p><strong>UNIT \u2013 I\u00a0Introduction and Classical Optimization Techniques:<\/strong> Statement of an Optimization<br \/>\nproblem \u2013 design vector \u2013 design constraints \u2013 constraint surface \u2013 objective function \u2013\u00a0objective function surfaces \u2013 classification of Optimization problems.\u00a0Classical Optimization Techniques: Single variable Optimization \u2013 multi variable\u00a0Optimization without constraints \u2013 necessary and sufficient conditions for\u00a0minimum\/maximum \u2013 multivariable Optimization with equality constraints.\u00a0Solution by method of Lagrange multipliers \u2013 Multivariable Optimization with inequality\u00a0constraints \u2013 Kuhn \u2013 Tucker conditions.<\/p>\n<p><strong>UNIT \u2013 II\u00a0Linear Programming:<\/strong> Standard form of a linear programming problem \u2013 geometry of linear\u00a0programming problems \u2013 definitions and theorems \u2013 solution of a system of linear\u00a0simultaneous equations \u2013 pivotal reduction of a general system of equations \u2013 motivation to\u00a0the simplex method \u2013 simplex algorithm.\u00a0Transportation Problem: Finding initial basic feasible solution by north \u2013 west corner rule,\u00a0least cost method and Vogel\u2019s approximation method \u2013 testing for optimality of balanced\u00a0transportation problems.<\/p>\n<p><strong>UNIT \u2013 III\u00a0Unconstrained Nonlinear Programming:<\/strong> One dimensional minimization methods,<br \/>\nClassification, Fibonacci method and Quadratic interpolation method\u00a0Unconstrained Optimization Techniques: Univariant method, Powell\u2019s method and\u00a0steepest descent method.<\/p>\n<p style=\"text-align: center\"><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000\">Download iStudy Android App for complete JNTUH syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier<\/span>.<\/strong><\/a><\/p>\n<p><strong>TEXT BOOKS:<\/strong><\/p>\n<ul>\n<li>Singiresu S. Rao, Engineering Optimization: Theory and Practice by John Wiley and\u00a0Sons, 4th edition, 2009.<\/li>\n<li>H. S. Kasene &amp; K. D. Kumar, Introductory Operations Research, Springer (India),\u00a0Pvt. Ltd., 2004<\/li>\n<\/ul>\n<p><strong>REFERENCE BOOKS:<\/strong><\/p>\n<ul>\n<li>George Bernard Dantzig, Mukund Narain Thapa, \u201cLinear programming\u201d, Springer\u00a0series in operations research 3rd edition, 2003.<\/li>\n<li>H.A. Taha, \u201cOperations Research: An Introduction\u201d, 8th Edition, Pearson\/Prentice\u00a0Hall, 2007.<\/li>\n<li>Kalyanmoy Deb, \u201cOptimization for Engineering Design \u2013 Algorithms and Examples\u201d,\u00a0PHI Learning Pvt. Ltd, New Delhi, 2005.<\/li>\n<\/ul>\n<p>For all other B.Tech 3rd Year 2nd Sem syllabus go to <a href=\"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-third-year-second-sem-petroleum-engineering-course-structure-2016-2017-r16-batch\/\">JNTUH B.Tech Petroleum Engineering 3rd\u00a0Year 2nd Sem Course Structure for (R16) Batch.<\/a><\/p>\n<p>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.<\/p>\n<p>Do share with friends and in case of questions please feel free drop a comment.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Optimization Techniques Detailed Syllabus for B.Tech third year second sem is covered here. This gives the details about credits, number of hours and other details along with reference books for [&hellip;]<\/p>\n","protected":false},"author":2259,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[62],"tags":[],"class_list":["post-4666","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/4666","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/users\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/comments?post=4666"}],"version-history":[{"count":3,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/4666\/revisions"}],"predecessor-version":[{"id":18335,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/4666\/revisions\/18335"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=4666"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=4666"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=4666"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}