Discrete models for competitive location with foresight

Discrete models for competitive location with foresight

0.00 Avg rating0 Votes
Article ID: iaor2009850
Country: United Kingdom
Volume: 35
Issue: 3
Start Page Number: 683
End Page Number: 700
Publication Date: Mar 2008
Journal: Computers and Operations Research
Authors: ,
Keywords: programming: integer
Abstract:

We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective is to locate facilities under a budget constraint in order to maximise the remaining market share after the competitor's later entry. We develop mixed zero–one programming formulations for each of the following three strategies: the maxmin strategy where the worst possible competitor choice is considered, the minimum regret strategy, and the von Stackelberg strategy in which the competitor also optimises its market share. Some computational results show the feasibility and limits of these models.

Reviews

Required fields are marked *. Your email address will not be published.