A capacitated competitive facility location problem
- Авторлар: Beresnev V.1,2, Melnikov A.1,2
-
Мекемелер:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Шығарылым: Том 10, № 1 (2016)
- Беттер: 61-68
- Бөлім: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212240
- DOI: https://doi.org/10.1134/S1990478916010075
- ID: 212240
Дәйексөз келтіру
Аннотация
We consider a mathematical model similar in a sense to competitive location problems. There are two competing parties that sequentially open their facilities aiming to “capture” customers and maximize profit. In our model, we assume that facilities’ capacities are bounded. The model is formulated as a bilevel integer mathematical program, and we study the problem of obtaining its optimal (cooperative) solution. It is shown that the problem can be reformulated as that of maximization of a pseudo-Boolean function with the number of arguments equal to the number of places available for facility opening. We propose an algorithm for calculating an upper bound for values that the function takes on subsets which are specified by partial (0, 1)-vectors.
Негізгі сөздер
Авторлар туралы
V. Beresnev
Sobolev Institute of Mathematics; Novosibirsk State University
Хат алмасуға жауапты Автор.
Email: beresnev@math.nsc.ru
Ресей, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
A. Melnikov
Sobolev Institute of Mathematics; Novosibirsk State University
Email: beresnev@math.nsc.ru
Ресей, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090