1. .................... defined Operations Research as “the art of winning wars without actually fighting.”
Correct : D. Arthur Clark
2. Operations Research is a very powerful tool for ........................
Correct : C. Decision making
3. Who defined Operations Research as scientific approach to problem solving for executive
management.
Correct : B. H M Wagner
4. The term “Operations Research” was coined in the year ...................
Correct : B. 1940
5. The innovative science of Operations Research was discovered during ......................
Correct : C. World war II
6. Operations Research has the characteristic that it is done by a team of .....................
Correct : A. Scientists
7. Operations Research emphasises on the overall approach to the system. This characteristic of
Operations Research is often referred to as .................................
Correct : D. Team approach
8. Operations Research cannot give perfect .................. to the problem.
Correct : C. Both a and b
9. ............................ models involve the allocation of resources to activities in such a way that some
measure of effectiveness is optimised.
Correct : B. Allocation
10. In .................. models, everything is defined and the results are certain.
Correct : B. Deterministic
11. ......................... models involve more risks and uncertainties.
Correct : A. Probabilistic
12. .......................... models are obtained by enlarging or reducing the size of the items.
Correct : A. Iconic models
13. The word .................. may be defined as some actions that we apply to some problems or
hypothesis.
Correct : B. Operations
14. ......................are representations of reality.
Correct : B. Models
15. .........................are called mathematical models.
Correct : B. Symbolic models
16. Probabilistic models are also called ...........................
Correct : C. Stochastic models
17. ........................ models assume that the values of the variables do not change with time during a
particular period.
Correct : B. Static
18. .......................models consider time as one of the important variable.
Correct : A. Dynamic
19. ........................may be defined as a method of determining an optimal program of interdependent
activities in view of available resources.
Correct : B. Linear programming
20. ..................... are expressed in the form of equations
Correct : B. Constraints
21. If there are more than one optimal solutions for the decision variables, the solution is ...........
Correct : C. Alternative
22. Dual of the dual s a ..........................
Correct : B. Primal
23. The quantitative approach to decision analysis is a ..........................
Correct : C. Scientific approach
24. A model is a ...........................
Correct : D. All of the above
25. The dummy source/destination in a transportation problem is added to ........................
Correct : A. Satisfy rim constraints
26. The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number
of positive allocations are:
Correct : C. m +n – 1
27. The method used for solving an assignment problem is:
Correct : C. Hungarian method
28. An assignment problem can be solved by .........................
Correct : C. Both a and b
29. For salesman who has to visit ‘n’ cities, which of the following are the ways of his tour plans:
Correct : C. (n-1) !
30. The assignment problem is:
Correct : D. All the above
31. The Hungarian method for solving an assignment problem can also be used to solve:
Correct : B. A travelling salesman problem
32. All the parameters in the linear programming model are assumed to be .....................
Correct : B. Constraints
33. Graphic method can be applied to solve a liner programming problem when there are only
........................... variables
Correct : B. Two
34. If the feasible region of a linear programming problem is empty, the solution is ....................
Correct : B. Infeasible
35. The variables whose coefficient vectors are unit vectors, are called ......................
Correct : B. Basic variables
36. Any column or row of a simplex table is known as .........................
Correct : C. Vector
37. .................... is considered as the pioneer of Linear Programming Technique.
Correct : D. George B Dantzig
38. A minimisation problem can be connected into maximisation problem by changing the signs of
coefficients in the ...........................
Correct : B. Objectives
39. In an LPP, if the solution of a variable can be made infinitely large without violating the
constraints, then the solution is ..............................
Correct : C. Unbounded
40. In maximisation cases, ....................... are assigned to the artificial variables as their coefficients in
the objective function.
Correct : A. + m
41. In simplex method, we add .......................... in the case of constraints with sign “=”
Correct : B. Artificial variable
42. In simplex method, ........................ should be selected when there is tie between slack/surplus
variable and decision variable.
Correct : B. Decision variable
43. When at least one of the basic variables is zero, then the basic feasible solution to a Linear
Programming Problem is said to be ..............................
Correct : C. Degenerate
44. In Linear Programming Problem, degeneracy occurs in ................. stages.
Correct : B. Two
45. Every Linear Programming Problem is related to another Linear Programming Problem, called
..........................
Correct : B. Dual
46. In a maximisation assignment problem, the objective is to maximise .............................
Correct : A. Profit
47. Operations Research does not give perfect solution to a problem, but it helps to improve the
......................... of the solution.
Correct : A. Quality
48. Operations Research makes a ...................... attack on complex problems to arrive at optimal
solution.
Correct : C. Both a and b
49. Operations Research uses models to help the management in determining its ....................
scientifically.
Correct : C. Both a and b
50. Operations Research is a ................................
Correct : C. Both a and b
51. ......................... deals with making sound decisions under conditions of certainty, risk and
uncertainty.
Correct : C. Decision theory
52. ....................... deals with the concepts such as critical path, float, events, etc.
Correct : D. Network analysis
53. ............................... is used to imitate an operation prior to actual performance.
Correct : B. Simulation
54. ............................... is concerned with determination of the most economic replacement policy.
Correct : D. Replacement theory
55. The O R technique which helps in minimising total waiting and service cost is:
Correct : B. Queuing theory
56. Linear Programming technique is a:
Correct : D. All of the above
57. A constraint in a Linear Programming Model restricts:
Correct : D. All of the above
58. Before formulating a formal L P model, it is better to:
Correct : D. All of the above
59. Linear Programming Technique helps to find an optimal use of:
Correct : D. All of the above
60. Which of the followings is an assumption of Linear Programming Technique?
Correct : D. All of the above
61. Which of the following is true with regard to a Linear Programming Model?
Correct : D. None of the these
62. The graphical method if LPP uses:
Correct : D. All of the above
63. Constraints in an LPP are treated as active, if they:
Correct : B. Represent optimal solution
64. While solving a LPP graphically, the area bounded by constraints is called .................
Correct : A. Feasible region
65. While solving an LPP, infeasibility may be removed by:
Correct : B. Removing a constraint
66. ........................variables are fictitious and cannot have any physical meaning.
Correct : C. Artificial variables
67. An optimal solution is considered as the ................... among the feasible solutions.
Correct : B. Best
68. ........................... method is used to solve an assignment problem.
Correct : B. Hungarian method
69. The allocated cells in the transportation table are called ..............................
Correct : A. Occupied cells
70. In transportation Problems, VAM stands for .........................
Correct : B. Vogel’s Approximation Method
71. Initial feasible solution to a transportation Problem can be found out by .........................
Correct : A. VAM
72. ........................ is applied to determine optimal solution.
Correct : C. MODI Method
73. A Transportation Problem is said to be unbalanced when total supply is not equal to ............
Correct : B. Total demand
74. For a minimisation Transportation Problem, the objective is to minimise:
Correct : B. Cost
75. ....................... is an important Operations Research Technique to analyse the queuing behaviour.
Correct : B. Waiting line theory
76. An organisation chart is an example of ...........................
Correct : C. Analogue model
77. ........................ model is a map which indicates roads, highways, towns and inter-relationships
Correct : B. Analogue model
78. Operations Research techniques help to find ................... solution.
Correct : C. Optimal solution
79. Operations Research Techniques involves ..................... approach.
Correct : C. Individual approach
80. A LPP model doesnot contain:
Correct : D. Spread Sheet
81. Straight lines shown in a linear programming graph indicates ...........................
Correct : B. Constraints
82. Non-negativity constraints are written as ......................
Correct : C. Greater than or equal to
83. PERT stand for:
Correct : B. Programme Evaluation Review Technique
84. An activity which must be completed before commencement of one or more other activities is
called.................................
Correct : B. Predecessor activity
85. In network diagram, events are commonly represented by .........................
Correct : B. Nodes
86. ......................... is activity oriented network diagram.
Correct : A. CPM
87. ................... is an event oriented network diagram.
Correct : B. PERT
88. An activity which does not consume either resource or time is called .............................
Correct : C. Dummy activity
89. ......................... is a series of activities related to a project.
Correct : A. Network
90. An event which represents the beginning of more than one activity is a :
Correct : C. Burst event
91. Activities lying on critical path are called ............................
Correct : A. Critical activities
92. Activities that cannot be started until one or more of the other activities are completed, are
called..........................................
Correct : C. Successor activities
93. ............................ is the sequence of activities which determines the total project duration.
Correct : A. Critical path
94. PERT emphasises on ...........................
Correct : B. Time
95. ..................... is the duration by which an activity can be delayed without delaying the completion
of the project.
Correct : C. Latest Start Time
96. The EST + activity duration = ..............................
Correct : A. Earliest Finish Time
97. ............................ is the latest time by which an activity can be finished without delaying the
completion of the project.
Correct : B. LFT
98. ......................... is a scheme or design of something intended to do.
Correct : A. Network
99. In a network diagram, activity is denoted by ............................
Correct : B. Arrow
100. .......................... is the duration by which an activity can be delayed without delaying the project.