Bicriteria linear fractional programming

As a step toward the investigation of the multicriteria linear fractional program, this paper provides a thorough analysis of the bicriteria case. It is shown that the set of efficient points is a finite union of linearly constrained sets and the efficient frontier is the image of a finite number of connected line segments of efficient points. A simple algorithm using only one-dimensional parametric linear programming techniques is developed to evaluate the efficient frontier.This research was partially supported by NRC Research Grant No. A4743. The authors wish to thank two anonymous referees for their helpful comments on an earlier draft of this paper.