Upper Bound for the Capacitated Competitive Facility Location Problem

V. L. Beresnev () and A. A. Melnikov ()
Additional contact information
V. L. Beresnev: Sobolev Institute of Mathematics
A. A. Melnikov: Sobolev Institute of Mathematics

A chapter in Operations Research Proceedings 2015, 2017, pp 87-93 from Springer

Abstract: Abstract We consider the capacitated competitive facility location problem (CCFLP) where two competing firms open facilities to maximize their profits obtained from customer service. The decision making process is organized as a Stackelberg game. Both the set of candidate sites where firms may open facilities and the set of customers are finite. The customer demands are known, and the total demand covered by each of the facilities can not exceed its capacity. We propose the upper bound for the leader’s objective function based on solving of the estimating MIP.

Keywords: Boolean Function; Facility Location; Partial Solution; Stackelberg Game; Open Facility (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-42902-1_12

Ordering information: This item can be ordered from
http://www.springer.com/9783319429021

DOI: 10.1007/978-3-319-42902-1_12

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().