Upper bounds for goal functions of discrete competitive facility location problems

V. L. Beresnev

Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 4, pp. 3-24

Résumé

The facility location problems in the presence of competition are considered, when two competitive firms open facilities sequentially and each client selects one of the open facilities according to his preferences and profits either the first firm (Leader) or the second (Follower). The problem is to find a facility location for the Leader which maximizes its profits with the optimal reaction of the Follower taken into account. The formulations which differ in the Follower's goal function are considered. The models are formulated as bilevel linear integer programming problems and equivalent formulations of these problems are presented in the form of the bilevel pseudo-Boolean programming. A polynomial time algorithm for the problems is presented in the case, where facilities and clients are points of a path. A method of construction of an upper bound for optimal values of the Leader's profit is proposed. The corresponding algorithm consists in construction of an auxiliary pseudo-Boolean function and computing an optimal solution yielding minimal value of this function. Computational results illustrate the good performance of the upper bound for the test examples of the problem on a path. Table 1, illustr. 1, bibl. 15.

Détail

Keywords: bilevel programming problem, upper bound, pseudo-Boolean function.
Mots-clés : optimal solution