Upper Bound for the Competitive Facility Location Problem with Demand Uncertainty | Sciact - Система учета научной деятельности ИМ СО РАН

Upper Bound for the Competitive Facility Location Problem with Demand Uncertainty Научная публикация

Журнал

Doklady Mathematics
ISSN: 1064-5624 , E-ISSN: 1531-8362

Вых. Данные

Год: 2023, Том: 108, Номер: 3, Страницы: 438-442 Страниц : 5 DOI: 10.1134/s1064562423600318

Ключевые слова

bilevel programming, Stackelberg game, competitive facility location, pessimistic optimal solution

Авторы

Beresnev V.L. ^1,2 , Melnikov A.A. ^1,2

Организации

1	Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
2	Novosibirsk State University

Информация о финансировании (1)

Российский научный фонд

21-41-09017

We consider a competitive facility location problem with two competing parties operating in a situation of uncertain demand scenarios. The problem of finding the best solutions for the parties is formulated as a discrete bilevel mathematical programming problem. A procedure for computing an upper bound for the objective function on solution subsets is suggested. The procedure could be employed in implicit enumeration schemes capable of computing an optimal solution for the problem under study. Within the procedure, additional constraints (cuts) iteratively augment the high-point relaxation of the initial bilevel problem, which strengthens the relaxation and improves the upper bound’s quality. A new procedure for generating such cuts is proposed, which allows us to construct the strongest cuts without enumerating the parameters encoding them.

Beresnev V.L. , Melnikov A.A.
Upper Bound for the Competitive Facility Location Problem with Demand Uncertainty
Doklady Mathematics. 2023. V.108. N3. P.438-442. DOI: 10.1134/s1064562423600318 WOS Scopus РИНЦ OpenAlex

Береснев В.Л. , Мельников А.А.
Алгоритм вычисления верхних границ для задачи конкурентного размещения в условиях неопределенности спроса
Доклады Академии наук. Серия: Математика, информатика, процессы управления. 2023. Т.514. №1. С.20-25. DOI: 10.31857/S2686954323700327 РИНЦ OpenAlex

Поступила в редакцию:	6 апр. 2023 г.
Принята к публикации:	14 окт. 2023 г.
Опубликована в печати:	27 дек. 2023 г.
Опубликована online:	14 мар. 2024 г.

Web of science:	WOS:001184111000001
Scopus:	2-s2.0-85187910747
РИНЦ:	65123264
OpenAlex:	W4392796445

Пока нет цитирований