# MBA SEMESTER II MB0048 –Operation Research- 4 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]
http://en.wikipedia.org/wiki/Linear_programming http://math.tutorvista.com/algebra/graphical-method.html

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. b. Define: Primal Problem and Dual Problem.

[ 5 marks] [ 5 marks]

http://www.nd.edu/~dgalvin1/30210/30210_F07/presentations/interpretation_of_dual.pdf http://en.wikipedia.org/wiki/Dual_problem

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

Competitive games. a.com/doc/30906572/Game-THeory http://en. [ 5 marks] . Distinguish between PERT and CPM. x1. Payoff matrix. [ 5 marks] b. MBA SEMESTER II MB0048 –Operation Research.wikipedia.asp http://rcwww. Saddle point.palisade. Mixed Strategy. What is a critical path? [ 5 marks] b.com/risk/monte_carlo_simulation. Explain the steps involved in Monte-Carlo simulation.scribd.pdf 3. [ 5 marks] b. Explain the Maximin and Minimax principle used in Game Theory. [ 5 marks] http://www. a. Use the simplex method to Maximise z = 3x1 – x2 Subject to the constraints 2x1 + x2  2 x1 + 3x2  3 x2  4. Explain the terms: Pure strategy. Rectangular games. What are the advantages and limitations of using simulation? [ 5 marks] http://www.1 (60 Marks) Note: Each question carries 10 Marks.kek.scribd.jp/research/egs/docs/pdf/iccr_1994. Answer all the questions 1. Write a short note on PERT/CPM networks in Operations Research.org/wiki/Game_theory 2. a.http://www.com/doc/21757331/MB0032-Operations-Research-Assignments Refer Q5 6. x2  0.4 Credits (Book ID: B1301) Assignment Set.

org/wiki/Branch_and_bound 5. State the general form of an integer programming problem. [ 5 marks] b.wikipedia. Describe the branch and bound method for the solution of integer programming problem? [ 5marks] http://en.pdf 6.org/Lesson15MethodsOfFindingInitialSolutionForATransportati onProblem.org/pertcpm.html 4. Solve the following transportation problem.wikipedia. a. How can you use the Matrix Minimum method to find the initial basic feasible solution in the transportation problem.com/Q/What_is_the_difference_between_CPM_and_PERT http://www.answers.interventions.http://wiki.org/wiki/Integer_programming http://en. [ 10 marks] http://businessmanagementcourses. 9 7 6 6 4 12 3 5 8 4 9 7 9 11 6 6 7 11 2 2 9 5 3 2 4 10 5 11 10 2 5 6 2 9 22 [ 10 marks] .