Mcqs On Operations Research
Mcqs On Operations Research
A. economical
B. scientific
C. a and b both
D. artistic
A. mathematical models
C. diagrammatic models
A. Suitable manpower
C. Financial operations
4. Operations research is based upon collected information, knowledge and advanced study of various
factors impacting a particular operation. This leads to more informed ----------- --------------------------.
A. Management processes
B. Decision making
C. Procedures,
D. Survey results.
1
6. The objective function and constraints are functions of two types of variables, _______________
variables and ____________ variables.
A. Positive and negative
B. Controllable and uncontrollable
C. Strong and weak
D. None of the above
7. Operations research was known as an ability to win a war without really going in to ____
A. Battle field
B. Fighting
C. The opponent
D.Both A and B
8. Who defined OR as scientific method of providing executive departments with a quantitative basis for
decisions regarding the operations under their control?
A.Morse and Kimball (1946)
B. P.M.S. Blackett (1948),
C. E.L. Arnoff and M.J. Netzorg
D. None of the above
13. What have been constructed from OR problems and methods for solving the models that are available
in many cases?
2
A. Scientific Models
B. Algorithms
C. Mathematical Models
D. None of the above
14. Which technique is used in finding a solution for optimizing a given objective, such as profit
maximization or cost reduction under certain constraints?
A. Quailing Theory,
B. Waiting Line,
C. Both A and B,
D. Linear Programming,
15. OR techniques help the directing authority in optimum allocation of various limited resources
like_____________
A. Men and Machine
B. Money
C. Material and Time
D. All of the above
16. The Operations research technique which helps in minimizing total waiting and service costs is
A. Queuing Theory,
B. Decision Theory,
C. Both A & B,
D. None of the above,
24. The solution to a transportation problem with m-rows and n-columns is feasible if number of positive
allocations are
(a) m + n
(b) m *n ,
(c) m+n-l,
(d) m+n+l,
25. One disadvantage of using North-West Corner Rule to find initial solution to the transportation
problem is that
A. it is complicated to use,
B. it does not take into account cost of transportation
C. it leads to degenerate initial solution,
D. all of the above,
26. The occurrence of degeneracy while solving a transportation problem means that ---
A. total supply equals total demand,
B. the solution so obtained is not feasible,
C. the few allocations become negative
D. none of the above,
28. 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. Modified distribution method
D. All of the above,
29. The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at
unused cell because
A. It improve the total cost,
B. It does not disturb rim conditions,
C. It ensure feasible solution,
D. All of the above,
30. The procedure used to solve assignment problems wherein one reduces the original assignment costs
to a table of opportunity costs is called __________.
A. stepping-stone method
B. matrix reduction
C. MODI method
D. northwest reduction
E. simplex reduction,
31. The net cost of shipping one unit on a route not used in the current transportation problem solution is
called the __________.
A. change index,
B. new index,
C. MODI index,
D. idle index,
E. Improvement index,
32. Which of the following is a method for improving an initial solution in a transportation problem?
A. northwest-corner
B. intuitive lowest-cost
C. southeast-corner rule
D.Stepping-stone,
5
33.
A. 40,
B. 60,
C. 80,
D. 100,
E. none of the above,
34. . Which of the following is used to come up with a solution to the assignment problem?
A. MODI method
B. northwest corner method
C. stepping-stone method
D. Hungarian method
E. none of the above
35. what is concerned with the prediction of replacement costs and determination of the most economic
replacement policy.
A. Search theory
B. Theory of replacement,
C. Probabilistic programming,
D. Optimization program.
A-An infinite number of solutions all of which yield the same profit,
B, In infinite number of solution all of which yield the same cost,
C. An infinite number of optimal solutions.
D. A boundary of the feasible region.
37. Monte carlo solutions in queuing theory are extremely useful in queuing problems
6
A. that can’t be analysed mathematically,
B. involving multistage queuing,
C. to verify mathematical results,
D. All the above,
38. In Graphical solution of maximisation problem, the line, which we move from origin to the extreme point of
the polygon is :
(a) Any one side of the polygon,
(b) Iso cost line,
(c) Iso profit line,
(d) An imaginary line,
40. The problem, which is used to disburse the available limited resources to activities, is known as
(a) O.R. Model,
(b) Resources Model,
(c) Allocation Model,
(d) Activities model.
42. Which one of the following is a part of every game theory model?
A. Players,
B. Payoffs,
C. Probabilities.
D. Strategies.
43. In game theory, a choice that is optimal for a firm no matter what its competitors do is referred to as
A. the dominant strategy,
B. the game winning choice,
C. super optimal,
D. a gonzo selection.
7
45. Which of the following is an example of a game theory strategy?
A. You scratch my back and I’ll scratch yours,
B. If the shoe fits, wear it.
C. Monkey see, monkey do.
D. None of the above.
46. In game theory, a situation in which one firm can gain only what another firm loses is called a
A. nonzero-sum game.
B. prisoners’ dilemma,
C. zero-sum game.
D. cartel temptation
51. A game that involves interrelated decisions that are made over time is a
A. Sequential game,
B. Repeated game,
C. Zero sum game,
D. Non zero sum game.
52. A game that involves multiple moves in a series of identical situations is called a
A. Sequential game,
B.- Repeated game,
C. Zero sum game,
8
D. Non zero sum game.
54. Replacement of ----------------, which looses its operating efficiency due to aging (passage of time), or due to
continuous usage (due to wear and tear of components)
A. Capital investment,
B. Capital equipment,
C. New Machinery,
D. Old Machinery.
56. When sequencing jobs, an approach which may be used to help in a cash constrained situation is:
57. If the operation selects a sequencing approach purely on practical reasons for an activity such as unloading
cases from an aircraft, it may choose:
A. FIFO,
B. Due date,
C. Shortest operation time first.
D. Last in first out(LIFO),
E. Longest operation time first.
58. If the operation selects a sequencing approach which will appear fair to its customers it may choose:
A.FIFO,
B. Due date,
C. Shortest operation time first.
D. Last in first out(LIFO),
E. Longest operation time first.
62. When money value changes with time at 10 %, then PWF for first year is :
(a) 1,
(b) 0.909,
(c) 0.852,
(d) 0.9.
63. Which of the following maintenance policies is not used in old age stage of a machine?
(a) Operate up to failure and do corrective maintenance,
(b) Reconditioning,
(c) Replacement,
(d) Scheduled preventive maintenance.
64. When money value changes with time at 20%, the discount factor for 2nd year is:
(a) 1,
(b) 0.833,
(c) 0,
(d) 0.6955,
66. When the probability of failure reduces gradually, the failure mode is said to be:
(a) Regressive,
(b) Retrogressive,
(c) Progressive,
(d) Recursive.
70. Decreasing failure rate is usually observed in ………………. stage of the machine
(a) Infant,
(b) Youth,
(c) Old age,
(d) Any time in its life.
11
71. Which cost of the following is irrelevant to replacement analysis?
(a) Purchase cost of the machine,
(b) Operating cost of the machine,
(c) Maintenance cost of the machine,
(d) Machine hour rate of the machine.
72. The type of failure that usually occurs in old age of the machine is
(a) Random failure,
(b) Early failure,
(c) Chance failure,
(d) Wear-out failure.
74. The chance failure that occurs on a machine is commonly found on a graph of
time Vs failure rate (on X and Y axes respectively as ---
(a) Parabolic,
(b) Hyperbolic,
(c) Line nearly parallel to X-axis,
(d) Line nearly parallel to Y-axis.
85. The time required for printing of four books A, B, C and D is 5, 8, 10 and 7 hours. While its
data entry requires 7, 4, 3 and 6 hours respectively, the sequence time that minimizes total
elapsed time is
(a) ACBD,
(b) ABCD,
(c) ADCB,
(d) CBDA.
86. If there are ‘n’ jobs and ‘m’ machines, there will be .......... sequences of doing the jobs.
(a) n × m,
(b) m × n,
14
(c) nm,
(d) ( n !)m.
88. In solving 2 machines and ‘n’ jobs, which of the following assumptions is wrong?
(a) No passing is allowed,
(b) Processing times are known,
(c) Handling time is negligible,
(d) The time of processing depends on the order of machining.
89. The following is the assumption made in the processing of ‘n’ jobs on 2 machines:
(a) The processing time of jobs is exactly known and is independent of order of processing,
(b) The processing times are known and they depend on the order of processing the job,
(c) The processing time of a job is unknown and it is to be worked out after finding the
sequence,
(d) The sequence of doing jobs and processing times is inversely proportional.
90. As per queue discipline the following is not a negative behaviour of a customer:
(a) Balking
(b) Reneging,
(c) Boarding
(d) Collusion.
96. If the operating characteristics of a queue are dependent on time, then is said to be:
(a) Transient state,
(b) Busy state,
(c) Steady state
(d) Explosive state.
97. When the operating characteristics of the queue system dependent on time, then it is said
to be:
(a)Steady state
(b) Explosive state
16
(c) Transient state
(d) Any one of the above
ans : d
17