# Can there be multiple local minima for the sum of distances in the plane?

Let $f$ map a point in the plane to the sum of the distances to each element in a given set of points. Can $f$ have multiple local minima?

For example, there is only one relative minimum when the given set is the set of vertices of an equilateral triangle, since if you're at some point in the plane other than the center of the triangle, you can always get a lower sum of distances by moving closer to the center (I think).

-

The locus of points at a given 'sum of distances' from a set of $n$ given points is called an $n$-ellipse, and in general, the $n$-ellipse is a closed curve with convex interior. I believe this was also proved in the article above.
Since the question asks whether $f$ can have a local minimum, it would be worthwhile to elaborate on the special cases where multiple local minima exist. These are precisely when $n$ is even and the $n$ points are collinear; the local minima form the line segment joining the middle two points. This is the same reason why you need an additional condition to uniquely define the median of an even number of scalars. – Rahul Feb 14 '12 at 3:03