MB0048 OPERATIONS RESEARCH SPRING 2015-16
ASSIGNMENT
| DRIVE | SPRING 2015 |
| PROGRAM | MBA/ MBADS/ MBAFLEX/ MBAHCSN3/ PGDBAN2 |
| SEMESTER | II |
| SUBJECT CODE & NAME | MB0048 OPERATIONS RESEARCH |
| BK ID | B1631 |
| CREDITS | 4 |
| MARKS | 60 |
SMU MBA SPRING 2015-2016 solved Assignments are available now. (10 years of Excellency)
Submission date is 30-06-2015 23:59:59
Dear Students,
SMU MBA SPRING 2015 Assignments are available. For Booking, Kindly email us on kvsude@gmail.com OR call us to +91 9995105420 or S M S your “Email ID” to our mobile number.
Online Purchase Link : http://smumbaassignments.com/onlineshop
http://smumbaassignment.com
| \Q.No | Questions | Marks | Total Marks | ||||||||||||||||||||||||||||||||||||
| 1 | Discuss the methodology of Operations Research. Explain in brief the phases of Operations Research. | ||||||||||||||||||||||||||||||||||||||
| A | Meaning of Operations Research Methodology of Operations Research Phases of Operations Research | 2
4 4 |
10 | ||||||||||||||||||||||||||||||||||||
| 2 | a. Explain the graphical method of solving Linear Programming Problem.
b. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper in a week. There are 160 production hours in a week. It requires 0.20 and 0.40 hours to produce a ton of grade X and Y papers. The mill earns a profit of Rs. 200 and Rs. 500 per ton of grade X and Y paper respectively. Formulate this as a Linear Programming Problem. |
||||||||||||||||||||||||||||||||||||||
| A | a. Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem
b. Formulation of LPP (Objective function & Constraints) |
6
4 |
10 | ||||||||||||||||||||||||||||||||||||
| 3 | a. Explain how to solve the degeneracy in transportation problems.
b. Explain the procedure of MODI method of finding solution through optimality test. |
||||||||||||||||||||||||||||||||||||||
| A | a. Degeneracy in transportation problem
b. Procedure of MODI method |
5
5 |
10 | ||||||||||||||||||||||||||||||||||||
4 |
a. Explain the steps involved in Hungarian method of solving Assignment problems.
b. Find an optimal solution to an assignment problem with the following cost matrix: J1 J2 J3 J4 M1 M2 M3 M4 |
||||||||||||||||||||||||||||||||||||||
| a. Steps in Hungarian method
b. Computation/Solution to the problem |
4
6 |
10 | |||||||||||||||||||||||||||||||||||||
| 5 | a. Explain Monte Carlo Simulation.
b. A Company produces 150 cars. But the production rate varies with the distribution.
At present the track will hold 150 cars. Using the following random numbers determine the average number of cars waiting for shipment in the company and average number of empty space in the truck. Random Numbers 82, 54, 50, 96, 85, 34, 30, 02, 64, 47. |
||||||||||||||||||||||||||||||||||||||
| A | a. Explanation of Monte Carlo Simulation
b. Calculation/ Solution to the problem |
5
5 |
10 | ||||||||||||||||||||||||||||||||||||
| 6 | a. Explain the dominance principle in game theory.
b. Describe the Constituents of a Queuing System. c. Differentiate between PERT and CPM |
||||||||||||||||||||||||||||||||||||||
| A | a. Dominance principle in game theory
b. Constituents of a Queuing System c. Differences between PERT and CPM |
4
3 3 Dill |
10 | ||||||||||||||||||||||||||||||||||||
SMU MBA SPRING 2015-2016 solved Assignments are available now. (10 years of Excellency)
Submission date is 30-06-2015 23:59:59
Dear Students,
SMU MBA SPRING 2015 Assignments are available. For Booking, Kindly email us on kvsude@gmail.com OR call us to +91 9995105420 or S M S your “Email ID” to our mobile number.
Online Purchase Link : http://smumbaassignments.com/onlineshop
http://smumbaassignment.com
Note –Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme
