Assignment Problem - Hungarian Method Kathmandu Metropolitan is putting up bids for four used motorbikes company. The Metropolitan allows individuals to make bids on all four motorbikes company but will accept only one bid per individual. Four individuals have made the following bids (in thousands R
Assignment Problem - Hungarian Method
Kathmandu Metropolitan is putting up bids for four used motorbikes company. The Metropolitan allows individuals to make bids on all four motorbikes company but will accept only one bid per individual. Four individuals have made the following bids (in thousands Rs.). Make the use of Hungarian method to assign the individuals to different motorbike company in order to maximize the revenue.
$$\begin{array}{|c|c|c|c|c|}\hline \text{Individuals} & \text{Honda} & \text{Hero} & \text{Bajaj} & \text{Yamaha} \ \hline A & 100 & 90 & 110 & 90 \ B & 110 & 100 & 95 & 95 \ C & 105 & 95 & 90 & 105 \ D & 115 & 100 & 95 & 100 \ \hline \end{array}$$
[10]
Profit matrix (bids in thousands Rs.), one bid accepted per individual: Individual Honda Hero Bajaj Yamaha --------------- A 100 90 110 90 B 110 100 95 95 C 105 95 90 105 D 115 100 95 100 Objective: maximize total revenue via one-to-one assignment. --- Maximum element = 115. Subtract each element...