A Biobjective Multifacility Minimax Location Problem on a Tree Network

Barbaros C. Tansel, Richard L. Francis and Timothy J. Lowe
Additional contact information
Barbaros C. Tansel: Georgia Institute of Technology, Atlanta, Georgia
Richard L. Francis: University of Florida, Gainesville, Florida
Timothy J. Lowe: Purdue University, West Lafayette, Indiana

Transportation Science, 1982, vol. 16, issue 4, 407-429

Abstract: In this paper we consider a biobjective multifacility minimax location problem on a tree network, which involves as objectives the maximum of the weighted distances between specified pairs of new and existing facilities, and the maximum of the weighted distances between specified pairs of new facilities. We establish necessary and sufficient conditions for a location vector to be efficient. We also give an algorithm for finding the efficient frontier of the problem, and provide an example illustrating the use of the algorithm. In addition, we consider a broad class of multiobjective location problems and give general necessary and sufficient conditions for a location vector to be efficient.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.16.4.407 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:16:y:1982:i:4:p:407-429

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().