Towards finding global representations of the efficient set in multiple objective mathematical programming
Benson, H. P.
Naval Research Logistics
0894-069X (print)1520-6750 (online)
John Wiley & Sons
47 - 67
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/25666
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.