100% found this document useful (2 votes)
10K views17 pages

Mcqs On Operations Research

Operations research is the application of scientific and mathematical methods to arrive at optimal solutions to problems. Mathematical models are prepared to represent different situations. Operations research uses quantitative techniques, models and tools to solve problems within a system. It evaluates the effects of quantifiable factors to support informed decision making. Operations research was developed to help management determine optimal policies and actions. It uses techniques like linear programming and queuing theory to optimize objectives like profit maximization under constraints.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100% found this document useful (2 votes)
10K views17 pages

Mcqs On Operations Research

Operations research is the application of scientific and mathematical methods to arrive at optimal solutions to problems. Mathematical models are prepared to represent different situations. Operations research uses quantitative techniques, models and tools to solve problems within a system. It evaluates the effects of quantifiable factors to support informed decision making. Operations research was developed to help management determine optimal policies and actions. It uses techniques like linear programming and queuing theory to optimize objectives like profit maximization under constraints.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

MCQs on Operations Research

1. Operations research is the application of ____________methods to arrive at the optimal Solutions to


the problems.

A. economical

B. scientific

C. a and b both

D. artistic

2. In operations research, the ------------------------------are prepared for situations.

A. mathematical models

B. physical models diagrammatic

C. diagrammatic models

3. Operations management can be defined as the application of ----------------------------------- -------to a


problem within a system to yield the optimal solution.

A. Suitable manpower

B. mathematical techniques, models, and tools

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.

5. OR can evaluate only the effects of --------------------------------------------------.


A. Personnel factors.
B. Financial factors
C.Numeric and quantifiable factors.
D. Data’s,

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

9. OR has a characteristic that it is done by a team of …


A. Scientists
B. Mathematicians
C. Academics
D. All of the above

10. Hungarian Method is used to solve..


A. A transportation problem
B.A travelling salesman problem
C. A LP problem
D. Both a & b

11. A solution can be extracted from a model either by


A. Conducting experiments on it
B. Mathematical analysis
C. Both A and B,
D. Diversified Techniques

12. OR uses models to help the management to determine its _____________


A. Policies
B. Actions
C. Both A & B,
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,

17. What is the objective function in linear programming problems?


A. A constraint for available resource
B. An objective for research and development of a company
C. A linear function in an optimization problem
D. A set of non-negativity conditions

18. Which statement characterizes standard form of a linear programming problem?


A. Constraints are given by inequalities of any type,
B. Constraints are given by a set of linear equations
C. Constraints are given only by inequalities of >= type
D. Constraints are given only by inequalities of <= type

19. Feasible solution satisfies __________


A. Only constraints
B. only non-negative restriction,
C.[a] and [b] both,
D. [a],[b] and Optimum solution

20. In Degenerate solution value of objective function _____________.


A. increases infinitely
3
B. basic variables are nonzero
C. decreases infinitely,
D. One or more basic variables are zero

21. Minimize Z = ______________


A. –maximize(Z)
B. maximize(-Z)
C. maximize(-Z)
D. none of the above,

22. In graphical representation the bounded region is known as _________ region.


A. Solution,
B. basic solution
C. feasible solution,
D. optimal,

23. Graphical optimal value for Z can be obtained from ……


A. Corner points of feasible region,
B. Both a & c,
C. corner points of the solution region,
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,

27. The degeneracy in the transportation problem indicates that—


A. Dummy allocation(s) needs to be added
B. The problem has no feasible solution
C.The multiple optimal solution exist,
4
D. a & b but not c

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.

36. An iso profit line represents.

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,

39. The constraints of Maximisation problem are of ------


(a) Greater than or equal type,
(b) Less than or equal type,
(c) Less than type,
(d) Greater than type,

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.

41. The first step in solving Operations Research problem is----


(a) Model building,
(b) Obtain alternate solutions,
(c) Obtain basic feasible solutions,
(d)Formulation of the problem.

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.

44. Game theory is concerned with--


A. predicting the results of bets placed on games like roulette.
B. the choice of an optimal strategy in conflict situations.
C. utility maximization by firms in perfectly competitive markets,
D. the migration patterns of caribou in Alaska.

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

47. Which of the following is a nonzero-sum game?


A. Prisoners’ dilemma,
B. Chess,
C. Competition among duopolists when market share is the payoff,
D. All the above,

48. Which of the following is a zero-sum game?


A. Prisoners’ dilemma,
B. Chess,
C. Competition among duopolists when market share is the payoff,
D. All the above,

49. In game theory, the outcome or consequence of a strategy is referred to as the


A. Payoff,
B. Penalty,
C. Reward,
D. End game strategy,

50. A strategy that is best regardless of what rival players do is called……


A. first-mover advantage.,
B. a Nash equilibrium strategy.
C. Tit- for –tat,
D. Dominant strategy.

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.

53. In graphical method the restriction on number of constraint is __________.


A. 2,
B. not more than 3,
C. 3,
D. none of the above,

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.

55. The name Operations Research is first coined in the year,


(a) 1945, (b) 1940, (c) 1935, (d) 1950

56. When sequencing jobs, an approach which may be used to help in a cash constrained situation is:

A.Shortest operation time first (SOT),


