{"id":859,"date":"2021-10-17T10:01:58","date_gmt":"2021-10-17T10:01:58","guid":{"rendered":"https:\/\/itgeeks.in\/home\/?p=859"},"modified":"2021-10-17T10:02:00","modified_gmt":"2021-10-17T10:02:00","slug":"2k6-ec-805-f-optimization-techniques","status":"publish","type":"post","link":"https:\/\/itgeeks.in\/home\/?p=859","title":{"rendered":"2K6 EC 805 (F): OPTIMIZATION TECHNIQUES"},"content":{"rendered":"\n<p><strong>Module I: Linear programming I (13 hours)<\/strong><br>Systems of linear equations and inequalities &#8211; convex sets &#8211; convex functions &#8211; formulation of linear programming problems &#8211; theory of simplex method &#8211; simplex algorithm &#8211; Charne\u2019s M method &#8211; two phase method &#8211; duality in linear programming &#8211; dual simplex method<br><strong>Module II: Linear programming II (13 hours)<\/strong><br>Sensitivity analysis &#8211; parametric programming &#8211; bounded variable problems &#8211; transportation problem &#8211; development of the method &#8211; integrality property &#8211; degeneracy &#8211; unbalanced problems &#8211; assignment problem &#8211; development of the Hungarian method &#8211; routing problems<br><strong>Module III: Nonlinear programming (13 hours)<\/strong><br>Mathematical preliminaries of non-linear programming &#8211; gradient and Hessian &#8211; unimodal functions &#8211; convex and concave functions &#8211; role of convexity &#8211; unconstrained optimization &#8211; fibonacci search &#8211; golden section search &#8211; optimal gradient method &#8211; classical optimization &#8211; Lagrange multiplier method &#8211; Kuhn-tucker conditions &#8211; quadratic programming &#8211; separable convex programming &#8211; frank and wolfe method<br><strong>Module IV: Dynamic programming &amp; game theory (13 hours)<\/strong><br>Nature of dynamic programming problem &#8211; Bellman\u2019s optimality principle &#8211; cargo loading problem &#8211; replacement problems &#8211; multistage production planning and allocation problems &#8211; rectangular games &#8211; two person zero sum games &#8211; pure and mixed strategies &#8211; 2\uf0b4m and m\uf0b42 games &#8211; relation between theory of games and linear programming<\/p>\n\n\n\n<p><strong>REFERENCES<\/strong><br>1.<a href=\"https:\/\/itgeeks.in\/home\/?p=860\">\u00a0Bazarra M.S., Jarvis J.J. &amp; Sherali H.D. \u2018Linear Programming and Network Problems&#8217;, John Wiley<\/a><br>2.\u00a0<a href=\"https:\/\/itgeeks.in\/home\/?p=862\">Bazarra M.S., Sherali H.D. &amp; Shetty C.M., &#8216;Nonlinear Programming, Theory and Algorithms&#8217;, John Wiley<\/a><br>3. <a href=\"https:\/\/itgeeks.in\/home\/?p=864\">Hadley G., &#8216;Linear Programming&#8217;, Addison Wesley, Narosa<\/a><br>4.\u00a0<a href=\"https:\/\/itgeeks.in\/home\/?p=708\">Hillier F.S. &amp; Lieberman G.J. &#8216;Introduction to Operations Research&#8217;, McGraw Hill<\/a><br>5. Ravindran A., Phillips D.T. &amp; Solberg J. J., Operations Research Principles and Practice, John Wiley<br>6.\u00a0<a href=\"https:\/\/itgeeks.in\/home\/?p=451\">Taha H.A., Operations Research, An introduction, P.H.I.<\/a><br>7. <a href=\"https:\/\/itgeeks.in\/home\/?p=866\">Wagner H.M., \u2018Principles of Operations Research with Application to Managerial Decisions&#8217;, P.H.I\u00a0\u00a0<\/a><\/p>\n\n\n\n<div class=\"wp-block-buttons is-layout-flex wp-block-buttons-is-layout-flex\">\n<div class=\"wp-block-button\"><a class=\"wp-block-button__link\" href=\"https:\/\/itgeeks.in\/home\/?p=205\">S8 QUESTION PAPERS<\/a><\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Module I: Linear programming I (13 hours)Systems of linear equations and inequalities &#8211; convex sets &#8211; convex functions &#8211; formulation<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[33,23,9,8],"tags":[7],"class_list":["post-859","post","type-post","status-publish","format-standard","hentry","category-ku-s8-ece","category-ku-syb-s8","category-ku-syllabus","category-syllabus","tag-kannur-university"],"_links":{"self":[{"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts\/859","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=859"}],"version-history":[{"count":1,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts\/859\/revisions"}],"predecessor-version":[{"id":868,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts\/859\/revisions\/868"}],"wp:attachment":[{"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=859"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=859"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=859"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}