Note---Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming

Harold P. Benson
Additional contact information
Harold P. Benson: Department of Management and Administrative Sciences, University of Florida, Gainesville, Florida 32611

Management Science, 1985, vol. 31, issue 2, 240-248

Abstract: Recently Kornbluth and Steuer have developed a simplex-based algorithm for finding all weakly-efficient vertices of an augmented feasible region of a multiple objective linear fractional programming problem. As part of this algorithm, they presented a method for detecting certain weakly-efficient vertices called break points. In this note we show that the procedure used by Kornbluth and Steuer in this method for computing the numbers needed to find these break points may sometimes fail. We also propose a fail-safe method for computing these numbers and give some computational results with this method.

Keywords: programming: multicriteria; fractional (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.31.2.240 (application/pdf)

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:inm:ormnsc:v:31:y:1985:i:2:p:240-248

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().