McqMate
| 1. |
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. predict future operations | |
| 2. |
Decision variables are |
| A. | controllable |
| B. | uncontrollable |
| C. | parameters |
| D. | none of the above |
| Answer» A. controllable | |
| 3. |
A model is |
| A. | an essence of reality |
| B. | an approximation |
| C. | an idealization’ |
| D. | all of the above |
| Answer» D. all of the above | |
| 4. |
A physical model is an example of |
| A. | an iconic model |
| B. | an analogue model |
| C. | a verbal model |
| D. | a mathematical model |
| Answer» A. an iconic model | |
| 5. |
Every mathematical model |
| A. | must be deterministic |
| B. | requires computer aid for solution. |
| C. | represents data in numerical form |
| D. | all of the above |
| Answer» C. represents data in numerical form | |
| 6. |
Operations research approach is |
| A. | multi disciplinary |
| B. | scientific |
| C. | intuitive |
| D. | all of the above |
| Answer» A. multi disciplinary | |
| 7. |
An optimization model |
| A. | mathematically provides best decision |
| B. | provides decision with limited context |
| C. | helps in evaluating various alternatives constantly |
| D. | all of the above |
| Answer» D. all of the above | |
| 8. |
OR provides solution only if the elements are |
| A. | quantified |
| B. | qualified |
| C. | feasible |
| D. | optimal |
| Answer» A. quantified | |
| 9. |
The name management science is preferred by |
| A. | americans |
| B. | english |
| C. | french |
| D. | latin |
| Answer» A. americans | |
| 10. |
Operations research is applied |
| A. | military |
| B. | business |
| C. | administration’ |
| D. | all of the above |
| Answer» D. all of the above | |
| 11. |
The application of OR techniques involves ………… approach |
| A. | individual |
| B. | team |
| C. | critical |
| D. | none of the above |
| Answer» B. team | |
| 12. |
OR techniques helps to find ………..solution |
| A. | feasible |
| B. | non feasible |
| C. | optimal |
| D. | non optimal |
| Answer» C. optimal | |
| 13. |
Modern scientific management research originated during …… |
| A. | world war ii |
| B. | world war i |
| C. | 1990 |
| D. | 1993 |
| Answer» A. world war ii | |
| 14. |
………. helps management to evaluate alternative course of action for selecting the best course of action |
| A. | operations research |
| B. | quantitative technique |
| C. | management research |
| D. | none of the above |
| Answer» A. operations research | |
| 15. |
………. Theory is an important operations research technique to analyze the queuing behaviour. |
| A. | waiting line |
| B. | net work |
| C. | decision |
| D. | simulation |
| Answer» A. waiting line | |
| 16. |
……….. is an important Operations research technique to be used for determining optimal allocation of limited resources to meet the given objectives. |
| A. | waiting line theory |
| B. | net work analysis |
| C. | decision analysis |
| D. | linear programming |
| Answer» D. linear programming | |
| 17. |
………… model involves all forms of diagrams |
| A. | iconic |
| B. | mathematical |
| C. | analogue |
| D. | schematic |
| Answer» A. iconic | |
| 18. |
An organization chart is an example of |
| A. | iconic |
| B. | mathematical |
| C. | analogue |
| D. | none of the above |
| Answer» C. analogue | |
| 19. |
…. Is known as symbolic model |
| A. | iconic |
| B. | mathematical |
| C. | analogue |
| D. | none of the above |
| Answer» B. mathematical | |
| 20. |
A map indicates roads, highways, towns and the interrelationship is an ……model |
| A. | iconic |
| B. | mathematical |
| C. | analogue |
| D. | none of the above |
| Answer» C. analogue | |
| 21. |
………..models in which the input and output variables follow a probability distribution. |
| A. | iconic |
| B. | . mathematical |
| C. | . analogue |
| D. | deterministic model |
| Answer» D. deterministic model | |
| 22. |
………. Example of probabilistic model |
| A. | game theory |
| B. | charts |
| C. | graphs |
| D. | all the above |
| Answer» A. game theory | |
| 23. |
………..is a method of analyzing the current movement of the same variable in an effort to predict the future movement of the same variable. |
| A. | goal programming |
| B. | markov analysis |
| C. | replacement theory |
| D. | queuing theory |
| Answer» B. markov analysis | |
| 24. |
Constraints in an LP model represent |
| A. | limitations |
| B. | requirements |
| C. | balancing limitation |
| D. | all of the above |
| Answer» D. all of the above | |
| 25. |
Linear programming is a |
| A. | constraint optimization technique |
| B. | technique for economic allocation of limited resources. |
| C. | mathematical technique |
| D. | all of the above |
| Answer» D. all of the above | |
| 26. |
A constraint in an LP model restricts |
| A. | value of objective function |
| B. | value of decision variable |
| C. | use of available resource |
| D. | all of the above |
| Answer» D. all of the above | |
| 27. |
The best use of linear programming technique is to find an optimal use of |
| A. | money |
| B. | man power |
| C. | machine |
| D. | all of the above |
| Answer» D. all of the above | |
| 28. |
Which of the following as an assumption of an LP model |
| A. | divisibility |
| B. | proportionality |
| C. | additively |
| D. | all of the above |
| Answer» D. all of the above | |
| 29. |
Most of the constraints in the linear programming problem are expressed as ………. |
| A. | equality |
| B. | inequality |
| C. | uncertain |
| D. | all of the above |
| Answer» B. inequality | |
| 30. |
The graphical method of LP problem uses |
| A. | objective function equation |
| B. | constraint equation |
| C. | linear equations |
| D. | all the above |
| Answer» D. all the above | |
| 31. |
A feasible solution to a linear programming problem |
| A. | must satisfy all problem constraints simultaneously |
| B. | need not satisfy all constraints |
| C. | must be a corner point of the feasible region |
| D. | must optimize the value of the objective function |
| Answer» A. must satisfy all problem constraints simultaneously | |
| 32. |
While plotting constraints on a graph paper, terminal points on both axes are connected by a straight line because |
| A. | the resources are limited in supply |
| B. | the objective function is a linear function |
| C. | the constraints are linear equations or in equalities |
| D. | all of the above |
| Answer» C. the constraints are linear equations or in equalities | |
| 33. |
Constraints in LP problem are called active if they |
| A. | represent optimal solution |
| B. | at optimality do not consume all the available resources |
| C. | both of (a) and (b) |
| D. | none of the above |
| Answer» A. represent optimal solution | |
| 34. |
The solution space of a LP problem is unbounded due to |
| A. | an incorrect formulation of the lp model |
| B. | objective function is unbounded |
| C. | neither (a) nor (b) |
| D. | both (a) and (b) |
| Answer» C. neither (a) nor (b) | |
| 35. |
While solving LP problem graphically, the area bounded by the constraints is called |
| A. | feasible region |
| B. | infeasible region |
| C. | unbounded solution |
| D. | none of the above |
| Answer» A. feasible region | |
| 36. |
Which of the following is not a category of linear programming problems? |
| A. | resource allocation problem |
| B. | cost benefit trade off problem |
| C. | distribution network problem |
| D. | all of the above are categories of linear programming problems. |
| Answer» D. all of the above are categories of linear programming problems. | |
| 37. |
A linear programming model does not contain which of the following components? |
| A. | data |
| B. | decisions |
| C. | constraints |
| D. | a spread sheet |
| Answer» D. a spread sheet | |
| 38. |
Which of the following may not be in a linear programming formulation? |
| A. | <=. |
| B. | >. |
| C. | =. |
| D. | all the above |
| Answer» B. >. | |
| 39. |
While solving an LP problem infeasibility may be removed by |
| A. | adding another constraint |
| B. | adding another variable |
| C. | removing a constraint |
| D. | removing a variable |
| Answer» C. removing a constraint | |
| 40. |
Straight lines shown in a linear programming graph indicates |
| A. | objective function |
| B. | constraints |
| C. | points |
| D. | all the above |
| Answer» B. constraints | |
| 41. |
All negative constraints must be written as |
| A. | equality |
| B. | non equality |
| C. | greater than or equal to |
| D. | less than or equal to |
| Answer» C. greater than or equal to | |
| 42. |
In linear programming problem if all constraints are less than or equal to, then the feasible region is |
| A. | above lines |
| B. | below the lines |
| C. | unbounded |
| D. | none of the above |
| Answer» B. below the lines | |
| 43. |
………. is a series of related activities which result in some product or services. |
| A. | network |
| B. | transportation model |
| C. | assignment |
| D. | none of these |
| Answer» A. network | |
| 44. |
An event which represents the beginning of more than one activity is known as ………..event. |
| A. | merge |
| B. | net |
| C. | burst |
| D. | none of the above |
| Answer» C. burst | |
| 45. |
If two constraints do not intersect in the positive quadrant of the graph, then |
| A. | the problem is infeasible |
| B. | the solution is unbounded |
| C. | one of the constraints is redundant |
| D. | none of the above |
| Answer» D. none of the above | |
| 46. |
Constraint in LP problem are called active if they |
| A. | represent optimal solution |
| B. | at optimality do not consume all the available resources |
| C. | both of (a) and (b) |
| D. | none of the above |
| Answer» A. represent optimal solution | |
| 47. |
Alternative solutions exists of an LP model when |
| A. | one of the constraints is redundant. |
| B. | objective function equation is parallel to one of the constraints |
| C. | two constraints are parallel. |
| D. | all of the above |
| Answer» B. objective function equation is parallel to one of the constraints | |
| 48. |
While solving an LP problem, infeasibility may be removed by |
| A. | adding another constraint |
| B. | adding another variable |
| C. | removing a constraint |
| D. | removing a variable |
| Answer» C. removing a constraint | |
| 49. |
………..is that sequence of activities which determines the total project time. |
| A. | net work |
| B. | critical path |
| C. | critical activities |
| D. | none of the above |
| Answer» B. critical path | |
| 50. |
Activities lying on the critical path are called…………. |
| A. | net work |
| B. | critical path |
| C. | critical activities |
| D. | none of the above |
| Answer» C. critical activities | |
| 51. |
It ………. at which an activity can start. |
| A. | est |
| B. | eft |
| C. | lst |
| D. | lft |
| Answer» A. est | |
| 52. |
………… is the earliest starting time plus activity time. |
| A. | est |
| B. | eft |
| C. | lst |
| D. | lft |
| Answer» B. eft | |
| 53. |
………. is the latest time by which an activity can be started without delaying the completion of the project. |
| A. | est |
| B. | eft |
| C. | lst |
| D. | lft |
| Answer» C. lst | |
| 54. |
……….is the latest time by which an activity can be finished without delaying the completion of the project. |
| A. | est |
| B. | eft |
| C. | lst |
| D. | lft |
| Answer» D. lft | |
| 55. |
……………is the duration by which an activity can be delayed without delaying the project |
| A. | slack |
| B. | total float |
| C. | free float |
| D. | independent float |
| Answer» B. total float | |
| 56. |
……… is the time by which the completion of an activity can be delayed beyond its earliest finish time without affecting the earliest start time of a succeeding activity |
| A. | slack |
| B. | total float |
| C. | free float |
| D. | independent float |
| Answer» C. free float | |
| 57. |
……….is activity oriented. |
| A. | cpm |
| B. | pert |
| C. | lp |
| D. | none of the above |
| Answer» A. cpm | |
| 58. |
………. is event oriented. |
| A. | cpm |
| B. | pert |
| C. | lp |
| D. | none of the above |
| Answer» B. pert | |
| 59. |
PERT emphasis on ……….. |
| A. | time |
| B. | activity |
| C. | a) and b) |
| D. | none of the above |
| Answer» A. time | |
| 60. |
Full form of PERT is |
| A. | performance evaluation review technique |
| B. | programme evaluation review technique |
| C. | programme evaluation research technique |
| D. | none of these. |
| Answer» B. programme evaluation review technique | |
| 61. |
…….. is a scheme or design of something intended or device. |
| A. | programme |
| B. | project |
| C. | network |
| D. | float |
| Answer» C. network | |
| 62. |
An activity which must be completed before one or more other activities start is known as …………activity. |
| A. | dummy |
| B. | predecessor |
| C. | successor |
| D. | none of these |
| Answer» B. predecessor | |
| 63. |
The event is commonly represented by …… in network diagram |
| A. | nodes |
| B. | arrow |
| C. | triangle |
| D. | none of these |
| Answer» A. nodes | |
| 64. |
…….is the disconnection of an activity before the completion of activities in a project network diagram. |
| A. | dangling |
| B. | looping |
| C. | dummy |
| D. | none of the above |
| Answer» C. dummy | |
| 65. |
…………..is an activity oriented diagram. |
| A. | cpm |
| B. | pert |
| C. | histogram |
| D. | none of the above |
| Answer» A. cpm | |
| 66. |
………… is the duration by which an activity can be delayed without delaying the project. |
| A. | total float |
| B. | slack |
| C. | earliest event time |
| D. | none of these |
| Answer» A. total float | |
| 67. |
………is the shortest possible time in which an activity can be delayed without delaying the project. |
| A. | pessimistic time estimate |
| B. | optimistic time estimate |
| C. | most likely time estimate |
| D. | none of these |
| Answer» B. optimistic time estimate | |
| 68. |
Which of the following is not a part of decision tree problem specification? |
| A. | a list of alternatives |
| B. | a list of possible state of nature |
| C. | evpi |
| D. | pay off associated with alternative/ state of nature combination. |
| Answer» C. evpi | |
| 69. |
If a decision theory problem has 3 decision alternatives and 4 states of nature, the number of payoffs in that problem will be |
| A. | 3 |
| B. | 4 |
| C. | 12 |
| D. | 64 |
| Answer» C. 12 | |
| 70. |
In a decision theory problem under complete uncertainty, which one of the following approaches will not be possible? |
| A. | expected monetary value |
| B. | maxmin |
| C. | minimax |
| D. | hurwicz |
| Answer» A. expected monetary value | |
| 71. |
For decision making under uncertainty, identify the decision rule that is appropriate for the optimist. |
| A. | laplace |
| B. | maximax |
| C. | minimax regret |
| D. | maxmin |
| Answer» B. maximax | |
| 72. |
What decision-making condition must exist for the decision tree to be a valuable tool? |
| A. | certainty |
| B. | uncertainty |
| C. | risk |
| D. | it does not matter, the tool is appropriate in all environments |
| Answer» C. risk | |
| 73. |
Which of the following is (are) types of decision-making environments? |
| A. | decision making under uncertainty |
| B. | decision making under certainty |
| C. | decision making under risk |
| D. | none of the above |
| Answer» B. decision making under certainty | |
| 74. |
A good decision always implies that |
| A. | will obtain the best final results |
| B. | have used appropriate quantitative analysis. |
| C. | have considered all alternatives |
| D. | have followed a logical process. |
| Answer» D. have followed a logical process. | |
| 75. |
All of the following are steps in the decision-making process EXCEPT |
| A. | define the problem |
| B. | list alternatives |
| C. | identify the possible outcomes |
| D. | compute the posterior probabilities. |
| Answer» D. compute the posterior probabilities. | |
| 76. |
The equally likely decision criteria is also known as |
| A. | bayes |
| B. | laplace |
| C. | minimax |
| D. | hurwicz |
| Answer» B. laplace | |
| 77. |
Opportunity loss refers to |
| A. | the expected value of a bad decision |
| B. | the expected loss from a bad decision |
| C. | the difference between actual pay off and the optimal pay off |
| D. | the regret from not having made a decision |
| Answer» C. the difference between actual pay off and the optimal pay off | |
| 78. |
The criteria of expected monetary value is used for making decisions under |
| A. | certainty |
| B. | uncertainty |
| C. | risk |
| D. | all of the above |
| Answer» D. all of the above | |
| 79. |
The maximax criteria is…….. |
| A. | optimistic |
| B. | neutral |
| C. | pessimistic |
| D. | can be any one of the above |
| Answer» C. pessimistic | |
| 80. |
Which of the following might be viewed as an optimistic decision criterion? |
| A. | hurwicz criterion |
| B. | maximin |
| C. | maximax |
| D. | minimax |
| Answer» C. maximax | |
| 81. |
The minimum EOL will always result in the same decision as |
| A. | minimax |
| B. | maximin |
| C. | maximum emv |
| D. | maximax |
| Answer» C. maximum emv | |
| 82. |
Decision theory is concerned with |
| A. | methods of arriving at an optimal decision |
| B. | selecting optimal decision in sequential manner |
| C. | analysis of information that is available |
| D. | all of the above |
| Answer» D. all of the above | |
| 83. |
Which of the following criterion is not used for decision making under uncertainty? |
| A. | maximin |
| B. | maximax |
| C. | minimax |
| D. | minimize expected loss |
| Answer» D. minimize expected loss | |
| 84. |
The minimum expected opportunity loss is |
| A. | equal to evpi |
| B. | minimum regret |
| C. | equal to emv |
| D. | both (a) and (b) |
| Answer» D. both (a) and (b) | |
| 85. |
The expected value of perfect information is equal to |
| A. | eppi – minimum emv |
| B. | eppi + maximum emv |
| C. | maximum eol |
| D. | none of the above |
| Answer» A. eppi – minimum emv | |
| 86. |
The value of the coefficient of optimism is needed while using the criterion of |
| A. | equally likely |
| B. | maximin |
| C. | realism |
| D. | maximin |
| Answer» C. realism | |
| 87. |
while using Hurwicz criterion, the coefficient of realism |
| A. | represents the degree of optimism |
| B. | represents the degree of pessimism |
| C. | is the probability of state of nature |
| D. | none of the above |
| Answer» A. represents the degree of optimism | |
| 88. |
The decision making criteria that should be used to achieve maximum long term pay off is |
| A. | eol |
| B. | emv |
| C. | hurwicz |
| D. | maximax |
| Answer» B. emv | |
| 89. |
Game theory models are classified by the |
| A. | number of players |
| B. | sum of all payoff |
| C. | number of strategies |
| D. | all of the above |
| Answer» D. all of the above | |
| 90. |
The objective of network analysis is to |
| A. | minimize total project duration |
| B. | minimize total project cost |
| C. | minimize production delays, interruption and conflicts |
| D. | all of the above |
| Answer» A. minimize total project duration | |
| 91. |
The initial solution of a transportation problem can be obtained by applying any known method. But the only condition is |
| A. | the solution be optimal |
| B. | the rim conditions are satisfied |
| C. | the solution not be degenerate |
| D. | all of the above |
| Answer» B. the rim conditions are satisfied | |
| 92. |
When total supply is equal to total demand in a transportation problem , the problem is said to be |
| A. | balanced |
| B. | unbalanced |
| C. | degenerate |
| D. | none of the above |
| Answer» A. balanced | |
| 93. |
The term “Operation Research” was coined by : |
| A. | Mc Closky and Trefthen |
| B. | Arthur Clark |
| C. | Churchman, Ackoff and Arnoff |
| D. | George B Dantzig |
| Answer» A. Mc Closky and Trefthen | |
| 94. |
Management Science came into existence in a ................... context. |
| A. | Business |
| B. | Academic |
| C. | Military |
| D. | Religious |
| Answer» C. Military | |
| 95. |
By the beginning of ........................., the industries in USA realised the importance of Management Science in solving business and management problems. |
| A. | 1930s |
| B. | 1940s |
| C. | 1950s |
| D. | 1960s |
| Answer» C. 1950s | |
| 96. |
In India, Operations Research came into existence in the year .............. |
| A. | 1940 |
| B. | 1947 |
| C. | 1949 |
| D. | 1950 |
| Answer» C. 1949 | |
| 97. |
In India, first Operations Research unit was set up at ................................. |
| A. | Regional Research Laboratory, Hyderabad |
| B. | Indian Statistical Institute, Kolkotha |
| C. | Indian Institute of Science and Technology, Bengaluru |
| D. | Indian Institute of Science and Technology, Mohali |
| Answer» A. Regional Research Laboratory, Hyderabad | |
| 98. |
In India, first Operations Research application was made by ........................... |
| A. | Pranab K Sen |
| B. | Prof. Mahalonobis |
| C. | Samarendra Nath Roy |
| D. | Raghu Raj Bahadur |
| Answer» B. Prof. Mahalonobis | |
| 99. |
Operations Research Society of India was formed in the year .................. |
| A. | 1950 |
| B. | 1955 |
| C. | 1957 |
| D. | 1960 |
| Answer» C. 1957 | |
| 100. |
Who defined Operations Research as “the art of giving bad answers to problems which otherwise have worse answers”? |
| A. | H M Wagner |
| B. | H A Taha |
| C. | T L Saaty |
| D. | Arthur Clark |
| Answer» C. T L Saaty | |
Done Reading?