MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 53 Mcqs, each offering curated multiple-choice questions to sharpen your Bachelor of Business Administration (BBA) knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
. Theory is an important operations research technique to analyze the queuing behaviour. |
| A. | waiting line |
| B. | net work |
| C. | decision |
| D. | simulation |
| Answer» B. net work | |
| 2. |
. 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» B. quantitative technique | |
| 3. |
.. 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» E. | |
| 4. |
Who defined Operations Research as scientific approach to problem solving for executive management. |
| A. | E L Arnoff |
| B. | H M Wagner |
| C. | Churchman |
| D. | None of these |
| Answer» C. Churchman | |
| 5. |
Operations Research emphasises on the overall approach to the system. This characteristic of Operations Research is often referred to as ................................. |
| A. | System orientation |
| B. | System approach |
| C. | Inter-disciplinary |
| D. | Team approach |
| Answer» E. | |
| 6. |
............................ models involve the allocation of resources to activities in such a way that some measure of effectiveness is optimised. |
| A. | Sequencing |
| B. | Allocation |
| C. | Queuing theory |
| D. | Decision theory |
| Answer» C. Queuing theory | |
| 7. |
The word .................. may be defined as some actions that we apply to some problems or hypothesis. |
| A. | Research |
| B. | Operations |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 8. |
........................ models assume that the values of the variables do not change with time during a particular period. |
| A. | Dynamic |
| B. | Static |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 9. |
........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources. |
| A. | Goal programming |
| B. | Linear programming |
| C. | Decision making |
| D. | None of these |
| Answer» C. Decision making | |
| 10. |
The solution to a transportation problem with m rows and n columns is feasible if the number of positive allocations are: |
| A. | m + n |
| B. | m x n |
| C. | m +n 1 |
| D. | m +n + 1 |
| Answer» D. m +n + 1 | |
| 11. |
Graphic method can be applied to solve a liner programming problem when there are only ........................... variables |
| A. | A one |
| B. | Two |
| C. | Three |
| D. | More than three |
| Answer» C. Three | |
| 12. |
A minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the ........................... |
| A. | Constraints |
| B. | Objectives |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 13. |
In maximisation cases, ....................... are assigned to the artificial variables as their coefficients in the objective function. |
| A. | + m |
| B. | m |
| C. | 0 |
| D. | None of these |
| Answer» B. m | |
| 14. |
In simplex method, ........................ should be selected when there is tie between slack/surplus variable and decision variable. |
| A. | Slack variable |
| B. | Decision variable |
| C. | Surplus variable |
| D. | None of these |
| Answer» C. Surplus variable | |
| 15. |
When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be .............................. |
| A. | Infeasible |
| B. | Unbounded |
| C. | Degenerate |
| D. | Non-degenerate |
| Answer» D. Non-degenerate | |
| 16. |
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 | |
| 17. |
In an LPP, if the solution of a variable can be made infinitely large without violating the constraints, then the solution is .............................. |
| A. | Infeasible |
| B. | Alternative |
| C. | Unbounded |
| D. | Unique |
| Answer» D. Unique | |
| 18. |
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 | |
| 19. |
Operations Research makes a ...................... attack on complex problems to arrive at optimal solution. |
| A. | Scientific |
| B. | Systematic |
| C. | Both a and b |
| D. | None of these |
| Answer» D. None of these | |
| 20. |
......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. |
| A. | Game theory |
| B. | Network analysis |
| C. | Decision theory |
| D. | None of these |
| Answer» D. None of these | |
| 21. |
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» B. unbalanced | |
| 22. |
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» C. the solution not be degenerate | |
| 23. |
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» D. 1960s | |
| 24. |
. 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» D. lft | |
| 25. |
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» C. free float | |
| 26. |
.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» E. | |
| 27. |
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» D. independent float | |
| 28. |
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» C. successor | |
| 29. |
.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» D. none of the above | |
| 30. |
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» C. most likely time estimate | |
| 31. |
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» B. slack | |
| 32. |
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» D. 64 | |
| 33. |
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» C. minimax regret | |
| 34. |
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» B. maxmin | |
| 35. |
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» D. all of the above | |
| 36. |
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» C. unbounded | |
| 37. |
...................... is a method of analysing the current movement of the some variable in an effort 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 | |
| 38. |
An activity which must be completed before commencement of one or more other activities is called................................. |
| A. | Successor activity |
| B. | Predecessor activity |
| C. | Dummy activity |
| D. | None of these |
| Answer» C. Dummy activity | |
| 39. |
Activities that cannot be started until one or more of the other activities are completed, are called.......................................... |
| A. | Dummy activities |
| B. | Initial activities |
| C. | Successor activities |
| D. | Predecessor activities |
| Answer» D. Predecessor activities | |
| 40. |
..................... is the duration by which an activity can be delayed without delaying the completion of the project. |
| A. | Earliest Start Time |
| B. | Earliest Finish Time |
| C. | Latest Start Time |
| D. | Latest Finish Time |
| Answer» D. Latest Finish Time | |
| 41. |
............................ is the latest time by which an activity can be finished without delaying the completion of the project. |
| A. | LST |
| B. | LFT |
| C. | EFT |
| D. | EST |
| Answer» C. EFT | |
| 42. |
................................is that element of the simplex table which lis both in the key row and key column. |
| A. | Key element |
| B. | Pivot element |
| C. | Both a and b |
| D. | None of these |
| Answer» D. None of these | |
| 43. |
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» D. none of the above | |
| 44. |
Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: |
| A. | NWCM |
| B. | LCM |
| C. | VAM |
| D. | None of these |
| Answer» D. None of these | |
| 45. |
a customer s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... |
| A. | Jockying |
| B. | Reneging |
| C. | Collusion |
| D. | Balking |
| Answer» E. | |
| 46. |
A matrix which shows the gains and losses resulting from moves and counter moves is called.................................. |
| A. | Cost matrix |
| B. | Pay off matrix |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 47. |
Game theory became popular when the book Theory of Games and Economic Behaviour was published in 1944 by .............................. |
| A. | Von Neumann |
| B. | Mc Closky |
| C. | Von-Neumann and Mc Closky |
| D. | Von-neumann and Morgenstern |
| Answer» E. | |
| 48. |
In a ........................game the amounts won by all winners together is equal to the sum of the amounts lost by all losers together. |
| A. | Non-zero sum game |
| B. | Zero sum game |
| C. | Rectangular game |
| D. | None of these |
| Answer» C. Rectangular game | |
| 49. |
If a simplex table shows the values 2, -3, 0 against , which should be taken as the replacement ratio. |
| A. | 2 |
| B. | -3 |
| C. | 0 |
| D. | None of these *** |
| Answer» D. None of these *** | |
| 50. |
When all the players of the game follow their optimal strategies, then the expected pay off of the game 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 | |