Efficient solution approaches for a discrete multi-facility competitive interaction model

In this paper, we present efficient solution approaches for discrete multi-facility competitive interaction model. Applying the concept of “Tangent Line Approximation” presented by the authors in their previous work, we develop efficient computational approaches—both exact and approximate (with controllable error bound α). Computational experiments show that the approximate approach (with small α) performs extremely well solving large scale problems while the exact approach performs very well for small to medium-sized problems.