| Article ID: | iaor19972143 |
| Country: | United States |
| Volume: | 44 |
| Issue: | 1 |
| Start Page Number: | 47 |
| End Page Number: | 68 |
| Publication Date: | Feb 1997 |
| Journal: | Naval Research Logistics |
| Authors: | Benson Harold P., Sayin Serpil |
The authors propose and justify the proposition that finding truly global representations of the efficient sets of multiple objective mathematical programs is a worthy goal. They 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.