Mean-Variance Location Problems

Oded Berman
Additional contact information
Oded Berman: University of Massachusetts-Harbor Campus, Boston, Massachusetts 02125

Transportation Science, 1990, vol. 24, issue 4, 287-293

Abstract: In this paper we discuss three mean-variance location problems. Two of them are constrained problems where one performance measure—mean of the weighted distance, or variance, is minimized subject to an upper bound constraint on the value of the other. In the third problem the objective function minimized is given by the mean plus a constant times the variance. The paper includes polynomial time algorithms to solve the three problems. The solutions produced by these algorithms are Pareto optimum solutions (solutions that are strictly better than any other solution in at least one of the two measures: mean and variance).

Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.24.4.287 (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:24:y:1990:i:4:p:287-293

Access Statistics for this article

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