Operations Research - II

1.Assignment problem is balanced if ......

• (a) . No of rows = No of columns

• (b) . No of rows / No of columns

• (c).No of rows * No of columns

• (d) None of these

2.An assignment problem is a completely ... form of a transportation problem

• (a) Non degenerate

• (b) Degenerate

• (c) Both (a) and (b)

• (d) None of these

3.The assignment problem represents a transportation problem will all demands and supplies equal to ....

• (a) 3

• (b) 1

• (c) 2

• (d) None of these

4.Assignment technique is essentially a .... technique

5. Assignment problem is a particular case of LPP

• (a) True

• (b) False

6.The transportation problem technique or simplex method cannot be used to solve the assignment problem because of .....

• (a) Non degeneracy

• (b) Demand

• (c) Degeneracy

• (d) None of these

7. The assignment problem can be stated in the for of m * n matrix called a .....

• (a) Cost matrix

• (b) Effectiveness matrix

• (c) Symmetric matrix

• (d) Both ( a ) and (b)

8.An unbalanced assignment problem in to a balanced one by adding dummy rows and dummy columns with .... cost elements in the cost matrix

• (a) one

• (b) zero

• (c) negative

• (d) None of these

9. Travelling Salesman Problem must satisfied ...

• (a) order

• (b) Sequence

• (c) route

• (d) none of these

10.Hungarian method is used to solve ....

• (a) Transportation Problem

• (b) Travelling Salesman Problem

• (c) A LP Problem

• (d) Both (a) and (b)