Geodesic
An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 4, pp. 5-21

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

A new mathematical model is considered related to competitive location problems where two competing parties, the Leader and the Follower, successively open their facilities and try to win customers. In the model, we consider a situation of several alternative demand scenarios which differ by the composition of customers and their preferences. We assume that the costs of opening a facility depend on its capacity; therefore, the Leader, making decisions on the placement of facilities, must determine their capacities taking into account all possible demand scenarios and the response of the Follower. For the bilevel model suggested, a problem of finding an optimistic optimal solution is formulated. We show that this problem can be represented as a problem of maximizing a pseudo-Boolean function with the number of variables equal to the number of possible locations of the Leader’s facilities.We propose a novel system of estimating the subsets that allows us to supplement the estimating problems, used to calculate the upper bounds for the constructed pseudo-Boolean function, with additional constraints which improve the upper bounds. Bibliogr. 13.
Keywords: competitive facility location, bilevel programming, upper bound. 
@article{DA_2017_24_4_a0,
     author = {V. L. Beresnev and A. A. Melnikov},
     title = {An upper bound for the competitive location and capacity choice problem with multiple demand scenarios},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {5--21},
     publisher = {mathdoc},
     volume = {24},
     number = {4},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2017_24_4_a0/}
}
TY  - JOUR
AU  - V. L. Beresnev
AU  - A. A. Melnikov
TI  - An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2017
SP  - 5
EP  - 21
VL  - 24
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2017_24_4_a0/
LA  - ru
ID  - DA_2017_24_4_a0
ER  - 
%0 Journal Article
%A V. L. Beresnev
%A A. A. Melnikov
%T An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
%J Diskretnyj analiz i issledovanie operacij
%D 2017
%P 5-21
%V 24
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2017_24_4_a0/
%G ru
%F DA_2017_24_4_a0
V. L. Beresnev; A. A. Melnikov. An upper bound for the competitive location and capacity choice problem with multiple demand scenarios. Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 4, pp. 5-21. http://geodesic.mathdoc.fr/item/DA_2017_24_4_a0/