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

Decision Science MCQs

  

1 / 20

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