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

Decision Science MCQs

  

 

1. The minimum processing time on machine M1 and M2 are related as
   1.   Min t1j = Max t2j
   2.   Min t2j ≥ Max t1j
   3.   Min t1j ≤ Max t2j
   4.   Min t1j ≥ Max t2j
2. You Would like to assign operators to the equipment that has
   1.   Most jobs waiting to be processed.
   2.   All of the
   3.   Job which has been waiting longest
   4.   Job with the earliest due date
3. What is meant by 'Payoffs' in Game Theory?
   1.   Outcome of a game when different alternatives are adopted by players
   2.   strategies used by players
   3.   value of a game
   4.   No. of players involved in a game
4. The North West Corner rule
   1.   is used to find an initial feasible solution
   2.   none of the given
   3.   is based on the concept of minimizing opportunity cost
   4.   is used to find an optimal solution
5. The first step in formulating a linear programming problem is
   1.   Identify any upper or lower bounds on the decision variables.
   2.   State the objective function as a linear combination of the decision variables
   3.   Identify the decision variables.
   4.   State the constraints as linear combinations of the decision variables.
6. The third step in formulating a linear programming problem is
   1.   .State the constraints as linear combinations of the decision variables.
   2.   Understand the problem.
   3.   Identify the decision variables.
   4.   State the objective function as a linear combination of the decision variables
7. 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.
8. Decision variables
   1.   tell how much or how many of something to produce, invest, purchase, hire, etc.
   2.   measure the objective function.
   3.   must exist for each constraint.
   4.   represent the values of the constraints.
9. 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
10. Infeasibility means that the number of solutions to the linear programming models that satisfies
    all constraints i
    1.   0.
    2.   an infinite number.
    3.   at least 1.
    4.   at least 2.
11. The improvement in the value of the objective function per unit increase in a right-hand side is the.
    1.   slack value
    2.   constraint coefficient.
    3.   shadow price.
    4.   sensitivity value.
12. Slack
    1.   is the difference between the left and right sides of a constraint.
    2.   is the amount by which the left side of a < constraint is smaller than the right side.
    3.   is the amount by which the left side of a > constraint is larger than the right side.
    4.   exists for each variable in a linear programming problem.
13. ..........is indicated by dotted arrow.
    1.   burst event
    2.   dummy activity
    3.   none of them
    4.   merge event
14. Event indicates ............of activity
    1.   both A and B
    2.   none of them
    3.   starting
    4.   ending
15. Activity which does not require any resources or time is called........
    1.   event
    2.   tools
    3.   activity
    4.   arrow
16. Activity which starts only after finishing other activity is called........
    1.   dummy
    2.   successor
    3.   Predecessor
    4.   none of them
17. Processing time Mij’s are......... of order of processing the jobs
    1.   dependent
    2.   independent
    3.   none of them
    4.   negligible
18. ............operation is carried out on a machine at a time.
    1.   Two
    2.   only one
    3.   none of them
    4.   atleast one
19. In sequencing the time involved in moving jobs from one machine to
    another is
    .
    1.   negligible
    2.   significant
    3.   none of them
    4.   positive number
20. In sequencing if smallest time for a job belongs to machine-1 then that job has to placed of the sequence
    1.   at end D.
    2.   in the starting
    3.   in the middle
    4.   none of them
21. Dynamic programming is a mathematical technique dealing with the
    optimization of ....... stage decision process.
    1.   multi .
    2.   none of them
    3.   single
    4.   both A and B