Skip to main content
SpringerLink
Log in

On the competitive facility location problem with a free choice of suppliers

  • Two-Level Programming Problems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We consider a mathematical model from the class of competitive sequential facility location problems. In these problems, the competitors sequentially open their facilities, and each side aims to “capture” the consumers and maximize its profits. In the proposed model, we consider a situation of a “free” choice by each side of an open facility to service a customer. The model is formulated as a bilevel integer programming problem. We show that the problem of finding an optimal noncooperative solution can be represented as a maximization problem for a pseudo-Boolean function. We propose an algorithm for constructing an admissible noncooperative solution for fixed values of the variables in this pseudo-Boolean function. We also propose a method for constructing an upper bound on the maximal value of the pseudo-Boolean function on subsets of solutions defined by partial (0, 1)-vectors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beresnev, V.L. and Melnikov, A.A., Approximate Algorithms for the Competitive Facility Location Problem, J. Appl. Ind. Math., 2011, vol. 5. no. 2, pp. 180–190.

    Article  MathSciNet  Google Scholar 

  2. Beresnev, V.L., Local Search Algorithms for the Problem of Competitive Location of Enterprises, Autom. Remote Control, 2012, vol. 73, no. 3, pp. 425–439.

    Article  Google Scholar 

  3. Beresnev, V., Branch-and-Bound Algorithm for Competitive Facility Location Problem, Comput. Oper. Res., 2013, vol. 40, pp. 2062–2070.

    Article  MathSciNet  Google Scholar 

  4. Krarup, J. and Pruzan, P.M., The Simple Plant Location Problem: Survey and Synthesis, Eur. J. Oper. Res., 1983, vol. 12, pp. 36–81.

    Article  MATH  MathSciNet  Google Scholar 

  5. Beresnev, V.L., Diskretnye zadachi razmeshcheniya i polinomy ot bulevykh peremennykh (Discrete Location Problems and Polynomials of Boolean Variables), Novosibirsk: Inst. Mat., 2005.

    Google Scholar 

  6. Stackelberg, H., The Theory of the Market Economy, Oxford: Oxford Univ. Press, 1952.

    Google Scholar 

  7. Dempe, S., Foundations of Bilevel Programming, Dordrecht: Kluwer, 2002.

    MATH  Google Scholar 

  8. Kononov, A.V., Kochetov, Yu.A., and Plyasunov, A.V., Competitive Facility Location Models, Comput. Math. Math. Phys., 2009, vol. 49, no. 6, pp. 994–1009.

    Article  MathSciNet  Google Scholar 

  9. Plyasunov, A.V. and Panin, A.A., The Pricing Problem. Part I. Exact and Approximate Algorithms, Diskret. Anal. Issled. Oper., 2012, vol. 19, no. 5, pp. 83–100.

    MathSciNet  Google Scholar 

  10. Plyasunov, A.V. and Panin, A.A., The Pricing Problem. Part II. Computational Complexity, Diskret. Anal. Issled. Oper., 2012, vol. 19, no. 6, pp. 56–71.

    MathSciNet  Google Scholar 

  11. Hammer, P.L. and Rudeanu, S., Pseudo-Boolean Programming, Oper. Res., 1969, vol. 17, pp. 233–261.

    Article  MATH  MathSciNet  Google Scholar 

  12. Beresnev, V.L., Goncharov, E.N., and Melnikov, A.A., Local Search Over Generalized Neighborhood for an Optimization Problem of Pseudo-Boolean Functions, J. Appl. Ind. Math., 2012, vol. 6, no. 1, pp. 22–30.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia

    V. L. Beresnev

Authors
  1. V. L. Beresnev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. L. Beresnev.

Additional information

Original Russian Text © V.L. Beresnev, 2014, published in Avtomatika i Telemekhanika, 2014, No. 4, pp. 94–105.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Beresnev, V.L. On the competitive facility location problem with a free choice of suppliers. Autom Remote Control 75, 668–676 (2014). https://doi.org/10.1134/S0005117914040079

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117914040079

Keywords

Search

Navigation