Use the Hungarian Method to Obtain the Optimal Solution to the Following

Essay

Use the Hungarian method to obtain the optimal solution to the following assignment problem in which total cost is to be minimized. All tasks must be assigned and no agent can be assigned to more than one task. $$\begin{array} { c | c c c c } & & { \text { Task } } \\\text { Agent } & \text { A } & \text { B } & \text { C } & \text { D } \\\hline 1 & 10 & 12 & 15 & 25 \\2 & 11 & 14 & 19 & 32 \\3 & 18 & 21 & 23 & 29 \\4 & 15 & 20 & 26 & 28\end{array}$$