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

A Maxmin Location Problem

Author

Listed:
  • B. Dasarathy

    (GTE Laboratories Incorporated, Waltham, Massachusetts)

  • Lee J. White

    (The Ohio State University, Columbus, Ohio)

Abstract

The problem considered is to locate a point in a given convex polyhedron which maximizes the minimum Euclidean distance from a given set of points. The paper describes several possible application areas and shows the existence of a finite set of candidates for the optimal solution. A combinatorial algorithm is presented for the problem in three dimensions, and it is compared with existing nonconvex programming algorithms.

Suggested Citation

  • B. Dasarathy & Lee J. White, 1980. "A Maxmin Location Problem," Operations Research, INFORMS, vol. 28(6), pages 1385-1401, December.
    • Handle: RePEc:inm:oropre:v:28:y:1980:i:6:p:1385-1401
    DOI: 10.1287/opre.28.6.1385
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.28.6.1385
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.28.6.1385?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. Andreas Löhne & Andrea Wagner, 2017. "Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver," Journal of Global Optimization, Springer, vol. 69(2), pages 369-385, October.
    2. Munoz-Perez, Jose & Saameno-Rodriguez, Juan Jose, 1999. "Location of an undesirable facility in a polygonal region with forbidden zones," European Journal of Operational Research, Elsevier, vol. 114(2), pages 372-379, April.
    3. Tongli Zhang & Yong Xia, 2022. "Covering a simplex by spheres: complexity and algorithms," Journal of Global Optimization, Springer, vol. 84(1), pages 119-135, September.
    4. Andrea Wagner, 2019. "Locating a semi-obnoxious facility in the special case of Manhattan distances," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 90(2), pages 255-270, October.

    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:oropre:v:28:y:1980:i:6:p:1385-1401. 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.