Bilevel competitive facility location and pricing problems

We propose new models for competitive facility location and pricing as bilevel Boolean linear programming problems. We obtain results that characterize the complexity of the problem where a monopolist's profit on each of the markets is defined with a monotone nonincreasing function of the servicing cost. For this problem, we also propose two approximate algorithms based on the ideas of alternating heuristics and local search. We give results of a computational experiment that show a possibility for fast computation of approximate solutions.

Presented by the member of Editorial Board: A. I. Kibzun