Editorial Board
Publishing Ethics
Author Guide
Submission Prepare Your ManuscriptPeer review
Archive
English version:
Journal of Applied and Industrial Mathematics, 2019, 13:2, 194-207
Volume 26, No 2, 2019, P. 5-29
UDC 519.8+518.25
V. L. Beresnev and A. A. Melnikov
A cut generation algorithm of finding an optimal solution in a market competition
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.
Tab. 2, bibliogr. 17.
Keywords: market competition, Stackelberg game, bilevel programming, estimating problem.
DOI: 10.33048/daio.2019.26.642
Vladimir L. Beresnev 1,2
Andrey A. Melnikov 1,2
1. Sobolev Institute of Mathematics,
4 Koptyug Ave., 630090 Novosibirsk, Russia
2. Novosibirsk State University,
2 Pirogov St., 630090 Novosibirsk, Russia
e-mail: beresnev@math.nsc.ru, melnikov@math.nsc.ru
Received December 17, 2018
Revised January 11, 2019
Accepted February 27, 2019
References
[1] V. L. Beresnev, On the competitive facility location problem with a free choice of suppliers, Avtom. Telemekh., No. 4, 94–105, 2014 [Russian]. Translated in Autom. Remote Control, 75, No. 4, 668–676, 2014.[2] V. L. Beresnev and A. A. Melnikov, The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers, Diskretn. Anal. Issled. Oper., 21, No. 2, 3–23, 2014 [Russian]. Translated in J. Appl. Ind. Math., 8, No. 2, 177–189, 2014.
[3] V. L. Beresnev and A. A. Melnikov, Cut generation algorithm for the discrete competitive facility location problem, Dokl. Acad. Nauk, 80, No. 5, 515–518, 2018 [Russian]. Translated in Dokl. Math., 97, No. 3, 254–257, 2018.
[4] V. L. Beresnev and V. I. Suslov, A mathematical model of market competition, Sib. Zh. Ind. Mat., 12, No. 1, 11–24, 2009 [Russian]. Translated in J. Appl. Ind. Math., 4, No. 2, 147–157, 2010.
[5] Benchmark Library “Discrete Location Problems”, Available at http://old.math.nsc.ru/AP/benchmarks/english.html (accessed Feb. 11, 2019).
[6] A. A. Melnikov, Randomized local search for the discrete competitive facility location problem, Avtom. Telemekh., No. 4, 134–152, 2014 [Russian]. Translated in Autom. Remote Control, 75, No. 4, 700–714, 2014.
[7] V. L. Beresnev, Branch-and-bound algorithm for a competitive facility location problem, Comput. Oper. Res., 40, No. 8, 2062–2070, 2013.
[8] V. L. Beresnev and A. A. Melnikov, Exact method for the capacitated competitive facility location problem, Comput. Oper. Res., 95, 73–82, 2018.
[9] V. L. Beresnev and A. A. Melnikov, Approximation of the competitive facility location problem with MIPs, Comput. Oper. Res., 104, 139–148, 2019.
[10] L. Cánovas, A. García, M. Labbé, and A. Marín, A strengthened formulation for the simple plant location problem with order, Oper. Res. Lett., 35, No. 2, 141–150, 2007.
[11] S. Dempe, Foundations of Bilevel Programming, Kluwer Acad. Publ., Dordrecht, 2002.
[12] Gurobi Optimizer Reference Manual, Gurobi Optimization, 2018. Available at https://www.gurobi.com/documentation/8.1/refman.pdf (accessed Feb. 11, 2019).
[13] P. Hanjoul and D. Peeters, A facility location problem with clients’ preference orderings, Reg. Sci. Urban Econ., 17, No. 3, 451–473, 1987.
[14] M. Hemmati and J. C. Smith, A mixed-integer bilevel programming approach for a competitive prioritized set covering problem, Discrete Optim., 20, 105–134, 2016.
[15] J. T. Moore and J. F. Bard, The mixed integer linear bilevel programming problem, Oper. Res., 38, No. 5, 911–921, 1990.
[16] H. von Stackelberg, The Theory of the Market Economy, Oxf. Univ. Press, Oxford, 1952.
[17] I. Vasilyev, X. Klimentova, and M. Boccia, Polyhedral study of simple plant location problem with order, Oper. Res. Lett., 41, No. 2, 153–158, 2013.
