MB0032_Operations Research_Sem 2_Aug_Fall 2011- assignment

Shared by:
Categories
Tags
-
Stats
views:
220
posted:
9/18/2011
language:
English
pages:
2
Document Sample

```							                            MBA SEMESTER II

MB0032 –Operation Research- 3 Credits

(Book ID: B1301)

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.
MBA SEMESTER II

MB0032 –Operation Research- 2 Credits

(Book ID: B1301)

Assignment Set- 1 (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
programming problem?                                           [ 5marks]

5. How can you use the Matrix Minimum method to find the initial basic
feasible solution in the transportation problem.      [ 10 marks]

6. Solve the following transportation problem.                  [ 10 marks]
9   12   9     6   9   10   5

7   3    7     7   5   5    6

6   5    9    11   3   11   2

6   8    11    2   2   10   9

4   4    6     2   4   2    22

```
Other docs by freehelp