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

Harold P. Benson and Serpil Sayin

Naval Research Logistics (NRL), 1997, vol. 44, issue 1, 47-67

Abstract: 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.

Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199702)44:13.0.CO;2-M

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:44:y:1997:i:1:p:47-67

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().