AbstractIn this paper we study a multiple‐objective dispersion problem from an efficient solution and value function perspective. A general fundamental theorem on non‐dominance is given and a polar co‐ordinate elimination heuristic is given for the case of R2. Some general results are given for the existence of a linearly weighted objective function whose maximal value will give a most preferred solution, for convex or concave value functions, and a heuristic is developed for the case where these conditions do not hold.