Operations Research

UNIT 1 1. The main objective of O.R is to provide a Scientific basis to the decision makers. 2. O.R employs a team Scientists from different disciplines 3. Mention two uses of O.R = Industry, Planning 4. How is it used in hospital. = To solve waiting problems 5. O.R Imbibes interdisciplinary approach. 6. OR increases the effectiveness of Decision making ability. 7. O.R gives qualitative solution. = True 8. One of O.R phases is Action phase= True 9. Diagram belongs to physical model = True 10. Allocation problems are represented by iconic model. = False 11. State True / False 12. O.R methodology consists of definition, solution and validation only. = False 2. The interaction between O.R team and Management reaches peak level in implementation phase. = False 13. OR imbibes Interdisciplinary team approach 14. Linear programming is tool of OR 15. The three phases of OR are Judgment phase, Research phase and Action phase 16. To solve any problem through OR approach the first step is Define the problem 17. Model represents a real life system 18. Parameters represents the controlled variables of the system. UNIT 2 19. Both objective function and constraints are expressed in Linear forms. 20. L.P.P requires existence of Alternate course of actions. 21. Solution of decision variables can also be Fractious 22. One of the characteristics of canonical form in the objective function must be of maximisation. = True 23. 2x 3y 10 can be written as 2x+ 3y 10 = True 24. The collection of all feasible solutions is known as the Feasible region. 25. A linear inequality in two variables is known as a Half plan 26. The feasible region is a convex set. = True 27. The optimum value occurs anywhere in feasible region. = False UNIT 3 28. We add surplus variable for of constraint = False 29. The right hand side element of each constraint is non-negative. = True 30. A basic solution is said to be a feasible solution if it satisfies all constraints. = True 31. If one or more values of basic variable are zero then solution is said to be degenerate. = True 32. The key column is determined by Zj - Cj row. = Yes 33. Pivotal element lies on the crossing of key column and key row = Yes 34. The ve and infinite ratios are considered for determining key row. = No 35. The value of artificial value is M = Yes 36. Artificial variables enters as Basic Variable. = Yes UNIT 4 37. Dual L.P.P always reduces the amount of computation. = No 38. 2. It is possible to reverse the dual L.P.P to primal L.P.P. = Yes

Operations Research

39. Fill in the blanks 40. The coefficients of decision variable sin the objective function becomes 41. quantities on right hand side of Dual. 42. constraints changes to type in dual L.P 43. For every L.P.P there exists a unique Dual problem. 44. Dual variables represent the worth / unit of resource. = True 45. Optimality is reached when the resources are not fully utilized.=False 46. At optimum, the relationship holds as a strict equation.=True 47. Sensitivity analysis is carried out on Final simplex table. 48. It helps us to study the effect of changes in Resource, levels on objective function. 49. The results of sensitive analysis establishes Upper, lower and bounce for input parameters value.
UNIT 5 50. Transportation problems are a special type of L.P.P 51. The number of rows and columns need not always be equal 52. Transportation problem develops a schedule at minimum cost 53. In T.P ai = bj for getting a feasible solution. = Yes 54. T.P can also be solved by simplex method. = Yes 55. Matrix-minima method gives optimum solution. = No 56. In Matrix-minima method we start allocating from left-top cell of the table. = False 57. In vogels approximation method we first construct penalty and then start allocating.= True 58. North-west corner Rule gives optimum solution. = False 59. Vogel approximation method gives solution near to the optimum solution= True 60. All the values of Cij - ui - vj should be or zero for the solution to be optimum. 61. In unbalanced T.P ai is Not equal to to bj. 62. If the number of allocation is less than m + n 1 then it is said to be a degenerate T.P UNIT 6 63. In A.P the constraints are of equality type. =True 64. The no. of facilities should be equal to no. of resources. =True 65. The decision variables can take any value. = False 66. In Hungarian method first we prepare row reduced Matrix = Yes 67. The number of assignments should be equal to number of rows for optimum solution. = Yes 68. There can be more than one allocation in a row. = No 69. In unbalanced T.P number of rows to number of column. 70. Hungarian method cannot be applied directly to Maximisation problem problem. 71. If some jobs cannot be assigned to some M/cs then it is called Infeasible assignment problem. 72. In traveling salesmen problem the objective is to visit each cities Only once 73. Salesman has (n 1)! different sequences if n is the number of cities to be visited. UNIT 7 74. Integer programming is applied to problems that involve discrete variables. = True 75. If some variables can take non negative values then it is known as pure I.P.P = False 76. An optimum solution to I.P.P is first obtained by using Simplex method. 77. With the addition of Gomorys constraint the problem is solved by Dual simplex method. 78. We select that variable for Gomorys constraint whose fractional value is more. = True 79. Optimum values in an pure I.P.P can be x = 2 and y = 3.5. = False

