A moving company needs to serve three customers, and the distances between the four entities, where 1 denotes the moving company location and 2 through 4 denote the customers, are provided in the symmetric matrix below. There are 4 routes, named A through D, to choose from, and the following provides information on customers served on each route:

Route A: 2, 3; Route B: 2, 4; Route C: 4, 3; Route D: 3, 4, 2.

Let x(k) equal 1 if route k is selected and let it equal 0 otherwise for k = A, B, C and D. The objective function

	1	2	3	4
1	0	12	18	35
2	12	0	24	17
3	18	24	0	60
4	35	17	60	0

must be to minimize: