1. In an Linear Programming Problem functions to be maximized or minimized are called
______________.
a) constraints
b) objective function
c) basic solution
d) feasible solution
2. If the primal problem has n constraints and m variables then the number of constraints in the dual
problem is ______________.
a) mn
b) m+n
c) m-n
d) m/n
3. The non basic variables are called ______________.
a) shadow cost
b) opportunity cost
c) slack variable
d) surplus variable
4. Key element is also known as ______________.
a) slack
b) surplus
c) artificial
d) pivot
5. The solution to a transportation problem with m-sources and n-destinations is feasible if the
numbers of allocations are ______________.
a) m+n
b) mn
c) m-n
d) m+n-1
6. The allocation cells in the transportation table will be called ______________ cell
a) occupied
b) unoccupied
c) no
d) finite
7. To resolve degeneracy at the initial solution, a very small quantity is allocated in ______________ cell
a) occupied
b) unoccupied
c) no
d) finite
8. The assignment algorithm was developed by ______________ method.
a) HUNGARIAN
b) VOGELS
c) MODI
d) TRAVELING SALES MAN
9. An assignment problem is a particular case of ______________.
a) transportation Problem
b) assignment Problem
c) travelling salesman problem
d) replacement Problem
10. The coefficient of slack\surplus variables in the objective function are always assumed to be
______________.
a) 0
b) 1
c) M
d) -M