Реферат: 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 con structed 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 ap proach 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.

Библиографическая ссылка: Beresnev V.L. , Melnikov A.A.
Computation of an Upper Bound in the Two-Stage Bilevel Competitive Location Model
Journal of Applied and Industrial Mathematics. 2022. V.16. N3. P.377-386. DOI: 10.1134/S1990478922030012 Scopus РИНЦ OpenAlex

Оригинальная: Береснев В.Л. , Мельников А.А.
Вычисление верхней границы для двухэтапной двухуровневой модели конкурентного размещения
Дискретный анализ и исследование операций. 2022. Т.29. №3. С.7-23. DOI: 10.33048/daio.2022.29.740 РИНЦ

Даты:

Поступила в редакцию:	16 мая 2022 г.
Принята к публикации:	19 мая 2022 г.
Опубликована в печати:	18 дек. 2022 г.
Опубликована online:	18 дек. 2022 г.

Идентификаторы БД:

Scopus:	2-s2.0-85144183476
РИНЦ:	58841024
OpenAlex:	W4313191325

Цитирование в БД:

БД	Цитирований
Scopus	1
OpenAlex	1
РИНЦ	1

Альметрики: