QN1. The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that
a. The solution be optimal
b. The rim conditions are satisfied
c. The solution not be degenerate
d. All of the above
Answer
Answer: b. The rim conditions are satisfied
QN2. The dummy source or destination in a transportation problem is added to
a. Satisfy rim conditions
b. Prevent solution from becoming degenerate
c. Ensure that total cost does not exceed a limit
d. None of the above
Answer
Answer: a. Satisfy rim conditions
QN3. The occurrence of degeneracy while solving a transportation problem means that
a. Total supply equals total demand
b. The solution so obtained is not feasible
c. The few allocations become negative
d. None of the above
Answer
Answer: b. The solution so obtained is not feasible
QN4. An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:
a. Positive & greater than zero
b. Positive with at least one equal to zero
c. Negative with at least one equal to zero
d. None of the above
Answer
Answer: b. Positive with at least one equal to zero
QN5. One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that
a. It is complicated to use
b. It does not take into account cost of transportation
c. It leads to a degenerate initial solution
d. All of the above
Answer
Answer: b. It does not take into account cost of transportation
QN6. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are
a. m+n
b. m*n
c. m+n-1
d. m+n+1
Answer
Answer: c. m+n-1
QN7. If an opportunity cost value is used for an unused cell to test optimality, it should be
a. Equal to zero
b. Most negative number
c. Most positive number
d. Any value
Answer
Answer: b. Most negative number
QN8. During an iteration while moving from one solution to the next, degeneracy may occur when
a. The closed path indicates a diagonal move
b. Two or more occupied cells are on the closed path but neither of them represents a corner of the path.
c. Two or more occupied cells on the closed path with minus sign are tied for lowest circled value
d. Either of the above
Answer
Answer: c. Two or more occupied cells on the closed path with minus sign are tied for lowest circled value
QN9. The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current solution because
a. It represents per unit cost reduction
b. It represents per unit cost improvement
c. It ensure no rim requirement violation
d. None of the above
Answer
Answer: a. It represents per unit cost reduction
QN10. The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because
a. It improve the total cost
b. It does not disturb rim conditions
c. It ensure feasible solution
d. All of the above
Answer
Answer: c. It ensure feasible solution
QN11. When total supply is equal to total demand in a transportation problem, the problem is said to be
a. Balanced
b. Unbalanced
c. Degenerate
d. None of the above
Answer
Answer: c. Degenerate
QN12. Which of the following methods is used to verify the optimality of the current solution of the transportation problem
a. Least cost method
b. Vogel’s approximation method
c. Modified distribution method
d. All of the above
Answer
Answer: a. Least cost method
QN13. The degeneracy in the transportation problem indicates that
a. Dummy allocation(s) needs to be added
b. The problem has no feasible solution
c. The multiple optimal solution exist
d. a & b but not c
Answer
Answer: c. The multiple optimal solution exist
QN14. An assignment problem is considered as a particular case of a transportation problem because
a. The number of rows equals columns
b. All xij = 0 or 1
c. All rim conditions are 1
d. All of the above
Answer
Answer: d. All of the above
QN15. An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of
a. Rows or columns
b. Rows & columns
c. Rows + columns – 1
d. None of the above
Answer
Answer: d. None of the above
QN16. 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. All of the above
Answer
Answer: a. Minimize total cost of assignment
QN17. The method used for solving an assignment problem is called
a. Reduced matrix method
b. MODI method
c. Hungarian method
d. None of the above
Answer
Answer: c. Hungarian method
QN18. The purpose of a dummy row or column in an assignment problem is to
a. Obtain balance between total activities & total resources
b. Prevent a solution from becoming degenerate
c. Provide a means of representing a dummy problem
d. None of the above
Answer
Answer: a. Obtain balance between total activities & total resources
QN19. Maximization assignment problem is transformed into a minimization problem by
a. Adding each entry in a column from the maximization 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. Any one of the above
Answer
Answer: c. Subtracting each entry in the table from the maximum value in that table
QN20. If there were n workers & n jobs there would be
a. n! solutions
b. (n-1)! solutions
c. (n!)n solutions
d. n solutions
Answer
Answer: a. n! solutions
QN21. An assignment problem can be solved by
a. Simplex method
b. Transportation method
c. Both a & b
d. None of the above
Answer
Answer: c. Both a & b
QN22. For a salesman who has to visit n cities which of the following are the ways of his tour plan
a. n!
b. (n+1)!
c. (n-1)!
d. n
Answer
Answer: c. (n-1)!
QN23. The assignment problem
a. Requires that only one activity be assigned to each resource
b. Is a special case of transportation problem
c. Can be used to maximize resources
d. All of the above
Answer
Answer: d. All of the above
QN24. An assignment problem is a special case of transportation problem, where
a. Number of rows equals number of columns
b. All rim conditions are 1
c. Values of each decision variable is either 0 or 1
d. All of the above
Answer
Answer: d. All of the above
QN25. 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. 2n-1
c. m+n-1
d. m+n
Answer
Answer: b. 2n-1
QN26. To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
a. n
b. 2n
c. n-1
d. 2n-1
Answer
Answer: c. n-1
QN27. The Hungarian method for solving an assignment problem can also be used to solve
a. A transportation problem
b. A travelling salesman problem
c. A LP problem
d. Both a & b
Answer
Answer: b. A travelling salesman problem
QN28. An optimal solution of an assignment problem can be obtained only if
a. Each row & column has only one zero element
b. Each row & column has at least one zero element
c. The data is arrangement in a square matrix
d. None of the above
Answer
Answer: d. None of the above
QN29. Customer behavior in which the customer moves from one queue to another in a multiple channel situation is
a. Balking
b. Reneging
c. Jockeying
d. Altering
Answer
Answer: c. Jockeying
QN30. Which of the following characteristics apply to queuing system
a. Customer population
b. Arrival process
c. Both a & b
d. Neither a nor b
Answer
Answer: c. Both a & b
QN31. Which of the following is not a key operating characteristics apply to queuing system
a. Utilization factor
b. Percent idle time
c. Average time spent waiting in the system & queue
d. None of the above
Answer
Answer: d. None of the above
QN32. Priority queue discipline may be classified as
a. Finite or infinite
b. Limited & unlimited
c. Pre-emptive or non-pre-emptive
d. All of the above
Answer
Answer: c. Pre-emptive or non-pre-emptive
QN33. The calling population is assumed to be infinite when
a. Arrivals are independent of each other
b. Capacity of the system is infinite
c. Service rate is faster than arrival rate
d. All of the above
Answer
Answer: a. Arrivals are independent of each other
QN34. Which of the cost estimates & performance measures are not used for economic analysis of a queuing system
a. Cost per server per unit of time
b. Cost per unit of time for a customer waiting in the system
c. Average number of customers in the system
d. Average waiting time of customers in the system
Answer
Answer: d. Average waiting time of customers in the system
QN35. A calling population is considered to be infinite when
a. All customers arrive at once
b. Arrivals are independent of each other
c. Arrivals are dependent upon each other
d. All of the above
Answer
Answer: b. Arrivals are independent of each other
QN36. The cost of providing service in a queuing system decreases with
a. Decreased average waiting time in the queue
b. Decreased arrival rate
c. Increased arrival rate
d. None of the above
Answer
Answer: d. None of the above
QN37. Service mechanism in a queuing system is characterized by
a. Server’s behavior
b. Customer’s behavior
c. Customers in the system
d. All of the above
Answer
Answer: a. Server’s behavior
QN38. Probabilities of occurrence of any state are
a. Collectively exhaustive
b. Mutually exclusive
c. Representing one of the finite numbers of states of nature in the system
d. All of the above
Answer
Answer: d. All of the above
QN39. In a matrix of transition probability, the probability values should add up to one in each
a. Row
b. Column
c. Diagonal
d. All of the above
Answer
Answer: a. Row
QN40. In a matrix of transition probability, the element aij where i=j is a
a. Gain
b. Loss
c. Retention
d. None of the above
Answer
Answer: c. Retention
