SMU university SOLVED online test
Product Details: Sikkim manipal university SMU university SOLVED Online test AND GUESS
Format: online test 2 month membership plan
Pub. Date: NEW EDITION APPLICABLE FOR Current EXAM
Publisher: MEHTA SOLUTIONS
Edition Description: 2015-16
RATING OF Test: EXCELLENT
ABOUT THE Online test
FROM THE PUBLISHER
If you find yourself getting fed up and frustrated with other SMU book solutions now mehta solutions brings top solutions for SMU. this SMU university book contains previous year solved papers plus faculty important questions and answers specially for SMU university .questions and answers are specially design specially for SMU university students .
Please note: All products sold on mbaonlinepapers.com are brand new and 100% genuine
- New addition fully solved
PH: 09871409765 , 09899296811 FOR ANY problem or for any demo
EXAM TIME QUESTIONS SERIES
Features :
- Sikkim manipal university important questions answers are available online
- we will sent user name and password
- you can read only
- this programme run only from one computer only.
- True false questions answers +matching questions+multiple choice questions
- total questions answers 3000+
- You will get objective test software for 2 month membership only
- unlimited test unlimited time for 2 months
7.Huge selling productAny questions
8. Membership plan for test is 2 month only
call Customercare
PH 09871409765 , 09899296811
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
