Problem

Source:

Tags: function, geometry, inequalities, parallelogram, triangle inequality, combinatorics proposed, combinatorics



In a village, there are $n$ houses with $n>2$ and all of them are not collinear. We want to generate a water resource in the village. For doing this, point $A$ is better than point $B$ if the sum of the distances from point $A$ to the houses is less than the sum of the distances from point $B$ to the houses. We call a point ideal if there doesn’t exist any better point than it. Prove that there exist at most $1$ ideal point to generate the resource.