{"id":4785,"date":"2024-12-19T05:27:32","date_gmt":"2024-12-19T05:27:32","guid":{"rendered":"https:\/\/science.sjp.ac.lk\/mat\/?page_id=4785"},"modified":"2024-12-19T05:28:23","modified_gmt":"2024-12-19T05:28:23","slug":"amt-323-1-0-operational-research-i","status":"publish","type":"page","link":"https:\/\/science.sjp.ac.lk\/mat\/amt-323-1-0-operational-research-i\/","title":{"rendered":"AMT 323 1.0 Operational Research I"},"content":{"rendered":"<section class=\"wpb-content-wrapper\"><p>[vc_row][vc_column][vc_column_text]<\/p>\n<p><strong>Course:\u00a0AMT 323 1.0 Operational Research I<\/strong>\u00a0<strong>(Optional)<\/strong><\/p>\n\n<p><strong>Course content:<\/strong><\/p>\n\n<p style=\"text-align: justify;\">Methods in Operation Research; Introduction to linear programming; Formation of linear programing problem; objective function; Constraints; Solving linear programing problem; Minimization and Maximization of objective function; Graphical Method; Standard form of a linear programing problem; slack\/surplus variables; negative variables; Simplex Method; Artificial variable technique; Types of Solutions in a LPP; optimal solution; Duality theory; Formation of the dual problem; Dual simplex method;<\/p>\n\n<p style=\"text-align: justify;\">Sensitivity analysis\/post optimality analysis; Changes of the initial problem; Transportation model; Mathematical formulation; Methods for initial basic feasible solution; Optimal solution; Unbalanced transportation problem; Solve linear programing and transportation problems using software packages;<\/p>\n\n<p><strong>Recommended Readings:<\/strong><\/p>\n\n\n<ol type=\"1\">\n<li style=\"list-style-type: none;\">\n<ol type=\"1\"><\/p>\n<li>Sen,R.P. (2010). <em>Operational Research Algorithms and Applications. <\/em>PHI Learning.<\/li>\n\n\n<li>Gupta,P.K., &amp; Hira,D.S. (1976). <em>Operations Research. <\/em>S. Chand Publishing.<\/li>\n\n\n<li>Amarasena,S.M. (2015). <em>Operational Research <\/em>(4<sup>th <\/sup>ed). Kathru Prakashana.<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n\n<p>&nbsp;<\/p>\n<p>[\/vc_column_text][\/vc_column][\/vc_row]<\/p>\n<\/section>","protected":false},"excerpt":{"rendered":"<p>[vc_row][vc_column][vc_column_text] Course:\u00a0AMT 323 1.0 Operational Research I\u00a0(Optional) Course content: Methods in Operation Research; Introduction to linear programming; Formation of linear programing problem; objective function; Constraints; Solving linear programing problem; Minimization and Maximization of objective function; Graphical Method; Standard form of a linear programing problem; slack\/surplus variables; negative variables; Simplex Method; Artificial variable technique; Types of &hellip; <a href=\"https:\/\/science.sjp.ac.lk\/mat\/amt-323-1-0-operational-research-i\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">AMT 323 1.0 Operational Research I<\/span><\/a><\/p>\n","protected":false},"author":33,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_ti_tpc_template_sync":false,"_ti_tpc_template_id":"","footnotes":""},"_links":{"self":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4785"}],"collection":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/users\/33"}],"replies":[{"embeddable":true,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/comments?post=4785"}],"version-history":[{"count":2,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4785\/revisions"}],"predecessor-version":[{"id":4788,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4785\/revisions\/4788"}],"wp:attachment":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/media?parent=4785"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}