Operations Research Multiple Choice Questions and Answers

101. 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.

1. Both (i) and( ii)
2. (ii) only
3. (i) only
4. Both are incorrect

102. Probabilistic models are also known as

1. Deterministic Models
2. Stochastic Models
3. Dynamic Models
4. Static Models

103. Process refers to the combination of.........................inputs to produce a particular output.

1. one or more
2. two or more
3. one
4. None of the above

104. Replacement Model is a.................model

1. Static Models
2. Dynamic Models
3. Both A and B
4. None of the above

105. Simple linear programming problem with...............variables can be easily solved by the graphical method.

1. One decision
2. Four decisions
3. Three decisions
4. Two decisions

106. 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

1. both (i) and (ii) are correct
2. Two only
3. One only
4. Both (i) and (ii) are incorrect

107. The allocated cells in the transportation table are called

1. Occupied cells
2. Empty cells
3. Both A and B
4. Unoccupied cells

108. The issue of decision models

1. Is possible when the variables value is
2. Reduces the scope of judgment and intuition known with certainty in decision making
3. Requires the knowledge of computer software use
4. None of the above

109. The objective functions and constraints are linear relationship between

1. Variables
2. Constraints
3. Functions
4. All of the above

110. The operations Research technique which helps in minimizing total waiting and service costs is

1. Queuing Theory
2. Decision Theory
3. Both A and B
4. None of the above