The optimization problem of finding a point in the plane that minimizes the sum of Euclidean distances to the three vertices of a given triangle; the minimizing point is called the Fermat (or Torricelli) point and has incident angles of 120° when all triangle angles are less than 120°.

Principle

A geometric variational principle: the minimizing configuration equalizes angular tensions so that the three segments from the Fermat point meet pairwise at 120° unless an obtuse vertex dominates, in which case the minimizing point is that obtuse vertex.

Demonstration

For an equilateral triangle the Fermat point coincides with the centroid and each connecting segment makes 120°; for a triangle with an angle of 130° the minimizing point is the vertex with 130° because any interior point increases the total distance.

Misapplication

Assuming the Fermat point is always interior or always characterized by 120° angles; neglecting the special case where a triangle angle is ≥ 120° and the minimizer is that vertex leads to incorrect solutions.

Consequence

Solves a basic network optimization and models minimal connection networks; it leads to constructions for Steiner trees and provides exact solutions for three‑terminal length minimization problems.

Reversal

Viewed oppositely as locating the point that maximizes sum of distances yields trivial boundary solutions (faraway points), illustrating that minimization imposes interior angular balance while maximization is unbounded in the plane.

Boundary

Formulated for three points in the Euclidean plane; generalizations to more points (Weber problem) or different metrics require different existence/uniqueness behavior and may lack the 120° characterization.

Semantic Tension

Competes with centers like circumcenter, incenter, and centroid that optimize different objective functions (maximizing minimal distance, equal distances, or coordinate sums); the Fermat point is distinct because it minimizes total distance, not radius or moment.

Synthesis

The Fermat–Torricelli problem identifies a point balancing three competing distance demands: either the vertex with an angle ≥120° is optimal, or an interior Fermat point equalizes pairwise angles to 120°, providing the unique minimizer of total distance for three vertices.