Q1. The main objective of OR is to provide a _ to the decision-makers.
Answer: Scientific basis
Q2. OR employs a team of from __.
Answer: Scientists, different disciplines
Q3. A government can thus use OR for framing future _ and __
Answer: economic , social policies
Q4. In hospital OR methods can solve waiting problems in _ department of big hospitals and _ problems of the hospital organisations.
Answer: Outpatient, administrative
Q5. OR __ inter-disciplinary approach.
Answer: Imbibes
Q6. OR increases the effectiveness of __ ability.
Answer: Decision making
Q7. Action phase involves making recommendations for the decision process. (True/False)
Answer: True
Q8. One of the OR phases is judgement phase. (True/False)
Answer: True
Q9. Diagram belongs to physical models. (True/False)
Answer: True
Q10. Allocation problems are represented by iconic models. (True/False)
Answer: False
Q11. OR methodology consists of definition, solution, and validation only. (True/False)
Answer: False
Q12. The interaction between the OR team and management reaches peak level in the implementation phase. (True/False)
Answer: False
Q13. OR imbibes _ team approach.
Answer: Inter-disciplinary
Q14. Linear programming is tool of _.
Answer: OR
Q15. The three phases of OR are __.
Answer: Judgement phase, research phase, and action phase
Q16. To solve any problem through OR approach, the first step is _.
Answer: Define the problem
Q17. _ represents a real life system.
Answer: Model
Q18. _ represents the controlled variables of the system.
Answer: Parameters
Q19. Both the objective function and constraints are expressed in _____forms.
Answer: Linear
Q20. LPP requires existence of , , of _.
Answer: Alternate course of action
Q21. Solution of decision variables can also be __.
Answer: Fractions
Q22. One of the characteristics of canonical form in the objective function must be maximisation. (True/False)
Answer: True
Q23. 2x – 3y = 10 can be written as -2x + 3y =-10. (True/False)
Answer: True
Q24. Personnel planning problems can also be analysed with _.
Answer: Linear programming
Q25. Linear programming is a powerful tool for selecting alternatives in a _____.
Answer: Decision problem
Q26. Linear programming can be used to determine the ___ to use in an advertising campaign.
Answer: Proper mix of media
Q27. Quite often in the process industries, a given _ can be made into a wide variety of products.
Answer: Raw material
Q28. The collection of all feasible solutions is known as the __ region.
Answer: Feasible
Q29. A linear inequality in two variables is known as a _.
Answer: Half-plane
Q30. The feasible region is a convex set. (True/False)
Answer: True
Q31. The optimum value occurs anywhere in feasible region. (True/False)
Answer: False
Q32. An unbounded solution means that there exist a finite number of solutions to the given problem. (True/False)
Answer: False
Q33. The feasible region has an important property which is called the convexity property of geometry (True/False)
Answer: True
Q34. The boundaries of the feasible regions are lines or planes. (True/False)
Answer: True
Q35. If the optimal solution is not unique, there are points other than corners that are optimal but in any case at least one corner is optimal.
Answer: True
Q36. We add surplus variable for “=”constraint. (True/False)
Answer: False
Q37. The right-hand side element of each constraint is non-negative in the standard form. (True/False)
Answer: True
Q38.A basic solution is said to be a feasible solution if it satisfies all constraints. (True/False)
Answer: True
Q39. If one or more values of basic variable are zero then solution is said to be degenerated. (True/False)
Answer: True
Q40. The element that lies both on key column and key row is called pivotal element. (True/False)
Answer: True
Q41. The element that lies both on key column and key row is called pivotal element (True/False)
Answer: True
Q42. Pivotal element lies on the crossing of key column and key row. (True/False)
Answer: False
Q43. In the simplex algorithm, the variable to be replaced is called the outgoing variable and the variable that replaces it is called the incoming variable (True/False)
Answer: True
Q44. The value of artificial variable is “M”. (True/False)
Answer: True
Q45. Artificial variables are entered as basic variables. (True/False)
Answer: True
Q46. Dual linear programming problem always reduces the amount of computation. (True/False)
Answer: False
Q47. It is possible to reverse the dual linear programming problem to primal linear programming problem. (True/False)
Answer: True
Q48. The coefficients of decision variables in the objective function become quantities on the right hand side of _______.
Answer: Dual
Q49. “=” constraints changes to __ type in dual linear programming.
Answer: =
Q50. For every linear programming problem, there exists a unique __ problem.
Answer: Dual
Q51. Dual variables represent the worth or unit of a resource. (True/False)
Answer: True
Q52. Optimality is reached when the resources are not fully utilised. (True/False)
Answer: False
Q53. At optimum level, the relationship holds as a strict equation. (True/False)
Answer: True
Q54. Sensitivity analysis is carried out on _ simplex table.
Answer: Final
Q55. Sensitivity analysis helps us to study the effect of changes in __ in objective function.
Answer: Resource levels
Q56. The results of sensitive analysis establish and __ for input parameters value.
Answer: Upper, lower, bounce
Q57. Transportation problems are a special type of _.
Answer: Linear programming problem
Q58. The number of rows and columns need not always be _.
Answer: Equal
Q59. If total demand is greater than total supply then there is _ solution.
Answer: No feasible
Q60. Basic feasible solution In transportation problem can be found using North-west corner rule. (True/False)
Answer: True
Q61. Transportation problems can also be solved by simplex method. (True/False)
Answer: True
Q62. In matrix-minima method, you start allocating from the upper left hand (north-west) corner of the table. (True/False)
Answer: True
Q63. In Vogel’s approximation method, you first construct penalty and then start allocating. (True/False)
Answer: True
Q64. North-west corner rule gives optimum solution. (True/False)
Answer: False
Q65. Vogel’s approximation method gives solution near to the optimum solution. (True/False)
Answer: True
Q66. All the values of ?ij = cij – ui – vj should be _ or for the solution to be optimum.
Answer: Zero or positive
Q67. In unbalanced transportation problem Sai is __ to Sbj.
Answer: Not equal
Q68. If the number of allocation is less than _ then it is said to be a degenerate transportation problem.
Answer: m + n – 1
Q69. In an AP, the constraints are of equality type. (True/False)
Answer: True
Q70. The number of facilities should be equal to the number of resources. (True/False)
Answer: True
Q71. A balanced assignment problem is one where the number of rows ? the number of columns. (True/False)
Answer: False
Q72. In Hungarian method, you prepare row-reduced matrix. (True/False)
Answer: True
Q73. The number of assignments should be equal to the number of rows for an optimum solution. (True/False)
Answer: True
Q74. There can be more than one allocation in a row. (True/False)
Answer: False
Q75. In unbalanced AP, the number of rows __ to number of columns.
Answer: ?
Q76. Hungarian method cannot be applied directly to _ problem.
Answer: Maximisation problem
Q77. If some jobs cannot be assigned to some machines, then it is called _ assignment problem.
Answer: Infeasible
Q78. In travelling salesman problem, the objective is to visit each cities __.
Answer: Only once
Q79. Salesman has __ different sequences if n is the number of cities to be visited.
Answer: (n-1)
Q80. Integer programming is applied to problems that involve discrete variables. (True/False)
Answer: True
Q81. If some variables take on non-negative values, then it is known as pure IPP. (True/False)
Answer: False
Q82. An optimum solution to IPP is first obtained by using _.
Answer: Simplex method
Q83. With the addition of Gomory’s constraint, the problem is solved by ________.
Answer: Dual simplex method
Q84. For Gomory’s constraint select the variable whose fractional value is more? (True/False)
Answer: True
Q85. Optimum values in a pure IPP can be x=2 and y=3.5. (True/False)
Answer: False
Q86. Branch and bound technique is applied when some variables have upper or lower bounds. (True/False)
Answer: True
Q87. We start the branch and bound technique with the lower bound. (True/False)
Answer: False
Q88. Customers arrive at a bank at regular intervals. (True/False)
Answer: False
Q89. Queuing identifies the optimal service facilities to be provided. (True/False)
Answer: True
Q90. Queuing theory is based on the deterministic model. (True/False)
Answer: False
Q91. _ represents number of customers waiting in the queue.
Answer: Queue length
Q92. times may indicate a need to adjust the service rate of the system or change the arrival rate of customers
Answer: Long waiting
Q93. _ represents the percentage of time the facilities are busy.
Answer: Collective utilisation
Q94. Every queuing process has an arrival pattern, a service facility and a queue discipline as its constituents.(True/False)
Answer: True
Q95. If the arrivals are completely random, then it follows Poisson distribution. (True/False)
Answer: True
Q96. Multiple service channels may be arranged in __ or in _.
Answer: Series, parallel
Q97. The service time can be _ or .
Answer: Constant, varying
Q98. When customers keep on switching over from one queue to another then it is called __.
Answer: Jockeying
Q99. _ _ _ are the types of customer behaviour.
Answer: Balking, Collusion, reneging, jockeying
Q100. E (m) refers to .
Answer: Average length of queue
Q101. Probability density function of the time spent by a customer in the system is denoted by _.
Answer: F (v)
Q102. _ arrivals are allowed.
Answer: Simultaneous
Q103. The expected number of customers in non-empty queue is given by _.
Answer: m / m – l
Q104. The probability that an arriving customer has to wait for receiving service is given by _.
Answer: ? / µ
Q105. Write the formula for calculating the expected number of customers in the system.
Answer: E(m/m > 0) = µ/(µ – ?)
Q106. Write the formula for calculating the average waiting time of the customer in the queue.
Answer: P(w = 0) = 1-P
Q107. Write the formula for E (m)
Answer: k+1/ 2k ?2/µ(µ-?)
Q108. Write the formula for E (w)
Answer: k+1/ 2k ?/µ(µ-?)
Q109. When the possible number of arrivals is limited, then we apply infinite queuing model. (True/False)
Answer: False
Q110. The queue discipline in a finite queuing process can be random. (True/False)
Answer: True
Q111. The efficiency factor for this model is F = T+U/ T+W. (True/False)
Answer: False
Q112. __ principle states that customers are served one at a time and that the customer that has been waiting the longest is served first.
Answer: First Come – First Served (FCFS)
Q113. __ discipline models give priority to rush jobs and important customers over others.
Answer: Priority
Q114. Simulation is useful to analyse problems where analytical solution is difficult. (True/False)
Answer: True
Q115. Simulation cannot be used where mathematical techniques can be used. (True/False)
Answer: False
Q116. Simulation solutions would be identical to those using mathematical techniques. (True/False)
Answer: False
Q117. Simulation may be called experimentation in the _ _.
Answer: Management laboratory
Q118. Random numbers have the property that any number is __ to occur.
Answer: Equally likely
Q119. The totality of probability assigned to the variable should always be equal to _.
Answer: 1
Q120. In any simulation problem, initial conditions are stated. (True/False)
Answer: True
Q121. Random numbers are assigned for cumulative probability values. (True/False)
Answer: True
Q122. Without identifying any relationship between variables, you can solve the simulation problem. (True/False)
Answer: False
Q123. A simulation model involves several variables making it impossible to determine the number of trials required to obtain the desired accuracy at a specified confidence level. (True/False)
Answer: True
Q124. Large number of trails require a great deal of computational effort and the use of computer becomes optional. (True/False)
Answer: False
Q125. A practical indicator of when to stop simulation trials is when the results that violently fluctuate initially tend to stabilise if the simulation is continued. (True/False)
Answer: True
Q126. Which of the following is not correct?
a) Randomness is a key requirement of Monte-Carlo simulation.
b) Monte-Carlo simulation involves modelling a deterministic system.
c) Simulation is a statistical experiment as such its results are subject to statistical error.
d) In Monte-Carlo simulation, a problem is solved by simulating the original data with random number generators.
Answer: (b) Monte-Carlo simulation involves modelling a deterministic system.
Q127. The technique of Monte-Carlo involves the selection of _ observations within the _ model.
Answer: Random, Simulation
Q128. The _ and the project duration can be found out with a randomly selected activity times for each activity.
Answer: Critical path
Q129. The range of application of simulation in _ is extremely wide
Answer: Business
Q129. An advantage of simulation as opposed to optimisation is that:
a) Several options of measure of performance can be examined.
b) Complex reallife problems can be studied.
c) It is applicable in cases where there is an element of randomness in a system.
d) All the above.
Answer: (d) All of the above.
Q130. Large complicated simulation models are appreciated because:
a) Their average costs are not well-defined.
b) It is difficult to create the appropriate events.
c) They may be expensive to write and use as an experimental device.
d) All of the above.
Answer: (c) They may be expensive to write and use as an experimental device.
Q131. Simulation should not be applied in all the cases because it:
a) Requires considerable talent for model building and extensive computer programming efforts.
b) Consumes much computer time.
c) Provides at best approximate solution to problem.
d) All of the above.
Answer: (d) All of the above.
Q132. Analytical results are taken into consideration before a simulation study so as to:
a) Identify suitable values of the system parameters.
b) Determine the optimal decision.
c) Identify suitable values of decision variables for the specific choices of system parameters.
d) All of the above.
Answer: (c) Identify suitable values of decision variables for the specific choices of system parameters.
Q133. Project consists of interrelated activities. (True/False)
Answer: True
Q134. Project activities are to be completed in a specified time according to a specified sequence. (True/False)
Answer: True
Q135. PERT and CPM identifies non-critical activities. (True/False)
Answer: True
Q136. PERT is an activity-oriented network. (True/False)
Answer: False
Q137. CPM is used for projects that are repetitive in nature.(True/False)
Answer: True
Q138. Events do not consume and _.
Answer: Time, resource
Q139. Arrow’s head number is _ than its tail number.
Answer: Greater than
Q140. Dummy activity is introduced in a network to keep proper _________relationship.
Answer: Precedence
Q141. Critical path calculation includes both and .
Answer: Forward pass & backward pass
Q142. In a project network, a sequence of activities may form a loop. (True/False)
Answer: False
Q143. A critical activity must have its total and free floats equal to zero. (True/False)
Answer: True
Q144. A non-critical activity cannot have zero total float. (True/False)
Answer: True
Q145. The critical path of project network represents the minimum duration needed to complete the network. (True/False)
Answer: True
Q146. The analysis in CPM does not take into account the cases where time estimates for the different activities are probabilistic. (True/False)
Answer: True
Q147. Competitive situations arise when or parties with __ operate.
Answer: Two, more, conflicting interest
Q148. The number of players or competitors is finite (True/False).
Answer: True.
Q149.If the sum of the gains of the players in a game is 1, the game is called zero-sum game (True/False)
Answer: False
Q150. A zero-sum game with two players is called a __ game.
Answer: Rectangular
Q151. During the game, if a player’s strategy is to adopt a specific course of action, irrespective of the opponent’s strategy is called __ strategy
Answer: Pure
Q152. If a player chooses his course of action according to pre-assigned probabilities, then the player’s strategy is called __ strategy.
Answer: Mixed
Q153. Saddle point occurs at row minimum and column maximum. (True/False)
Answer: True.
Q154. If the value of the game is zero, then it is called zero-sum game.(True/False)
Answer: True.
Q155. The pay off matrix represents the gain for top player.(True/False)
Answer: False
Q156. In the pay-off matrix, if each pay-off in rth row is greater than (or equal to) the corresponding pay-off insth row the , Ar dominates As , hence As is __.
Answer: Deleted
Q157. In the pay-off matrix, if each pay-off in pthcolumnis less than (or equal to) the corresponding pay-off in qth column, Bp, dominates Bq, hence Bq is _.
Answer: Deleted
