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

A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems

Author

Listed:
  • Ralph W. Swain

    (The Ohio State University)

Abstract

This paper presents a new approach to determining the optimal facility locations for uncapacitated location problems in two stages. First, it is shown that a subset of all solutions to the uncapacitated public facility location problem can be obtained by considering a closely related private location problem. The exact nature of the problem is established using the Generalized Lagrange Multiplier results given by Everett. In the second section of the paper a particularly efficient parametric decomposition algorithm, which is based on the results of the first section, is presented. Computational results are given which summarize the current level of experience with the algorithm.

Suggested Citation

  • Ralph W. Swain, 1974. "A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems," Management Science, INFORMS, vol. 21(2), pages 189-198, October.
  • Handle: RePEc:inm:ormnsc:v:21:y:1974:i:2:p:189-198
    DOI: 10.1287/mnsc.21.2.189
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.21.2.189
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.21.2.189?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. Arbib & F. Marinelli, 2009. "Exact and Asymptotically Exact Solutions for a Class of Assortment Problems," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 13-25, February.
    2. Diego Ruiz-Hernández & Javier Elizalde & David Delgado-Gómez, 2017. "Cournot–Stackelberg games in competitive delocation," Annals of Operations Research, Springer, vol. 256(1), pages 149-170, September.
    3. Daniel Serra & Charles Revelle & Ken Rosing, 1999. "Surviving in a competitive spatial market: The threshold capture model," Economics Working Papers 359, Department of Economics and Business, Universitat Pompeu Fabra.
    4. Marianov, Vladimir & Serra, Daniel, 2001. "Hierarchical location-allocation models for congested systems," European Journal of Operational Research, Elsevier, vol. 135(1), pages 195-208, November.
    5. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    6. Galvao, Roberto D. & Acosta Espejo, Luis Gonzalo & Boffey, Brian & Yates, Derek, 2006. "Load balancing and capacity constraints in a hierarchical location model," European Journal of Operational Research, Elsevier, vol. 172(2), pages 631-646, July.
    7. Sorensen, Paul & Church, Richard, 2010. "Integrating expected coverage and local reliability for emergency medical services location problems," Socio-Economic Planning Sciences, Elsevier, vol. 44(1), pages 8-18, March.
    8. Daniel Serra & Charles Revelle, 1997. "Competitive location and pricing on networks," Economics Working Papers 219, Department of Economics and Business, Universitat Pompeu Fabra.
    9. Rosing, K. E. & ReVelle, C. S. & Schilling, D. A., 1999. "A gamma heuristic for the p-median problem," European Journal of Operational Research, Elsevier, vol. 117(3), pages 522-532, September.
    10. Rafael Bernardo Carmona-Benítez, 2020. "Dimensionality-reduction Procedure for the Capacitated p-Median Transportation Inventory Problem," Mathematics, MDPI, vol. 8(4), pages 1-16, March.
    11. Daniel Serra & Charles Revelle, 1994. "Competitive location in discrete space," Economics Working Papers 96, Department of Economics and Business, Universitat Pompeu Fabra.

    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:inm:ormnsc:v:21:y:1974:i:2:p:189-198. 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.