This article presents an algorithm called OUTSET for generating the efficient outcome set of a multiple objective linear program (BX) with two objective functions. Unlike standard vector maximization approaches to generate the efficient decision set for problem (BX), which can be large and quite complicated. Instead, it directly generates the efficient faces of the smaller, simpler efficient outcome set. As a result, it is expected that in practice, the OUTSET algorithm will have the potential to allow decision makers to solve bicriteria linear programming problems relatively easily and accurately, including those large-scale problems that heretofore were too large to be amenable to standard vector maximization methods for multiple objective linear programming.