| Article ID: | iaor20003314 |
| Country: | Netherlands |
| Volume: | 118 |
| Issue: | 3 |
| Start Page Number: | 620 |
| End Page Number: | 630 |
| Publication Date: | Nov 1999 |
| Journal: | European Journal of Operational Research |
| Authors: | Drezner Zvi, Scott Carlton H. |
| Keywords: | Weber problem |
In this paper we find the set of feasible solution points to the Weber location problem with squared Euclidean distances when the weights can be at any point in a given set of intervals. We prove that this set is a convex polygon. The result is then used to solve the minimax regret objective when individual scenarios can be any set of weights in a given set of intervals.