IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v31y1985i2p240-248.html
   My bibliography  Save this article

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

Author

Listed:
  • Harold P. Benson

    (Department of Management and Administrative Sciences, University of Florida, Gainesville, Florida 32611)

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.

Suggested Citation

  • Harold P. Benson, 1985. "Note---Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming," Management Science, INFORMS, vol. 31(2), pages 240-248, February.
    • Handle: RePEc:inm:ormnsc:v:31:y:1985:i:2:p:240-248
    DOI: 10.1287/mnsc.31.2.240
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.31.2.240
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.31.2.240?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. C. Singh & M.A. Hanson, 1991. "Multiobjective fractional programming duality theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(6), pages 925-933, December.
    2. Hamiden Abd El- Wahed Khalifa & Pavan Kumar, 2022. "A goal programming approach for multi-objective linear fractional programming problem with LR possibilistic variables," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(4), pages 2053-2061, August.

    More about this item

    Keywords

    programming: multicriteria; fractional;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:31:y:1985:i:2:p:240-248. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.