Additional constraints for computing upper bounds for (r|p) -centroid problem's objective function | Sciact - Система учета научной деятельности ИМ СО РАН

Additional constraints for computing upper bounds for (r|p) -centroid problem's objective function Научная публикация

Журнал

Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304

Вых. Данные

Год: 2025, Том: 22, Номер: 2, Страницы: 1371-1381 Страниц : 11 DOI: 10.33048/semi.2025.22.082

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

Competitive facility location, optimal solution, bilevel programming, high-point relaxation, cut generation.

Авторы

Beresnev V.L. ¹ , Melnikov A.A. ¹

Организации

1	Sobolev Institute of Mathematics

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

Институт математики им. С.Л. Соболева СО РАН

FWNF-2022-0019

We consider an (r|p) -centroid problem formulated as a bilevel mathematical programming problem. In the problem, two competing parties open, respectively, r and p facilities aiming to attract customers' demand and maximize the market share. An approach for computing upper bounds for the first player's (Leader) objective function, is proposed based on generating additional constraints (cuts) for the high-point relaxation of the bi-level problem. New types of additional constraints are introduced, which take into account the specific of the (r|p) -centroid problem. A procedure of generating these constraints is discussed, which allows to improve sequentially the upper bound's quality.

Beresnev V.L. , Melnikov A.A.
Additional constraints for computing upper bounds for (r|p) -centroid problem's objective function
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2025. V.22. N2. P.1371-1381. DOI: 10.33048/semi.2025.22.082

Поступила в редакцию:	17 апр. 2025 г.
Опубликована в печати:	25 нояб. 2025 г.
Опубликована online:	25 дек. 2025 г.

Нет идентификаторов

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