Preview

Smu Question

Satisfactory Essays
Open Document
Open Document
331 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Smu Question
Master of Business Administration-MBA Semester 2
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.

Master of Business Administration-MBA Semester 2
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

You May Also Find These Documents Helpful

  • Satisfactory Essays

    DQ 3: Explain what is strategic control and what are the four basic types? Please provide examples to support your response.…

    • 703 Words
    • 6 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Busn312 Hw3A

    • 727 Words
    • 3 Pages

    Linear programming problems have a.|linear objective functions, non-linear constraints.| b.|non-linear objective functions, non-linear constraints.| c.|non-linear objective functions, linear constraints.| d.|linear objective functions, linear constraints.| ____C 7. The first step in formulating a linear programming problem is a.|Identify any upper or lower bounds on the decision variables.| b.|State the constraints as linear combinations of the decision variables.| c.|Understand the problem.| d.|Identify the decision variables.| e.|State the objective…

    • 727 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    Freaudian Analysis

    • 3380 Words
    • 14 Pages

    1. Consider the following linear programming problem: Maximize Z = 400 x + 100y Subject to 8 x + 10y ≤ 80 2 x + 6y ≤ 36 x≤ 6 x, y ≥ 0…

    • 3380 Words
    • 14 Pages
    Powerful Essays
  • Good Essays

    Brs Mdm3 Tif Ch04

    • 4332 Words
    • 20 Pages

    B) if the right-hand side value of the constraint increases by 1 unit, the objective function value will decrease by 5 units…

    • 4332 Words
    • 20 Pages
    Good Essays
  • Good Essays

    A&D High Tech (A)

    • 613 Words
    • 3 Pages

    3. What is (are) the critical path(s) in the project? What is the level of risk in completing tasks on the critical path(s)? Explain.…

    • 613 Words
    • 3 Pages
    Good Essays
  • Good Essays

    b) Determine a “Northwest Corner Rule” basic feasible solution for this problem. Calculate the total transportation cost associated with this solution.…

    • 863 Words
    • 4 Pages
    Good Essays
  • Good Essays

    I posted an annotated solution to Problem 2-5. This problem is an examplar for both the chapter 2 and 3 problems. In this example I show how I typically set up a problem. First I set up the linear programming model and then develop a parallel set-up to use as input to the Solver add-in. I use this strategy because I first like to set up the problem solution before I worry about setting up the parameters for using Solver.…

    • 1092 Words
    • 5 Pages
    Good Essays
  • Satisfactory Essays

    (d) Why is it important to determine the critical path of a project? What happens if activities…

    • 805 Words
    • 4 Pages
    Satisfactory Essays
  • Good Essays

    8) What do you understand by a linear programming problem? What are its major requirements?…

    • 457 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    Maths Bigm Method

    • 2291 Words
    • 10 Pages

    slack variable si; and if constraint i is a > constraint, we subtract an excess variable ei). 3. Add an artificial variable ai to the constraints identified as > or = constraints at the end of Step 1. Also add the sign restriction ai > 0. 4. If the LP is a max problem, add (for each artificial variable) -Mai to the objective function where M denote a very large positive number. 5. If the LP is a min problem, add (for each artificial variable) Mai to the objective function. 6. Solve the transformed problem by the simplex . Since each artificial variable will be in the starting basis, all artificial variables must be eliminated from row 0 before beginning the simplex. Now…

    • 2291 Words
    • 10 Pages
    Powerful Essays
  • Satisfactory Essays

    The problem of maximization/minimization deals with choosing the ideal set of values of variables in order to find the extrema of an equation subject to constraints. The simplex method is one of the fundamental methods of calculating the Basic Feasible Solution (BFS) of a maximization/minimization. This algorithm implements the simplex method to allow for quick calculation of the BFS to maximize profit or minimize loss, depending on the requirement. It provides an intuitive user interface which can be used to provide all the input and then performs the required calculations, presenting the results in a clean format.…

    • 408 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Smu Assignment

    • 3010 Words
    • 13 Pages

    Assignment 2 Scribd Upload a Document Search Documents Explore DocumentsBooks - FictionBooks - Non-fictionHealth & MedicineBrochures/ CatalogsGovernment DocsHow- To Guides/ManualsMagazines/NewspapersRecipes/MenusSchool Work+ all categoriesFeaturedRecentPeopleAuthorsStudentsResearchersPubl ishersGovernment & NonprofitsBusinessesMusiciansArtists & DesignersTeachers+ all categoriesMost FollowedPopularSign Up|Log…

    • 3010 Words
    • 13 Pages
    Powerful Essays
  • Satisfactory Essays

    Smu Solved

    • 329 Words
    • 2 Pages

    (August 2012) Master of Business Administration - MBA Semester 4 “Operations Management” Specialization OM 0015 – Maintenance Management (4 credits) (Book ID: B1340) ASSIGNMENT- Set 1 Marks 60…

    • 329 Words
    • 2 Pages
    Satisfactory Essays
  • Better Essays

    Athletes Dope Case Study

    • 883 Words
    • 4 Pages

    Dixit, A., & Skeath, S. (1999). Games of Strategy. W. W. Norton & Company, Inc.…

    • 883 Words
    • 4 Pages
    Better Essays
  • Powerful Essays

    Linear Programming

    • 10813 Words
    • 44 Pages

    1 Linear Programming 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 The Canonical Linear Programming Problem . . . . . . . . . . . . . . . . 1.2.1 Statement of the Diet Problem . . . . . . . . . . . . . . . . . . . . 1.2.2 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.3 Solution to the Diet Problem . . . . . . . . . . . . . . . . . . . . . 1.3 Duality and Basic Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3.1 Duality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3.2 Basic Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.4 Solving the Canonical Linear Programming Problem: The Simplex Method 1.4.1 Phase I of the Simplex Method . . . . . . .…

    • 10813 Words
    • 44 Pages
    Powerful Essays