Assignment Problem - Hungarian Method A marketing manager has four salesmen and four sales districts. Considering the capabilities of the salesmen and nature of districts, the marketing manager estimates that sales per month in hundreds of rupees for each salesman in each district would be as follow
Assignment Problem - Hungarian Method
A marketing manager has four salesmen and four sales districts. Considering the capabilities of the salesmen and nature of districts, the marketing manager estimates that sales per month in hundreds of rupees for each salesman in each district would be as follows:
$$\begin{array}{|c|c|c|c|c|}\hline \text{Sales} & A & B & C & D \ \hline P & 32 & 38 & 40 & 28 \ Q & 40 & 24 & 28 & 21 \ R & 41 & 27 & 33 & 30 \ S & 22 & 38 & 41 & 36 \ \hline \end{array}$$
Make the use of Hungarian method to assign the salesmen in different districts in such a way that total sales would be maximized. [5]
Sales matrix (hundreds of rupees), salesmen P, Q, R, S vs districts A, B, C, D: Sales A B C D ------------------- P 32 38 40 28 Q 40 24 28 21 R 41 27 33 30 S 22 38 41 36 Objective: Maximize total sales. Subtract every element from the maximum value $41$ (regret/opportunity-loss matrix): A B C D -...