Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program

This note describes a class of linear multiple objective programs for which Isermann's method for finding an initial efficient extreme point is valid. The note also proposes a new method for generating an initial extreme efficient point which enjoys advantages of both the Isermann method and of the modified Ecker-Kouada method.