Projects per year
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 zeroone 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.
remaining market share after the competitor's later entry.
We develop mixed zeroone 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.
Original language  English 

Pages (fromto)  683700 
Number of pages  18 
Journal  Computers and Operations Research 
Volume  35 
Issue number  3 
Publication status  Published  2008 
Bibliographical note
Computers and Operations Research, to appearKeywords
 Competitive location
 Maxmin
 Minimum regret
 Bilevel programming
 Mixed integer programming
Fingerprint Dive into the research topics of 'Discrete models for competitive location with foresight'. Together they form a unique fingerprint.
Projects
 1 Finished

OZR1067: Integration of consumer behavior in competitive and ethical location models & applications.
Plastria, F. & Vanhaverbeke, L.
1/01/05 → 31/12/08
Project: Fundamental