Quiz 2

for ODD Roll Numbers 1. Transportation problem is basically a (a) Maximization model (c) Transshipment problem (a) To write the inverse of the matrix (b) To multiply the rim re uirements by !1 (c) To multiply the matrix by !1 (d) "e cannot convert the transportation problem in to a maximization problem# as it is basically a minimization problem. m % n size is e ual to& (a ) m % n (c) m ( n (1 (b ) ( m ' n ) ! 1 (d ) m ( n ! 1 ( ) ( ) $. The total number of allocation in a basic feasible solution of transportation problem of (b) Minimization model (d) Iconic model ( )

2. To convert the transportation problem into a maximization model we have to

). The opportunity cost of a row in a transportation problem is obtained by& (a) *eductin+ the smallest element in the row from all other elements of the row# (b) ,ddin+ the smallest element in the row to all other elements of the row# (c) *eductin+ the smallest element in the row from the next hi+hest element of the row (d) *eductin+ the smallest element in the row from the hi+hest element in that row. ( -. .,M stands for& (a) .alue added method (c) .o+el ,dam method# indicates (a) The solution is not optimal (c) 1omethin+ wron+ in the solution (b) The problem has alternate solution (d) The problem will cycle. ( ) (b) .alue assessment method (d) .o+el/s approximation method. ( ) )

0. In the optimal solution# more than one empty cell have their opportunity cost as zero# it

2. To solve de+eneracy in the transportation problem we have to& (a) 3ut allocation in one of the empty cell as zero (b) 3ut a small element epsilon in any one of the empty cell (c) ,llocate the smallest element epsilon in such a cell# which will not form a closed loop with other loaded cells. (d) ,llocate the smallest element epsilon in such a cell# which will form a closed loop with other loaded cells. 4.5 1olve the followin+ problem by 6"78. ( )

Quiz 2 for Even Roll Numbers

Time&9 1- Min MM&9 1:

1. In a transportation problem where the demand or re uirement is e uals to the available resource is ;nown as (a) <alanced transportation problem (b) 8e+ular transportation problem# (d) 1imple transportation model. ( ) (c) 8esource allocation transportation problem the situation is ;nown as& (a) =nbalanced situation (c) *e+eneracy (b) Tie situation (d) 6one of the above ( )

2. "hen the total allocations in a transportation model of m % n size is not e uals to m ( n ! 1

$. In 6orthwest corner method the allocations are made (a) 1tartin+ from the left hand side top corner# (c) 1tartin+ from the lowest cost cell (d) 1tartin+ from the lowest re uirement and satisfyin+ first. ( ) ). M>*I stands for (a) Modern distribution# (c) Modified distribution method (a) The +iven problem is wron+ (b) Mendel?s distribution method (d) Model index method (b) "e can allocate zeros to those cells ( ) ( ) (b) 1tartin+ from the ri+ht hand side top corner

-. In case the cost elements of one or two cells are not +iven in the problem# it means& (c) ,llocate very hi+h cost element to those cells (d) To assume that the route connected by those cells are not available. 0. In transportation model# the opportunity cost is +iven by (a) Implied cost ( ,ctual cost of the cell (c) Implied cost ! ,ctual cost of the cell the situation is ;nown as (a) =nbalanced situation# (c) *e+eneracy# 5. 1olve the followin+ problem by @7M. (b) Tie situation# (d) 6one of the above ( ) (b) ,ctual cost of the cell ! Implied cost# (d) Implied cost % ,ctual cost of the cell ( )

2. "hen the total allocations in a transportation model of m x n size is not e uals to m ( n ! 1