A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program

Various computational difficulties arise in using decision set-based vector maximization methods to solve multiple objective linear programming problems. As a result, several researchers have begun to explore the possibility of solving these problems by examining subsets of their outcome sets, rather than of their decision sets. In this article, we present and validate a basic weight set decomposition approach for generating the set of all efficient extreme points in the outcome set of a multiple objective linear program. Based upon this approach, we then develop an algorithm, called the Weight Set Decomposition Algorithm, for generating this set. A sample problem is solved using this algorithm,and the main potential computational and practical advantages of the algorithm are indicated. (C) 2002 Elsevier Science B,V. All rights reserved.