IDEAS home Printed from https://ideas.repec.org/a/sae/envira/v16y1984i9p1181-1195.html
   My bibliography  Save this article

Extensions of the k-Elliptic Optimization Approach and a Computer Method for Location Decision

Author

Listed:
  • D K Kulshrestha
  • T W Sag

Abstract

Some closely related location problems subject to given constraints are considered. With the aid of the k -elliptic optimization approach, a minimax problem is solved. This approach is further developed with a view to solving location problems involving nonconvex level surfaces. Last, a computer method for constructing level curves of a certain class of objective functions is described.

Suggested Citation

  • D K Kulshrestha & T W Sag, 1984. "Extensions of the k-Elliptic Optimization Approach and a Computer Method for Location Decision," Environment and Planning A, , vol. 16(9), pages 1181-1195, September.
    • Handle: RePEc:sae:envira:v:16:y:1984:i:9:p:1181-1195
    DOI: 10.1068/a161181
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/a161181
    Download Restriction: no
    File URL: https://libkey.io/10.1068/a161181?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
    ---><---

    References listed on IDEAS

    as
    1. P. M. Dearing & R. L. Francis, 1974. "A Minimax Location Problem on a Network," Transportation Science, INFORMS, vol. 8(4), pages 333-343, November.
    2. George O. Wesolowsky, 1972. "Rectangular Distance Location under the Minimax Optimality Criterion," Transportation Science, INFORMS, vol. 6(2), pages 103-113, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nikolai Krivulin, 2017. "Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance," Computational Management Science, Springer, vol. 14(4), pages 493-518, October.
    2. Polten, Lukas & Emde, Simon, 2022. "Multi-shuttle crane scheduling in automated storage and retrieval systems," European Journal of Operational Research, Elsevier, vol. 302(3), pages 892-908.
    3. G Babich, 1978. "An Efficient Algorithm for Solving the Rectilinear Location-Allocation Problem," Environment and Planning A, , vol. 10(12), pages 1387-1395, December.
    4. Diaz-Banez, J. M. & Mesa, J. A. & Schobel, A., 2004. "Continuous location of dimensional structures," European Journal of Operational Research, Elsevier, vol. 152(1), pages 22-44, January.
    5. Noor-E-Alam, Md. & Mah, Andrew & Doucette, John, 2012. "Integer linear programming models for grid-based light post location problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 17-30.
    6. Maksim Barketau & Erwin Pesch, 2016. "An approximation algorithm for a special case of the asymmetric travelling salesman problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4205-4212, July.

    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:sae:envira:v:16:y:1984:i:9:p:1181-1195. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: SAGE Publications (email available below). General contact details of provider: .

    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.