IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v37y1990i6p937-944.html
   My bibliography  Save this article

Analysis of a bicriteria location model

Author

Listed:
  • Adel A. Aly
  • Boubekeur Rahali

Abstract

In this article a bicriteria model, formed by the weighted sum of the minisum and minimax functions for a single‐location problem, is investigated. It is shown that all efficient solutions generated by either constrained model are also properly efficient. The bicriteria model and the constrained models are theoretically equivalent, but it is more efficient and simpler to generate nondominated solutions using the constrained criterion approach. When solving the bicriteria model, a critical range is found for which all properly efficient solutions are generated.

Suggested Citation

  • Adel A. Aly & Boubekeur Rahali, 1990. "Analysis of a bicriteria location model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 937-944, December.
    • Handle: RePEc:wly:navres:v:37:y:1990:i:6:p:937-944
    DOI: 10.1002/1520-6750(199012)37:63.0.CO;2-4
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199012)37:63.0.CO;2-4
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199012)37:63.0.CO;2-4?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. Timothy J. Lowe, 1978. "Efficient Solutions in Multiobjective Tree Network Location Problems," Transportation Science, INFORMS, vol. 12(4), pages 298-316, November.
    2. Chalmet, Luc G. & Francis, Richard L. & Kolen, Antoon, 1981. "Finding efficient solutions for rectilinear distance location problems efficiently," European Journal of Operational Research, Elsevier, vol. 6(2), pages 117-124, February.
    3. Leon F. McGinnis & John A. White, 1978. "A Single Facility Rectilinear Location Problem with Multiple Criteria," Transportation Science, INFORMS, vol. 12(3), pages 217-231, August.
    4. Margaret K. Schaefer & Arthur P. Hurter, 1974. "An algorithm for the solution of a location problem with metric constraints," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(4), pages 625-636, December.
    5. Jonathan Halpern, 1978. "Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph," Management Science, INFORMS, vol. 24(5), pages 535-544, January.
    6. Allen Klinger, 1967. "Letter to the Editor—Improper Solutions of the Vector Maximum Problem," Operations Research, INFORMS, vol. 15(3), pages 570-572, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ohsawa, Yoshiaki, 1999. "A geometrical solution for quadratic bicriteria location models," European Journal of Operational Research, Elsevier, vol. 114(2), pages 380-388, April.

    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. Hamacher, H. W. & Nickel, S., 1996. "Multicriteria planar location problems," European Journal of Operational Research, Elsevier, vol. 94(1), pages 66-86, October.
    2. Yoshiaki Ohsawa, 2000. "Bicriteria Euclidean location associated with maximin and minimax criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(7), pages 581-592, October.
    3. Ohsawa, Yoshiaki, 1999. "A geometrical solution for quadratic bicriteria location models," European Journal of Operational Research, Elsevier, vol. 114(2), pages 380-388, April.
    4. Oliver Stein & Maximilian Volk, 2023. "Generalized Polarity and Weakest Constraint Qualifications in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1156-1190, September.
    5. Jiwon Baik & Alan T. Murray, 2022. "Locating a facility to simultaneously address access and coverage goals," Papers in Regional Science, Wiley Blackwell, vol. 101(5), pages 1199-1217, October.
    6. Alzorba, Shaghaf & Günther, Christian & Popovici, Nicolae & Tammer, Christiane, 2017. "A new algorithm for solving planar multiobjective location problems involving the Manhattan norm," European Journal of Operational Research, Elsevier, vol. 258(1), pages 35-46.
    7. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.
    8. P B Mirchandani & A Oudjit, 1982. "Probabilistic Demands and Costs in Facility Location Problems," Environment and Planning A, , vol. 14(7), pages 917-932, July.
    9. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    10. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "A bi-objective approach to discrete cost-bottleneck location problems," Annals of Operations Research, Springer, vol. 267(1), pages 179-201, August.
    11. Li, Hongmei & Luo, Taibo & Xu, Yinfeng & Xu, Jiuping, 2018. "Minimax regret vertex centdian location problem in general dynamic networks," Omega, Elsevier, vol. 75(C), pages 87-96.
    12. Savin Treanţă & Tadeusz Antczak & Tareq Saeed, 2023. "Connections between Non-Linear Optimization Problems and Associated Variational Inequalities," Mathematics, MDPI, vol. 11(6), pages 1-12, March.
    13. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.
    14. Dionisio Brito & José Moreno Pérez, 2000. "The generalizedp-Centdian on network," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(2), pages 265-285, December.
    15. Richard Francis & Timothy Lowe, 2014. "Comparative error bound theory for three location models: continuous demand versus discrete demand," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 144-169, April.
    16. Welch, S. B. & Salhi, S., 1997. "The obnoxious p facility network location problem with facility interaction," European Journal of Operational Research, Elsevier, vol. 102(2), pages 302-319, October.
    17. Ogryczak, Wlodzimierz, 2000. "Inequality measures and equitable approaches to location problems," European Journal of Operational Research, Elsevier, vol. 122(2), pages 374-391, April.
    18. Carrizosa, E. J. & Puerto, J., 1995. "A discretizing algorithm for location problems," European Journal of Operational Research, Elsevier, vol. 80(1), pages 166-174, January.
    19. Justo Puerto & Federica Ricca & Andrea Scozzari, 2018. "Extensive facility location problems on networks: an updated review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 187-226, July.
    20. Martínez-Merino, Luisa I. & Albareda-Sambola, Maria & Rodríguez-Chía, Antonio M., 2017. "The probabilistic p-center problem: Planning service for potential customers," European Journal of Operational Research, Elsevier, vol. 262(2), pages 509-520.

    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:wly:navres:v:37:y:1990:i:6:p:937-944. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.