\(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185)

The authors consider a warehouse location problem as a Stackelberg game where both parties try to maximize their profit. The leader has no information about the set of customers, only a finite set of possible scenarios and their probability of realization are known. The leader aims at maximizing the probability of a guaranteed profit and at maximizing the profit. The Pareto front of the bi-objective and bi-level mathematical program is approximated by solving a sequence of single objective programs with branch and bound. Comprehensive computational results show the performance of the method and the integrated three upper bounding procedures.