Geodesic
Computing an upper bound in the two-stage bi-level competitive location model
Diskretnyj analiz i issledovanie operacij, Tome 29 (2022) no. 3, pp. 7-23

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider a competitive facility location problem with uncertainty represented by a finite number of possible demand scenarios. The problem is formulated as a bi-level model built on the base of a Stackelberg game and classic facility location model formalizing the players' decision process. In the bi-level model, the first player (Leader) has two options to open a facility. We assume that a Leader's facility could be opened either before the actual demand scenario is revealed or after the revelation. The fixed costs associated with the facility opening are lower in the first case. Thus the fixed costs could be reduced by making a preliminary location decision on the first stage and adjusting it on the second. We suggest a procedure to compute an upper bound for the Leader's profit value. The approach is based on using a family of auxiliary bi-level subproblems. Optimal solutions of the subproblems form a feasible solution of the initial problem. The upper bound is computed by applying a cut generation procedure to strengthen high-point relaxations of the subproblems. Tab. 1, illustr. 1, bibliogr. 10.
Keywords: Stackelberg game, binary customer's behavior rule, bi-level location model
Mots-clés : pessimistic optimal solution. 
@article{DA_2022_29_3_a1,
     author = {V. L. Beresnev and A. A. Melnikov},
     title = {Computing an upper bound in the two-stage bi-level competitive location model},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {7--23},
     publisher = {mathdoc},
     volume = {29},
     number = {3},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2022_29_3_a1/}
}
TY  - JOUR
AU  - V. L. Beresnev
AU  - A. A. Melnikov
TI  - Computing an upper bound in the two-stage bi-level competitive location model
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2022
SP  - 7
EP  - 23
VL  - 29
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2022_29_3_a1/
LA  - ru
ID  - DA_2022_29_3_a1
ER  - 
%0 Journal Article
%A V. L. Beresnev
%A A. A. Melnikov
%T Computing an upper bound in the two-stage bi-level competitive location model
%J Diskretnyj analiz i issledovanie operacij
%D 2022
%P 7-23
%V 29
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2022_29_3_a1/
%G ru
%F DA_2022_29_3_a1
V. L. Beresnev; A. A. Melnikov. Computing an upper bound in the two-stage bi-level competitive location model. Diskretnyj analiz i issledovanie operacij, Tome 29 (2022) no. 3, pp. 7-23. http://geodesic.mathdoc.fr/item/DA_2022_29_3_a1/