IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v26y1979i1p123-139.html
   My bibliography  Save this article

The enumeration of all efficient solutions for a linear multiple‐objective transportation problem

Author

Listed:
  • Heinz Isermann

Abstract

An algorithm is presented by which the set of all efficient solutions for a linear multiple‐objective transportation problem can be enumerated. First the algorithm determines an initial efficient basic solution. In a second step all efficient basic solutions are enumerated. Finally, the set of all efficient solutions is constructed as a union of a minimal number of convex sets of efficient solutions. The algorithm is illustrated by a numerical example.

Suggested Citation

  • Heinz Isermann, 1979. "The enumeration of all efficient solutions for a linear multiple‐objective transportation problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 26(1), pages 123-139, March.
  • Handle: RePEc:wly:navlog:v:26:y:1979:i:1:p:123-139
    DOI: 10.1002/nav.3800260112
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800260112
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.3800260112?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. Strijbosch, L.W.G. & van Doorne, A.G.M. & Selen, W.J., 1990. "A simplified MOLP algorithm : The MOLP-S procedure," Other publications TiSEM be36bc9e-0563-472f-ad4e-d, Tilburg University, School of Economics and Management.
    2. Gupta, Pankaj & Mehlawat, Mukesh Kumar & Aggarwal, Usha & Charles, V., 2021. "An integrated AHP-DEA multi-objective optimization model for sustainable transportation in mining industry," Resources Policy, Elsevier, vol. 74(C).

    More about this item

    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:wly:navlog:v:26:y:1979:i:1:p:123-139. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.