SM NEYAZ AHMAD Final Grade Submitted 4/8/22, 11:34 AM (UTC+5:30) Question scores appear after all grades are posted cE) = B Assignment Content Nn Question 1 Which of the following is the efficient method to solve Assignment problems @ Simplex method oe Hungarian Method © MODI Method ©) Dominance methodQuestion 2 Which of the following can be the sequence of the travelling salesman problem, if there are 5 cities to be covered by a salesman. ® None of the above Question 3 The unbalanced assignment problem with 5 operators (along rows) and 4 machines (along columns) can be made balanced by addingQuestion 4 The value of the following game is Strategies llS M NEYAZ AHMAD Final Grade Submitted 4/8/22, 11:52 AM (UTC+5:30) CG Question scores appear after all grades are * posted cE = Assignment Content Nn Question 1 In the Hungarian method to solve the minimisation assignment problems, row reduction involves. from each element in that row. ® subtract the largest cost element of each row subtract the smallest cost element of each row add the smallest cost element of each row © © eo subtract the smallest cost element of each column ®= x Quiz 4 Question 2 Which of the following methods can be applied to solve the games with mixed strategies 6 All of the above Dominance method © Odds method () Sub games methodQuestion 3 For the game Player B Il Player A | 2 8 I 6 2 The probability of selecting stratergy II for Player A is 6 3/5 None of the aboveQuestion 4 The Assignment problem is a special case of (a) Air crew problem Duality problem rc) Transportation Problem (v) Travelling salesman problemean ety S M NEYAZ AHMAD Final Grade Gia) Submitted late 4/10/22, 2:14 PM (UTC+5:30) By Question scores appear after al grades are posted Assignment Content a Question 1 Consider the following problem of assigning five jobs to five persons. The assignment costs are given as follows The maximum element in the row and column reduced matrix will be @®«= XxX Surprise Test 2 Question 2 Consider the following problem of assigning five jobs to five persons. The assignment costs are given as follows: In the optimum assignment schedule, person A is assigned job number (a) 1= xX Surprise Test 2 Question 3 Consider the following problem of assigning five jobs to five persons. The assignment costs are given as follows: In the optimum assignment schedule, person D is assigned job number= X Surprise Test 2 Question 4 Consider the following problem of assigning five jobs to five persons. The assignment costs are given as. follows: The total minimum cost will be (a) 5 7 6: () None of the above4 Surprise Test 2 Question 5 Given the following matrix of setup costs The sequence of the production so as to minimize the setup cost per cycle is © none of the above= xX Surprise Test 2 Question 6 In the Hungarian method, the optimal solution is attained when o number of assigned zeros become equal to number of rows or column number of assigned zeros is less than number of rows or column number of rows or column none of the above © number of assigned zeros is more than4 Surprise Test 2 Question 7 The value of the game with the following payoff matrix is Player B B1 B2 B3 Al 15 2 3 I ; ayer A2 6 5 7 A3 -7 4 0 @) None of the above4 Surprise Test 2 Question 8 For the game with the following payoff matrix, Player B B1 B2 B3 Al 15 2 3 Player ¥ 6 5 7 A 0 A3 -7 4 The optimal strategy of A and B respectively isD4 Surprise Test 2 Question 9 Consider the following 2x2 game Player B ll Player A 4 7 lI 6 5»4 Surprise Test 2 Question 10 The saddle point of the following game is Player B | ll Player A | 4 7 I 6 5 (@) 4 @) s ©s« Qo None of the above= xX Surprise Test 2 Question 11 Given the payoff matrix of Player A Player B ll Ul Player ye 6 3 7 A Il -3 0 4 The probability of selecting the strategy | and II (respectively) for player A is 6 1/4 and 3/4 2/4 and 3/4 © 1/4 and 5/4 @) none of the abovea4 Tele Yam Cia Question 12 Given the payoff matrix of Player A, Player B | ll ll Pl. ayer | 6 3 7 A Il 3 0 4 the value of the game is ® 3 314 ce ©: