Locating a competitive facility in the plane with a robustness criterion

A new model for locating a competitive facility in the plane in a robust way is presented and embedded in the literature on robustness in facility location. Its mathematical properties are investigated and new sharp bounds for a deterministic method that guarantees the global optimum are derived and evaluated.

► A new robust competitive continuous location model is investigated.
► Robust stochastic programming models are shown to be a particular case.
► The model inherits the multimodal character of the underlying Huff-model.
► Bounds are derived by using dcm optimization.
► Problems with thousands of demand points can be solved in a few seconds.