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. |
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» D. None of the above | |
| 2. |
The region of feasible solution in LPP graphical method is called region |
| A. | infeasible |
| B. | infinite |
| C. | unbounded |
| D. | feasible |
| Answer» E. | |
| 3. |
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 | |
| 4. |
Linear Programming technique is used to allocate scarce resources in an optimum manner in problems of ? |
| A. | Schedule |
| B. | Product Mix |
| C. | Both A and B |
| D. | Servicing Cost |
| Answer» D. Servicing Cost | |
| 5. |
What have been constructed for Operations Research problems and methods for solving the models 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 | |
| 6. |
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 | |
| 7. |
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» D. Dummy entries | |
| 8. |
Operations Research techniques helps the directing authority in optimum allocation of various limited resources, such as |
| A. | Men and Machine |
| B. | Money |
| C. | Material and Time |
| D. | All of the above |
| Answer» E. | |
| 9. |
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» D. Dummy entries | |
| 10. |
Please state which statement is incorrect.(i) Linear programming was first formulated by an English economist L.V. Kantorovich(ii) LP is generally used in solving maximization or minimization problems subject to certain assumptions. |
| A. | (ii) only |
| B. | (i) only |
| C. | Both (i) and( ii) |
| D. | Both are correct |
| Answer» C. Both (i) and( ii) | |
| 11. |
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» C. Canonical solution | |
| 12. |
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» C. Canonical solution | |
| 13. |
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. | |
| 14. |
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» D. None of the above | |
| 15. |
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 | |
| 16. |
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 | |
| 17. |
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 | |
| 18. |
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 | |
| 19. |
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 | |
| 20. |
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» B. Non basic variables | |
| 21. |
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 | |
| 22. |
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» B. Non basic variables | |
| 23. |
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 | |
| 24. |
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 | |
| 25. |
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 | |
| 26. |
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» D. None of the above | |
| 27. |
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 | |
| 28. |
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» D. None of the above | |
| 29. |
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» D. | |
| 30. |
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 |
| D. | X |
| Answer» D. X | |
| 31. |
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» D. Both A and B | |
| 32. |
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» D. Both A and B | |