Abstract: We consider a mathematical model of market competition between two parties. The parties sequentially bring their products to the market while aiming to maximize profit. The model is based on the Stackelberg game and formulated as a bilevel integer mathematical program. The problem can be reduced to the competitive facility location problem (CompFLP) with a prescribed choice of suppliers which belongs to a family of bilevel models generalizing the classical facility location problem. For the CompFLP with a prescribed choice of suppliers, we suggest an algorithm of finding a pessimistic optimal solution. The algorithm is an iterative procedure that successively strengthens an estimating problem with additional constraints. The estimating problem provides an upper bound for the objective function of the CompFLP and is resulted from the bilevel model by excluding the lower-level objective function. To strengthen the estimating problem, we suggest a new family of constraints. Numerical experiments with randomly generated instances of the CompFLP with prescribed choice of suppliers demonstrate the effectiveness of the algorithm.

Cite: Береснев В.Л. , Мельников А.А.
A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition
Journal of Applied and Industrial Mathematics. 2019. V.13. N2. P.194-207. DOI: 10.1134/s1990478919020029 Scopus OpenAlex

Original: Береснев В.Л. , Мельников А.А.
Алгоритм генерации отсечений для задачи выбора оптимальных решений в конкурентной борьбе на рынке
Дискретный анализ и исследование операций. 2019. Т.26. №2. С.5-29. DOI: 10.33048/daio.2019.26.642 OpenAlex

Identifiers:

Scopus:	2-s2.0-85067414381
OpenAlex:	W2951553976

Citing: Пока нет цитирований

Altmetrics: