121. If there are more than one optimal solutions for the decision variables, the solution is ___
A. Infeasible
B. Unbounded
C. Alternative
D. None of these
Answer
C. Alternative
122. Dual of the dual s a ___. .
A. Dual
B. Primal
C. Alternative
D. None of these
Answer
B. Primal
123. The quantitative approach to decision analysis is a ___. .
A. Logical approach
B. Rational approach
C. Scientific approach
D. All of the above
Answer
C. Scientific approach
124. A model is a ___
A. An essence of reality
B. An approximation
C. An idealisation
D. All of the above
Answer
D. All of the above
125. The dummy source/destination in a transportation problem is added to ___.
A. Satisfy rim constraints
B. Prevent solution from becoming degenerate
C. Ensure total cost does not exceed a limit
D. None of the above
Answer
A. Satisfy rim constraints
126. The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the numberof positive allocations are:
A. m + n
B. m x n
C. m +n – 1
D. m +n + 1
Answer
C. m +n – 1
127. The method used for solving an assignment problem is:
A. Reduced matrix method
B. MODI method
C. Hungarian method
D. None of these
Answer
C. Hungarian method
128. An assignment problem can be solved by ___. .
A. Simplex method
B. Transportation method
C. Both a and b
D. None of these
Answer
C. Both a and b
129. For salesman who has to visit ‘n’ cities, which of the following are the ways of his tour plans:
A. n !
B. (n+1) !
C. (n-1) !
D. n
Answer
C. (n-1) !
130. The assignment problem is:
A. Requires that only one activity be assigned to each resource
B. Is a special case of transportation problem
C. Can be used to maximise resource
D. All the above
Answer
D. All the above
131. The Hungarian method for solving an assignment problem can also be used to solve:
A. A transportation problem
B. A travelling salesman problem
C. A linear programming problem
D. Both a and b
Answer
B. A travelling salesman problem
132. All the parameters in the linear programming model are assumed to be ___
A. Variables
B. Constraints
C. Functions
D. None of these
Answer
B. Constraints
133. Graphic method can be applied to solve a liner programming problem when there are only ___ variables
A. A one
B. Two
C. Three
D. More than three
Answer
B. Two
134. If the feasible region of a linear programming problem is empty, the solution is ___
A. Unbounded
B. Infeasible
C. Infeasible
D. Alternative
Answer
B. Infeasible
135. The variables whose coefficient vectors are unit vectors, are called ___
A. Unit variables
B. Basic variables
C. Non-basic variables
D. None of these
Answer
B. Basic variables
136. Any column or row of a simplex table is known as ___. .
A. Key column
B. Key row
C. Vector
D. None of these
Answer
C. Vector
137. ___ is considered as the pioneer of Linear Programming Technique.
A. Churchman
B. D W Miller
C. James Lundy
D. George B Dantzig
Answer
D. George B Dantzig
138. A minimisation problem can be connected into maximisation problem by changing the signs ofcoefficients in the ___
A. Constraints
B. Objectives
C. Both a and b
D. None of these
Answer
B. Objectives
139. In an LPP, if the solution of a variable can be made infinitely large without violating theconstraints, then the solution is ___ ___.
A. Infeasible
B. Alternative
C. Unbounded
D. Unique
Answer
C. Unbounded
140. In maximisation cases, ___ are assigned to the artificial variables as their coefficients inthe objective function.
A. + m
B. – m
D. None of these
Answer
A. + m
141. In simplex method, we add ___. . in the case of constraints with sign “=”
A. Surplus variable
B. Artificial variable
C. Slack variable
D. None of these
Answer
B. Artificial variable
142. In simplex method, ___. should be selected when there is tie between slack/surplusvariable and decision variable.
A. Slack variable
B. Decision variable
C. Surplus variable
D. None of these
Answer
B. Decision variable
143. When at least one of the basic variables is zero, then the basic feasible solution to a LinearProgramming Problem is said to be ___ ___.
A. Infeasible
B. Unbounded
C. Degenerate
D. Non-degenerate
Answer
C. Degenerate
144. In Linear Programming Problem, degeneracy occurs in ___. . stages.
A. One
B. Two
C. Three
D. Four
Answer
B. Two
145. Every Linear Programming Problem is related to another Linear Programming Problem, called ___. .
A. Primal
B. Dual
C. Non-linear Programming
D. None of these
Answer
B. Dual
146. In a maximisation assignment problem, the objective is to maximise ___ ___
A. Profit
B. Cost
C. Optimisation
D. None of these
Answer
A. Profit
147. Operations Research does not give perfect solution to a problem, but it helps to improve the ___. . of the solution.
A. Quality
B. Clarity
C. Look
D. None of these
Answer
A. Quality
148. Operations Research makes a ___ attack on complex problems to arrive at optimalsolution.
A. Scientific
B. Systematic
C. Both a and b
D. None of these
Answer
C. Both a and b
149. Operations Research uses models to help the management in determining its ___ scientifically.
A. Policies
B. Actions
C. Both a and b
D. None of these
Answer
C. Both a and b
150. Operations Research is a ___ ___. .
A. Science
B. Art
C. Both a and b
D. None of these
Answer
C. Both a and b
151. ___. . deals with making sound decisions under conditions of certainty, risk anduncertainty.
A. Game theory
B. Network analysis
C. Decision theory
D. None of these
Answer
C. Decision theory
152. ___ deals with the concepts such as critical path, float, events, etc.
A. Game theory
B. Decision theory
C. Queuing theory
D. Network analysis
Answer
D. Network analysis
153. ___ ___. . is used to imitate an operation prior to actual performance.
A. Inventory control
B. Simulation
C. Game theory
D. Integrated Production Model
Answer
B. Simulation
154. ___ ___. . is concerned with determination of the most economic replacement policy.
A. Probabilistic programming
B. Linear programming
C. Search theory
D. Replacement theory
Answer
D. Replacement theory
155. The O R technique which helps in minimising total waiting and service cost is:
A. Game theory
B. Queuing theory
C. Both a and b
D. Decision theory
Answer
B. Queuing theory
156. Linear Programming technique is a:
A. Constrained optimisation technique
B. Technique for economic allocation of resources
C. Mathematical technique
D. All of the above
Answer
D. All of the above
157. A constraint in a Linear Programming Model restricts:
A. Value of objective function
B. Value of decision variable
C. Use of available resources
D. All of the above
Answer
D. All of the above
158. Before formulating a formal L P model, it is better to:
A. Verbally identify decision variables
B. Express the objective function in words
C. Express each constraint in words
D. All of the above
Answer
D. All of the above
159. Linear Programming Technique helps to find an optimal use of:
A. Machine
B. Money
C. Manpower
D. All of the above
Answer
D. All of the above
160. Which of the followings is an assumption of Linear Programming Technique?
A. Divisibility
B. Additivity
C. Proportionality
D. All of the above
Answer
D. All of the above
