Photo by igormiske from unsplash
A competitive facility location model formulated as a bilevel programming problem is considered. A new approach to the construction of estimating problems for bilevel competitive location models is proposed. An… Click to show full abstract
A competitive facility location model formulated as a bilevel programming problem is considered. A new approach to the construction of estimating problems for bilevel competitive location models is proposed. An iterative algorithm for solving a series of mixed integer programming problems to obtain a pessimistic optimal solution of the model under consideration is suggested.
Keywords:
facility location;
location;
cut generation;
competitive facility;
problem
Journal Title: Doklady Mathematics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Doklady Mathematics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!