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]
http://en.wikipedia.org/wiki/Operations_research http://www.ehow.com/about_5055351_characteristics-operations-research.html http://www.citeman.com/1913-limitations-of-operations-research.html

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]
http://wps.prenhall.com/wps/media/objects/9434/9660836/online_tutorials/heizer10e_tut 3.pdf http://mcaor.blogspot.com/2006/10/about-artificial-variables-in-linear.html

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]

http://www.scribd.com/doc/21757331/MB0032-Operations-Research-Assignments Refer Q5

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 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. 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]
http://www.scribd.com/doc/30906572/Game-THeory http://en.wikipedia.org/wiki/Game_theory

2. a. Explain the steps involved in Monte-Carlo simulation. [ 5 marks] b. What are the advantages and limitations of using simulation? [ 5 marks]
http://www.palisade.com/risk/monte_carlo_simulation.asp http://rcwww.kek.jp/research/egs/docs/pdf/iccr_1994.pdf

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]

http://wiki.answers.com/Q/What_is_the_difference_between_CPM_and_PERT http://www.interventions.org/pertcpm.html

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]
http://en.wikipedia.org/wiki/Integer_programming http://en.wikipedia.org/wiki/Branch_and_bound

5. How can you use the Matrix Minimum method to find the initial basic feasible solution in the transportation problem. [ 10 marks]
http://businessmanagementcourses.org/Lesson15MethodsOfFindingInitialSolutionForATransportati onProblem.pdf

6. Solve the following transportation problem.

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]