IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v7y1973i4p297-316.html
   My bibliography  Save this article

A Dual Decomposition Method for Minimizing Transportation Costs in Multifacility Location Problems

Author

Listed:
  • Robert F. Love

    (University of Wisconsin, Madison, Wisconsin)

  • Svend A. Kraemer

    (Bedriftsokonomisk Institute, Oslo, Norway)

Abstract

This paper develops the dual program of the constrained multifacility location problem in which total transportation cost in the system is proportional to the sum of the weighted Euclidean distances between facilities. A decomposition solution method is presented in which the master program is linear and each subprogram is a nonlinear programming problem. Computation results are presented and discussed.

Suggested Citation

  • Robert F. Love & Svend A. Kraemer, 1973. "A Dual Decomposition Method for Minimizing Transportation Costs in Multifacility Location Problems," Transportation Science, INFORMS, vol. 7(4), pages 297-316, November.
    • Handle: RePEc:inm:ortrsc:v:7:y:1973:i:4:p:297-316
    DOI: 10.1287/trsc.7.4.297
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.7.4.297
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.7.4.297?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. Halit Üster & Robert F. Love, 2002. "Duality in constrained multi‐facility location models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(4), pages 410-421, June.
    2. Quoc Tran Dinh & Carlo Savorgnan & Moritz Diehl, 2013. "Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems," Computational Optimization and Applications, Springer, vol. 55(1), pages 75-111, May.

    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:ortrsc:v:7:y:1973:i:4:p:297-316. 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.