# Smu Question

Pages: 2 (331 words) Published: December 19, 2011
MB0048 –Operation Research - 4 Credits
Assignment Set- 1 (60 Marks)

Note: Each question carries 10 Marks. Answer all the questions.

1. a .Define O.R and discuss its characteristics. [ 5 marks] b. Explain the nature of Operations Research and its limitations.[ 5 marks]

2. a. What are the essential characteristics of a linear programming model?[ 5 marks] b. Explain the graphical method of 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 of artificial variables in L.P [ 5 marks]

4. a. Explain the economic interpretation of dual variables. [ 5 marks] b. Define: Primal Problem and Dual Problem.[ 5 marks]

5. Describe the North-West Corner rule for finding the initial basic feasible solution in the transportation problem? [ 10 marks]

6. Use the simplex method to

Maximise    z = 3x1 – x2
Subject to the constraints
2x1 + x2  ³ 2
x1 + 3x2 £ 3
x2 £ 4,
x1, x2  ³ 0.

MB0048 –Operation Research - 4 Credits
Assignment Set- 2 (60 Marks)

Note: Each question carries 10 Marks. Answer all the questions.

1. a. Explain the terms: Pure strategy, Mixed Strategy, Saddle point, Competitive games, Payoff 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 of 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 form of an integer programming problem. [ 5 marks] b. Describe the branch and bound method for the solution of integer...