Q1. Operations research approach is
(a) Multidisciplinary
(b) Scientific
(c) Intuitive
(d) All of the above
Answer: (a)
Q2. Operations research analysts do not
(a) Predict future operations
(b) Build more than one model
(c) Collect relevant data
(d) Recommend decision and accept
Answer: (a)
Q3. For analyzing a problem, decision makers should normally study its
(a) Quantitative aspect
(b) Qualitative aspects
(c) Both (a) and (b)
(d) Neither (a) nor (b)
Answer: (c)
Q4. OR techniques are also applied in cash flow analysis and —
Answer: Capital Budgeting
Q5. The area of operations research that concentrates on real-world operational problems is known as —
Answer: Production systems
Q6. The area of production systems presents special challenges for —
Answer: Operation Researchers
State true or false:
Q7. There is no unique set of problems which can be solved using OR models or techniques.
Answer: True
Q8. OR methods and techniques are only applicable to big enterprises.
Answer: False
Q9. OR can be applied in almost all disciplines of management such as marketing, finance, HR, research and development.
Answer: True
Q10. OR approach is typically based on the use of — model.
Answer: Mathematical
Q11. Monthly plan of processes to be carried on is an example of —.model.
Answer: Functional
Q12. There are two types of ———models—Verbal Models and Mathematical Models.
Answer: Symbolic
Q13. Linear Programming is a
(a) constrained optimization technique
(b) Technique for economic allocation of limited resource
(c) Mathematical technique
(d) All of the above
Answer: (d)
Q14. A constraint in a LP model restricts
(a) Value of an objective function
(b) Value of a decision variable
(c) Use of the available resources
(d) All of the above
Answer: (d)
Q15. Constraints of an LP model represents
(a) Limitations
(b) Requirements
(c) Balancing limitations and requirements
(d) All of the above
Answer: (d)
Q16. Graphical method can be used only if there are ——decision variables.
Answer: Two
Q17. While solving a LP graphically the area bounded by the constraints is called ——
Answer: Feasible region
Q18. If the given problem is maximization, Zmax then locate the solution point at the —point of the feasible zone from the origin
Answer: far most
Q19. Solve the following LPP problem using simplex method.
Maximize ‘Z’ = 7x 1 + 5×2
[Subject to constraints]
x1 + x2 ? 6
4×1 + 3×2 ? 12
Where,
x1, x2 ? 0
[Non-negativity constraints]
Answer: z = 21
Q20. Solve the following LPP problem using simplex method.
Maximise
‘Z’
= 5x + 7x [Subject to constraints]
1 2
= x + x ? 4
1 2= 3x – 8x ? 24
1 2= 10x + 7x ? 35
1 2Where,
x1, x2 ? 0
[Non-negativity constraints]
Answe: z = 28
Q21. The element common to the incoming and outgoing vector is called —— .
Answer: key element or pivotal element
Q22. A ——— variable represents unused resources and are added to original objective function with zero coefficients.
Answer: slack
Q23. A ——— Variable represents amount by which solution value exceed a resource.
Answer: surplus
Q24. Solve the following LPP using the Big M method.
Maximise ‘Z’ = 40×1 + 60×2
[Subject to constraints]
2x 1 + x2 ? 70
x1 + x2 ? 40
x1 + x2 ? 40
x + 3x ? 90
1 2Where, x , x ? 0
Answer: z = 2,100
Q25. Solve the following LPP using the Big M method.
Maximise ‘Z’ = 5x + 3x [Subject to constraints]
1 2
x + x ? 6
1 22×1 + 3x 2 ? 3
x1 ? 3
x2 ? 3
Where, x 1, x2 ? 0
Answer: z = 7.45 – 3.51m
Q26. The optimal solution of the primal problem appears under the —— variables in the ——— row of the final simplex table associated with the dual problem.
Answer: slack, last
Q27. The —. analysis involves “what if” questions.
Answer: sensitivity
Q28. The original linear programming problem is known as ——. problem.
Answer: Parimal
State true or false:
Q29. One part of a Linear Programming Problem (LPP) is called the Primal and the other part is called the Dual.
Answer: True
Q30. In the primal problem, the objective function is a exponential combination of n variables.
Answer: False
Q31. In the dual problem, the dual vector multiplies the constants that determine the positions of the constraints in the primal.
Answer: True
Q32. Duality is quite useful when investigating changes in the parameters of an LPP( the technique known as sensitivity analysis).
Answer: True
Q33. It is advantageous to solve the dual of a primal having less number of constraints because the number of constraints usually equals the number of iterations required to solve the problem.
Answer: True
Q34. Transportation problem applies to situations where a set of commodities is to be transported
from source to another.
Answer: False
Q35. The cost of transportation per unit varies between different supply points,
Answer: False
Q36. In transportation problems, there are supply constraints for each destination.
Answer: False
Q37. The most important objective of a transportation problem is to maximize the cost of shipping.
Answer: False
Q38. The transportation problem is an extension of transshipment problem.
Answer: False
Q39. There may be routes that are unavailable to transport units from one source to one or more destinations.
Answer: True
Q40. In transshipment problem, each node makes supplies to the other.
Answer: False
Q41. Degeneracy is the condition when the number of filled cells is less than the number of rows plus the number of columns minus one.
Answer: True
Q42. Degeneracy involves ——steps.
Answer: Two
Q43. To resolve degeneracy at the initial solution, allocate a small positive quantity e to one or more unoccupied cell that have ——transportation costs.
Answer: Lowest
.
Q44. —may occur either at the initial stage or at subsequent iterations.
Answer: Degeneracy
Q45. When total supply is equal to the total demand in a transportation problem, the problem is said to be
(a) Balanced
(b) Unbalanced
(c) Degenerate
(d) All of the above
Answer: (a)
Q46. 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) MODI method
(d) All of the above
Answer: (c)
Q47. MODI method and stepping stone method is used for this purpose
(a) To find out initial basic feasible solution
(b) Optimal solution
(c) Multiple solution
(d) All of the above
Answer: (b)
Q48. — is an extension of the transportation problem in which the commodity can be transported to a particular destination through one or more intermediate or trans-shipment nodes.
Answer: Trans-shipment
Q49. A very —cost is applied to prohibited routes.
Answer: High
Q50. The objective of the transshipment problem is to determine how many units should be shipped over each node so that all the demand requirements are met with the minimum —.
Answer: TransportationCost
Q51. An assignment problem will have the following solution
(a) optimal
(b) unique
(c) multiple
(d) all of the above
Answer: (d)
Q52. Maximization assignment problem is transformed into 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 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: (c)
Q53. The main objective of an assignment problem is to
(a) Minimize the total cost
(b) Maximize the sales and returns.
(c) Both (a) and (b)
(d) None
Answer: (c)
Q54. An assignment problem is said to be unbalanced when ——
Answer: number of rows is not equal to the number of columns
Q55. When the number of rows is equal to the number of columns then the problem is said to be ——. assignment problem.
Answer: Balanced
Q56. For solving an assignment problem the matrix should be a ——. matrix.
Answer: Square
Q57. An assignment problem will have the following solution:
(a)optimal
(b) unique
(c) multiple
(d) all of the above
Answer: (d)
Q58. Maximisation assignment problem is transformed into 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 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: (c)
Q59.When an assignment problem has more than one solution, then it is
(a) Multiple Optimal solution
(b) The problem is unbalanced
(c) Maximization problem
(d) Balanced problem
Answer: (a)
Q60. If the given matrix is not a —matrix, the assignment problem is called an unbalanced problem
Answer: Square
Q61. A dummy row(s) or column(s) with the cost elements as —. is added to convert the matrix of an unbalanced assignment problem as a square matrix.
Answer: Zero
Q62. A given assignment problem can be classified into balanced or unbalanced on the basis of —
Answer: Number of jobs and resources
State true or false:
Q63. For a salesman to visit n cities, there are (n+1)! ways to plan his tour.
Answer: False
Q64. An essential condition in a travelling salesman problem is that a salesman, who wishes to travel through his territory visiting various cities, wishes to visit one city only once.
Answer: True
Q65. Mere Reduction is not the solution to travelling salesman problem; hence the solution is to find an optimal route that could achieve the objective of the salesman.
Answer: True
Q66. The list of all possible actions that a player takes for every payoff.
Answer: Strategy
Q67. A strategy that always involves selecting a particular course of action with the probability of 1.
Answer: Pure Strategy
Q68. The strategy to choose at least two courses of action with fixed probabilities.
Answer: Mixed strategy
Q69. A situation where both the players are facing pure strategies.
Answer: Saddle Point
Q70. The “expected gain to a player” if the player and his opponent use their best strategies.
Answer: Value of the Game
State true or false:
Q71. Two-person-zero-sum game without saddle point is called pure strategy games.
Answer: False
Q72. One of the important assumptions in a two person zero sum game is that each player has a finite number of strategies.
Answer: True
Q73. Two-person-zero-sum game with saddle point is called mixed strategy games.
Answer: False
Q74. What happens when maximin and minimax values of the game are same?
(a) No solution exists
(b) Solution is mixed
(c) Saddle point exists
(d) None of the above
Answer: (c)
Q75. In a mixed strategy game
(a) No saddle point exists
(b) Each player selects the same strategy without considering other player’s choice
(c) Each player always selects same strategy
(d) All of the above
Answer: (a)
Q76. When the sum of the gains of one player is equal to the sum of losses to another player in the game, this situation is known as
(a) Biased game
(b) Zero-sum game
(c) Fair game
(d) All of the above
Answer: (b)
Q77. The time interval between starting the first job and completing the last job including the idle time (if any) in a particular order by the given set of machines.
Answer: Total elapsed time
Q78. Order or sequence in which machines are required for completing the job.
Answer: Processing Order
Q79. The condition to be satisfied in which the order of jobs are to be processed on given machines.
Answer: No passing Rule
State true or false.
Q80. One machine – one job is not an assumption in solving sequencing problems
Answer: False
Q81. If there are two least processing times for machine A and machine B, priority is given for the processing time which has lowest time of the adjacent machine.
Answer: True
Q82. There can be four types of sequencing problems depending upon number of jobs and number of machines.
Answer: False
Q83. A firm is considering replacement of a machine whose cost is ` 12, 200 and scrap value is Rs. 200. The maintenance costs are found from experience to be as follows:
Year Maintenance cost (Rs.)
1 200
2 500
3 800
4 1,200
5 1,800
6 2,500
7 3,200
8 4,000
When should the machine be replaced?
a. At the end of 6th year or beginning of 7 th year
b. At the end of 4th year
c. At the end of 8th year
d. At the beginning of 5th year
Answer: (a) The machine is to be replaced at the end of the 6th year or at the beginning of the 7th year as the maintenance cost of the 7th year becomes higher than the average cost of maintaining the machine at the end of the 6th year.
Q84. Which of the following characteristics apply to queueing system
(a) Customer perception
(b) Arrival process
(c) Both a and b
(d) none of the above
Answer: (c)
Q85. The cost of providing service in a queueing system decreases with
(a) Decreased average waiting time in a queue
(b) Decreased arrival time
(c) Increased arrival rate
(d) None of the above
Answer: (d)
Q86. Priority queue discipline may be classified as
(a) Finite or infinite
(b) Limited or unlimited
(c) Preemptive or non preemptive
(d) All of the above
Answer: (c)
Q87. A bank transaction or grocery store checkout counter is an example of ——.system.
Answer: Single Phase
Q88. —— specifies the average number of customers per time period.
Answer: Arrival
Q89. The ——. governs capacity of the service system.
Answer: Service
Q90. It is the fluctuation in —— and —.patterns that causes wait in queuing system.
Answer: arrival, service
Q91. When customer changes one line to another to reduce wait time, process is called —.
Answer: jockeying
State true or false:
Q92. An important assumptions in Single server Queuing model 1 is that the customers are served on a First-in, First-out basis (FIFO).
Answer: True
Q93. If arrival rate is lesser than or equal to the service rate, the waiting line would increase without limit.
Answer: False
Q94. Traffic intensity in a system of steady state is given by P = l /µ.
Answer: True
Q95. For Poisson arrivals at the constant rate l per unit, the time between successive arrivals (inter-arrival time) has the exponential distribution.
Answer: True
Q96. The shortest time taken to complete an activity.
Answer: Optimistic
Q97. The technique in which the time estimates are assumed to be known with certainty.
Answer: CPM
Q98. An imaginary activity that does not consume any resource and time
Answer: dummy activity
Q99. Activities that must be used only if it is necessary to reduce the complexity of the network.
Answer: dummy activities
Q100. A —— has no slack.
Answer: critical activity
Q101. The —— of an activity is the amount of time available by which it is possible to delay its completion time without extending the overall project completion time.
Answer: float
Q102. —— refers to analyzing and evaluating the actual progress against the plan.
Answer: controlling
Q103. Project Management consists of —— phases.
Answer: three
Q104. An —— represents an action and consumption of resources required to complete a portion of a project.
Answer: activity
Q105. — is the method to analyse the involved tasks in completing a given project.
Answer: PERT
Q106. Planning can be explained as the process of —— and —— a plan.
Answer: creating, maintaining
Q107. The probability of completing the project within the scheduled time or contracted time may be obtained by using the ——
Answer: Standard normal deviate
Q108. —— analysis is the general time given to certain specific techniques which can be used for the planning, management and control of projects.
Answer: network
Q109. Pessimistic time is the —— time an activity would take to complete.
Answer: longest
Q110. —— time is the normal time taken to complete an activity.
Answer: Most likely
Q111. State true or false:
The cost which is incurred to place an order is called as carrying cost.
Answer: False
Q112. Carrying cost is usually represented in terms of percentage on purchase price of average quantity to be held.
Answer: True
Q113. EOQ concept can be studied under two situations: in the absence of quantity discounts and in the presence of quantity discounts.
Answer: True
Q114. When the price to be paid for an unit of a material is fixed, the price goes on ———when the lot size increases.
Answer: Reduced
Q115. Under the —method, generally the total cost of ordering two lots would be considered and the quantity discount to be availed and the lot which reveals the lowest total cost inclusive of the purchase price is said to be the EOQ.
Answer: Cost Comparison method
Q116. Under — approach, the EOQ is decided based on the total annual cost associated with different lots and the lot with least total annual cost would be chosen.
Answer: Price Break
Q117.The time lag between indenting and receiving materials or the time gap between placing an order and receiving the materials.
Answer: Lead Time
Q118. The maximum quantity of material which a store can hold at any point of time.
Answer: Maximum stock Level
Q119. Inventory level that represents that the purchaser has to place fresh orders for the materials.
Answer: Reorder Level
Q120. Different types of decision-making environment.
Answer: Certainty, Risk and uncertainty
Q121. Discovery or recognition of data that are assembled into an information system.
Answer: Cognition
Q122. Two most common flaws in decision-making
Answer: Inertia and impatience
Q123. Decision-making environment in which each alternative leads to one and only one consequence, and a choice among alternatives is equivalent to a choice among consequences.
Answer: Decision-making under certainty
State true or false:
Q124. A decision tree is used as a visual and analytical tool, where the expected values (or expected utility) of competing alternatives are calculated.
Answer: True
Q125. A decision Tree consists of 4 types of nodes.
Answer: False
Q126. End nodes are represented by triangles in a decision tree.
Answer: True
Q127. In —— situation, there in no control over the occurrence of given state of nature.
Answer: probabilistic
Q128. The —— value may be intuitively understood by the law of large numbers.
Answer: expected
Q129. The —— may be defined as the maximum amount one would be willing to pay to obtain perfect information about the state of nature that would occur.
Answer: Expected Value of Perfect Information (EVPI)
Q130. A —— is used as a visual and analytical tool, where the expected values (or expected utility) of competing alternatives are calculated.
Answer: decision tree
Q131. The —— criterion assures the decision maker that he will earn no less (or pay no more) than some specified amount.
Answer: pessimistic decision
Q132. Decision under certainty means that each alternative leads to ——
Answer: one and only one consequence
Q133. All types of human decision-making are —— processes.
Answer: intellectual