B. Last in first out (LIFO)
C First in first out (FIFO),
D. Longest operation Time first(LOTF)

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.

59. Graphical method is only suitable to______ sequencing


A. 2 jobs ‘ n’ machines,
B. n jobs \2 machines,
C. n jobs 3 machines,
D. n jobs k machines.

60. The expression ( 1+r)-n , is known as the payment…


9
A. Compound amount factor (CAF),
B. Discount rate,
C. Replacement policy.
D. Group replacement policy.
61. Contractual maintenance or agreement maintenance with manufacturer is suitable for equipment,
which is

(a) In its infant state,


(b) When machine is old one,
(c) Scrapped,
(d) None of the above.

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,

65. Which of the following replacement policies is considered to be dynamic in nature?


(a) Time is continuous variable and the money value does not change with time,
(b) When money value does not change with time and time is a discrete variable,
(c) When money value changes with time,
10
(d) When money value remains constant for some time and then goes on changing with time

66. When the probability of failure reduces gradually, the failure mode is said to be:
(a) Regressive,
(b) Retrogressive,
(c) Progressive,
(d) Recursive.

67. The following replacement model is said to be probabilistic model:


(a) When money value does not change with time and time is a continuous variable,
(b) When money value changes with time,
(c) When money value does not change with time and time is a discrete variable,
(d) Preventive maintenance policy.

68. A machine is replaced with average running cost


(a) Is not equal to current running cost,
(b) Till current period is greater than that of next period,
(c) If current period is greater than that of next period,
(d) If current period is less than that of next period.

69. The curve used to interpret machine life cycle is


(a) Bath tub curve,
(b) Time curve,
(c) Product life cycle,
(d) Ogive curve.

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.

73. Group replacement policy is most suitable for:


(a) Trucks,
(b) Infant machines,
(c) Street light bulbs,
(d) New cars.

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.

75. Replacement of an item will become necessary when


(a) Old item becomes too expensive to operate or maintain,
(b) When your operator desires to work on a new machine,
(c) When your opponent changes his machine in his unit,
(d) When company has surplus funds to spend.
12
76. The production manager will not recommend group replacement policy
(a) When large number of identical items are to be replaced,
(b) In case Low cost items are to be replaced, where record keeping is a problem,
(c) For items that fail completely,
(d) For Reparable items.

77. In replacement analysis the maintenance cost is a function of:


(a) Time,
(b) Function,
(c) Initial investment,
(d) Resale value.

78. A competitive situation is known as:


(a) Competition,
(b) Marketing,
(c) Game,
(d) None of the above.

79. One of the assumptions in the game theory is:


(a) All players act rationally and intelligently,
(b) Winner alone acts rationally,
(c) Loser acts intelligently,
(d) Both the players believe in luck.

80. A play is played when:


(a) The manager gives green signal,
(b) Each player chooses one of his courses of action simultaneously,
(c) The player who comes to the place first says that he will start the game,
(d) The late comer says that he starts the game.

81. The list of courses of action with each player is


(a) Finite,
(b) Number of strategies with each player must be same,
(c) Number of strategies with each player need not be same,
13
(d) None of the above.

82. A game involving ‘n’ persons is known as:


(a) Multimember game,
(b) Multiplayer game,
(c) n-person game,
(d) Not a game.

83. Theory of Games and Economic Behaviour is published by:


(a) John Von Neumann and Morgenstern,
(b) John Flood
(c) Bellman and Neumann,
(d) Mr. Erlang,

84.. The objective of sequencing problem is


(a) To find the order in which jobs are to be made,
(b) To find the time required for completing all the jobs on hand,
(c) To find the sequence in which jobs on hand are to be processed to minimize the total
time required for processing the jobs,
(d) To maximize the effectiveness.

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.

87. In general, sequencing problem will be solved by using ………….


(a) Hungarian Method,
(b) Simplex method,
(c) Johnson and Bellman method,
(d) Flood’s technique.

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.

91. The expediting or follow up function in production control is an example of


(a) LIFO
(b) FIFO
(c) SIRO
15
(d) Pre emptive.

92. In M/M/S: N/FIFO the following does not apply


(a) Poisson arrival
(b) Limited service,
(c) Exponential service
(d) Single server

93. The dead bodies coming to a burial ground is an example of:


(a) Pure Birth Process
(b) Pure death Process
(c) Birth and Death Process
(d) Constant rate of arrival

94.. The system of loading and unloading of goods usually follows:


(a) LIFO
(b) FIFO
(c) SIRO
(d) SBP

95. A steady state exist in a queue if:


(a) λ > µ
(b) λ < µ
(c) λ ≤ µ
(d) λ ≥ µ

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

98. The distribution of arrivals in a queuing system can be considered as a:


(a) Death Process
(b) Pure Birth Process
(c) Pure live process
(d) Sick process

99. Queuing models measure the effect of:


(a) Random arrivals
(b) Random service
(c) Effect of uncertainty on the behaviour of the queuing system
(d) Length of queue.

100. Traffic intensity is given by:


(a) Mean arrival rate/Mean service rate,
(b) λ ×μ
(c) μ/ λ
(d) Number present in the queue / Number served

101. Variance of queue length is:

ans : d

17

You might also like