Towards finding global representations of the efficient set in multiple objective mathematical programming
| dc.citation.epage | 67 | en_US |
| dc.citation.issueNumber | 1 | en_US |
| dc.citation.spage | 47 | en_US |
| dc.citation.volumeNumber | 44 | en_US |
| dc.contributor.author | Benson, H. P. | en_US |
| dc.contributor.author | Sayin, S. | en_US |
| dc.date.accessioned | 2016-02-08T10:48:49Z | |
| dc.date.available | 2016-02-08T10:48:49Z | |
| dc.date.issued | 1997 | en_US |
| dc.department | Department of Management | en_US |
| dc.description.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. | en_US |
| dc.identifier.eissn | 1520-6750 | |
| dc.identifier.issn | 0894-069X | |
| dc.identifier.uri | http://hdl.handle.net/11693/25666 | |
| dc.language.iso | English | en_US |
| dc.publisher | John Wiley & Sons | en_US |
| dc.source.title | Naval Research Logistics | en_US |
| dc.subject | Problem solving | en_US |
| dc.subject | Set theory | en_US |
| dc.subject | Global representations | en_US |
| dc.subject | Multiple objective mathematical programming (MMP) problem | en_US |
| dc.subject | Mathematical programming | en_US |
| dc.title | Towards finding global representations of the efficient set in multiple objective mathematical programming | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Towards finding global representations of the efficient set in multiple objective mathematical programming.pdf
- Size:
- 1.08 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version