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. |
All the parameters in the linear programming model are assumed to be ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | None of the above |
| Answer» C. Functions | |
| 2. |
As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Profit |
| B. | optimization |
| C. | cost |
| D. | None of the above |
| Answer» B. optimization | |
| 3. |
What is being considered as one of the most versatile management tools? |
| A. | Electronic Computers |
| B. | Linear Programming |
| C. | Computer Programming |
| D. | None of the above |
| Answer» C. Computer Programming | |
| 4. |
The solution of any transportation problem is obtained in how many stages? |
| A. | Five |
| B. | Four |
| C. | Three |
| D. | Two |
| Answer» E. | |
| 5. |
A solution may be extracted from a model either by |
| A. | Conducting experiments on it |
| B. | Mathematical analysis |
| C. | Both A and B |
| D. | Diversified Techniques |
| Answer» D. Diversified Techniques | |
| 6. |
For maximization in TP , the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐ |
| A. | Solution |
| B. | Profit Matrix |
| C. | Profit |
| D. | None of the above |
| Answer» D. None of the above | |
| 7. |
State which of the two statements is correct(i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost |
| A. | both (i) and (ii) are correct |
| B. | Two only |
| C. | One only |
| D. | Both (i) and (ii) are incorrect |
| Answer» D. Both (i) and (ii) are incorrect | |
| 8. |
Who defined Operations Research as scientific method of providing executive departments witha quantitative basis for decisions regarding the operations under their control? |
| A. | Morse and Kimball (1946) |
| B. | P.M.S. Blackett (1948) |
| C. | E.L. Arnoff and M.J. Netzorg |
| D. | None of the above |
| Answer» B. P.M.S. Blackett (1948) | |
| 9. |
Operations Research uses models built by quantitative measurement of the variables c a given problem and also derives a solution from the model using ‐‐‐‐‐‐‐‐‐‐‐‐‐ of the diversified solution techniques oncerning |
| A. | Two or more |
| B. | One or more |
| C. | Three or more |
| D. | Only One |
| Answer» C. Three or more | |
| 10. |
Every LPP is associated with another LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Primal |
| B. | Dual |
| C. | Non‐linear programming |
| D. | None of the above |
| Answer» C. Non‐linear programming | |
| 11. |
In ‐‐‐‐‐‐‐‐‐‐ models one set of properties is used to represent another set of properties |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» B. Analogue Models | |
| 12. |
If the total supply is less than the total demand, a dummy source (row) is included in the costmatrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Dummy Demand |
| B. | Dummy Supply |
| C. | Zero Cost |
| D. | Both A and B |
| Answer» D. Both A and B | |
| 13. |
In a manufacturing process, who takes the decisions as to what quantities and which process orprocesses are to be used so that the cost is minimum and profit is maximum? |
| A. | Supervisor |
| B. | Manufacturer |
| C. | Producer |
| D. | Production manager |
| Answer» E. | |
| 14. |
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 | |
| 15. |
The solution need not be in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ numbers |
| A. | Prime Number |
| B. | Whole Number |
| C. | Complex Number |
| D. | None of the above |
| Answer» C. Complex Number | |
| 16. |
Any feasible solution which optimizes (minimizes or maximizes) the objective function ofthe LPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Optimal solution |
| B. | Non‐basic variables |
| C. | Solution |
| D. | Basic feasible solution |
| Answer» B. Non‐basic variables | |
| 17. |
Key concept under which technique are network of events and activities , resourceallocation, time and cost considerations, network paths and critical paths ? |
| A. | Game Theory |
| B. | Network Analysis |
| C. | Decision Theory |
| D. | None of the above |
| Answer» C. Decision Theory | |
| 18. |
Who developed Linear Programming for the purpose of scheduling the complicatedprocurement activities of the United States Air Force? |
| A. | George B. Dantzig |
| B. | James B. Dantzig |
| C. | George B. Dante |
| D. | George V. Dantzig |
| Answer» B. James B. Dantzig | |
| 19. |
Which variables are fictitious and cannot have any physical meaning ? |
| A. | Optimal variable |
| B. | Decision variable |
| C. | Artificial variable |
| D. | None of the above |
| Answer» D. None of the above | |
| 20. |
Operations Research techniques helps the directing authority in optimum allocation of variouslimited resources, such as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Men and Machine |
| B. | Money |
| C. | Material and Time |
| D. | All of the above |
| Answer» E. | |
| 21. |
Operations Research is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Science |
| B. | Art |
| C. | Mathematics |
| D. | Both A and B |
| Answer» E. | |
| 22. |
Probabilistic models are also known as |
| A. | Deterministic Models |
| B. | Stochastic Models |
| C. | Dynamic Models |
| D. | Static Models |
| Answer» C. Dynamic Models | |
| 23. |
LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Proportionality |
| B. | Additivity |
| C. | Certainty |
| D. | All of the above |
| Answer» E. | |
| 24. |
MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Optimal solutions |
| B. | Optimality test |
| C. | Both A and B |
| D. | Optimization |
| Answer» D. Optimization | |
| 25. |
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» D. None of the above | |
| 26. |
If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» B. Unbounded | |
| 27. |
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» C. Partite graph | |
| 28. |
The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Occupied cells |
| B. | Empty cells |
| C. | Both A and B |
| D. | Unoccupied cells |
| Answer» D. Unoccupied cells | |
| 29. |
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» B. Feasible solution | |
| 30. |
In simplex method , we add ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables in the case of ‘=’ |
| A. | Slack Variable |
| B. | Surplus Variable |
| C. | Artificial Variable |
| D. | None of the above |
| Answer» D. None of the above | |
| 31. |
Who defined Operations Research as scientific approach to problem solving for executivemanagement ? |
| A. | E.L. Arnoff |
| B. | P.M.S. Blackett |
| C. | H.M. Wagner |
| D. | None of the above |
| Answer» D. None of the above | |
| 32. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐ refers to the combination of one or more inputs to produce a particular output. |
| A. | Solution |
| B. | variable |
| C. | Process |
| D. | None of the above |
| Answer» D. None of the above | |
| 33. |
Once the initial basic feasible solution has been computed , what is the next step in theproblem |
| A. | VAM |
| B. | Modified distribution method |
| C. | Optimality test |
| D. | None of the above |
| Answer» D. None of the above | |
| 34. |
Which method is an iterative procedure for solving LPP in a finite number of steps ? |
| A. | Simplex algorithm |
| B. | Slack variable |
| C. | M method |
| D. | Simplex method |
| Answer» E. | |
| 35. |
After determining every basic cell with in this cycle, adjustment is obtained as minimum valuein basic cells . this is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Adjustment amount |
| B. | aa |
| C. | Both A and B |
| D. | Alternatives |
| Answer» D. Alternatives | |
| 36. |
The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | All of the above |
| Answer» B. Constraints | |
| 37. |
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» B. Mathematicians | |
| 38. |
All the constraints are expressed as equations and the right hand side of each constraint and allvariables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Canonical variable |
| B. | Canonical form |
| C. | Canonical solution |
| D. | Both A and B |
| Answer» C. Canonical solution | |
| 39. |
The term linearity implies ‐‐‐‐‐‐‐‐‐‐‐ among the relevant variables: |
| A. | Straight line |
| B. | Proportional relationships |
| C. | Linear lines |
| D. | Both A and B |
| Answer» E. | |
| 40. |
Operations Research attempts to find the best and ‐‐‐‐‐‐‐‐‐‐‐‐‐ solution to a problem |
| A. | Optimum |
| B. | Perfect |
| C. | Degenerate |
| D. | None of the above |
| Answer» B. Perfect | |
| 41. |
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» D. None of the above | |
| 42. |
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» D. None of the above | |
| 43. |
The word ‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as some action that we apply to some problems orhypothesis. |
| A. | Research |
| B. | Operation |
| C. | Both A and B |
| D. | None of the above |
| Answer» C. Both A and B | |
| 44. |
An optimum solution is considered the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ among feasible solutions. |
| A. | Worst |
| B. | Best |
| C. | Ineffective |
| D. | None of the above |
| Answer» C. Ineffective | |
| 45. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time during aparticular period |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Dynamic Models | |
| 46. |
Operations Research simply helps in improving the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ of the solution but does not resultin a perfect solution. |
| A. | Quality |
| B. | Clarity |
| C. | Look |
| D. | None of the above |
| Answer» B. Clarity | |
| 47. |
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» E. | |
| 48. |
An objective function is maximized when it is a ‐‐‐‐‐‐‐‐‐‐‐ function |
| A. | Passive |
| B. | Profit |
| C. | Cost |
| D. | None of the above |
| Answer» C. Cost | |
| 49. |
A BFS of a LPP is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ if at least one of the basic variable is zero |
| A. | Degenerate |
| B. | Non‐degenerate |
| C. | Infeasible |
| D. | Unbounded |
| Answer» B. Non‐degenerate | |
| 50. |
To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐ |
| A. | LPP |
| B. | VAM |
| C. | MODI Method |
| D. | Rim |
| Answer» D. Rim | |