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. |
Operations Research attempts to find the best and __________ solution to a problem. |
| A. | ptimum |
| B. | erfect |
| C. | egenerate |
| D. | one of the above |
| Answer» B. erfect | |
| 2. |
___________ models are obtained by enlarging or reducing the size of the item. |
| A. | conic Models |
| B. | nalogue Models |
| C. | ymbolic Models |
| D. | one of the above |
| Answer» B. nalogue Models | |
| 3. |
A _____________ models considers time as one of the important variable. |
| A. | tatic Models |
| B. | ynamic Models |
| C. | oth A and B |
| D. | one of the above |
| Answer» C. oth A and B | |
| 4. |
____________ models assumes that the values of the variables do not change with time during a particular period. |
| A. | tatic Models |
| B. | ynamic Models |
| C. | oth A and B |
| D. | one of the above |
| Answer» B. ynamic Models | |
| 5. |
Probabilistic models are also known as. |
| A. | eterministic Models |
| B. | tochastic Models |
| C. | ynamic Models |
| D. | tatic Models |
| Answer» C. ynamic Models | |
| 6. |
___________ are called mathematical models. |
| A. | conic Models |
| B. | nalogue Models |
| C. | ymbolic Models |
| D. | one of the above |
| Answer» D. one of the above | |
| 7. |
Operations Research approach is __________ |
| A. | ulti disciplinary |
| B. | cientific |
| C. | nitiative |
| D. | ll of the above |
| Answer» B. cientific | |
| 8. |
Dual of the dual is ______________. |
| A. | rimal |
| B. | ual |
| C. | lternative |
| D. | one of the above |
| Answer» B. ual | |
| 9. |
If there are more than one optimum solution for the decision variable the solution is ___________. |
| A. | nfeasible |
| B. | nbounded |
| C. | lternative |
| D. | one of the above |
| Answer» D. one of the above | |
| 10. |
________ are expressed is n the form of inequities or equations. |
| A. | onstraints |
| B. | bjective Functions |
| C. | oth A and B |
| D. | one of the above |
| Answer» B. bjective Functions | |
| 11. |
An optimization model. |
| A. | athematically provides the best decision |
| B. | rovides decision within its limited context |
| C. | elps in evaluating various alternatives constantly |
| D. | ll of the above |
| Answer» E. | |
| 12. |
_____________ is one of the fundamental combinatorial optimization problems. |
| A. | ssignment problem |
| B. | ransportation problem |
| C. | ptimization Problem |
| D. | one of the above |
| Answer» B. ransportation problem | |
| 13. |
The issue of decision models. |
| A. | s possible when the variable’s value is |
| B. | educes the scope of judgment and intuition known with certainty in decision making |
| C. | equires the knowledge of computer software use |
| D. | one of the above |
| Answer» E. | |
| 14. |
Decision variables are __________ |
| A. | ontrollable |
| B. | ncontrollable |
| C. | arameters |
| D. | one of the above |
| Answer» B. ncontrollable | |
| 15. |
For analyzing the problem , decision – makers should normally study. |
| A. | ts qualitative aspects |
| B. | ts quantitative aspects |
| C. | oth A and B |
| D. | either A and B |
| Answer» B. ts quantitative aspects | |
| 16. |
A model is. |
| A. | n essence of reality |
| B. | n approximation |
| C. | n idealization |
| D. | ll of the above |
| Answer» E. | |
| 17. |
For analyzing a problem, decision-makers should study. |
| A. | ts qualitative aspects |
| B. | ts quantitative aspects |
| C. | oth a & b |
| D. | either a nor b |
| Answer» D. either a nor b | |
| 18. |
In a manufacturing process, who takes the decisions as to what quantities and which process or processes are to be used so that the cost is minimum and profit is maximum? |
| A. | upervisor |
| B. | anufacturer |
| C. | roducer |
| D. | roduction manager |
| Answer» E. | |
| 19. |
Operations Research approach is typically based on the use of. |
| A. | hysical model |
| B. | athematical model |
| C. | conic model |
| D. | escriptive model |
| Answer» C. conic model | |
| 20. |
The best use of linear programming technique is to find an optimal use of. |
| A. | oney |
| B. | anpower |
| C. | achine |
| D. | ll of the above |
| Answer» E. | |
| 21. |
Which of the following is not a characteristic of the LP model? |
| A. | lternative courses of action |
| B. | n objective function of maximization type |
| C. | imited amount of resources |
| D. | on-negativity condition on the value of decision variables. |
| Answer» C. imited amount of resources | |
| 22. |
Maximization of objective function in an LP model means. |
| A. | alue occurs at allowable set of decisions |
| B. | ighest value is chosen among allowable decisions |
| C. | either of above |
| D. | oth a & b |
| Answer» B. ighest value is chosen among allowable decisions | |
| 23. |
Assignment problem helps to find a maximum weight identical in nature in a weighted ____________. |
| A. | ripartite graph |
| B. | ipartite graph |
| C. | artite graph |
| D. | one of the above |
| Answer» C. artite graph | |
| 24. |
The objective functions and constraints are linear relationship between _____________. |
| A. | ariables |
| B. | onstraints |
| C. | unctions |
| D. | ll of the above |
| Answer» B. onstraints | |
| 25. |
An optimal solution of an assignment problem can be obtained only if. |
| A. | ach row & column has only one zero element |
| B. | ach row & column has at least one zero element |
| C. | he data is arrangement in a square matrix |
| D. | one of the above |
| Answer» E. | |
| 26. |
The graphical method of LP problem uses. |
| A. | bjective function equation |
| B. | onstraint equations |
| C. | inear equations |
| D. | ll of the above |
| Answer» E. | |
| 27. |
Which of the following is a limitation associated with an LP model? |
| A. | he relationship among decision variables in linear |
| B. | o guarantee to get integer valued solutions |
| C. | o consideration of effect of time & uncertainty on LP model |
| D. | ll of the above |
| Answer» E. | |
| 28. |
Which of the following is an assumption of an LP model? |
| A. | ivisibility |
| B. | roportionality |
| C. | dditivity |
| D. | ll of the above |
| Answer» E. | |
| 29. |
While solving a LP model graphically, the area bounded by the constraints is called? |
| A. | easible region |
| B. | nfeasible region |
| C. | nbounded solution |
| D. | one of the above |
| Answer» B. nfeasible region | |
| 30. |
The solution space (region) of an LP problem is unbounded due to. |
| A. | n incorrect formulation of the LP model |
| B. | bjective function is unbounded |
| C. | either a nor b |
| D. | oth a & b |
| Answer» D. oth a & b | |
| 31. |
Constraints in LP problem are called active if they. |
| A. | epresent optimal solution |
| B. | t optimality do not consume all the available resources |
| C. | oth a & b |
| D. | one of the above |
| Answer» B. t optimality do not consume all the available resources | |
| 32. |
While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because? |
| A. | he resources are limited in supply |
| B. | he objective function as a linear function |
| C. | he constraints are linear equations or inequalities |
| D. | ll of the above |
| Answer» D. ll of the above | |
| 33. |
If an iso-profit line yielding the optimal solution coincides with a constaint line, then. |
| A. | he solution is unbounded |
| B. | he solution is infeasible |
| C. | he constraint which coincides is redundant |
| D. | one of the above |
| Answer» E. | |
| 34. |
An iso-profit line represents. |
| A. | n infinite number of solutions all of which yield the same profit |
| B. | n infinite number of solution all of which yield the same cost |
| C. | n infinite number of optimal solutions |
| D. | boundary of the feasible region |
| Answer» B. n infinite number of solution all of which yield the same cost | |
| 35. |
The variables whose coefficient vectors are unit vectors are called ____________. |
| A. | nit Variables |
| B. | asic Variables |
| C. | on basic Variables |
| D. | one of the above |
| Answer» C. on basic Variables | |
| 36. |
If the feasible region of a LPP is empty, the solution is ______________. |
| A. | nfeasible |
| B. | nbounded |
| C. | lternative |
| D. | one of the above |
| Answer» B. nbounded | |
| 37. |
Graphic method can be applied to solve a LPP when there are only _____________ variable. |
| A. | ne |
| B. | ore than One |
| C. | wo |
| D. | hree |
| Answer» D. hree | |
| 38. |
Customer behavior in which the customer moves from one queue to another in a multiple channel situation is. |
| A. | alking |
| B. | eneging |
| C. | ockeying |
| D. | ltering |
| Answer» D. ltering | |
| 39. |
If one of the constraint of an equation in an LP problem has an unbounded solution, then. |
| A. | olution to such LP problem must be degenerate |
| B. | easible region should have a line segment |
| C. | lternative solutions exist |
| D. | one of the above |
| Answer» C. lternative solutions exist | |
| 40. |
If a non-redundant constraint is removed from an LP problem then. |
| A. | easible region will become larger |
| B. | easible region will become smaller |
| C. | olution will become infeasible |
| D. | one of the above |
| Answer» B. easible region will become smaller | |
| 41. |
In maximization cases, _____________ are assigned to the artificial variables as their coefficients in the objective function. |
| A. | m |
| B. | m |
| C. | |
| Answer» B. m | |
| 42. |
If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is _____________. |
| A. | nfeasible |
| B. | nbounded |
| C. | lternative |
| D. | one of the above |
| Answer» C. lternative | |
| 43. |
A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the _____________. |
| A. | onstraints |
| B. | bjective Functions |
| C. | oth A and B |
| D. | one of the above |
| Answer» C. oth A and B | |
| 44. |
If there are ‘m’ original variables and ‘n’ introduced variables, then there will be _____________ columns in the simplex table. |
| A. | + n |
| B. | – n |
| C. | +m + n |
| D. | + n – 1 |
| Answer» D. + n – 1 | |
| 45. |
A solution may be extracted from a model either by. |
| A. | onducting experiments on it |
| B. | athematical analysis |
| C. | oth A and B |
| D. | iversified Techniques |
| Answer» D. iversified Techniques | |
| 46. |
Operations Research uses models built by quantitative measurement of the variables of a given problem and also derives a solution from the model using _____________ of the diversified solution techniques. |
| A. | wo or more |
| B. | ne or more |
| C. | hree or more |
| D. | nly One |
| Answer» C. hree or more | |
| 47. |
Operations Research involves ______________ attack of complex problems to arrive at the optimum solution. |
| A. | cientific |
| B. | ystematic |
| C. | oth A and B |
| D. | tatistical |
| Answer» D. tatistical | |
| 48. |
Every LPP is associated with another LPP is called ______________. |
| A. | rimal |
| B. | ual |
| C. | on_linear programming |
| D. | one of the above |
| Answer» C. on_linear programming | |
| 49. |
In LPP, degeneracy occurs in ____________ stages. |
| A. | ne |
| B. | wo |
| C. | hree |
| D. | our |
| Answer» C. hree | |
| 50. |
A BFS of a LPP is said to be ________________ if at least one of the basic variable is zero. |
| A. | egenerate |
| B. | on_degenerate |
| C. | nfeasible |
| D. | nbounded |
| Answer» B. on_degenerate | |