Abstract: We consider Stackelberg games and corresponding bilevel and trilevel programming models based on facility location and pricing processes. At the upper level of the bilevel models, the company decides on the location of its uncapacitated facilities and the assignment of optimal prices for homogeneous products. In the trilevel models, two companies compete for client demand by making decisions sequentially. We have established the dependence of the computational complexity of the problems under study on the choice of pricing policy and the concept of facility allocation. We have divided the problems into three classes: polynomially solvable, NP-hard, and ΣP 2-hard. Moreover, the problems of stability analysis are discussed in conclusion.

Cite: Panin A.A. , Plyasunov A.V.
The multilevel facility location and pricing problems: the computational complexity and the stability analysis
Optimization Letters. 2023. V.17. N6. P.1295–1315. DOI: 10.1007/s11590-022-01924-3 WOS Scopus РИНЦ OpenAlex

Dates:

Submitted:	Dec 20, 2021
Accepted:	Aug 15, 2022
Published online:	Oct 17, 2022
Published print:	Jul 20, 2023

Identifiers:

Web of science:	WOS:000869340800002
Scopus:	2-s2.0-85160603970
Elibrary:	59777835
OpenAlex:	W4306407851

Citing:

DB	Citing
Scopus	4
Web of science	2
OpenAlex	4

Altmetrics: