IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v29y1981i6p1219-1227.html
   My bibliography  Save this article

Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty

Author

Listed:
  • Henrik Juel

    (Soenderborg School of Economics and Business Administration, Soenderborg, Denmark)

Abstract

An existing analysis of the bounds on the Weber problem solution under uncertainty is incorrect. For the generalized problem with arbitrary measures of distance, we give easily computable ranges on the bounds and state the conditions under which the exact values of the bounds can be found with little computational effort. Numerical examples illustrate the analysis.

Suggested Citation

  • Henrik Juel, 1981. "Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty," Operations Research, INFORMS, vol. 29(6), pages 1219-1227, December.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:6:p:1219-1227
    DOI: 10.1287/opre.29.6.1219
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.6.1219
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.6.1219?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. Nazlı Dolu & Umur Hastürk & Mustafa Kemal Tural, 2020. "Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances," Computational Optimization and Applications, Springer, vol. 75(2), pages 537-560, March.
    2. Blanco, Víctor & Fernández, Elena & Puerto, Justo, 2017. "Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods," European Journal of Operational Research, Elsevier, vol. 262(3), pages 863-878.
    3. Víctor Blanco, 2019. "Ordered p-median problems with neighbourhoods," Computational Optimization and Applications, Springer, vol. 73(2), pages 603-645, June.

    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:oropre:v:29:y:1981:i:6:p:1219-1227. 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.