Operation research MCQ
1. The main objective of OR is to provide a ____, ____ to the decision-makers.
Ans. Scientific basis
2. OR employs a team of ____ from ____ ____.
Ans. Scientists, different disciplines
3. Mention two applications of OR.
Ans. Industry Planning
4. How can a hospital benefit from the application of OR methods?
Ans. To solve waiting problems
5. OR ____ inter-disciplinary approach.
Ans. Imbibes
6. OR increases the effectiveness of ____ ability.
Ans. Decision making
7. OR gives qualitative solution
Ans. True
8. One of the OR phases is Action phase
Ans. True
9. Diagram belongs to the physical model
Ans. True
10. Allocation problems are represented by iconic model
Ans. False
11. OR methodology consists of definition, solution and validation only.
Ans. False
12. The interaction between OR team and Management reaches peak level in implementation phase.
Ans. False
13. OR imbibes ____ team approach.
Ans. Inter-disciplinary
14. Linear programming is tool of ____.
Ans. OR
15. The three phases of OR are ____.
Ans. Judgement phase, Research phase & Action phase
16. To solve any problem through OR approach the first step is ____.
Ans. Define the problem
17. ____ represents a real life system.
Ans. Model
18. ____ represents the controlled variables of the system
Ans. Parameters
19. Both the objective function and constraints are expressed in ____ forms.
Ans. Linear
20. LPP requires existence of ____, ____, ____ and ____.
Ans. Alternate course of action
21. Solution of decision variables can also be _____.
Ans. Fractious
22. One of the characteristics of canonical form in the objective function must be of maximisation.
Ans. True
23. 2x – 3y ≤ 10 can be written as -2x + 3y ≥-10
Ans. True
24. The collection of all feasible solutions is known as the ____ region.
Ans. Feasible
25. A linear inequality in two variables is known as a ____.
Ans. Half-plan
26. The feasible region is a convex set
Ans. True
27. The optimum value occurs anywhere in feasible region
Ans. False
28. We add surplus variable for “≤” of constraint.
Ans. False
29. The right hand side element of each constraint is non-negative.
Ans. True
30. A basic solution is said to be a feasible solution if it satisfies all constraints.
Ans. True
31. If one or more values of basic variable are zero then solution is said to be degenerate.
Ans. True
32. The right hand side element of each constraint is non-negative.
Ans. Yes
33. The key column is determined by Zj - Cj row.
Ans. Yes
34. Pivotal element lies on the crossing of key column and key row.
Ans. No
35. The negative and infinite ratios are considered for determining key row.
Ans. Yes
36. The value of artificial value is “M”.
Ans. Yes
37. Artificial variables enter as basic variables.
Ans. Yes
38. Dual LPP always reduces the amount of computation.
Ans. No
39. It is possible to reverse the dual LPP to primal LPP
Ans. Yes
40. The coefficients of decision variables in the objective function become quantities on the right hand side of
____ ____.
Ans. Dual
41. “” constraints changes to ____ type in dual LP.
Ans. ≥
42. For every LPP, there exists a unique ____ problem.
Ans. Dual
43. Dual variables represent the worth or unit of a resource.
Ans. True
44. Optimality is reached when the resources are not fully utilised.
Ans. False
45. At optimum level the relationship holds as a strict equation
Ans. True
46. Sensitivity analysis is carried out on ____ simplex table.
Ans. Final
47. It helps us to study the effect of changes in ____ ____ in objective function.
Ans. Resource, levels
48. The results of sensitive analysis establish ____ and ____ ____ for input parameters value.
Ans. Upper, lower, bounce
49. Transportation problems are a special type of ____.
Ans. LPP
50. The number of rows and columns need not always be ____.
Ans. Equal
51. Transportation problem develops a schedule at ____ and ____.
Ans. Minimum cost
52. In transportation problems, ai = bj is a sufficient and necessary condition for getting a feasible solution.
Ans. Yes
53. Transportation problems can also be solved by simplex method.
Ans. Yes
54. Matrix-minima method gives optimum solution.
Ans. No
55. In matrix-minima method, you start allocating from the left-top cell of the table.
Ans. False
56. In Vogel‟s approximation method, you first construct penalty and then start allocating.
Ans. True
57. North-west corner rule gives optimum solution.
Ans. False
58. Vogel’s approximation method gives solution near to the optimum solution.
Ans. True
59. All the values of Cij - ui - vj should be ____ or ____ for the solution to be optimum.
Ans. zero
60. In unbalanced transportation problem ai is ____ ____ to bj.
Ans. Not equal to
61. If the number of allocation is less than ____ then it is said to be a degenerate transportation problem.
Ans. m + n – 1
62. In an AP, the constraints are of equality type.
Ans. True
63. The number of facilities should be equal to the number of resources.
Ans. True
64. The decision variables can take on any value.
Ans. False
65. In Hungarian method, you prepare row-reduced matrix.
Ans . True
66. The number of assignments should be equal to the number of rows for an optimum solution.
Ans. True
67. There can be more than one allocation in a row.
Ans. False
68. In unbalanced AP, the number of rows ____ to number of column.
Ans. ≠
69. Hungarian method cannot be applied directly to ____ problem.
Ans. Maximisation problem
70. If some jobs cannot be assigned to some machines, then it is called ____ assignment problem.
Ans. Infeasible
71. In travelling salesman problem, the objective is to visit each cities ____ ____.
Ans. Only once
72. Salesman has ____ different sequences if n are the number of cities to be visited.
Salesman
Ans. (n-1)
73. Integer programming is applied to problems that involve discrete variables.
Ans. True
74. If some variables take on non-negative values, then it is known as pure IPP.
Ans. False
75. An optimum solution to IPP is first obtained by using ____.
Ans. Simplex method