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. |
In queuing theory, ...................... refers to those waiting in a queue or receiving service. |
| A. | Service provider |
| B. | Customer |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 2. |
................... is an event oriented network diagram. |
| A. | CPM |
| B. | PERT |
| C. | Histogram |
| D. | Ogive |
| Answer» C. Histogram | |
| 3. |
Operations Research Society of India was formed in the year .................. |
| A. | 1950 |
| B. | 1955 |
| C. | 1957 |
| D. | 1960 |
| Answer» D. 1960 | |
| 4. |
............................ is the latest time by which an activity can be finished without delaying thecompletion of the project. |
| A. | LST |
| B. | LFT |
| C. | EFT |
| D. | EST |
| Answer» C. EFT | |
| 5. |
An event which represents the beginning of more than one activity is a : |
| A. | Merge event |
| B. | Net event |
| C. | Burst event |
| D. | None of these |
| Answer» D. None of these | |
| 6. |
If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacementratio. |
| A. | 2 |
| B. | -3 |
| C. | None of these *** |
| Answer» D. | |
| 7. |
The assignment problem is: |
| A. | Requires that only one activity be assigned to each resource |
| B. | Is a special case of transportation problem |
| C. | Can be used to maximise resource |
| D. | All the above |
| Answer» E. | |
| 8. |
..................... are expressed in the form of equations |
| A. | Objectives |
| B. | Constraints |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 9. |
............................... is concerned with determination of the most economic replacement policy. |
| A. | Probabilistic programming |
| B. | Linear programming |
| C. | Search theory |
| D. | Replacement theory |
| Answer» E. | |
| 10. |
Matrix Minima Method to find initial feasible solution to a TP is also called ....................... |
| A. | NWCM |
| B. | LCM |
| C. | VAM |
| D. | None of these |
| Answer» D. None of these | |
| 11. |
.................... defined Operations Research as “the art of winning wars without actually fighting.” |
| A. | H M Wagner |
| B. | H A Taha |
| C. | T L Saaty |
| D. | Arthur Clark |
| Answer» E. | |
| 12. |
A minimisation problem can be connected into maximisation problem by changing the signs ofcoefficients in the ........................... |
| A. | Constraints |
| B. | Objectives |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 13. |
By the beginning of ........................., the industries in USA realised the importance ofManagement Science in solving business and management problems. |
| A. | 1930s |
| B. | 1940s |
| C. | 1950s |
| D. | 1960s |
| Answer» D. 1960s | |
| 14. |
MODI Method to test the optimality of a feasible solution to TP is also called............... |
| A. | Stepping Stone Method |
| B. | u. v. Method |
| C. | both a and b |
| D. | none of these |
| Answer» C. both a and b | |
| 15. |
Commonly assumed probability distribution of arrival pattern is ....................... |
| A. | Poisson distribution |
| B. | Binomial distribution |
| C. | Normal distribution |
| D. | None of these |
| Answer» B. Binomial distribution | |
| 16. |
Any column or row of a simplex table is known as ......................... |
| A. | Key column |
| B. | Key row |
| C. | Vector |
| D. | None of these |
| Answer» D. None of these | |
| 17. |
.......................... is the duration by which an activity can be delayed without delaying the project. |
| A. | Slack |
| B. | Total float |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 18. |
The graphical method if LPP uses: |
| A. | Linear equations |
| B. | Constraint equations |
| C. | Objective function |
| D. | All of the above |
| Answer» E. | |
| 19. |
............................ models involve the allocation of resources to activities in such a way that somemeasure of effectiveness is optimised. |
| A. | Sequencing |
| B. | Allocation |
| C. | Queuing theory |
| D. | Decision theory |
| Answer» C. Queuing theory | |
| 20. |
................................was the first person who developed a viable queueing theory |
| A. | Von Neumann |
| B. | Morgenstern |
| C. | H M Wagner |
| D. | Simeon Dennis Poisson |
| Answer» E. | |
| 21. |
In Transportation Problem, LCM stands for ............................. |
| A. | Lowest Common Multiplier |
| B. | Least Cost Method |
| C. | Lowest Cell Method |
| D. | None of these |
| Answer» C. Lowest Cell Method | |
| 22. |
In a network diagram, activity is denoted by ............................ |
| A. | Node |
| B. | Arrow |
| C. | Triangle |
| D. | None of these |
| Answer» C. Triangle | |
| 23. |
The maximise criteria is ........................... |
| A. | Optimistic |
| B. | Pessimistic |
| C. | Neutral |
| D. | None of these |
| Answer» C. Neutral | |
| 24. |
A matrix which shows the gains and losses resulting from moves and counter moves iscalled.................................. |
| A. | Cost matrix |
| B. | Pay off matrix |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 25. |
Excess of service facilities over and above the number of customers results: |
| A. | Idleness of service capacity |
| B. | Queues |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Queues | |
| 26. |
Which of the followings is an assumption of Linear Programming Technique? |
| A. | Divisibility |
| B. | Additivity |
| C. | Proportionality |
| D. | All of the above |
| Answer» E. | |
| 27. |
PERT stand for: |
| A. | Performance Evaluation Review Technique |
| B. | Programme Evaluation Review Technique |
| C. | Programme Evaluation Research Technique |
| D. | None of these |
| Answer» C. Programme Evaluation Research Technique | |
| 28. |
An assignment problem can be solved by ......................... |
| A. | Simplex method |
| B. | Transportation method |
| C. | Both a and b |
| D. | None of these |
| Answer» D. None of these | |
| 29. |
In Linear Programming Problem, degeneracy occurs in ................. stages. |
| A. | One |
| B. | Two |
| C. | Three |
| D. | Four |
| Answer» C. Three | |
| 30. |
In transportation Problems, VAM stands for ......................... |
| A. | Value Addition Method |
| B. | Vogel’s Approximation Method |
| C. | Virgenean Approximation Method |
| D. | None of these |
| Answer» C. Virgenean Approximation Method | |
| 31. |
The position in the pay off matrix where the maximin coincides with the minimax. |
| A. | Saddle point |
| B. | Break even point |
| C. | Pivot point |
| D. | None of the above |
| Answer» B. Break even point | |
| 32. |
......................... is a series of activities related to a project. |
| A. | Network |
| B. | Transportation Model |
| C. | Assignment model |
| D. | None of these |
| Answer» B. Transportation Model | |
| 33. |
In an LPP, if the solution of a variable can be made infinitely large without violating theconstraints, then the solution is .............................. |
| A. | Infeasible |
| B. | Alternative |
| C. | Unbounded |
| D. | Unique |
| Answer» D. Unique | |
| 34. |
Which of the following method is used to solve mixed strategy problems: |
| A. | Probability method |
| B. | Graphic method |
| C. | Linear Programming method |
| D. | All of the above |
| Answer» E. | |
| 35. |
Operations Research has the characteristic that it is done by a team of ..................... |
| A. | Scientists |
| B. | Mathematicians |
| C. | Academicians |
| D. | Politicians |
| Answer» B. Mathematicians | |
| 36. |
Operations Research uses models to help the management in determining its ....................scientifically. |
| A. | Policies |
| B. | Actions |
| C. | Both a and b |
| D. | None of these |
| Answer» D. None of these | |
| 37. |
A queue is formed when the demand for a service: |
| A. | Exceeds the capacity to provide that service |
| B. | Is less than the capacity to provide that service |
| C. | a or b |
| D. | None of these |
| Answer» B. Is less than the capacity to provide that service | |
| 38. |
The outcome of a game is known as.................... |
| A. | Profit |
| B. | Loss |
| C. | Pay off |
| D. | None of these |
| Answer» D. None of these | |
| 39. |
Which of the following is a characteristic of a dual problem: |
| A. | Dual of a dual is primal |
| B. | If dual has a finite optimal solution, then the primal also has finite optimal solution |
| C. | If dual has no feasible solution, then the primal also has no feasible solution |
| D. | All of the above |
| Answer» E. | |
| 40. |
................................is that element of the simplex table which lis both in the key row and keycolumn. |
| A. | Key element |
| B. | Pivot element |
| C. | Both a and b |
| D. | None of these |
| Answer» D. None of these | |
| 41. |
Linear Programming Technique helps to find an optimal use of: |
| A. | Machine |
| B. | Money |
| C. | Manpower |
| D. | All of the above |
| Answer» E. | |
| 42. |
Every Linear Programming Problem is related to another Linear Programming Problem, called.......................... |
| A. | Primal |
| B. | Dual |
| C. | Non-linear Programming |
| D. | None of these |
| Answer» C. Non-linear Programming | |
| 43. |
A model is a ........................... |
| A. | An essence of reality |
| B. | An approximation |
| C. | An idealisation |
| D. | All of the above |
| Answer» E. | |
| 44. |
...................... is a method of analysing the current movement of the some variable in aneffort to predict the future movement of the same variable. |
| A. | Goal programming |
| B. | Queuing theory |
| C. | Markov Analysis |
| D. | Replacement theory |
| Answer» D. Replacement theory | |
| 45. |
Which of the following methods is used to solve an assignment problem: |
| A. | Enumeration Method |
| B. | Hungarian Method |
| C. | Simplex Method |
| D. | All of the above |
| Answer» E. | |
| 46. |
Commonly assumed probability distribution of service pattern are ....................... |
| A. | Poisson distribution |
| B. | Exponential distribution |
| C. | Erlang distribution |
| D. | b and c |
| Answer» E. | |
| 47. |
Operations Research cannot give perfect .................. to the problem. |
| A. | Answers |
| B. | Solutions |
| C. | Both a and b |
| D. | Decisions |
| Answer» D. Decisions | |
| 48. |
Straight lines shown in a linear programming graph indicates ........................... |
| A. | Objective function |
| B. | Constraints |
| C. | Points |
| D. | All of the above |
| Answer» C. Points | |
| 49. |
The variables which cannot be manipulated by the decision maker are called.................... |
| A. | Controllable variables |
| B. | Uncontrollable variables |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 50. |
A customer’s behaviour of leaving the queue due to impatience is called ....................... |
| A. | Jockying |
| B. | Reneging |
| C. | Collusion |
| D. | Balking |
| Answer» C. Collusion | |