Operations Research

161. Feasible solution satisfies __________

1. Only constraints
2. only non-negative restriction
3. [a] and [b] both
4. [a],[b] and Optimum solution

162. Graphical optimal value for Z can be obtained from

1. Corner points of feasible region
2. Both a and c
3. corner points of the solution region
4. none of the above

163. Hungarian Method is used to solve

1. A transportation problem
2. A travelling salesman problem
3. A LP problem
4. Both a & b

164. Identify the type of the feasible region given by the set of inequalities
x - y <= 1
x - y >= 2
where both x and y are positive.

1. A triangle
2. A rectangle
3. An unbounded region
4. An empty region

165. If an opportunity cost value is used for an unused cell to test optimality, it should be

1. Equal to zero
2. Most negative number
3. Most positive number
4. Any value

166. In a transportation problem, we must make the number of __________ and __________ equal.

1. destinations; sources
2. units supplied; units demanded
3. columns; rows
4. positive cost coefficients; negative cost coefficients
5. warehouses; suppliers

167. In a transportation problem, when the number of occupied routes is less than the number of rows plus the number of columns -1, we say that the solution is:

1. Unbalanced.
2. Infeasible.
3. Optimal.
4. impossible.
5. Degenerate.

168. In assignment problem of maximization, the objective is to maximise

1. Profit
2. optimization
3. cost
4. None of the above

169. In case of an unbalanced problem, shipping cost coefficients of __________ are assigned to each created dummy factory or warehouse.

1. very high positive costs
2. very high negative costs
3. 10
4. zero
5. one

170. In Degenerate solution value of objective function __________.

1. increases infinitely
2. basic variables are nonzero
3. decreases infinitely
4. One or more basic variables are zero