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

Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems

Author

Listed:
  • E. Erkut

    (University of Alberta, Edmonton, Canada)

  • R. L. Francis

    (University of Florida, Gainesville, Florida)

  • T. J. Lowe

    (Purdue University, West Lafayette, Indiana)

  • A. Tamir

    (New York University, New York and Tel Aviv University, Tel Aviv, Israel)

Abstract

We consider the optimization problem of locating several new facilities on a tree network, with respect to existing facilities, and to each other. The new facilities are not restricted to be at vertices of the network, but the locations are subject to constraints. Each constraint function, and the objective function, is an arbitrary, nondecreasing function of any finite collection of tree distances between new and existing facilities, and/or between distinct pairs of new facilities, and represents some sort of transport or travel cost. The new facilities are to be located so as to minimize the objective function subject to upper bounds on the constraint functions. We show that such problems are equivalent to mathematical programming problems which, when each function is expressed using only maximization and summation operations on nonnegatively weighted arguments, are linear programming problems of polynomial dimensions. The latter problems can be solved using duality theory with special purpose column generation and shortest path algorithms for column pricing.

Suggested Citation

  • E. Erkut & R. L. Francis & T. J. Lowe & A. Tamir, 1989. "Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems," Operations Research, INFORMS, vol. 37(3), pages 447-461, June.
    • Handle: RePEc:inm:oropre:v:37:y:1989:i:3:p:447-461
    DOI: 10.1287/opre.37.3.447
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.37.3.447
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.37.3.447?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
    ---><---

    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:37:y:1989:i:3:p:447-461. 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.