MBA SEMESTER II

MB0048 -Operation Research- 4 Credits

(Book ID: B1301)
Assignment Set- 1 (60 Marks)
Note: Each question carries 10 Marks. Answer aII the questions
1. a .DeIine O.R and discuss its characteristics. | 5 marks|
b. Explain the nature oI Operations Research and its limitations.
| 5 marks|
2. a. What are the essential characteristics oI a linear programming model?
| 5 marks|
b. Explain the graphical method oI solving a LPP involving two
variables. | 5 marks|

3. a. Explain the simplex procedure to solve a linear programming problem.
| 5 marks|
b. Explain the use oI artiIicial variables in L.P | 5 marks|

4. a. Explain the economic interpretation oI dual variables. | 5 marks|
b. DeIine: Primal Problem and Dual Problem. | 5 marks|
5. Describe the North-West Corner rule Ior Iinding the initial basic Ieasible
solution in the transportation problem? | 10
marks|
6. Use the simplex method to
Maximise z 3x
1
x
2

Subject to the constraints
2x
1
x
2
K 2
x
1
3x
2
A 3
x
2
A 4,
x
1
, x
2
K 0.
MBA SEMESTER II
MB0048 -Operation Research- 4 Credits
(Book ID: B1301)
Assignment Set- 1 (60 Marks)
Note: Each question carries 10 Marks. Answer aII the questions
1. a. Explain the terms: Pure strategy, Mixed Strategy, Saddle point,
Competitive games, PayoII matrix, Rectangular games. | 5 marks|
b. Explain the Maximin and Minimax principle used in Game Theory.
| 5 marks|
2. a. Explain the steps involved in Monte-Carlo simulation. | 5 marks|
b. What are the advantages and limitations oI using simulation?
| 5 marks|
3. a. Distinguish between PERT and CPM. What is a critical path?
| 5 marks|
b. Write a short note on PERT/CPM networks in Operations Research.
| 5 marks|
4. a. State the general Iorm oI an integer programming problem. | 5 marks|
b. Describe the branch and bound method Ior the solution oI integer
programming problem? | 5marks|

5. How can you use the Matrix Minimum method to Iind the initial basic
Ieasible solution in the transportation problem. | 10 marks|
Solve the Iollowing transportation problem. | 10 marks|
9 12 9 6 9 10 3
7 3 7 7 3 3 6
6 3 9 11 3 11 2
6 8 11 2 2 10 9
4 4 6 2 4 2 22