1. Which of the following is an assumption of an LP model
Correct : D. All of the above
2. Which of the following is a limitation associated with an LP model
Correct : D. All of the above
3. The graphical method of LP problem uses
Correct : D. All of the above
4. A feasible solution to an LP problem
Correct : A. Must satisfy all of the problem’s constraints simultaneously
5. Which of the following statements is true with respect to the optimal solution of an LP problem
Correct : D. If an optimal solution exists, there will always be at least one at a corner
6. An iso-profit line represents
Correct : A. An infinite number of solutions all of which yield the same profit
7. If an iso-profit line yielding the optimal solution coincides with a constaint line, then
Correct : D. None of the above
8. While plotting constraints on a graph paper, terminal points on both the axes are connected
by a straight line because
Correct : C. The constraints are linear equations or inequalities
9. A constraint in an LP model becomes redundant because
Correct : D. None of the above
10. If two constraints do not intersect in the positive quadrant of the graph, then
Correct : A. The problem is infeasible
11. Constraints in LP problem are called active if they
Correct : A. Represent optimal solution
12. The solution space (region) of an LP problem is unbounded due to
Correct : C. Neither a nor b
13. While solving a LP model graphically, the area bounded by the constraints is called
Correct : A. Feasible region
14. Alternative solutions exist of an LP model when
Correct : B. Objective function equation is parallel to one of the constraints
15. While solving a LP problem, infeasibility may be removed by
Correct : C. Removing a constraint
16. If a non-redundant constraint is removed from an LP problem then
Correct : A. Feasible region will become larger
17. If one of the constraint of an equation in an LP problem has an unbounded solution, then
Correct : B. Feasible region should have a line segment
18. The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that
Correct : B. The rim conditions are satisfied
19. The dummy source or destination in a transportation problem is added to
Correct : A. Satisfy rim conditions
20. The occurrence of degeneracy while solving a transportation problem means that
Correct : B. The solution so obtained is not feasible
21. An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:
Correct : B. Positive with at least one equal to zero
22. One disadvantage of using North-West Corner rule to find initial solution to the transportation
problem is that
Correct : B. It does not take into account cost of transportation
23. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination)
is feasible if number of positive allocations are
Correct : C. m+n-1
24. If an opportunity cost value is used for an unused cell to test optimality, it should be
Correct : B. Most negative number
25. During an iteration while moving from one solution to the next, degeneracy may occur when
Correct : C. Two or more occupied cells on the closed path with minus sign are tied for lowest circled value
26. The large negative opportunity cost value in an unused cell in a transportation table is chosen
to improve the current solution because
Correct : A. It represents per unit cost reduction
27. The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because
Correct : C. It ensure feasible solution
28. When total supply is equal to total demand in a transportation problem, the problem is said to be
Correct : C. Degenerate
29. Which of the following methods is used to verify the optimality of the current solution of the transportation problem
Correct : A. Least cost method
30. The degeneracy in the transportation problem indicates that
Correct : C. The multiple optimal solution exist
31. An assignment problem is considered as a particular case of a transportation problem because
Correct : D. All of the above
32. 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
Correct : D. None of the above
33. While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to
Correct : A. Minimize total cost of assignment
34. The method used for solving an assignment problem is called
Correct : C. Hungarian method
35. The purpose of a dummy row or column in an assignment problem is to
Correct : A. Obtain balance between total activities & total resources
36. Maximization assignment problem is transformed into a minimization problem by
Correct : C. Subtracting each entry in the table from the maximum value in that table
37. If there were n workers & n jobs there would be
Correct : A. n! solutions
38. An assignment problem can be solved by
Correct : C. Both a & b
39. For a salesman who has to visit n cities which of the following are the ways of his tour plan
Correct : C. (n-1)!
40. The assignment problem
Correct : D. All of the above
41. An assignment problem is a special case of transportation problem, where
Correct : D. All of the above
42. Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to
Correct : B. 2n-1
43. To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
Correct : C. n-1
44. The Hungarian method for solving an assignment problem can also be used to solve
Correct : B. A travelling salesman problem
45. An optimal solution of an assignment problem can be obtained only if
Correct : D. None of the above
46. Customer behavior in which the customer moves from one queue to another in a multiple channel situation is
Correct : C. Jockeying
47. Which of the following characteristics apply to queuing system
Correct : C. Both a & b
48. Which of the following is not a key operating characteristics apply to queuing system
Correct : D. None of the above
49. Priority queue discipline may be classified as
Correct : C. Pre-emptive or non-pre-emptive
50. The calling population is assumed to be infinite when
Correct : A. Arrivals are independent of each other
51. Which of the cost estimates & performance measures are not used for economic analysis of a queuing system
Correct : D. Average waiting time of customers in the system
52. A calling population is considered to be infinite when
Correct : B. Arrivals are independent of each other
53. The cost of providing service in a queuing system decreases with
Correct : D. None of the above
54. Service mechanism in a queuing system is characterized by
Correct : A. Server’s behavior
55. Probabilities of occurrence of any state are
Correct : D. All of the above
56. In a matrix of transition probability, the probability values should add up to one in each
Correct : A. Row
57. In a matrix of transition probability, the element aij where i=j is a
Correct : C. Retention
58. In Markov analysis, state probabilities must
Correct : A. Sum to one
59. State transition probabilities in the Markov chain should
Correct : A. Sum to 1
60. If a matrix of transition probability is of the order n*n, then the number of equilibrium equations would be
Correct : A. n
61. In the long run, the state probabilities become 0 & 1
Correct : C. In all cases
62. While calculating equilibrium probabilities for a Markov process, it is assumed that
Correct : B. Transition probabilities do not change
63. The first-order Markov chain is generally used when
Correct : A. Transition probabilities are fairly stable
64. A problem is classified as Markov chain provided
Correct : D. All of the above
65. The transition matrix elements remain positive from one point to the next. This property is known as:
Correct : C. Regular property
66. Markov analysis is useful for:
Correct : C. All of the above
67. Which of the following is not one of the assumptions of Markov analysis:
Correct : C. There are limited number of future periods
68. An advantage of simulation as opposed to optimization is that
Correct : D. All of the above
69. The purpose of using simulation technique is to
Correct : D. All of the above
70. Which of the following is not the special purpose simulation language
Correct : A. BASIC
71. As simulation is not an analytical model, therefore the result of simulation must be viewed as
Correct : C. Approximation
72. While assigning random numbers in Monte Carlo simulation, it is
Correct : B. Necessary to develop a cumulative probability distribution
73. Analytical results are taken into consideration before a simulation study so as to
Correct : C. Identify suitable values of decision variables for the specific choices of system parameters
74. Biased random sampling is made from among alternatives which have
Correct : B. Unequal probability
75. Large complicated simulation models are appreciated because
Correct : C. They may be expensive to write and use as an experimental device
76. Simulation should not be applied in all cases because it
Correct : D. All of the above
77. Simulation is defined as
Correct : D. All of the above
78. The general purpose system simulation language
Correct : B. Does not require programme writing
79. Special simulation languages are useful because they
Correct : D. All of the above
80. Few causes of simulation analysis failure are
Correct : D. All of the above
81. To make simulation more popular, we need to avoid
Correct : D. All of the above
82. The important step required for simulation approach in solving a problem is to