RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2023 Volume 30, Issue 3, Pages 43–56 (Mi da1326)

Additional constraints for dynamic competitive facility location problem

V. L. Beresnevab, A. A. Melnikovab

a Sobolev Institute of Mathematics, 4 Koptyug Avenue, 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia

Abstract: We consider a competitive facility location model, where competing parties (Leader and Follower) make decisions considering changes of the set of customers happening during the planing horizon, having known number of time periods. It is supposed that the Leader makes a decision on opening their facilities at the beginning of the planning horizon, while the Follower can revise their decision in each time period. In the present paper, we study perspectives to apply a method for finding the best solution which is based on using HP-relaxation of the bi-level problem considered. The key element of this method is construction of additional inequalities strengthening the HP-relaxation and computation of upper bounds for the objective function of the problem. In the work, new families of additional constraints are proposed to strengthen the HP-relaxation, that allow us to compute non-trivial upper bounds. Bibliogr. 13.

Keywords: Stackelberg game, bi-level programming, competitive location, valid inequalities.

UDC: 519.8+518.25

Received: 17.05.2023
Revised: 25.05.2023
Accepted: 29.05.2023

DOI: 10.33048/daio.2023.30.774



© Steklov Math. Inst. of RAS, 2024