On the efficient point set of tricriteria linear programs

The authors consider linear programs with three objective functions and investigate the set of efficient points in the objective space. The set of efficient points is a subset of the boundary of a three-dimensional convex polyhedron. The authors characterize the structure and shape of the planar graphs corresponding to such sets. They give an example of an efficient point set whose structure is of the most general type.