Decision Science | Chapter 2 | Part 3 | MBA MCQs | DS

Decision Science MCQs

  

 

1. The quantitative analysis approach requires
   1.   the manager's prior experience with a similar problem.
   2.   a relatively uncomplicated problem.
   3.   mathematical expressions for the relationships.
   4.   each of the above is true.
2. In labor planning formulation, how would you write the constraint that there are only 10 full-time tellers (labeled as T) available
   1.   All of the above are correct ways.
   2.   T ≤10
   3.   T > 10
   4.   T + 10 > 0
3. A type of linear programming problem that is used in marketing is called the
   1.   media selection problem.
   2.   Madison Avenue problem.
   3.   marketing allocation problem
   4.   all of the above
4. The maximization or minimization of a quantity is the
   1.   goal of management science.
   2.   objective of linear programming.
   3.   constraint of operations research.
   4.   decision for decision analysis.
5. Decision variables
   1.   tell how much or how many of something to produce, invest, purchase, hire, etc.
   2.   represent the values of the constraint
   3.   measure the objective function.
   4.   must exist for each constraint.
6. Which of the following is a valid objective function for a linear programming problem?
   1.   Max 5xy
   2.   Min 4x + 3y + (2/3)z
   3.   Max 5x2+ 6y2
   4.   Min (x1 + x2)/x3
7. Which of the following statements is NOT true?
   1.   A feasible solution satisfies all constraints.
   2.   A feasible solution point does not have to lie on the boundary of the feasible region.
   3.   An optimal solution satisfies all constraints.
   4.   An infeasible solution violates all constraints.
8. solution that satisfies all the constraints of a linear programming problem except the
   non-negativity constraints is called
   1.   optimal.
   2.   semi-feasible.
   3.   infeasible.
   4.   feasible.
9. In converting a less-than-or-equal constraint for use in a simplex table, we must add
   1.   a surplus variable.
   2.   an artificial variable.
   3.   both a surplus and a slack variable
   4.   a slack variable.
10. Slack
    1.   Is the difference between the left and right sides of a constraint.
    2.   Exists for each variable in a linear programming problem.
    3.   Is the amount by which the left side of a ≥ constraint is larger than the right side.
    4.   Is the amount by which the left side of a ≤ constraint is smaller than the right side.
11. Unboundedness is usually a sign that the LP problem
    1.   has finite multiple solutions.
    2.   contains too many redundant constraints.
    3.   has been formulated improperly.
    4.   is degenerate.
12. To find the optimal solution to a linear programming problem using the graphical method
    1.   None of the alternatives is correct
    2.   find the feasible point that is the farthest away from the origin.
    3.   find the feasible point that is at the highest location.
    4.   find the feasible point that is closest to the origin
13. Which of the following special cases does not require reformulation of the problem in
    order to obtain a solution?
    1.   each case requires a reformulation
    2.   unboundedness
    3.   infeasibility
    4.   alternate optimality
14. Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in
    1.   standard form.
    2.   bounded form
    3.   feasible form.
    4.   alternative form.
15. In applying Vogel's approximation method to a profit maximization problem, row and
    column penalties are determined by:
    1.   finding the largest unit cost in each row or column.
    2.   finding the smallest unit cost in each row or column.
    3.   finding the difference between the two lowest unit costs in each row and column.
    4.   finding the difference between the two highest unit costs in each row and column.
16. The northwest corner rule requires that we start allocating units to shipping routes in the:
    1.   middle cell.
    2.   Lower right corner of the table.
    3.   Upper right corner of the table.
    4.   Upper left-hand corner of the table.
17. In a transportation problem, when the number of occupied routes is less than the number
    of rows plus the number of columns -1, we say that the solution is:
    1.   Unbalanced.
    2.   Optimal.
    3.   Infeasible.
    4.   Degenerate.
18. The only restriction can be placed on the initial solution of a transportation problem is
    that:
    1.   must have nonzero quantities in a majority of the boxes
    2.   demand must equal supply.
    3.   all constraints must be satisfied.
    4.   must have a number (equal to the number of rows plus the number of columns minus
       one) of boxes which contain nonzero quantities.
19. Which of the following is used to come up with a solution to the assignment problem?
    1.   MODI method
    2.   northwest corner method
    3.   Hungarian method
    4.   stepping-stone method
20. The graph that plots the utility value versus monetary value is called:
    1.   Laplace curve.
    2.   benefit curve.
    3.   decision tree graph.
    4.   utility curve.