Additional constraints for dynamic competitive facility location problem
Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 3, pp. 43-56

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

We consider a competitive facility location model, where competing parties (Leader and Follower) make decisions considering changes of the set of customers happening during the planing horizon, having known number of time periods. It is supposed that the Leader makes a decision on opening their facilities at the beginning of the planning horizon, while the Follower can revise their decision in each time period. In the present paper, we study perspectives to apply a method for finding the best solution which is based on using HP-relaxation of the bi-level problem considered. The key element of this method is construction of additional inequalities strengthening the HP-relaxation and computation of upper bounds for the objective function of the problem. In the work, new families of additional constraints are proposed to strengthen the HP-relaxation, that allow us to compute non-trivial upper bounds. Bibliogr. 13.
Keywords: Stackelberg game, bi-level programming, competitive location, valid inequalities.
@article{DA_2023_30_3_a1,
     author = {V. L. Beresnev and A. A. Melnikov},
     title = {Additional constraints for dynamic competitive facility location problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {43--56},
     publisher = {mathdoc},
     volume = {30},
     number = {3},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2023_30_3_a1/}
}
TY  - JOUR
AU  - V. L. Beresnev
AU  - A. A. Melnikov
TI  - Additional constraints for dynamic competitive facility location problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2023
SP  - 43
EP  - 56
VL  - 30
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2023_30_3_a1/
LA  - ru
ID  - DA_2023_30_3_a1
ER  - 
%0 Journal Article
%A V. L. Beresnev
%A A. A. Melnikov
%T Additional constraints for dynamic competitive facility location problem
%J Diskretnyj analiz i issledovanie operacij
%D 2023
%P 43-56
%V 30
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2023_30_3_a1/
%G ru
%F DA_2023_30_3_a1
V. L. Beresnev; A. A. Melnikov. Additional constraints for dynamic competitive facility location problem. Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 3, pp. 43-56. http://geodesic.mathdoc.fr/item/DA_2023_30_3_a1/