Preview

Operational Research Questions

Good Essays
Open Document
Open Document
457 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Operational Research Questions
Question Bank

1) Explain the term Operations Research. 2) Give the characteristics of OR. 3) Explain the phases of OR. 4) Write a note on methodology of OR. 5) Explain applications & scope of OR. 6) What is linear programming problem? Discuss the scope & role of linear programming in solving management problems. 7) Describe the limitations of linear programming in decision-making. 8) What do you understand by a linear programming problem? What are its major requirements? 9) Briefly explain the major applications of linear programming in business. 11) Discuss the assumptions in the context of LPPs. 12) What steps are required in solving LPPs by graphic method? Discuss in brief. 13) What is feasible region? Is it necessary that it should always be a convex set? 14) Define iso-profit line. How does it affect the optimal solutions to an LPP? 15) How would you know whether the solution to a LPP is unique or not? In this connection, state the conditions that should be satisfied for more than one optimal solution. 16) Explain the phenomenon of ‘infeasibility’ in an LP problem. What are the indicators of such a phenomenon? How it can be handled?

18) Solve the LPP using Simplex method. Max z = 3x1+5x2+4x3 s.t 2x1+3x2 = 0.

21) One company manufactures & sales two products A & B. Each unit of product A requires 1 hour of machining & 2 hours of skilled labour, whereas each unit of product B uses 2 hours of machining & 1 hour of labour. For the coming month the machine capacity is limited to 720 machine-hours & the skilled labour is limited to 780 hours. Not more than 320 units of product A can be sold in the market during a month a) Develop a suitable model that will enable determination of the optimal product-mix. b) Determine the optimal product-mix & the maximum contribution. Unit contribution from product A is Rs. 6 & from product B is Rs. 4. c) What will be the

You May Also Find These Documents Helpful

  • Satisfactory Essays

    OPRE/411 Week 4

    • 379 Words
    • 2 Pages

    1. Use Solver in EXCEL to solve each of the following linear programming problems. To do so,…

    • 379 Words
    • 2 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
  • Better Essays

    Acme

    • 1450 Words
    • 8 Pages

    Linear programming is the “several related mathematical techniques used to allocate limited resources among competing demands in an optimal way” (Jacobs & Chase, 2013, appendix…

    • 1450 Words
    • 8 Pages
    Better 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

    MATH%$)

    • 535 Words
    • 4 Pages

    7. For a maximization integer linear programming problem, feasible solution is ensured by rounding _______ non-integer solution values if all of the constraints are less-than -or equal- to type.…

    • 535 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Optimization Exam Paper

    • 1236 Words
    • 5 Pages

    Time allowed: 2 hours Attempt four questions. All questions carry equal marks. In all questions, you may assume that all functions f (x1 , . . . , xn ) under consideration are sufficiently ∂2f ∂2f continuous to satisfy Young’s theorem: fxi xj = fxj xi or ∂xi ∂xj = ∂xj ∂xi . The following abbreviations, consistent with those used in the course, are used throughout for commonly occurring optimisation terminology: LPM – leading principal minor; PM – (non-leading) principal minor; CQ – constraint qualification; FOC – first-order conditions; NDCQ – non-degenerate constraint qualification; CSC – complementary slackness condition; NNC – non-negativity constraint.…

    • 1236 Words
    • 5 Pages
    Satisfactory Essays
  • Good Essays

    ___________________________________________________________________________ 1. A Ch3 Student: firm will maximize profit by producing that level of output at which A. the additional revenue from the last unit sold exceeds the additional cost of the last unit by the largest amount. B. the additional revenue from the last unit sold equals the additional cost of the last unit. C. total revenue exceeds total cost by the largest amount. D. total revenue equals total cost. E. both b and c 2. The function a decision maker seeks to maximize or minimize is the ________ function. A. optimal B. decision-making C. objective D. marginal E. none of the above 3. Choice variables A. determine the value of the objective function B. determine the constraint C. can only take on integer values D. cannot be continuous E. both c and d 4. For an unconstrained maximization problem A. the decision maker seeks to maximize net benefits. B. the decision maker seeks to maximize total benefits. C. the decision maker does not take cost into account because there is no constraint. D. the decision maker does not take the objective function into account because there is no constraint. E. none of the above 5. When marginal cost is greater than marginal benefit at the current activity level, the decision maker can increase net benefit by decreasing the activity because A. B. C. D. total benefit will rise by more than total cost will rise. marginal cost is rising faster than marginal benefit is falling. net benefit is upward sloping at this point. total cost will fall by more than total benefit will fall. 6. For a constrained minimization problem, the decision maker A. is constrained by the specific amount of total benefits. B. is…

    • 8076 Words
    • 33 Pages
    Good Essays
  • Good Essays

    Sensitivity Analysis

    • 1326 Words
    • 6 Pages

    There are two approaches to determining how sensitive an optimal solution is to changes. The first is simply a trial and error approach, however we prefer the second approach of post optimality method i.e. after an LP problem has been solved, and we attempt to determine a range of changes in problem parameters that will not affect the optimal solution or change the variables in the solution. This is done without resolving the whole problem again. This…

    • 1326 Words
    • 6 Pages
    Good Essays
  • Good Essays

    The objective is to minimize the cost of chemical compounds used and can be written as:…

    • 402 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    CMA ima questions part 1

    • 6251 Words
    • 42 Pages

    of product B is $55 per unit. Product A requires 4 hours of machine time per unit and…

    • 6251 Words
    • 42 Pages
    Satisfactory Essays
  • Satisfactory Essays

    • The improvement in the value of the optimal solution per unit increase in the right-hand side is called the dual price. • The range of feasibility is the range over which the dual price is applicable. • As the RHS increases, other constraints will become binding and limit the change in the value of the objective function.…

    • 657 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    Linear Solution

    • 6098 Words
    • 25 Pages

    Since computers are used to solve virtually all business LP problems, the most important thing a student can do is to get experience in formulating a wide variety of problems. This chapter provides such a variety.…

    • 6098 Words
    • 25 Pages
    Powerful Essays
  • Satisfactory Essays

    Lp Formulation Quiz

    • 458 Words
    • 2 Pages

    1. ACME Co. is a manufacturer of X’s which they sell to OR/MS teachers to be used as variables. For this week they intend to manufacture two types of X’s, namely, X1’s & X2’s. The profit contribution for each unit of X1 & X2 are $4 and $5, respectively. Mr. Loony, the manager of ACME, found out that his available supply of raw material 1 (RM1) and raw material 2 (RM2) are 18 units and 24, respectively. Each unit of X1 will require 3 units of RM1 and 3 units of RM2 while each unit of X2 will require 2 units of RM1 and 4 units of RM2. Weekly demand for X1 is about 5 units while that for X2 is about 7 units. Plant capacity of ACME Co. is 6 for X1 and 5 for X2. Formulate an LP model (objective function & constraints) than can be employed to solve for the optimal product mix.…

    • 458 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    The decision to be made in this problem is how many of each type of backpack to make. Therefore, we add two changing cells with range name UnitsProduced (C11:D11). The…

    • 531 Words
    • 3 Pages
    Good Essays