Towards finding global representations of the efficient set in multiple objective mathematical programming

We propose and justify the proposition that finding truly global representations of the efficient sets of multiple objective mathematical programs is a worthy goal. We summarize the essential elements of a general global shooting procedure that seeks such representations. This procedure illustrates the potential benefits to be gained from procedures for globally representing efficient sets in multiple objective mathematical programming. © 1997 John Wiley & Sons, Inc.     

A face search heuristic algorithm for optimizing over the efficient set

The problem of optimizing a linear function over the efficient set of a multiple objective linear program is an important but difficult problem in multiple criteria decision making. In this article we present a flexible face search heuristic algorithm for the problem. Preliminary computational experiments indicate that the algorithm gives very good estimates of the global optimum with relatively little computational effort. © 1993 John Wiley & Sons, Inc.