Cut Generation Algorithm
for the Discrete Competitive Facility Location Problem
V. L. Beresneva,b,* and A. A. Melnikova,b,**
Translated by I. Ruzanova
a Sobolev Institute of Mathematics, Siberian Branch,
Russian Academy of Sciences, Novosibirsk, 630090 Russia
b Novosibirsk State University, Novosibirsk, 630090 Russia
Correspondence to: *e-mail: beresnev@math.nsc.ru
Correspondence to: **e-mail: melnikov@math.nsc.ru
Received 15 February, 2018
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.
DOI: 10.1134/S1064562418030183