McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Bachelor of Business Administration (BBA) , Master of Commerce (M.com) .
| 101. |
.................... 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» D. Arthur Clark | |
| 102. |
Operations Research is a very powerful tool for ........................ |
| A. | Operations |
| B. | Research |
| C. | Decision making |
| D. | None of these |
| Answer» C. Decision making | |
| 103. |
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» B. H M Wagner | |
| 104. |
The term “Operations Research” was coined in the year ................... |
| A. | 1930 |
| B. | 1940 |
| C. | 1950 |
| D. | 1960 |
| Answer» B. 1940 | |
| 105. |
The innovative science of Operations Research was discovered during ...................... |
| A. | Civil war |
| B. | World war I |
| C. | World war II |
| D. | Industrial Revolution |
| Answer» C. World war II | |
| 106. |
Operations Research has the characteristic that it is done by a team of ..................... |
| A. | Scientists |
| B. | Mathematicians |
| C. | Academicians |
| D. | Politicians |
| Answer» A. Scientists | |
| 107. |
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» D. Team approach | |
| 108. |
Operations Research cannot give perfect .................. to the problem. |
| A. | Answers |
| B. | Solutions |
| C. | Both a and b |
| D. | Decisions |
| Answer» C. Both a and b | |
| 109. |
............................ 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» B. Allocation | |
| 110. |
In .................. models, everything is defined and the results are certain. |
| A. | Probabilistic |
| B. | Deterministic |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Deterministic | |
| 111. |
......................... models involve more risks and uncertainties. |
| A. | Probabilistic |
| B. | Deterministic |
| C. | Both a and b |
| D. | None of these |
| Answer» A. Probabilistic | |
| 112. |
.......................... models are obtained by enlarging or reducing the size of the items. |
| A. | Iconic models |
| B. | Analogue models |
| C. | Symbolic models |
| D. | None of these |
| Answer» A. Iconic models | |
| 113. |
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» B. Operations | |
| 114. |
......................are representations of reality. |
| A. | Phases |
| B. | Models |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Models | |
| 115. |
.........................are called mathematical models. |
| A. | Iconic models |
| B. | Symbolic models |
| C. | Analogue models |
| D. | None of these |
| Answer» B. Symbolic models | |
| 116. |
Probabilistic models are also called ........................... |
| A. | Deterministic models |
| B. | Dynamic models |
| C. | Stochastic models |
| D. | None of these |
| Answer» C. Stochastic models | |
| 117. |
........................ 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» B. Static | |
| 118. |
.......................models consider time as one of the important variable. |
| A. | Dynamic |
| B. | Static |
| C. | Botha and b |
| D. | None of these |
| Answer» A. Dynamic | |
| 119. |
........................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» B. Linear programming | |
| 120. |
..................... are expressed in the form of equations |
| A. | Objectives |
| B. | Constraints |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Constraints | |
| 121. |
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» C. Alternative | |
| 122. |
Dual of the dual s a .......................... |
| A. | Dual |
| B. | Primal |
| C. | Alternative |
| D. | None of these |
| Answer» B. Primal | |
| 123. |
The quantitative approach to decision analysis is a .......................... |
| A. | Logical approach |
| B. | Rational approach |
| C. | Scientific approach |
| D. | All of the above |
| Answer» C. Scientific approach | |
| 124. |
A model is a ........................... |
| A. | An essence of reality |
| B. | An approximation |
| C. | An idealisation |
| D. | All of the above |
| Answer» D. All of the above | |
| 125. |
The dummy source/destination in a transportation problem is added to ........................ |
| A. | Satisfy rim constraints |
| B. | Prevent solution from becoming degenerate |
| C. | Ensure total cost does not exceed a limit |
| D. | None of the above |
| Answer» A. Satisfy rim constraints | |
| 126. |
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» C. m +n – 1 | |
| 127. |
The method used for solving an assignment problem is: |
| A. | Reduced matrix method |
| B. | MODI method |
| C. | Hungarian method |
| D. | None of these |
| Answer» C. Hungarian method | |
| 128. |
An assignment problem can be solved by ......................... |
| A. | Simplex method |
| B. | Transportation method |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 129. |
For salesman who has to visit ‘n’ cities, which of the following are the ways of his tour plans: |
| A. | n ! |
| B. | (n+1) ! |
| C. | (n-1) ! |
| D. | n |
| Answer» C. (n-1) ! | |
| 130. |
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» D. All the above | |
| 131. |
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» B. A travelling salesman problem | |
| 132. |
All the parameters in the linear programming model are assumed to be ..................... |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | None of these |
| Answer» B. Constraints | |
| 133. |
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» B. Two | |
| 134. |
If the feasible region of a linear programming problem is empty, the solution is .................... |
| A. | Unbounded |
| B. | Infeasible |
| C. | Infeasible |
| D. | Alternative |
| Answer» B. Infeasible | |
| 135. |
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» B. Basic variables | |
| 136. |
Any column or row of a simplex table is known as ......................... |
| A. | Key column |
| B. | Key row |
| C. | Vector |
| D. | None of these |
| Answer» C. Vector | |
| 137. |
.................... is considered as the pioneer of Linear Programming Technique. |
| A. | Churchman |
| B. | D W Miller |
| C. | James Lundy |
| D. | George B Dantzig |
| Answer» D. George B Dantzig | |
| 138. |
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» B. Objectives | |
| 139. |
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» C. Unbounded | |
| 140. |
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» A. + m | |
| 141. |
In simplex method, we add .......................... in the case of constraints with sign “=” |
| A. | Surplus variable |
| B. | Artificial variable |
| C. | Slack variable |
| D. | None of these |
| Answer» B. Artificial variable | |
| 142. |
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» B. Decision variable | |
| 143. |
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» C. Degenerate | |
| 144. |
In Linear Programming Problem, degeneracy occurs in ................. stages. |
| A. | One |
| B. | Two |
| C. | Three |
| D. | Four |
| Answer» B. Two | |
| 145. |
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» B. Dual | |
| 146. |
In a maximisation assignment problem, the objective is to maximise ............................. |
| A. | Profit |
| B. | Cost |
| C. | Optimisation |
| D. | None of these |
| Answer» A. Profit | |
| 147. |
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» A. Quality | |
| 148. |
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» C. Both a and b | |
| 149. |
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» C. Both a and b | |
| 150. |
Operations Research is a ................................ |
| A. | Science |
| B. | Art |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.