Final PN-16 Strategic Cost Management Quiz 4

1. When we try to solve the Assignment problem by Transportation algorithm the following difficulty arises.

2. The similarity between Assignment Problem and Transportation Problem is –

3. The horizontal and vertical lines drawn to cover all zeros of the total opportunity matrix for an optimal solution must be –

4. In the Hungarian Method of solving Assignment problem, the row reduction is obtained by

5. Maximisation assignment problem is transformed into a minimisation problem by                

6. The assignment matrix is always a          

7. In marking assignments which of the following should be preferred?

8. An assignment problem can be viewed as a special case of transportation problem in which the capacity from each source is               and the demand at each destination is   .

9. In an assignment problem –

10. While solving an assignment problem, an activity is assigned to a resource with zero opportunity cost because objective is to –

11. Dummy row or column is added in an assignment problem –

12. Assignment problem can be considered as a particular case of -

13. An Assignment problem is solved to minimise the total time required to complete three jobs on three different machines such that each job is processed by exactly one machine and each machine processes exactly one job. The minimum total processing time is found to be 480 minutes. After a few days of operation, there has been a change in the design of the second job. Due to this, the processing time of the second job is increased by 15 minutes in either of the machines. The revised minimum total processing time will be –

14. In an Assignment matrix of size (5 × 5), the total number of decision variables in the objective function is –

15. Assignment of work to men and machines is known as:

16. Which of the following methods is used to solve the Assignment problems?

17. The Transportation Problem deals with the transportation of –

18. In a solution of Transportation problem, empty cells are called –

19. Which of the following method is used to test optimality of a solution in Transportation?

20. Which of the following is not correct with respect to Transportation as a tool of Quantitative Technique?

21. To resolve Degeneracy in the solution of a Transportation Problem an infinitely small allocation is made to the solution already obtained. This allocation is known as –

22. The solution to a Transportation Problem with ‘m’ sources and ‘n’ destinations is feasible if the number of cell allocations are –

23. When the total allocation of a Transportation Problem match with supply and demand values, the solution is –

24. Which of the following considers difference between least cost and the cost just before least for each row and column while finding Basic Feasible Solution in Transportation?

25. Which of the following is assumption of Linear Programming Model?