{"id":5479,"date":"2022-04-08T17:07:20","date_gmt":"2022-04-08T17:07:20","guid":{"rendered":"https:\/\/commerceiets.com\/?page_id=5479"},"modified":"2023-03-16T06:25:25","modified_gmt":"2023-03-16T06:25:25","slug":"operations-research-notes","status":"publish","type":"page","link":"https:\/\/commerceiets.com\/bcom-gndu-notes\/operations-research-notes\/","title":{"rendered":"OPERATIONS RESEARCH NOTES- PREVIOUS YEAR QUESTIONS GNDU"},"content":{"rendered":"\n

OPERATIONS RESEARCH NOTES- PREVIOUS YEAR QUESTIONS GNDU<\/h2>\n\n\n\n

Click on the link to get the notes chapter-wise.<\/p>\n\n\n\n

Introduction to operations research<\/a><\/p>\n\n\n\n

Linear programming problems (LPP)<\/a><\/p>\n\n\n\n

Basics of Operational Research<\/strong>– Development, Definition, Characteristics, Necessity, Scope, Limitation.<\/p>\n\n\n\n

Linear Programming: <\/strong>Introduction, Application, Formulating Linear Programming Problem, General Linear Programming Problem, Graphical method of solution. Theory of Simplex method, Big-M model.<\/p>\n\n\n\n

Transportation Model: <\/strong>Assumption, Formulation and Solution of transportation models, Trans-shipment problems, definition of assignment model, Hungarian method for solution of assignment problems, Travelling salesman probelms.<\/p>\n\n\n\n

Queuing Models: <\/strong>Application, Introduction, Elements, Operating characteristics, Waiting time and idle time costs, Model I – Single channel poison arrivals with exponential service times. Infinite population, Assumption & limitation Poisson of Queuing model.<\/p>\n\n\n\n

Game Theory: <\/strong>Theory of games, Characteristics of Games, Rules- Look for a pure strategy, reduce game by Dominance method, Mixed strategies (2*2 games, 2*n games or m*2 games).<\/p>\n\n\n\n

Network analysis in Project Planning:<\/strong> Project, Project Planning scheduling, CPM, PERT, Cost analysis and crashing the Network exercises.<\/p>\n\n\n\n

\n
CONNECT ON LINKEDIN<\/a><\/div>\n<\/div>\n\n\n\n
\"OPERATIONS
OPERATIONS RESEARCH NOTES<\/figcaption><\/figure>\n\n\n\n
\n
CONNECT ON LINKEDIN<\/a><\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

OPERATIONS RESEARCH NOTES- PREVIOUS YEAR QUESTIONS GNDU Click on the link to get the notes chapter-wise. Introduction to operations research Linear programming problems (LPP) Basics of Operational Research– Development, Definition, Characteristics, Necessity, Scope, Limitation. Linear Programming: Introduction, Application, Formulating Linear Programming Problem, General Linear Programming Problem, Graphical method of solution. Theory of Simplex method, Big-M…<\/p>\n

Read More “OPERATIONS RESEARCH NOTES- PREVIOUS YEAR QUESTIONS GNDU”<\/span> »<\/a><\/p>\n","protected":false},"author":2,"featured_media":5481,"parent":5472,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/pages\/5479"}],"collection":[{"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/comments?post=5479"}],"version-history":[{"count":3,"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/pages\/5479\/revisions"}],"predecessor-version":[{"id":6938,"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/pages\/5479\/revisions\/6938"}],"up":[{"embeddable":true,"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/pages\/5472"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/media\/5481"}],"wp:attachment":[{"href":"https:\/\/commerceiets.com\/wp-json\/wp\/v2\/media?parent=5479"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}