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) .
| 251. |
How many methods are there to solve LPP? |
| A. | Three |
| B. | Two |
| C. | Four |
| D. | None of the above |
| Answer» B. Two | |
| 252. |
An assumption that implies that finite numbers of choices are available to a decision – maker and the decision variables do not assume negative values is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Certainty |
| B. | Continuity |
| C. | Finite choices |
| D. | None of the above |
| Answer» C. Finite choices | |
| 253. |
A set of values X1, X2,…Xn which satisfies the constraints of the LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Solution |
| B. | Variable |
| C. | Linearity |
| D. | None of the above |
| Answer» A. Solution | |
| 254. |
A basic solution which also satisfies the condition in which all basic variables are non ‐ negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Basic feasible solution |
| B. | Feasible solution |
| C. | Optimal solution |
| D. | None of the above |
| Answer» A. Basic feasible solution | |
| 255. |
All the constraints are expressed as equations and the right hand side of each constraint and all variables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Canonical variable |
| B. | Canonical form |
| C. | Canonical solution |
| D. | Both A and B |
| Answer» B. Canonical form | |
| 256. |
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» A. Business problems | |
| 257. |
Please state which statement is true.
|
| A. | Both (i) and( ii) |
| B. | (ii) only |
| C. | (i) only |
| D. | Both are incorrect |
| Answer» C. (i) only | |
| 258. |
Please state which statement is incorrect.
|
| A. | (ii) only |
| B. | (i) only |
| C. | Both (i) and( ii) |
| D. | Both are correct |
| Answer» B. (i) only | |
| 259. |
MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Optimal solutions |
| B. | Optimality test |
| C. | Both A and B |
| D. | Optimization |
| Answer» C. Both A and B | |
| 260. |
To make an unbalanced assignment problem balanced, what are added with all entries as zeroes? |
| A. | Dummy rows |
| B. | Dummy columns |
| C. | Both A and B |
| D. | Dummy entries |
| Answer» C. Both A and B | |
| 261. |
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» C. Feasible solution | |
| 262. |
A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | m‐n+1 |
| B. | m‐n‐1 |
| C. | m+n‐1 |
| D. | None of the above |
| Answer» C. m+n‐1 | |
| 263. |
Any feasible solution to a transportation problem containing m origins and n destinations is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Independent |
| B. | Degenerate |
| C. | Non‐degenerate |
| D. | Both A and B |
| Answer» C. Non‐degenerate | |
| 264. |
Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from O origins and D destinations |
| A. | Goods |
| B. | Products |
| C. | Items |
| D. | None of the above |
| Answer» A. Goods | |
| 265. |
If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Simple problem |
| B. | Balanced problem |
| C. | Transportation problem |
| D. | None of the above |
| Answer» B. Balanced problem | |
| 266. |
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» D. Unshipped supply, Shortage | |
| 267. |
In which phase is optimization done and how does that phase also checks for optimality conditions? |
| A. | Phase II |
| B. | Phase I |
| C. | Phase II |
| D. | None of the above |
| Answer» C. Phase II | |
| 268. |
Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐ |
| A. | Time taken |
| B. | Partial cost |
| C. | Total cost |
| D. | None of the above |
| Answer» C. Total cost | |
| 269. |
State which of the two statements is correct
|
| A. | both (i) and (ii) are correct |
| B. | Two only |
| C. | One only |
| D. | Both (i) and (ii) are incorrect |
| Answer» C. One only | |
| 270. |
The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Occupied cells |
| B. | Empty cells |
| C. | Both A and B |
| D. | Unoccupied cells |
| Answer» C. Both A and B | |
| 271. |
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 | |
| 272. |
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 | |
| 273. |
To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐ |
| A. | LPP |
| B. | VAM |
| C. | MODI Method |
| D. | Rim |
| Answer» C. MODI Method | |
| 274. |
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 | |
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.