Solved MCQs on operation research | Operation research MCQ with answers for the preparation of academic and competitive exams.
Are you a student or professional searching for comprehensive and solved multiple-choice questions (MCQs) on operation research? Look no further! In this article, we have gathered a diverse range of MCQs that cover the fundamental concepts and techniques of operation research.
Whether you are preparing for an exam, looking to assess your knowledge, or simply curious about this field’s intricacies, these solved MCQs will serve as an invaluable resource.
Operation research is a discipline that utilizes mathematical models and analytical techniques to optimize complex decision-making processes.
It plays a crucial role in various industries, including manufacturing, logistics, finance, healthcare, and transportation. However, grasping the core principles of operation research can be challenging without adequate practice.
Solved MCQs on operation research
1. With the addition of Gomory’s constraint, the problem is solved by ___ ___ ___.
Ans. Dual simplex method
2. Do you select the variable for Gomory’s constraint whose fractional value is more?
3. Optimum values in a pure IPP can be x=2 and y=3.5.
4. Branch and bound techniques are applied when some variables have upper or lower bounds.
5. We start the technique with a lower bound.
6. Customers arrive at a bank at regular intervals.
7. Queuing identifies the optimal service facilities to be provided.
8. Queuing theory is based on the deterministic model.
9. One of the indicators of the efficiency of a system is the ___ factor.
10. Analysis of queuing system explores ___ ___.
Ans. Various alternatives
11. ___ technique can also be used for analysis.
12. Every queuing process has an arrival pattern, a service facility and a queue discipline as its constituents.
13. If the arrivals are completely random, then it follows the Poisson distribution.
14. Multiple service channels may be arranged in ___ or in ___.
Ans. Series, parallel
15. The service time can be ___ or ___.
Ans. Constant, varying
16. When customers keep on switching over from one queue to another then it is called ___.
17. ___ ___ ___ ___ are the types of customer behavior.
18. E (m) refers to ___ ___ ___ ___.
Ans. The average length of the queue
19. Probability density function of the time spent by a customer in the system is denoted by ___.
Ans. F (μ)
20. ___ arrivals are allowed.
21. The expected number of customers in the non-empty queue is given by ___.
Ans. μ / μ – λ
22. The probability that an arriving customer has to wait for receiving service is given by ___.
Ans. λ / μ
23. When the possible number of arrivals is limited, then we apply the infinite queuing model.
24. The queue discipline in a finite queuing process can be random.
25. The efficiency factor for this model is HJ / H + J + L.
26. Simulation may be called experimentation in the ___ ___.
Ans. Management Laboratory
27. Random numbers have the property that any number has ___to occur.
Ans. Equally likely
28. The totality of probability assigned to the variable should always be equal to ___.
29. In any simulation problem, initial conditions are stated.
30. Random numbers are assigned for cumulative probability values.
31. Without identifying any relationship between variables, you can solve the simulation problem.
32. Standard error for percentage of success = (P (1-P) / N) 1/2.
33. It is possible to determine the number of trials.
34. The accuracy of results increases as the square of the number of trials.
35. Simulation gives the optimum solution.
36. Simulation interrupts real system activities.
37. This technique can be easily understood by non-technical managers.
38. Project consists of interrelated activities.
39. Project activities are to be completed in a specified time according to a specified sequence.
40. PERT and CPM identifies non-critical activities.
41. PERT is an activity-oriented network.
42. CPM is used for projects that are repetitive in nature.
43. Events do not consume ___ and ___.
Ans. Time, resource
44. Arrow’s head number is ___ than its tail number.
Ans. Greater than
45. Dummy activity is introduced in a network to keep a proper ___ relationship.
46. Critical path calculation includes both ___ and ___.
Ans. Forward pass & backward pass
47. In a project network, a sequence of activities may form a loop.
48. A critical activity must have its total and free floats equal to zero.
49. A non-critical activity cannot have zero total floats.
50. The critical path of the project network represents the minimum duration needed to complete the network.
51. A network may include more than one critical path.
52. Competitive situations arise when ___ or ___ parties with ___ operate.
Ans. Two, more, conflicting interest
53. State any one characteristic of a competitive game.
Ans. Players do not communicate with each other.
54. When do you call a game a zero-sum game?
Ans. When the value of the game is zero (0).
55. What is a rectangular game?
Ans. Two-person zero-sum game.
56. What is pure strategy?
Ans. When a player plays only one strategy irrespective of the opponents ‘moves.
57. How many courses of action are available to the players in a competitive game?
Ans. Each player has a finite number of courses of action or moves.
58. Saddle point occurs at row minimum and column maximum.
59. The row whose elements are less than the corresponding elements of another row is ___.
60. If the average of any 2 columns is less than or equal to the corresponding elements of another column, it is ___.
Thanks for visiting our website, if you like the post on Solved MCQs on operation research, don’t forget to share it on social media.