|
|||||
|
|
The Minimax and Maximin Location Problems on a Network with Uniform Distributed Weights |
|
| Authors: | Oded Berman Zvi Drezner Jiamin Wang George O. Wesolowsky |
| Affiliation: | a Joseph L. Rotman School of Management, University of Toronto, 105 St. George St., Toronto, Ontario, Canada M5S 3E6 E-mail: berman@Rotman.utoronto.ca or jwang@Rotman.utoronto.ca.b College of Business and Economics, California State University-Fullerton, Fullerton, CA 92834, USA E-mail: zdrezner@fullerton.edu.c Long Island University, Department of Management, C.W. Post, NY 11548, USA E-mail: jiamin.wang@liu.edu.d Faculty of Business, McMaster University, Hamilton, Ontario, Canada L8S 4M4 E-mail: wesolows@mcmail.ccs.mcmaster.ca. |
| Abstract: | In this paper we consider the weighted minimax and maximin location problems on the network when the weights are drawn from a uniform distribution. In the minimax (maximin) problem with stochastic demand the probability that the maximum (minimum) weighted distance between the facility and demand points exceeding (falling short of) a given value T is minimized. Properties of the solution points for both problems are proven and algorithms are presented. |
| Keywords: | |
| 本文献已被 InformaWorld 等数据库收录！ | |