The problem is to assign locations to the offices to minimize the flow-distance measure. To evaluate the natural assignment shown in the example we multiply each number in the distance matrix by the corresponding number in the flow matrix and add the numbers. Find the minimize distance for every Office 1 to Office 10.

00 10 Distance 1 2 ooo 30 50 12 o 10 20 10 20 40 30 10 10 30 20 40 50 40 30 20 10 0 10 40 30 3 20 10 10 20 30 20 10 5 40 30 20 10 0 SO 40 30 20 10 3 SerBoo 6 10 20 30 40 50 0 10 20 30 40 20 10 20 30 7 20 10 20 30 40 10 0 10 20 30 9 40 30 20 10 20 30 20 10 40 30 20 10 40 30 20 10 20 20 20 30 10 30 20 20 10 20 10 20 30 10