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, 2017, Volume 24, Issue 4, Pages 5–21
DOI: https://doi.org/10.17377/daio.2017.24.578
(Mi da878)
 

This article is cited in 3 scientific papers (total in 3 papers)

An upper bound for the competitive location and capacity choice problem with multiple demand scenarios

V. L. Beresnevab, A. A. Melnikovab

a Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia
References:
Abstract: A new mathematical model is considered related to competitive location problems where two competing parties, the Leader and the Follower, successively open their facilities and try to win customers. In the model, we consider a situation of several alternative demand scenarios which differ by the composition of customers and their preferences. We assume that the costs of opening a facility depend on its capacity; therefore, the Leader, making decisions on the placement of facilities, must determine their capacities taking into account all possible demand scenarios and the response of the Follower. For the bilevel model suggested, a problem of finding an optimistic optimal solution is formulated. We show that this problem can be represented as a problem of maximizing a pseudo-Boolean function with the number of variables equal to the number of possible locations of the Leader’s facilities.We propose a novel system of estimating the subsets that allows us to supplement the estimating problems, used to calculate the upper bounds for the constructed pseudo-Boolean function, with additional constraints which improve the upper bounds. Bibliogr. 13.
Keywords: competitive facility location, bilevel programming, upper bound.
Funding agency Grant number
Russian Foundation for Basic Research 15-01-01446
Received: 02.05.2017
English version:
Journal of Applied and Industrial Mathematics, 2017, Volume 11, Issue 4, Pages 472–480
DOI: https://doi.org/10.1134/S1990478917040020
Bibliographic databases:
Document Type: Article
UDC: 519.85
Language: Russian
Citation: V. L. Beresnev, A. A. Melnikov, “An upper bound for the competitive location and capacity choice problem with multiple demand scenarios”, Diskretn. Anal. Issled. Oper., 24:4 (2017), 5–21; J. Appl. Industr. Math., 11:4 (2017), 472–480
Citation in format AMSBIB
\Bibitem{BerMel17}
\by V.~L.~Beresnev, A.~A.~Melnikov
\paper An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
\jour Diskretn. Anal. Issled. Oper.
\yr 2017
\vol 24
\issue 4
\pages 5--21
\mathnet{http://mi.mathnet.ru/da878}
\crossref{https://doi.org/10.17377/daio.2017.24.578}
\elib{https://elibrary.ru/item.asp?id=30551362}
\transl
\jour J. Appl. Industr. Math.
\yr 2017
\vol 11
\issue 4
\pages 472--480
\crossref{https://doi.org/10.1134/S1990478917040020}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85036458617}
Linking options:
  • https://www.mathnet.ru/eng/da878
  • https://www.mathnet.ru/eng/da/v24/i4/p5
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:415
    Full-text PDF :108
    References:70
    First page:4
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025