Operations Research Multiple Choice Questions and Answers pdf for MBA BBA online and offline exams of various Institutions.

## Operations Research Multiple Choice Questions and Answers

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 for problems

5. OR ___ inter-disciplinary approach.

Ans. Imbibes

6. OR increases the effectiveness of ___ ability.

Ans. Decision making

7. OR gives a qualitative solution

Ans. True

8. One of the OR phases is the Action phase

Ans. True

9. Diagram belongs to the physical model

Ans. True

10. Allocation problems are represented by the iconic model

Ans. False

11. OR methodology consists of definition, solution and validation only.

Ans. False

12. The interaction between the OR team and Management reaches peak level in the implementation phase.

Ans. False

13. OR imbibes ___ team approach.

Ans. Inter-disciplinary

14. Linear programming is the tool of ___.

Ans. OR

15. The three phases of OR are ___.

Ans. Judgement phase, Research phase & Action phase

16. To solve any problem through the 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. An 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 the anywhere infeasible region

Ans. False

28. We add a 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 the basic variable are zero then the 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 the 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 the 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 the 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 the simplex method.

Ans. Yes

54. Matrix-minima method gives the 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 the optimum solution.

Ans. False

58. Vogel‟s approximation method gives a 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 the Hungarian method, you prepare the 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 the number of columns.

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 the travelling salesman problem, the objective is to visit each city ___ ___.

Ans. Only once

72. Salesman has ___ different sequences if n is 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

**Download Pdf form****Watch the video format of these MCQs on Youtube****Research methodology MCQ questions and answers**

#### In conclusion

This post offered a springboard for your Operations Research preparation by exploring some sample multiple choice questions. To truly excel, dive deeper into specific topics and practice solving problems from a comprehensive study guide or textbook. Good luck!