McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Bachelor of Computer Applications (BCA) , Bachelor of Management Studies (BMS) .
| 201. |
VAM stands for ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Vogeal’s Approximation Method |
| B. | Vogel’s Approximate Method |
| C. | Vangel’s Approximation Method |
| D. | Vogel’s Approximation Method |
| Answer» D. Vogel’s Approximation Method | |
| 202. |
Once the initial basic feasible solution has been computed , what is the next step in the problem |
| A. | VAM |
| B. | Modified distribution method |
| C. | Optimality test |
| D. | None of the above |
| Answer» C. Optimality test | |
| 203. |
One can find the initial basic feasible solution by using ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ? |
| A. | VAM |
| B. | MODI |
| C. | Optimality test |
| D. | None of the above |
| Answer» A. VAM | |
| 204. |
What do we apply in order to determine the optimum solution ? |
| A. | LPP |
| B. | VAM |
| C. | MODI Method |
| D. | None of the above |
| Answer» C. MODI Method | |
| 205. |
In a TP , if the number of non‐negative independent allocation is ‐‐‐‐‐‐‐‐‐‐‐‐ than m+n‐1. |
| A. | Equivalent |
| B. | Greater |
| C. | Less |
| D. | None of the above |
| Answer» C. Less | |
| 206. |
A given TP is said to be unbalanced, if the total supply is not equal to the total ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Optimization |
| B. | Demand |
| C. | Cost |
| D. | None of the above |
| Answer» B. Demand | |
| 207. |
If the total supply is less than the total demand, a dummy source (row) is included in the cost matrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Dummy Demand |
| B. | Dummy Supply |
| C. | Zero Cost |
| D. | Both A and B |
| Answer» C. Zero Cost | |
| 208. |
To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐ |
| A. | LPP |
| B. | VAM |
| C. | MODI Method |
| D. | Rim |
| Answer» C. MODI Method | |
| 209. |
For maximization in TP , the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐ |
| A. | Solution |
| B. | Profit Matrix |
| C. | Profit |
| D. | None of the above |
| Answer» C. Profit | |
| 210. |
Operations Research (OR) , which is a very powerful tool for ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Research |
| B. | Decision – Making |
| C. | Operations |
| D. | None of the above |
| Answer» B. Decision – Making | |
| 211. |
The term Operations Research was coined in the year ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | 1950 |
| B. | 1940 |
| C. | 1978 |
| D. | 1960 |
| Answer» B. 1940 | |
| 212. |
This 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 | |
| 213. |
Operations Research was known as an ability to win a war without really going in to a ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Battle field |
| B. | Fighting |
| C. | War |
| D. | Both A and B |
| Answer» D. Both A and B | |
| 214. |
Who defined Operations Research as an aid for the executive in marketing his decisions by providing 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» A. C. Kitte | |
| 215. |
Operations Research has the characteristics the it is done by a team of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Scientists |
| B. | Mathematicians |
| C. | Academics |
| D. | All of the above |
| Answer» A. Scientists | |
| 216. |
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» D. none | |
| 217. |
Operations Research uses models built by quantitative measurement of the variables concerning a given problem and also derives a solution from the model using ‐‐‐‐‐‐‐‐‐‐‐‐‐ of the diversified solution techniques |
| A. | Two or more |
| B. | One or more |
| C. | Three or more |
| D. | Only One |
| Answer» B. One or more | |
| 218. |
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» C. Both A and B | |
| 219. |
Operations Research is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Science |
| B. | Art |
| C. | Mathematics |
| D. | Both A and B |
| Answer» D. Both A and B | |
| 220. |
Key concept under which technique are network of events and activities , resource allocation, time and cost considerations, network paths and critical paths ? |
| A. | Game Theory |
| B. | Network Analysis |
| C. | Decision Theory |
| D. | None of the above |
| Answer» B. Network Analysis | |
| 221. |
What is concerned with the prediction of replacement costs and determination of the most economic replacement policy ? |
| A. | Search Theory |
| B. | Theory of replacement |
| C. | Probabilistic Programming |
| D. | None of the above |
| Answer» B. Theory of replacement | |
| 222. |
Allocation problems can be solved by |
| A. | Linear Programming Technique |
| B. | Non – Linear Programming Technique |
| C. | Both A and B |
| D. | None of the above |
| Answer» C. Both A and B | |
| 223. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models are obtained by enlarging or reducing the size of the item |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» A. Iconic Models | |
| 224. |
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» B. Simulation | |
| 225. |
It is not easy to make any modification or improvement in |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» C. Symbolic Models | |
| 226. |
Allocation Models are ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Iconic models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» C. Symbolic Models | |
| 227. |
Probabilistic models are also known as |
| A. | Deterministic Models |
| B. | Stochastic Models |
| C. | Dynamic Models |
| D. | Static Models |
| Answer» B. Stochastic Models | |
| 228. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time during a particular period |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» A. Static Models | |
| 229. |
The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | All of the above |
| Answer» A. Variables | |
| 230. |
Assignment problem helps to find a maximum weight identical in nature in a weighted ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Tripartite graph |
| B. | Bipartite graph |
| C. | Partite graph |
| D. | None of the above |
| Answer» B. Bipartite graph | |
| 231. |
All the parameters in the linear programming model are assumed to be ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | None of the above |
| Answer» B. Constraints | |
| 232. |
If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» A. Infeasible | |
| 233. |
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» B. Basic Variables | |
| 234. |
Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Vector |
| B. | Key column |
| C. | Key Raw |
| D. | None of the above |
| Answer» A. Vector | |
| 235. |
Every LPP is associated with another LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Primal |
| B. | Dual |
| C. | Non‐linear programming |
| D. | None of the above |
| Answer» B. Dual | |
| 236. |
As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Profit |
| B. | optimization |
| C. | cost |
| D. | None of the above |
| Answer» A. Profit | |
| 237. |
Dual of the dual is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Primal |
| B. | Dual |
| C. | Alternative |
| D. | None of the above |
| Answer» A. Primal | |
| 238. |
‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems. |
| A. | Assignment problem |
| B. | Transportation problem |
| C. | Optimization Problem |
| D. | None of the above |
| Answer» A. Assignment problem | |
| 239. |
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 | |
| 240. |
Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Agricultural |
| B. | Industrial applications |
| C. | Both A and B |
| D. | Manufacturing |
| Answer» C. Both A and B | |
| 241. |
This method of formal calculations often termed as Linear Programming was developed later in which year? |
| A. | 1947 |
| B. | 1988 |
| C. | 1957 |
| D. | 1944 |
| Answer» A. 1947 | |
| 242. |
The world ‘Linear’ means that the relationships are represented by ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Diagonal lines |
| B. | Curved lines |
| C. | Straight lines |
| D. | Slanting lines |
| Answer» C. Straight lines | |
| 243. |
The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Systematically |
| B. | Rapidly |
| C. | Slowly |
| D. | Instantly |
| Answer» A. Systematically | |
| 244. |
LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Proportionality |
| B. | Additivity |
| C. | Certainty |
| D. | All of the above |
| Answer» D. All of the above | |
| 245. |
Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by the graphical method. |
| A. | One decision |
| B. | Four decisions |
| C. | Three decisions |
| D. | Two decisions |
| Answer» D. Two decisions | |
| 246. |
Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐ |
| A. | Unbounded solution |
| B. | Optimal solution |
| C. | Feasible solution |
| D. | Both A and B |
| Answer» C. Feasible solution | |
| 247. |
Any feasible solution which optimizes (minimizes or maximizes) the objective function of the LPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Optimal solution |
| B. | Non‐basic variables |
| C. | Solution |
| D. | Basic feasible solution |
| Answer» A. Optimal solution | |
| 248. |
A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infinity |
| B. | One |
| C. | Zero |
| Answer» C. Zero | |
| 249. |
What is also defined as the non‐negative variables which are added in the LHS of the constraint to convert the inequality ‘< ‘ into an equation? |
| A. | Slack variables |
| B. | Simplex algorithm |
| C. | Key element |
| D. | None of the above |
| Answer» A. Slack variables | |
| 250. |
In simplex algorithm , which method is used to deal with the situation where an infeasible starting basic solution is given? |
| A. | Slack variable |
| B. | Simplex method |
| C. | M‐ method |
| D. | None of the above |
| Answer» C. M‐ method | |
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.