Abstract
We consider a competitive facility location problem with uncertainty represented by a finite number of possible demand scenarios. The problem is stated as a bilevel model constructed on the basis of a Stackelberg game and the classical facility location model formalizing the players’ decision process. In the bilevel model, the first player (Leader) has two options to open a facility. We assume that the Leader’s facility can be opened either before the actual demand scenario is revealed or after such a revelation. The fixed costs associated with the facility opening are lower in the former case. Thus, the fixed costs can be reduced by making a preliminary location decision at the first stage and adjusting it at the second one.
We suggest a procedure for computing an upper bound for the Leader’s profit. The approach is based on using a family of auxiliary bilevel subproblems. The optimal solutions of the subproblems form a feasible solution of the original problem. The upper bound is computed by applying a c-cut generation procedure to strengthen high-point relaxations of the subproblems.
Similar content being viewed by others
REFERENCES
V. L. Beresnev, “On the competitive facility location problem with a free choice of suppliers,” Avtom. Telemekh. (4) 93–106 (2014) [Autom. Remote Control 75 (4), 668–676 (2014)].
M. G. Ashtiani, A. Makui, and R. Ramezanian, “A robust model for a leader–follower competitive facility location problem in a discrete space,” Appl. Math. Model. 37 (1–2), 62–71 (2013).
W. Yu, “A leader–follower model for discrete competitive facility location problem under the partially proportional rule with a threshold,” PLOS ONE 14 (12), e0225693 (2019).
S. V. Ivanov and M. V. Morozova, “Stochastic problem of competitive location of facilities with quantile criterion,” Avtom. Telemekh. (3), 109–122 (2016) [Autom. Remote Control 77 (3), 451–461 (2016)].
V. L. Beresnev and A. A. Melnikov, “ \( \varepsilon \)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario,” EURO J. Comput. Optim. 8 (1), 33–59 (2020).
S. V. Ivanov and V. N. Akmaeva, “Two-stage stochastic facility location model with quantile criterion and choosing reliability level,” Vestn. Yuzhno-Ural. Gos. Univ. Ser. Mat. Model. 14 (3), 5–17 (2021).
V. L. Beresnev and A. A. Melnikov, “Approximation of the competitive facility location problem with MIPs,” Comput. Oper. Res. 104, 139–148 (2019).
J. T. Moore and J. F. Bard, “The mixed integer linear bilevel programming problem,” Oper. Res. 38 (5), 911–921 (1990).
V. L.Beresnev, “Branch-and-bound algorithm for a competitive facility location problem,” Comput. Oper. Res. 40 (8), 2062–2070 (2013).
Gurobi Optimizer Reference Manual (Gurobi Optimization, Beaverton, 2021). www.gurobi.com/documentation/9.5/refman/index.html. Accessed May 16, 2022.
Funding
This work was supported by the Russian Science Foundation, project no. 21–41–09017.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by V. Potapchouck
Rights and permissions
About this article
Cite this article
Beresnev, V.L., Melnikov, A.A. Computation of an Upper Bound in the Two-Stage Bilevel Competitive Location Model. J. Appl. Ind. Math. 16, 377–386 (2022). https://doi.org/10.1134/S1990478922030012
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478922030012