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

Decision Science MCQs

  

1 / 20

1. Let C be the expected number of servers in the system ,Cˉ the expected number of serves not busy and C the expected number of servers busy then__________.
   1.   C=C+C.
   2.   C=C/C.
   3.   C=C-C.
   4.   C=C/C.
2. In transportation problem,one of the dual variable is assigned an arbitrary
   value, because_______________?
   1.   None of these.
   2.   This facilitates construction of the loop.
   3.   One of the constrains is redundant in a transportation problem
   4.   Then a solution is obtained immediately.
3. Any feasible solution which optimize the objective function of general linear
   programming problem is called an _________________ to that linear
   programming problem.
   1.   None of the above.
   2.   Initial basic feasible solution.
   3.   Optimal feasible solution
   4.   Bounded solution.
4. For M/M/1 model the expected number of busy servers are equal to_______.
   1.   Arrival rate λ
   2.   Service rate μ
   3.   Traffic intensity p .
   4.   None of these .
5. For M/M/1 queueing system if arrival rate is 10 customers/day and service rate is 30 customers per day then expected number of customers in the queue on a certain day is _________.
   1.   1/6.
   2.   1/3.
      b.
      c. .
      d.
   3.   None of these.
   4.   6
6. For M/M/1/N system, the expected waiting time in the system for p=1 is
   ________.
   1.   W=N/2 λ
   2.   W=1/λ
   3.   W=N/2
   4.   None of these .
7. When p=1, for M/M/1/N queueing system, expected number of customers in
   the system are__________ .
   1.   None of these
   2.   N/2.
   3.   N/6.
   4.   N .
8. For M/M/1 system, the expected waiting time in the queue is ________.
   1.   None of these
   2.   λ / μ .
   3.   λ / μ(μ-λ).
   4.   λ / μ-λ.
9. To find dual of linear programming problem,the primal must be in
   ___________?
   1.   Canonical form
   2.   Standard form.
   3.   None of the above
   4.   With <=, =, >= signs
10. In the optimal table of a transportation problem a zero in the south_west corner rule shows that____________?
    1.   None of these.
    2.   The optimal solution is degenerated
    3.   (a) and (b) both true.
    4.   An alternate optimal solution exists.
11. The expected waiting time in the system is 10 minutes, and expected waiting
    time in the queue is 5 minutes then the service rate is _______.
    1.   1/5
    2.   5.
    3.   0.
    4.   1 /10..
12. For M/M/1 queueing system, the expected number of customers in the system are_______.
    1.   None of these
    2.   L= λ-μ / λ.
    3.   L= λ / μ-λ.
    4.   L= μ / μ-λ.
13. If arrival rate is 15 customers per minute and service rate is 30 customers per
    minute, then for M/M/1 queueing system, its traffic intensity is given by__________.
    1.   4
    2.   None of these
    3.   1/2
    4.   2
14. For M/M/1/N queue modules, if P n is the number of customers in the system
    then ________.
    1.   None of these.
    2.   n=0 for n>N.
    3.   P n=1 for n>N.
    4.   Pn≠0 for n>N
15. Let λ be an arrival rate of customer in a system, μ be an service rate of the
    system then the expected number of busy servers are _______.
    1.   λ+ μ .
    2.   λ/ μ .
    3.   λ μ.
    4.   None of these
16. For M/M/1 model the probability that there is no customer in the system is
    ________.
    1.   5
    2.   1.5
    3.   2
    4.   3
17. If the dual of the linear programming problem have a finite optimal
    solution,then primal process________?
    1.   Infinite solution.
    2.   No solution.
    3.   Unbounded solution.
    4.   Finite optimal solution
18. If arrival rate is 20 customers/per week and service rate is 50 customers/week, then the expected number of busy servers for M/M/1 queueing system are
    1.   5/2
    2.   2/5
    3.   None of these
    4.   5
19. The traffic intensity for M/M/1 system is given by ________.
    1.   None of these
    2.   p=λ/μ.
       .
    3.   p=λ μ.
    4.   p=μ/λ.
20. For M/M/1 queueing system, the expected number of customers in the system are ___.
    1.   L =p/1-p.
    2.   L=1-p.
    3.   L=1-p/p
    4.   None of these.