P2Pprogrammer 2 programmer

Home > Download > SMU - Question Paper > MBA > MB0032

Operations Research

This is the collection of Sikkim Manipal University (SMU) question and answers for Operations Research . It will help to prepare your examination. All question paper are classified as per semester, subject code and question type of Part A, Part B and Part C with multiple choice options as same as actual examination. SMU question papers includes year 2023, 2022, 2021 Sem I, II, III, IV, V, VI examinations of all subjects.

SMU question test set of old, last and previous year are updated regularly and it is absolutely free to use. Question paper includes Visual basic 6, VB.Net, C#, ASP.Net, Web, Oracle, Database, SQL, Software Engineering, C, C++, OOPS, MBA, MCA, BSC IT I have requested you kindly send me the question paper of Operations Research , SMU - Master of Business Administration.

Course Name        MBA (Master of Business Administration)

Subject Code       MB0032 (Operations Research )

Get Questions        PART - A    PART - B    PART - C

Operations Research Syllabus.

Unit 1: Introduction to OR
Introduction • Scope of Operations Research (OR) • The significant features of OR • Phases of Operations Research • Methodology of Operations Research • The Structure of Mathematical Model

Unit 2: Linear Programming
Introduction • Objectives • Linear Programming • Graphical Analysis • Graphical Methods to Solve the LPP

Unit 3: Simplex Method
Introduction • The Standard form of LPP • Solution of the LPP – Simplex Method • The Simplex Algorithm • Penalty cost Method or Big-M Methods • Two Phase Method • Duality Concept • Sensitivity Analysis

Unit 4: Transportation Problem
Introduction • Formulation of transportation problem • The transportation algorithm (MODI method) • The initial basic feasible solution • North West Corner Rule • Matrix Minimum Method • Vogel’s approximation method • Moving towards optimality • Improving the solution • Degeneracy in transportation problem

Unit 5: Assignment Problem
Introduction • Mathematical formulation of the problem • Hungarian Method: Algorithm • Routing Problem • Traveling salesman problem

Unit 6: Integer Programming Problem
Introduction • All and Mixed I P P • Gomory’s all – IPP Method • Construction of Gomory’s Constraints • All I. P. P. algorithm • The Branch and bound technique

Unit 7: Queuing Models
Introduction • Queuing Theory • Analysis of a Queuing Process • Constituents of a Queuing System • Service Facility • Queue Discipline • Mathematical Analysis of Queuing Process • Single Channel Models • Multiple Service Channels • Erlang Family of Distribution of Service Times • Finite Queuing Models • Finite Queuing Tables • Measures of system efficiency • Use of finite queuing tables

Unit 8: Simulation
Introduction • Basic Concepts • Simulation Procedure • Allocation of Random Numbers • Use of Random Number Tables • Sample Size • Application of Simulation

Unit 9: Project Scheduling and PERT-CPM
Introduction • Basic difference between PERT and CPM • PERT / CPM Network components and precedence relationships • Critical path Calculations • Determination of critical path • Determination of Floats • Project Management – PERT

Home > Download > SMU - Question Paper > MBA > MB0032