Operations Research

21. In an Linear Programming Problem functions to be maximized or minimized are called ______________.

1. constraints
2. objective function
3. basic solution
4. feasible solution

View answer

22. If the primal problem has n constraints and m variables then the number of constraints in the dual problem is ______________.

1. mn
2. m+n
3. m-n
4. m/n

View answer

23. The non basic variables are called ______________.

1. shadow cost
2. opportunity cost
3. slack variable
4. surplus variable

View answer

24. Key element is also known as ______________.

1. slack
2. surplus
3. artificial
4. pivot

View answer

25. The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ______________.

1. m+n
2. mn
3. m-n
4. m+n-1

View answer

26. The allocation cells in the transportation table will be called ______________ cell

1. occupied
2. unoccupied
3. no
4. finite

View answer

27. To resolve degeneracy at the initial solution, a very small quantity is allocated in ______________ cell

1. occupied
2. unoccupied
3. no
4. finite

View answer

28. The assignment algorithm was developed by ______________ method.

1. HUNGARIAN
2. VOGELS
3. MODI
4. TRAVELING SALES MAN

View answer

29. An assignment problem is a particular case of ______________.

1. transportation Problem
2. assignment Problem
3. travelling salesman problem
4. replacement Problem

View answer

30. The coefficient of slack\surplus variables in the objective function are always assumed to be ______________.

1. 0
2. 1
3. M
4. -M

View answer