MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The incoming variable column in the simplex algorithm is called . |
| A. | key column |
| B. | incoming column |
| C. | important column |
| D. | variable column |
| Answer» B. incoming column | |
| 2. |
In case of a ‘ ’ constraint, the feasible region is a straight line. |
| A. | less than or equal to |
| B. | greater than or equal to |
| C. | mixed |
| D. | equal to |
| Answer» E. | |
| 3. |
When it is not possible to find solution in LPP, it is called as solution |
| A. | infeasible |
| B. | unbounded |
| C. | improper |
| D. | unknown |
| Answer» B. unbounded | |
| 4. |
In linear programming, unbounded solution means solution. |
| A. | infeasible |
| B. | infinite |
| C. | unique |
| D. | degenerate |
| Answer» C. unique | |
| 5. |
_are the restrictions or limitations imposed on the LPP. |
| A. | objective function |
| B. | variables |
| C. | constraints |
| D. | profit |
| Answer» D. profit | |
| 6. |
specifies the objective or goal of solving the LPP. |
| A. | objective function |
| B. | decision variables |
| C. | constraints |
| D. | opportunity cost |
| Answer» B. decision variables | |
| 7. |
are the entities whose values are to be determined from the solution of the LPP. |
| A. | objective function |
| B. | decision variables |
| C. | constraints |
| D. | opportunity cost |
| Answer» C. constraints | |
| 8. |
and are techniques applied in project management. |
| A. | cpm and pert |
| B. | assignment & transportation |
| C. | game theory |
| D. | decision theory& inventory models |
| Answer» B. assignment & transportation | |
| 9. |
Operations Research Models in which some or all variables are random in nature are called models. |
| A. | physical |
| B. | symbolic |
| C. | deterministic |
| D. | probabilistic |
| Answer» E. | |
| 10. |
Operations Research Models in which values of all variables and all possible outcomes are known with certainty are called models. |
| A. | physical |
| B. | symbolic |
| C. | deterministic |
| D. | probabilistic |
| Answer» D. probabilistic | |
| 11. |
Any feasible solution which optimizes (minimizes or maximizes) the objective function of theLPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Optimal solution |
| B. | Non‐basic variables |
| C. | Solution |
| D. | Basic feasible solution |
| Answer» B. Non‐basic variables | |
| 12. |
Which technique is used in finding a solution for optimizing a given objective, such as profitmaximization or cost minimization under certain constraints? |
| A. | Quailing Theory |
| B. | Waiting Line |
| C. | Both A and B |
| D. | Linear Programming |
| Answer» E. | |
| 13. |
What has always been very important in the business and industrial world, particularly withregard to problems concerning productions of commodities? |
| A. | Linear Programming |
| B. | Production |
| C. | Decision – making |
| D. | None of the above |
| Answer» D. None of the above | |
| 14. |
LPP is exactly used in solving what kind of resource allocation problems? |
| A. | Production planning and scheduling |
| B. | Transportation |
| C. | Sales and advertising |
| D. | All of the above |
| Answer» E. | |
| 15. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ assumption means the prior knowledge of all the coefficients in the objectivefunction, the coefficients of the constraints and the resource values. |
| A. | Proportionality |
| B. | Certainty |
| C. | Finite choices |
| D. | Continuity |
| Answer» C. Finite choices | |
| 16. |
Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by thegraphical method. |
| A. | One decision |
| B. | Four decisions |
| C. | Three decisions |
| D. | Two decisions |
| Answer» E. | |
| 17. |
Any feasible solution to a transportation problem containing m origins and n destinations issaid to be ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Independent |
| B. | Degenerate |
| C. | Non‐degenerate |
| D. | Both A and B |
| Answer» D. Both A and B | |
| 18. |
In maximization cases , ‐‐‐‐‐‐‐‐‐‐‐‐‐ are assigned to the artificial variables as their coefficients inthe objective function |
| A. | +m |
| B. | –m |
| C. | None of the above |
| Answer» B. –m | |
| 19. |
What are the main questions before a production manager? |
| A. | Which commodity/ commodities to produce |
| B. | In what quantities |
| C. | By which process or processes |
| D. | All of the above |
| Answer» E. | |
| 20. |
In which phase is optimization done and how does that phase also checks for optimalityconditions? |
| A. | Phase II |
| B. | Phase I |
| C. | Phase II |
| D. | None of the above |
| Answer» D. None of the above | |
| 21. |
If in a LPP , the solution of a variable can be made infinity large without violating the constraints,the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» C. Alternative | |
| 22. |
Who pointed out that the businessman always studies his production function and his inputprices and substitutes one input for another till his costs become the minimum possible? |
| A. | Alan Marshall |
| B. | Alfred Marsh |
| C. | Alfred Marshall |
| D. | None of the above |
| Answer» D. None of the above | |
| 23. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as a method of determining an optimum programme interdependent activities in view of available resources |
| A. | Goal Programming |
| B. | Linear Programming |
| C. | Decision Making |
| D. | None of the above |
| Answer» C. Decision Making | |
| 24. |
An assumption that implies that finite numbers of choices are available to a decision – makerand the decision variables do not assume negative values is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Certainty |
| B. | Continuity |
| C. | Finite choices |
| D. | None of the above |
| Answer» D. None of the above | |
| 25. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models involves the allocation of resources to activities in such a manner that somemeasure of effectiveness is optimized. |
| A. | Sequencing |
| B. | Allocation Models |
| C. | Queuing Theory |
| D. | Decision Theory |
| Answer» C. Queuing Theory | |
| 26. |
A path formed by allowing horizontal and vertical lines and the entire corner cells of which areoccupied is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Occupied path |
| B. | Open path |
| C. | Closed path |
| D. | None of the above |
| Answer» D. None of the above | |
| 27. |
Graphic method can be applied to solve a LPP when there are only ‐‐‐‐‐‐‐‐‐‐‐‐‐ variable |
| A. | One |
| B. | More than One |
| C. | Two |
| D. | Three |
| Answer» D. Three | |
| 28. |
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» B. Products | |
| 29. |
‐‐‐‐‐‐‐‐‐‐‐‐ which is a subclass of a linear programming problem (LPP) |
| A. | Programming problem |
| B. | Transportation problem |
| C. | Computer problem |
| D. | Both are incorrect |
| Answer» C. Computer problem | |
| 30. |
‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems. |
| A. | Assignment problem |
| B. | Transportation problem |
| C. | Optimization Problem |
| D. | None of the above |
| Answer» B. Transportation problem | |
| 31. |
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. | |
| 32. |
For analyzing the problem , decision – makers should normally study |
| A. | Its qualitative aspects |
| B. | Its quantitative aspects |
| C. | Both A and B |
| D. | Neither A and B |
| Answer» B. Its quantitative aspects | |
| 33. |
An optimal solution is the ‐‐‐‐‐‐‐‐‐‐‐ stage of a solution obtained by improving the initial solution |
| A. | Third |
| B. | First |
| C. | Second |
| D. | Final |
| Answer» D. Final | |
| 34. |
To make an unbalanced assignment problem balanced, what are added with all entriesas zeroes? |
| A. | Dummy rows |
| B. | Dummy columns |
| C. | Both A and B |
| D. | Dummy entries |
| Answer» D. Dummy entries | |
| 35. |
Basic cells indicate positive values and non‐ basic cells have ‐‐‐‐‐‐‐‐‐‐‐ value for flow |
| A. | Negative |
| B. | Positive |
| C. | One |
| D. | zero |
| Answer» E. | |
| 36. |
A basic solution which also satisfies the condition in which all basic variables are non ‐negativeis called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Basic feasible solution |
| B. | Feasible solution |
| C. | Optimal solution |
| D. | None of the above |
| Answer» B. Feasible solution | |
| 37. |
A feasible solution is called a basic feasible solution if the number of non‐negative allocations isequal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | m‐n+1 |
| B. | m‐n‐1 |
| C. | m+n‐1 |
| D. | None of the above |
| Answer» D. None of the above | |
| 38. |
Optimality conditions are expressed as ‐‐‐‐‐‐‐‐‐‐‐‐‐ incase all non‐basic cells? |
| A. | Negligent costs |
| B. | Advanced costs |
| C. | Reduced costs |
| D. | None of the above |
| Answer» D. None of the above | |
| 39. |
In simplex algorithm , which method is used to deal with the situation where aninfeasible starting basic solution is given? |
| A. | Slack variable |
| B. | Simplex method |
| C. | M‐ method |
| D. | None of the above |
| Answer» D. None of the above | |
| 40. |
To make an unbalanced assignment problem balanced, what are added with all entries aszeroes? |
| A. | Dummy rows |
| B. | Dummy columns |
| C. | Both A and B |
| D. | Dummy entries |
| Answer» D. Dummy entries | |
| 41. |
The issue of decision models |
| A. | Is possible when the variable’s value is |
| B. | Reduces the scope of judgment and intuition known with certainty in decision making |
| C. | Requires the knowledge of computer software use |
| D. | None of the above |
| Answer» E. | |
| 42. |
Operations Research involves ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ attack of complex problems to arrive at theoptimum solution |
| A. | Scientific |
| B. | Systematic |
| C. | Both A and B |
| D. | Statistical |
| Answer» D. Statistical | |
| 43. |
Replacement Model is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ model |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» C. Both A and B | |
| 44. |
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» C. Cost | |
| 45. |
What is also defined as the non‐negative variables which are added in the LHS of theconstraint to convert the inequality ‘< ‘ into an equation? |
| A. | Slack variables |
| B. | Simplex algorithm |
| C. | Key element |
| D. | None of the above |
| Answer» B. Simplex algorithm | |
| 46. |
In which phase is optimization done and how does that phase also checks foroptimality conditions? |
| A. | Phase II |
| B. | Phase I |
| C. | Phase II |
| D. | None of the above |
| Answer» D. None of the above | |
| 47. |
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» B. Key column | |
| 48. |
Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ fromO origins and D destinations |
| A. | Goods |
| B. | Products |
| C. | Items |
| D. | None of the above |
| Answer» B. Products | |
| 49. |
Who invented a method of formal calculations often termed as ? |
| A. | A.V. Kantorovich |
| B. | L.V. Kantorovich |
| C. | T.S. Kantorovich |
| D. | Alfred Marshall |
| Answer» E. | |
| 50. |
Who originally called it ‘ Programming of interdependent activities in a linear structure’ but latershortened it to ‘ Linear Programming’ ? |
| A. | Dantzig |
| B. | Kantorovich |
| C. | Marshall |
| D. | None of the above |
| Answer» B. Kantorovich | |