A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition
- 1 Downloads
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.
Keywordsmarket competition Stackelberg game bilevel programming estimating problem
Unable to display preview. Download preview PDF.
- 2.H. von Stackelberg, The Theory of the Market Economy (Oxford Univ. Press, Oxford, 1952).Google Scholar
- 4.A. A. Melnikov, “Randomized Local Search for the Discrete Competitive Facility Location Problem,” Avtomat. Telemekh. No. 4, 134–152 (2014) [Automat. Remote Control 75 (4), 700–714 (2014)].Google Scholar
- 5.V. L. Beresnev, “On the Competitive Facility Location Problem with a Free Choice of Suppliers,” Avtomat. Telemekh. No. 4, 94–105 (2014) [Automat. Remote Control 75 (4), 668–676 (2014)].Google Scholar
- 16.Gurobi Optimizer Reference Manual, Gurobi Optimization (2018). Available at https://www.gurobi.com/documentation/8.1/refman.pdf (accessed Feb. 11, 2019).
- 17.Benchmark Library ‘Discrete Location Problems’, available at http://math.nsc.ru/AP/benchmarks/english.html (accessed Feb. 11, 2019).