The problem of optimizing a linear function over the efficient set of a multiple objective problem has many applications in multiple criteria decision making. The main difficulty of this problem is that its feasible region, in general, is a nonconvex set. In this paper we develop a fast algorithm for optimizing a linear function over the efficient set of a bicriteria linear programming problem. The method is a parametric simplex procedure using one parameter in the objective function.