Solving multiple objective linear programs in objective space

This paper presents an analysis of the objective space for a multiple objective linear program and develops a procedure for determining the nondominated extreme points and edges in objective space. Since not all extreme points (nor edges) of the constraint space necessarily map to extreme points (edges) of objective space, this technique analyzes a simpler structure than that analyzed by algorithms based on the extreme points of the constraint space.