Maximization Assignment Problem ‘There are problems where certain facilities have to be assigned to a number of jobs so as to maximize the overall performance ofthe assignment. The problem can be converted into a minimization problem in the following ways and then Hungarian method can be used forts solution. 1. Change the signs of all values given in the table. 2.Select the sament table and subtract all the elements of the table from the highest element. yhest element in the entire a Example: Amarketing manager has five salesmen and sale districts. Considering the capabilities of the salesmen and thenature of districts, the marketing manager estimates that sales per month (in hundred rupees) for each salesman in each district would beas follows. Find the assignment of salesmen to districts that will result in maximum sales. ‘Maximization Problem Salesman 3 Maximization assignment problem is transformes by into minimization problem Solution: The given maximization problem is converted into minimization problem by subtracting fom the highest salesvalue (ie, 41) withallelementsof the given able,Conversion to Minimization Problem District A B c 1 9 3 1 2 1 7 13 Salesman 3 0 i 8) 4 19 3 0 5 12 8 1 Reduce the matrixrow-wise ‘Matrix Reduced Row-wise District Salesman 3 [0 14 8 II on ° 13 20 ll Reduce the matrix column-wise and draw minimum numberof lines to cover al the zeros in the matrix, as shown in Table.‘Matrix Reduced Column-wise and Zeros Covered 1 2 Moi ow 4 Salesman 3 2 8 6 4 4 ie eee One as) 5 ‘Number of lines drawn + Order of matrix. Hence not optimal Select the least uncovered element, i, and subtract it from other uncovered elements, add it to the elements at Intersection of ine and leave the elements that are covered with single line unchanged, Table. ‘Added & Subtracted the least Uncovered Element Salesman 3. Now, numberof lines drawn = Order of matrix, hence optimality is reached. There are two alternative assignments due topresence of zero elementsin cells(4,C),(4,0),(5,C)and(5,0). Two Alternative Assignments A B Cc D E B Cc D E 1/2 [fo] KX 7 & 1 ° 7 2 K 10 8 10K 2 10 8 10 oO 3 oO 8 4 2 0 3 8 4 2 x 4/3 1 [Lo] x s 4 1 [eo s s Lis x [oJ 1 5 sk ey,Therefore, Assignment 1 Assignment 2 Salesman | Districts Sales Salesman] Districts Sales. (in "00) Rs. (in °00) Bs. 1 B 38 1 B 38 2 A 40 2 E 36 E 37 3 A 4 4 c al 4 c 4 D 38 5 D 35 Total Rs. = 191.00 Total Rs. = 191.00 Example : In a work shop four persons are available for working on the four jobs. But only one person can work on any one job. The following table shows the profit of assigning each person to each job. Calculate the maximum profit resulting from assignment. Jobs apa | a7 aE acy s ame 15 19 16 5 p2 19 16 20 20 a P3010 20 18 17 h