Professional Documents
Culture Documents
12. The interaction between OR team and Management reaches peak level in implementation phase.
Ans. False
16. To solve any problem through OR approach the first step is ____.
Ans. Define the problem
19. Both the objective function and constraints are expressed in ____ forms.
Ans. Linear
22. One of the characteristics of canonical form in the objective function must be of maximisation.
Ans. True
24. The collection of all feasible solutions is known as the ____ region.
Ans. Feasible
31. If one or more values of basic variable are zero then solution is said to be degenerate.
Ans. True
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
40. The coefficients of decision variables in the objective function become quantities on the right hand side of
____ ____.
Ans. Dual
44. Optimality is reached when the resources are not fully utilised.
Ans. False
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
50. The number of rows and columns need not always be ____.
Ans. Equal
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
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
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
61. If the number of allocation is less than ____ then it is said to be a degenerate transportation problem.
Ans. m + n – 1
66. The number of assignments should be equal to the number of rows for an optimum solution.
Ans. True
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)
74. If some variables take on non-negative values, then it is known as pure IPP.
Ans. False