MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following is an assumption of game theory? |
| A. | The players act rationally and intelligently |
| B. | Each payer has a finite set of possible courses of action |
| C. | The players attempt to maximise gains or minimises losses |
| D. | All of the above |
| Answer» E. | |
| 2. |
........................ is applied to determine optimal solution. |
| A. | NWCR |
| B. | VAM |
| C. | MODI Method |
| D. | None of these |
| Answer» D. None of these | |
| 3. |
The outlet where the services are being provided to the customers is called................. |
| A. | Waiting line |
| B. | Service facility |
| C. | Idle facility |
| D. | Traffic intensity |
| Answer» C. Idle facility | |
| 4. |
When all the players of the game follow their optimal strategies, then the expected pay off of thegame is called....................... |
| A. | Gain of the game |
| B. | Loss of the game |
| C. | Value of the game |
| D. | None of these |
| Answer» D. None of these | |
| 5. |
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» C. Samarendra Nath Roy | |
| 6. |
............................refers to the manner in which the customers behave while being in the queue. |
| A. | Service pattern |
| B. | Service pattern |
| C. | Queue discipline |
| D. | None of these |
| Answer» D. None of these | |
| 7. |
The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the numberof positive allocations are: |
| A. | m + n |
| B. | m x n |
| C. | m +n – 1 |
| D. | m +n + 1 |
| Answer» D. m +n + 1 | |
| 8. |
.......................models consider time as one of the important variable. |
| A. | Dynamic |
| B. | Static |
| C. | Botha and b |
| D. | None of these |
| Answer» B. Static | |
| 9. |
The allocated cells in the transportation table are called .............................. |
| A. | Occupied cells |
| B. | Empty cells |
| C. | Unoccupied cells |
| D. | None of these |
| Answer» B. Empty cells | |
| 10. |
In queuing theory, ...................... is a person by whom service is rendered. |
| A. | Customer |
| B. | Server |
| C. | a or b |
| D. | none of these |
| Answer» C. a or b | |
| 11. |
In India, Operations Research came into existence in the year .............. |
| A. | 1940 |
| B. | 1947 |
| C. | 1949 |
| D. | 1950 |
| Answer» D. 1950 | |
| 12. |
......................... is activity oriented network diagram. |
| A. | CPM |
| B. | PERT |
| C. | Histogram |
| D. | Ogive |
| Answer» B. PERT | |
| 13. |
PERT emphasises on ........................... |
| A. | Activity |
| B. | Time |
| C. | Cost |
| D. | None of these |
| Answer» C. Cost | |
| 14. |
Traffic intensity in Queuing Theory is also called........................... |
| A. | Service factor |
| B. | Arrival factor |
| C. | Utilisation factor |
| D. | None of these |
| Answer» D. None of these | |
| 15. |
If the feasible region of a linear programming problem is empty, the solution is .................... |
| A. | Unbounded |
| B. | Infeasible |
| C. | Infeasible |
| D. | Alternative |
| Answer» C. Infeasible | |
| 16. |
In network diagram, events are commonly represented by ......................... |
| A. | Arrows |
| B. | Nodes |
| C. | Triangles |
| D. | None of these |
| Answer» C. Triangles | |
| 17. |
........................variables are fictitious and cannot have any physical meaning. |
| A. | Slack variables |
| B. | Surplus variables |
| C. | Artificial variables |
| D. | Decision variables |
| Answer» D. Decision variables | |
| 18. |
........................ model is a map which indicates roads, highways, towns and inter-relationships |
| A. | Iconic model |
| B. | Analogue model |
| C. | Mathematical model |
| D. | None of these |
| Answer» C. Mathematical model | |
| 19. |
The EST + activity duration = .............................. |
| A. | Earliest Finish Time |
| B. | Latest Start Time |
| C. | Latest Finish Time |
| D. | None of these |
| Answer» B. Latest Start Time | |
| 20. |
a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lackof time or space is called ..................... |
| A. | Jockying |
| B. | Reneging |
| C. | Collusion |
| D. | Balking |
| Answer» E. | |
| 21. |
VAM is also called........................ |
| A. | Matrix Minima Method |
| B. | Penalty Method |
| C. | MODI Method |
| D. | None of these |
| Answer» C. MODI Method | |
| 22. |
In waiting line theory, number of customers waiting in the queue is referred to as ................ |
| A. | Traffic intensity |
| B. | Queuing system |
| C. | Service pattern |
| D. | Queue length |
| Answer» E. | |
| 23. |
Operations Research does not give perfect solution to a problem, but it helps to improve the......................... of the solution. |
| A. | Quality |
| B. | Clarity |
| C. | Look |
| D. | None of these |
| Answer» B. Clarity | |
| 24. |
Transportation model was first introduced by ........................ in the year 1941. |
| A. | T C Koopman |
| B. | George B Dantzig |
| C. | Von-neumann |
| D. | F L Hitchcock |
| Answer» E. | |
| 25. |
The innovative science of Operations Research was discovered during ...................... |
| A. | Civil war |
| B. | World war I |
| C. | World war II |
| D. | Industrial Revolution |
| Answer» D. Industrial Revolution | |
| 26. |
......................... models involve more risks and uncertainties. |
| A. | Probabilistic |
| B. | Deterministic |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Deterministic | |
| 27. |
Who defined Operations Research as scientific approach to problem solving for executivemanagement. |
| A. | E L Arnoff |
| B. | H M Wagner |
| C. | Churchman |
| D. | None of these |
| Answer» C. Churchman | |
| 28. |
An organisation chart is an example of ........................... |
| A. | Iconic model |
| B. | Mathematical model |
| C. | Analogue model |
| D. | None of these |
| Answer» D. None of these | |
| 29. |
.................... is considered as the pioneer of Linear Programming Technique. |
| A. | Churchman |
| B. | D W Miller |
| C. | James Lundy |
| D. | George B Dantzig |
| Answer» E. | |
| 30. |
Operations Research is a very powerful tool for ........................ |
| A. | Operations |
| B. | Research |
| C. | Decision making |
| D. | None of these |
| Answer» D. None of these | |
| 31. |
All the parameters in the linear programming model are assumed to be ..................... |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | None of these |
| Answer» C. Functions | |
| 32. |
Number of customers in the queue per unit of time is called ...................... |
| A. | Queuing system |
| B. | Length of queue |
| C. | Average length of queue |
| D. | None of these |
| Answer» D. None of these | |
| 33. |
In maximisation cases, ....................... are assigned to the artificial variables as their coefficients inthe objective function. |
| A. | + m |
| B. | – m |
| C. | None of these |
| Answer» B. – m | |
| 34. |
The Hungarian method for solving an assignment problem can also be used to solve: |
| A. | A transportation problem |
| B. | A travelling salesman problem |
| C. | A linear programming problem |
| D. | Both a and b |
| Answer» C. A linear programming problem | |
| 35. |
.........................are called mathematical models. |
| A. | Iconic models |
| B. | Symbolic models |
| C. | Analogue models |
| D. | None of these |
| Answer» C. Analogue models | |
| 36. |
The O R technique which helps in minimising total waiting and service cost is: |
| A. | Game theory |
| B. | Queuing theory |
| C. | Both a and b |
| D. | Decision theory |
| Answer» C. Both a and b | |
| 37. |
An activity which does not consume either resource or time is called ............................. |
| A. | Predecessor activity |
| B. | Successor activity |
| C. | Dummy activity |
| D. | Terminal activity |
| Answer» D. Terminal activity | |
| 38. |
Non-negativity constraints are written as ...................... |
| A. | Equality |
| B. | Non-equality |
| C. | Greater than or equal to |
| D. | Less than or equal to |
| Answer» D. Less than or equal to | |
| 39. |
The variables whose coefficient vectors are unit vectors, are called ...................... |
| A. | Unit variables |
| B. | Basic variables |
| C. | Non-basic variables |
| D. | None of these |
| Answer» C. Non-basic variables | |
| 40. |
........................... method is used to solve an assignment problem. |
| A. | American method |
| B. | Hungarian method |
| C. | German method |
| D. | British method |
| Answer» C. German method | |
| 41. |
A customer’s behaviour of jumping from one queue to another is called ............................ |
| A. | Jockying |
| B. | Reneging |
| C. | Collusion |
| D. | Balking |
| Answer» B. Reneging | |
| 42. |
Hungarian method was developed by ........................ |
| A. | T C Koopman |
| B. | F L Hitchcock |
| C. | D Konig |
| D. | George B Dantzig |
| Answer» D. George B Dantzig | |
| 43. |
In queuing theory, ............................ stands for mean arrival rate of customers. |
| A. | μ |
| B. | λ |
| C. | t |
| D. | none of these |
| Answer» C. t | |
| 44. |
Decision making under certainty refers to .............................. situation. |
| A. | Deterministic |
| B. | Probabilistic |
| C. | Competitive |
| D. | None of these |
| Answer» B. Probabilistic | |
| 45. |
Traffic intensity is computed by using the formula: |
| A. | λ/μ |
| B. | μ/λ |
| C. | 1- λ/μ |
| D. | 1- μ/λ |
| Answer» B. μ/λ | |
| 46. |
If there are more than one optimal solutions for the decision variables, the solution is ........... |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of these |
| Answer» D. None of these | |
| 47. |
Operations Research makes a ...................... attack on complex problems to arrive at optimalsolution. |
| A. | Scientific |
| B. | Systematic |
| C. | Both a and b |
| D. | None of these |
| Answer» D. None of these | |
| 48. |
While solving an LPP, infeasibility may be removed by: |
| A. | Removing a variable |
| B. | Removing a constraint |
| C. | Adding a variable |
| D. | Adding a constraint |
| Answer» C. Adding a variable | |
| 49. |
In queuing theory, ............................ stands for mean service rate. |
| A. | μ |
| B. | λ |
| C. | t |
| D. | none of these |
| Answer» B. λ | |
| 50. |
............................is known as father of game theory. |
| A. | Von Neumann |
| B. | A K Erlang |
| C. | George b Dantzig |
| D. | Arnoff |
| Answer» B. A K Erlang | |