{"id":707,"date":"2021-10-13T18:30:54","date_gmt":"2021-10-13T18:30:54","guid":{"rendered":"https:\/\/itgeeks.in\/home\/?p=707"},"modified":"2021-10-13T18:44:33","modified_gmt":"2021-10-13T18:44:33","slug":"2k6-cs-801-operations-research","status":"publish","type":"post","link":"https:\/\/itgeeks.in\/home\/?p=707","title":{"rendered":"2K6 CS 801: OPERATIONS RESEARCH"},"content":{"rendered":"\n<p><strong>Module I: Linear algebra (13 hours)<\/strong><br>Vectors &#8211; vector space and Euclidean space &#8211; vector operations &#8211; matrix operations &#8211; unit vector &#8211; sum vector &#8211; linear dependence &#8211; bases &#8211; spanning set &#8211; rank &#8211; simultaneous equations &#8211; basic solutions &#8211; point sets &#8211; lines and hyper planes &#8211; linear inequalities &#8211; convex sets &#8211; extreme points &#8211; fundamental theorem of linear programming<br><strong>Module II: Linear programming (13 hours)<\/strong><br>Statement of the LP problem &#8211; slack and surplus variables &#8211; basic feasible solutions &#8211; reduction of a feasible solution to basic feasible solution &#8211; artificial variables &#8211; optimality conditions &#8211; unbounded solutions &#8211; Charnes\u2019 M method &#8211; two phase method &#8211; degeneracy &#8211; duality<br><strong>Module III: Transportation, assignment and game problems (13 hours)<\/strong><br>Transportation problem &#8211; coefficient matrix and its properties &#8211; basic set of column vectors &#8211; linear combination of basic vectors &#8211; tableau format &#8211; stepping stone algorithm &#8211; UV method &#8211; inequality constraints &#8211; degeneracy in transportation problems &#8211; assignment problem as a maximally degenerate transportation problem &#8211; K\u00f6ning\u2019s method &#8211; rectangular zero sum games &#8211; von Neuman\u2019s theorem &#8211; saddle points &#8211; pure and mixed strategies &#8211; formulation of the primal and dual LP problem for fixed strategies &#8211; dominance &#8211; graphical solutions<br><strong>Module IV: Queuing theory (13 hours)<\/strong><br>Basic structure of queuing models &#8211; exponential and Poisson distributions &#8211; birth and death processes &#8211; queuing models based on Poisson inputs and exponential service times &#8211; basic model with constant arrival rate and service rate &#8211; finite queue &#8211; limited source queue models involving non-exponential distributions &#8211; single service model with Poisson arrival and any service time distribution &#8211; Poisson arrival with constant service time &#8211; Poisson arrival and Erlang service times &#8211; priority disciplines &#8211; dynamic programming &#8211; Bellman\u2019s principle of optimality &#8211; formulation and solution of simple problems<\/p>\n\n\n\n<p><strong>Text books<\/strong><br>1. Riggs J.L., Economic Decision Models for Engineers and Managers, McGraw Hill International Students Edition<br>2. Weist &amp; Levy, A Management Guide to PERT &amp; CPM, Prentice Hall of India<br>3.&nbsp;<a href=\"https:\/\/itgeeks.in\/home\/?p=661\">Starr &amp; Miller, Inventory Control &#8211; Theory &amp; Practice, Prentice Hall of India<\/a><br>4.&nbsp;<a href=\"https:\/\/itgeeks.in\/home\/?p=600\">Samuel Eilon, Production Planning &amp; Control, Universal Book Corporation<\/a><br>5. Francis &amp; White, Facility Layout &amp; Location, Prentice Hall Inc.<br><strong>Reference books<\/strong><br>1.&nbsp;<a href=\"https:\/\/itgeeks.in\/home\/?p=708\">Hillier &amp; Lieberman, Introduction to Operations Research, Holden Day Inc.<\/a><br>2. Biegel, Production Control, Prentice Hall of India<br>3. James Moore, Plant Layout &amp; Design, The Macmillan Company&nbsp;&nbsp;<\/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\">S8 QUESTION PAPERS<\/a><\/div>\n\n\n\n<div class=\"wp-block-button\"><a class=\"wp-block-button__link\" href=\"https:\/\/itgeeks.in\/home\/?p=714\">Notes<\/a><\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Module I: Linear algebra (13 hours)Vectors &#8211; vector space and Euclidean space &#8211; vector operations &#8211; matrix operations &#8211; unit<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[36,23,9,8],"tags":[7],"class_list":["post-707","post","type-post","status-publish","format-standard","hentry","category-ku-s8-cse","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\/707","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=707"}],"version-history":[{"count":2,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts\/707\/revisions"}],"predecessor-version":[{"id":717,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=\/wp\/v2\/posts\/707\/revisions\/717"}],"wp:attachment":[{"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=707"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=707"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/itgeeks.in\/home\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=707"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}