Minmax Regret Median Location on a Network Under Uncertainty

We consider the 1-median problem on a network with uncertain weights of nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find the "minimax regret" location, i.e., to minimize the worst-case loss in the objective function that may occur because a decision is made without knowing which state of nature will take place. We present the first polynomial algorithm for this problem on a general network. For the problem on a tree network, we discuss an algorithm with an order of complexity improved over the algorithms known in the literature.

[1]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[2]  J. Rosenhead,et al.  Robustness and Optimality as Criteria for Strategic Decisions , 1972 .

[3]  Hau L. Lee,et al.  A ROBUSTNESS APPROACH TO FACILITIES DESIGN , 1987 .

[4]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[5]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[6]  John Hooker.  Solving Nonlinear Single-Facility Network Location Problems , 1986, Oper. Res..

[7]  R. T. Wong,et al.  `Multidimensional' extensions and a nested dual approach for the m-median problem , 1985 .

[8]  Timothy J. Lowe,et al.  Convex Location Problems on Tree Networks , 1976, Oper. Res..

[9]  Howard Raiffa,et al.  Games and Decisions: Introduction and Critical Survey. , 1958 .

[10]  Genaro J. Gutierrez,et al.  A robustness approach to international sourcing , 1995, Ann. Oper. Res..

[11]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[12]  A. J. Goldman.  Optimal Center Location in Simple Networks , 1971 .

[13]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[14]  R. Garfinkel,et al.  Locating an Obnoxious Facility on a Network , 1978 .

[15]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[16]  Jonathan Halpern,et al.  THE LOCATION OF A CENTER-MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE* , 1976 .

[17]  Jati K. Sengupta.  Robust decisions in economic models , 1991, Comput. Oper. Res..

[18]  H. Frank,et al.  Optimum Locations on a Graph with Probabilistic Demands , 1966, Oper. Res..

[19]  J. Halpern.  Finding Minimal Center-Median Convex Combination Cent-Dian of a Graph , 1978 .

[20]  J. Rosenhead,et al.  Robustness in Sequential Investment Decisions , 1968 .

[21]  Genaro J. Gutierrez,et al.  Algorithms for robust single and multiple period layout planning for manufacturing systems , 1992 .

[22]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

[23]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[24]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[25]  H. Frank,et al.  Letter to the Editor - Optimum Locations on Graphs with Correlated Normal Demands , 1967, Oper. Res..

[26]  G. O. Wesolowsky.  Probabilistic Weights in the One-Dimensional Facility Location Problem , 1977 .

[27]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[28]  A. Odoni,et al.  Locations of Medians on Stochastic Networks , 1979 .

[29]  Martine Labbé,et al.  Sensitivity Analysis in Minisum Facility Location Problems , 1991, Oper. Res..

[30]  Z. Drezner.  Sensitivity analysis of the optimal location of a facility , 1985 .