Email this article Cut Generation Algorithm for the Discrete Competitive Facility Location Problem
- Authors: Beresnev V.L.1,2, Melnikov A.A.1,2
-
Affiliations:
- Sobolev Institute of Mathematics, Siberian Branch
- Novosibirsk State University
- Issue: Vol 97, No 3 (2018)
- Pages: 254-257
- Section: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225507
- DOI: https://doi.org/10.1134/S1064562418030183
- ID: 225507
Cite item
Open Access
Access granted
Subscription Access
Abstract
A competitive facility location model formulated as a bilevel programming problem is considered. A new approach to the construction of estimating problems for bilevel competitive location models is proposed. An iterative algorithm for solving a series of mixed integer programming problems to obtain a pessimistic optimal solution of the model under consideration is suggested.
About the authors
V. L. Beresnev
Sobolev Institute of Mathematics, Siberian Branch; Novosibirsk State University
Author for correspondence.
Email: beresnev@math.nsc.ru
Russian Federation, Novosibirsk, 630090; Novosibirsk, 630090
A. A. Melnikov
Sobolev Institute of Mathematics, Siberian Branch; Novosibirsk State University
Email: beresnev@math.nsc.ru
Russian Federation, Novosibirsk, 630090; Novosibirsk, 630090
Supplementary files
