MCQ Unit 5
MCQ Unit 5
Which of the following methods is used to verify the optimality of the current
solution of
the transportation problem_________.
A. Modified Distribution Method
B. Least Cost Method
C. Vogels Approximation Method
D. North West Corner Rule
ANSWER: A
25. An optimal assignment requires that the maximum number of lines which can be
drawn
through squares with zero opportunity cost be equal to the number of______.
A. rows or coloumns
B. rows and coloumns.
C. rows+columns- 1
D. rows-columns.
ANSWER: A
26. While solving an assignment problem, an activity is assigned to a resource
through a square
with zero opportunity cost because the objective is to_________.
A. minimize total cost of assignment.
B. reduce the cost of assignment to zero
C. reduce the cost of that particular assignment to zero
D. reduce total cost of assignment
ANSWER: A
27. Maximization assignment problem is transformed into a minimization problem
by_________.
A. adding each entry in a column from the maximum value in that column
B. subtracting each entry in a column from the maximum value in that column
C. subtracting each entry in the table from the maximum value in that table
D. adding each entry in the table from the maximum value in that table
ANSWER: C
29. To proceed with the MODI algorithm for solving an assignment problem, the
number of
dummy allocations need to be added are___________.
A. n
B. n-1
C. 2n-1
D. n-2
ANSWER: B
30. Every basic feasible solution of a general assignment problem having a square
pay-off
matrix of order n should have assignments equal to___________.
A. 2n-1
B. n
C. n+1
D. n-2
ANSWER: A
31. An artificial variable leaves the basis means, there is no chance for the
_____variable to
enter once again.
A. slack
B. surplus
C. artificial
D. dual
ANSWER: C
34. The cell with allocation can be called____
A. Cell
B. Empty cell
C. Basic cell
D. Non-basic cell
ANSWER: C
38. The problem of replacement is felt when job performing units fail_____.
A. suddenly and gradually
B. gradually
C. suddenly
D. neither gradually nor suddenly
ANSWER: A
144. _________ of a queuing system is the state where the probability of the number
of
customers in the system depends upon time
A. death model
B. birth model
C. transient state
D. steady state
ANSWER: D
146. An activity which does not consume neither any resource nor time is known
as________.
A. activity
B. predecessor activity
C. successor activity
D. dummy activity
ANSWER: D
147. The initial event which has all outgoing arrows with no incoming arrow is
numbered
_____________.
A. 0
B. 1
C. 2
D. -2
ANSWER: A
ANSWER: B
138. The process that performs the services to the customer is known as
___________.
A. queue
B. service channel
C. customers
D. server
ANSWER: B
139. The customers of high priority are given service over the low priority
customers
is____________.
A. pre emptive
B. non pre emptive
C. FIFO
D. LIFO
ANSWER: A
140. Given arrival rate = 30/hr, service rate = 40/hr, the value of traffic
intensity is
___________.
A. 4/3
B. 3/4
C. 3/2
D. 5
ANSWER: B
141. The model in which only arrivals are counted and no departure takes place are
called
_________.
A. pure birth model
B. pure death model
C. birth-death model
D. death-birth model
ANSWER: A