Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnyi Analiz i Issledovanie Operatsii, 2023, Volume 30, Issue 3, Pages 43–56
DOI: https://doi.org/10.33048/daio.2023.30.774
(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
References:
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.
Funding agency Grant number
Russian Science Foundation 23-21-00082
This research is supported by the Russian Science Foundation (Project 23–21–00082).
Received: 17.05.2023
Revised: 25.05.2023
Accepted: 29.05.2023
Document Type: Article
UDC: 519.8+518.25
Language: Russian
Citation: V. L. Beresnev, A. A. Melnikov, “Additional constraints for dynamic competitive facility location problem”, Diskretn. Anal. Issled. Oper., 30:3 (2023), 43–56
Citation in format AMSBIB
\Bibitem{BerMel23}
\by V.~L.~Beresnev, A.~A.~Melnikov
\paper Additional constraints for dynamic competitive facility location problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2023
\vol 30
\issue 3
\pages 43--56
\mathnet{http://mi.mathnet.ru/da1326}
\crossref{https://doi.org/10.33048/daio.2023.30.774}
Linking options:
  • https://www.mathnet.ru/eng/da1326
  • https://www.mathnet.ru/eng/da/v30/i3/p43
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:59
    Full-text PDF :3
    References:8
    First page:4
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024