MCQOPTIONS
Saved Bookmarks
This section includes 675 Mcqs, each offering curated multiple-choice questions to sharpen your General Management knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
What have been constructed for Operations Research problems and methods for solving themodels that are available in many cases? |
| A. | Scientific Models |
| B. | Algorithms |
| C. | Mathematical Models |
| D. | None of the above |
| Answer» D. None of the above | |
| 102. |
Currently, LPP is used in solving a wide range of practical ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Business problems |
| B. | Agricultural problems |
| C. | Manufacturing problems |
| D. | None of the above |
| Answer» B. Agricultural problems | |
| 103. |
In ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models there is risk and uncertainty |
| A. | Deterministic Models |
| B. | Probabilistic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» C. Both A and B | |
| 104. |
According to transportation problem number of basic cells will be exactly ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | m+n‐0 |
| B. | n+m‐1 |
| C. | m+n‐1 |
| D. | None of the above |
| Answer» D. None of the above | |
| 105. |
Linear Programming technique is used to allocate scarce resources in an optimum manner inproblems of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ? |
| A. | Schedule |
| B. | Product Mix |
| C. | Both A and B |
| D. | Servicing Cost |
| Answer» D. Servicing Cost | |
| 106. |
In ‐‐‐‐‐‐‐‐‐‐‐ models, everything is defined and the results are certain, |
| A. | Deterministic Models |
| B. | Probabilistic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Probabilistic Models | |
| 107. |
The operations Research technique, specially used to determine the optimum strategy is |
| A. | Decision Theory |
| B. | Simulation |
| C. | Game Theory |
| D. | None of the above |
| Answer» C. Game Theory | |
| 108. |
‐‐‐‐‐‐‐‐‐‐‐‐ is another method to solve a given LPP involving some artificial variable ? |
| A. | Big M method |
| B. | Method of penalties |
| C. | Two‐phase simplex method |
| D. | None of the above |
| Answer» D. None of the above | |
| 109. |
Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved bythe graphical method. |
| A. | One decision |
| B. | Four decisions |
| C. | Three decisions |
| D. | Two decisions |
| Answer» E. | |
| 110. |
Process refers to the combination of ‐‐‐‐‐‐‐‐‐‐‐‐ inputs to produce a particular output. |
| A. | one or more |
| B. | two or more |
| C. | one |
| D. | None of the above |
| Answer» B. two or more | |
| 111. |
How many methods are there to solve LPP? |
| A. | Three |
| B. | Two |
| C. | Four |
| D. | None of the above |
| Answer» C. Four | |
| 112. |
Please state which statement is true.(i) All linear programming problems may not have unique solutions(ii) The artificial variable technique is not a device that does not get the starting basic feasible solution. |
| A. | Both (i) and( ii) |
| B. | (ii) only |
| C. | (i) only |
| D. | Both are incorrect |
| Answer» D. Both are incorrect | |
| 113. |
All the constraints are expressed as equations and the right hand side of each constraint andall variables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Canonical variable |
| B. | Canonical form |
| C. | Canonical solution |
| D. | Both A and B |
| Answer» C. Canonical solution | |
| 114. |
The world ‘Linear’ means that the relationships are represented by ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Diagonal lines |
| B. | Curved lines |
| C. | Straight lines |
| D. | Slanting lines |
| Answer» D. Slanting lines | |
| 115. |
Which theory concerns making sound decisions under conditions of certainity, risk anduncertainty |
| A. | Game Theory |
| B. | Network Analysis |
| C. | Decision Theory |
| D. | None of the above |
| Answer» D. None of the above | |
| 116. |
Please state which statement is true.(i) All linear programming problems may not have unique solutions (ii) The artificial variable technique is not a device that does not get the starting basic feasible solution. |
| A. | Both (i) and( ii) |
| B. | (ii) only |
| C. | (i) only |
| D. | Both are incorrect |
| Answer» D. Both are incorrect | |
| 117. |
Operations Research emphasizes on the overall approach to the system. This charecteristics ofOperations Research is often referred as |
| A. | System Orientation |
| B. | System Approach |
| C. | Interdisciplinary Team Approach |
| D. | none |
| Answer» E. | |
| 118. |
An objective function which states the determinants of the quantity to be either maximized orminimized is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Feasible function |
| B. | Optimal function |
| C. | Criterion function |
| D. | None of the above |
| Answer» D. None of the above | |
| 119. |
There is a great scope for ‐‐‐‐‐‐‐‐‐‐‐‐ working as a team to solve problems of defence by using theOperations Research approach |
| A. | Economists |
| B. | Administrators |
| C. | Statisticians and Technicians |
| D. | All of the above |
| Answer» E. | |
| 120. |
What is also defined as the non‐negative variables which are added in the LHS of the constraintto convert the inequality ‘< ‘ into an equation? |
| A. | Slack variables |
| B. | Simplex algorithm |
| C. | Key element |
| D. | None of the above |
| Answer» B. Simplex algorithm | |
| 121. |
The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Systematically |
| B. | Rapidly |
| C. | Slowly |
| D. | Instantly |
| Answer» B. Rapidly | |
| 122. |
Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum(rim requirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Linear programming |
| B. | Basic feasible solution |
| C. | Feasible solution |
| D. | None of the above |
| Answer» D. None of the above | |
| 123. |
The term Operations Research was coined in the year ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | 1950 |
| B. | 1940 |
| C. | 1978 |
| D. | 1960 |
| Answer» C. 1978 | |
| 124. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time duringa particular period |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Dynamic Models | |
| 125. |
The variables whose coefficient vectors are unit vectors are called ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Unit Variables |
| B. | Basic Variables |
| C. | Non basic Variables |
| D. | None of the above |
| Answer» C. Non basic Variables | |
| 126. |
Before starting to solve the problem, it should be balanced. If not then make it balanced by ‐‐‐‐‐‐‐‐‐‐‐ column incase demand is less than supply or by adding ‐‐‐‐‐‐‐‐‐‐‐‐ raw incase supply is less than the demand |
| A. | O,D |
| B. | m,n |
| C. | Horizontal, Vertical |
| D. | Unshipped supply, Shortage |
| Answer» E. | |
| 127. |
What do we apply in order to determine the optimum solution ? |
| A. | LPP |
| B. | VAM |
| C. | MODI Method |
| D. | None of the above |
| Answer» D. None of the above | |
| 128. |
Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum (rimrequirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Linear programming |
| B. | Basic feasible solution |
| C. | Feasible solution |
| D. | None of the above |
| Answer» D. None of the above | |
| 129. |
Any feasible solution to a transportation problem containing m origins and n destinationsis said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Independent |
| B. | Degenerate |
| C. | Non‐degenerate |
| D. | Both A and B |
| Answer» D. Both A and B | |
| 130. |
Operations Research (OR) , which is a very powerful tool for ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Research |
| B. | Decision – Making |
| C. | Operations |
| D. | None of the above |
| Answer» C. Operations | |
| 131. |
In LPP, degeneracy occurs in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ stages |
| A. | One |
| B. | Two |
| C. | Three |
| D. | Four |
| Answer» C. Three | |
| 132. |
This method of formal calculations often termed as Linear Programming was developed later inwhich year? |
| A. | 1947 |
| B. | 1988 |
| C. | 1957 |
| D. | 1944 |
| Answer» B. 1988 | |
| 133. |
VAM stands for ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Vogeal’s Approximation Method |
| B. | Vogel’s Approximate Method |
| C. | Vangel’s Approximation Method |
| D. | Vogel’s Approximation Method |
| Answer» E. | |
| 134. |
If there are more than one optimum solution for the decision variable the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» D. None of the above | |
| 135. |
Who defined Operations Research as an aid for the executive in marketing his decisions byproviding him with the quantitative information based on the scientific method of analysis |
| A. | C. Kitte |
| B. | H.M. Wagner |
| C. | E.L. Arnoff |
| D. | None of the above |
| Answer» B. H.M. Wagner | |
| 136. |
Operations Research emphasizes on the overall approach to the system. This charecteristics of Operations Research is often referred as |
| A. | System Orientation |
| B. | System Approach |
| C. | Interdisciplinary Team Approach |
| D. | none |
| Answer» E. | |
| 137. |
Operations Research uses models to help the management to determine its ‐‐‐‐‐‐‐‐‐‐‐scientifically |
| A. | Policies |
| B. | Actions |
| C. | Both A and B |
| D. | None of the above |
| Answer» D. None of the above | |
| 138. |
The operations Research technique which helps in minimizing total waiting and service costs is |
| A. | Queuing Theory |
| B. | Decision Theory |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Decision Theory | |
| 139. |
Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Agricultural |
| B. | Industrial applications |
| C. | Both A and B |
| D. | Manufacturing |
| Answer» D. Manufacturing | |
| 140. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are expressed is n the form of inequities or equations |
| A. | Constraints |
| B. | Objective Functions |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Objective Functions | |
| 141. |
One can find the initial basic feasible solution by using ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ? |
| A. | VAM |
| B. | MODI |
| C. | Optimality test |
| D. | None of the above |
| Answer» B. MODI | |
| 142. |
Operations Research cannot give perfect ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ to problems |
| A. | Answers |
| B. | Solutions |
| C. | Both A and B |
| D. | Decisions |
| Answer» D. Decisions | |
| 143. |
A ‐‐‐‐‐‐‐‐‐ has rows / column having non‐ basic cells for holding compensating (+ )or (‐) sign. |
| A. | Cycle |
| B. | Dead – end |
| C. | Back track |
| D. | None of the above |
| Answer» B. Dead – end | |
| 144. |
Allocation Models are ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Iconic models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» D. None of the above | |
| 145. |
A ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models considers time as one of the important variable |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» C. Both A and B | |
| 146. |
What is concerned with the prediction of replacement costs and determination of the mosteconomic replacement policy ? |
| A. | Search Theory |
| B. | Theory of replacement |
| C. | Probabilistic Programming |
| D. | None of the above |
| Answer» C. Probabilistic Programming | |
| 147. |
For solving an assignment problem, which method is used? |
| A. | Hungarian |
| B. | American |
| C. | German |
| D. | Both are incorrect |
| Answer» B. American | |
| 148. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are called mathematical models |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» D. None of the above | |
| 149. |
A non – degenerate basic feasible solution is the basic feasible solution which has exactly mpositive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infinity |
| B. | One |
| C. | Zero |
| D. | X |
| Answer» D. X | |
| 150. |
What enables us to determine the earliest and the latest times for each of the events andactivities and thereby helps in the identification of the critical path? |
| A. | Programme Evaluation |
| B. | Review Technique (PERT) |
| C. | Both A and B |
| D. | Deployment of resources |
| Answer» D. Deployment of resources | |