We addres the following single-facility location problem: a rm is entering into a market by locating one facility in a polygonal region of the plane. The demand captured from each user by the facility will be proportional to the users buying power and inversely proportional to a function of the user-facility distance. Uncertainty exists on the buying power (weight) of the users. This is modeled by assuming that a set of scenarios exists, each scenario corresponding to a weight realization.
The objective is to locate the facility following the Savage criterion, ie., the minimumregret location is sought. The problem is formulated as a d.c. optimization problem. As a solution technique, a branch-and-bound is proposed. The usefulness of acceleration devises such as local-search optimization routines is analyzed.