Operations Research

80. Branch and Bound Technique is applied when some variables have upper or lower bounds. =
True 81. We start the technique with lower bound. = False UNIT 8 82. Customers arrive at a Bank at regular interval. = False 83. Queuing identifies the optimal service facilities to be provided.= True 84. Queuing theory is based on deterministic model.=False 85. One of the indicators of efficiency of a system is Utilization factor. 86. Analysis of Queuing system explores Various alternatives. 87. Simulation technique can also be used for analysis. 88. Queuing process has arrival pattern, service facility and Queue discipline as its constituents. Yes 89. If the arrivals are completely random, then it follows poisson distribution. Yes 90. Multiple service channels may be arranged in Series or in parallel 91. The service time can be Constant or varying. 92. When customers keep in switching over from one queue to another then it is called Jockeying 93. Balking, Collusion, Reneging, Jockeying are the types of customer behaviour. 94. E (m) refers to Average length of Queue. 95. Probability density function of the time spent by a customer in the system is denoted by F ( ). 96. Write one line answers 97. Expected number of customers in non empty Queue is given by / 98. The probability that an arriving customer has to wait for receiving service. / 99. Expected number of customer in the system. Refer Section 8.9 100. Average waiting time of customer in the Queue. Refer Section 8.9 101. E (m) Refer Section 8.10 102. E (w) Refer Section 8.10 UNIT 9 103. When the possible number of arrivals is limited then we apply infinite Queuing Model. False 104. The Queue discipline in a finite Queuing process can be random. True 105. The efficiency factor for this model is HJ / H + J + L. False UNIT 10 106. Simulation may be called experimentation in the Management laboratory 107. Random numbers have the property that any number has Equally likely to occur. 108. The totality of probability assigned to the variable should always be equal to 1. 109. In any simulation problem initial conditions are stated. = True 110. Assigned random numbers for cumulative probability values = True 111. Without identifying any relationship between variables we can solve the simulation problem. = False 112. Standard error for percentage of success = (P(1p) / n) 1/2 = Agree 113. It is possible to determine number of trials. = Agree 114. The accuracy of results increases as the square of number of trials. = disagree 115. Simulation gives optimum solution. = False 116. Simulation interrupts real system activities. = False

Operations Research

117.

This technique can be easily understood by non technical mangers = True

UNIT 11 118. Project consists of interrelated activities. = True 119. Project activities are to be completed in a specified time according to specified sequence. = True 120. PERT and CPM identifies non critical activities. = True 121. PERT is activity oriented network. = False 122. CPM is used for projects that are repetitive in nature. = True 123. Events do not consume Time and resource. 124. Arrows head number is Greater than its tail number. 125. Dummy activity in network is introduced t keep proper Precedence relationship. 126. Critical path calculation include both Forward pass and backward pass. 127. In a project network, a sequence of activities may form a loop. False 128. A critical activity must have its total and free floats equal to zero. True 129. A noncritical activity cannot have zero total float. True 130. The critical path of project network represents the minimum duration needed to complete the network. True 131. A network may include more than one critical path. False

UNIT 12

131. 132. 133. 134. 135. 136. 137. 138. 139. 140. 141.

Competitive situation occur when Two or more parties with conflicting interest operates. In competitive game prayers have Finite number of courses of action available to them. State any one characteristics of a competitive game. Players do not communicate to each other When do we call a game as Zero sum game. When the value of the game is 0. What is a rectangular game? Two person zero sum game. What is pure strategy? When a player always play only one strategy irrespective of Opponents move Saddle point occurs at row minimum and column maximum. = True If the value of the game is zero then it is called 0 sum game. = True The pay of matrix represents the gain for top player. = False The row whose elements are less than the corresponding elements of another row is Deleted. If the average of any 2 columns is less than or equal to the corresponding elements of another column is Deleted