MCQ Assignment - Notes PDF

Preview

Summary

Chapter 1: Assignment ProblemMultiple Choice Questions (MCQ) The application of assignment problems is to obtain _____. a. only minimum cost. b. only maximum profit. c. minimum cost or maximum profit. d. assign the jobs. The assignment problem is said to be unbalanced if _____. a. number of rows is ...

Description

Chapter 1: Assignment Problem Multiple Choice Questions (MCQ) 1. The application of assignment problems is to obtain _________. a. only minimum cost. b. only maximum profit. c. minimum cost or maximum profit. d. assign the jobs. 2. The assignment problem is said to be unbalanced if _________. a. number of rows is greater than number of columns. b. number of rows is lesser than number of columns. c. number of rows is equal to number of columns. d. both 1 and 2. 3. The assignment problem is said to be balanced if _________. a. number of rows is greater than number of columns. b. number of rows is lesser than number of columns. c. number of rows is equal to number of columns. d. if the entry of row is zero. 4. The assignment problem is said to be balanced if it is _________. a. square matrix. b. rectangular matrix. c. unit matrix. d. triangular matrix. 5. In assignment problem if number of rows is greater than column then _________. a. dummy column is added . b. dummy row added . c. row with cost 1 is added. d. column with cost 1 is added. 6. In assignment problem if number of column is greater than row then _________. a. dummy column is added. b. dummy row added . c. row with cost 1 is added. d. column with cost 1 is added. 7. An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost be equal to the number of______. a. rows or coloumns. b. rows and coloumns. c. rows+columns- 1. d. rows-columns. 8. While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to_________. a. minimize total cost of assignment. b. reduce the cost of assignment to zero. c. reduce the cost of that particular assignment to zero. d. reduce total cost of assignment.

9. Maximization assignment problem is transformed into a minimization problem by_________. a. adding each entry in a column from the maximum value in that column. b. subtracting each entry in a column from the maximum value in that column. c. subtracting each entry in the table from the maximum value in that table. d. adding each entry in the table from the maximum value in that table. 10. The assignment problem is a special case of transportation problem in which ______. a. number of origins equals the number of destinations. b. number of origins are less than the number of destinations. c. number of origins are greater than the number of destinations. d. number of origins are greater than or equal to the number of destinations. 11. Identify the correct statement. a. an assignment problem may require the introduction of both dummy row and dummy column. b. an assignment problem with m rows and n columns will involves a total of m x n possible assignments. c. an unbalanced assignment is one where the number of rows is more than, or less than,the number of columns. d. balancing any unbalanced assignment problem involves adding one dummy row /column. 12. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be _____. a. at the most n. b. at the least n. c. n – 1. d. n + 1. 13. In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______. a. 5!. b. 10. c. 25. d. 5. 14. In marking assignments, which of the following should be preferred? a. Only row having single zero. b. Only column having single zero. c. Only row/column having single zero. d. Column having more than one zero. 15. The Hungarian method used for finding the solution of the assignment problem is also called ___________. a. reduced matrix method. b. matrix minima method. c. modi method. d. simplex method. 16. The assignment algorithm was developed by ____________. a. Modi. b. Kuhn. c. Hungarian. d. Vogel’s.

17. An assignment problem is a particular case of ____________. a. transportation problem. b. linear programming problem. c. network problem. d. simplex problem. 18. The similarity between assignment problem and transportation problem is _______. a. both are rectangular matrices. b. both are square matrices. c. both can be solved by graphical method. d. both have objective function and non-negativity constraints. 19. The assignment problem will have alternate solutions when the total opportunity cost matrix has ________ a. atleast one zero in each row and column. b. when all rows have two zeros. c. when there is a tie between zero opportunity cost cells. d. if two diagonal elements are zeros. 20. In an assignment problem, a. one agent can do parts of several tasks. b. one task can be done by several agents. c. each agent is assigned to its own best task. d. None of the alternatives is correct. 21. To use the Hungarian method, a profit-maximization assignment problem requires a. converting all profits to opportunity losses. b. a dummy agent or task. c. matrix expansion. d. finding the maximum number of lines to cover all the zeros in the reduced matrix.

22. In an assignment problem, a. one agent can do parts of several tasks b. one task can be done by several agents c. each agent is assigned to its own best task d. none of the above 23. An assignment problem is considered as a particular case of a transportation problem because a. The number of rows equals columns b. All Xij = 0 or 1 c. All rim conditions are 1 d. All of the above 24. An optimal assignment requires that the maximum number of lines that can be drawn through sequares with zero opportunity cost be equal to the number of a. Rows or columns b. Rows and columns c. Rows + column -1 d. None of the above 25. While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to a. Minimize total cost of assignment b. Reduce the cost of assignment to zero c. Reduce the cost of that particular assignment to zero d. All of the above 26. The purpose of a dummy row or column in an assignment problem is to a. Obtain balance between total activities and total resources b. Prevent a solution from becoming degenerate c. Provide a means of representing a dummy problem d. None of the above 27. Maximization problem is transformed into a minimization problem by a. Adding each entry in a column from the maximum value in that column b. Subtracting each entry in a column from the maximum value in that column c. Subtracting each entry in the table from the maximum value in that table d. Any one of the above 28. If there were n workers and n jobs there would be a. n! solutions b. (n-1)! Solutions c. (n!)ⁿ solutions d. n solutions e.

29. An assignment problem can be solved by a. Simplex method b. Transportation method c. Both (a) and (b) d. None of the above 30. The assignment problem a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximize resources d. All of the above 31. An assignment problem is a special case of transportation problem, where a. Number of rows equals number of columns b. All rim conditions are 1 c. Values of each decision variable is either 0 or 1 d. All of the above 32. Every basic feasible solution of a general assignment problem having a square pay-off matrix of order, n should have assignments equal to a. 2n + 1 b. 2n – 1 c. m + n – 1 d. m + n 33. To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are a. n b. 2n c. n – 1 d. 2n – 1 34. The Hungarian method for solving an assignment problem can also be used to solve a. A transportation problem b. A travelling salesman problem c. Both (a) and (b) d. Only (b) 35. An optimal solution of an assignment problem can be obtained only if a. Each row and column has only one zero element b. Each row and column has at least one zero element c. The data are arrangement in a square matrix d. None of the above 36. Flood’s technique of solving an assignment matrix uses the concept of a. Maximum cost

b. Minimum cost c. Opportunity cost d. Negative cost 37. Given below is a reduced assignment matrix. State if it is optimum. 1 2 3 4 0 2 1 0 A 5 0 6 1 B 3 0 2 4 C 0 7 0 4 D a. Yes b. No c. Can’t be decided d. Data is insufficient 38. From the following reduced assignment matrix, state the optimum assignment for worker A. I II III IV V 2 0 0 6 0 A 4 2 0 0 1 B 0 0 5 8 3 C 0 1 7 3 9 D 5 4 3 4 0 E a. I b. II c. III d. V 39. Consider the following non-optimum matrix obtained during the use of Hungarian method for an assignment problem I II III IV 0 1 0 3 A 7 5 2 0 B 3 4 2 0 C 0 6 3 2 D (Draw line on A, D rows and IV column) The improved matrix obtained from this matrix will have following elements at position A-I and D-IV a. 0, 0 b. 2, 2 c. 2, 4 d. 0, 4...