Skip to main content

The Facility Location Problem with a Joint Probabilistic Constraint

  • Conference paper
  • First Online:
Integrated Uncertainty in Knowledge Modelling and Decision Making (IUKM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12482))

Abstract

This study shows the effectiveness of the cutting plane method by applying it to the facility location problem with probabilistic constraints. Probabilistic constraints are those that should be satisfied at a certain probabilistic level and can consider the uncertainty of the parameters involved in the problem. Problems with such probabilistic constraints are generally difficult to solve. Therefore, based on previous research, we consider transforming a problem with probabilistic constraints into a 0–1 mixed integer programming problem under special conditions. Thereafter, we introduce the cutting plane method using a valid inequality of the feasible region.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Atamturk, A., Nemhauser, G., Savelsbergh, M.: The mixed vertex packing problem. Math. Program. 89, 35–53 (2000)

    Article  MathSciNet  Google Scholar 

  2. Benninga, S.: Financial Modeling, 4th edn. The MIT Press, Cambridge (2014)

    Google Scholar 

  3. Charnes, A., Cooper, W.W.: Chance constrained programming problems using. Manag. Sci. 6, 73–79 (1959)

    Article  Google Scholar 

  4. Fujie, T.: Branch and cut method for mixed integer programming problems. Measur. Control 42, 770–775 (2003)

    Google Scholar 

  5. Fushimi, M.: Stochastic Methods and Simulations. Iwanami publishers, Tokyo (1994)

    Google Scholar 

  6. Lejeune, M.A., Ruszczynski, A.: An efficient trajectory method for probabilistic production-inventory-distribution problems. Oper. Res. 55, 378–394 (2007)

    Article  MathSciNet  Google Scholar 

  7. Luedtke, J., Ahmed, S., Nemhauser, G.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122, 247–272 (2010)

    Article  MathSciNet  Google Scholar 

  8. Murr, M.R., Prekopa, A.: Solution of a product substitution problem using stochastic programming. In: Uryasev, S.P. (ed.) Probabilistic Constrained Optimization. Nonconvex Optimization and Its Applications, vol. 49, pp. 252–271. Springer, Boston (2000). https://doi.org/10.1007/978-1-4757-3150-7_14

    Chapter  Google Scholar 

  9. Shiina, T.: Stochastic Programming. Asakura publishers, Tokyo (2015)

    MATH  Google Scholar 

  10. Van Roy, T.J., Wolsey, L.A.: Solving mixed integer programming automatic reformulation. Oper. Res. 35, 45–57 (1987)

    Article  MathSciNet  Google Scholar 

  11. Wolsey, L.A.: Integer Programming, pp. 133–166. A Wiley-Interscience Publication, Hoboken (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Suzuki .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Suzuki, A., Fukuba, T., Shiina, T. (2020). The Facility Location Problem with a Joint Probabilistic Constraint. In: Huynh, VN., Entani, T., Jeenanunta, C., Inuiguchi, M., Yenradee, P. (eds) Integrated Uncertainty in Knowledge Modelling and Decision Making. IUKM 2020. Lecture Notes in Computer Science(), vol 12482. Springer, Cham. https://doi.org/10.1007/978-3-030-62509-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-62509-2_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-62508-5

  • Online ISBN: 978-3-030-62509-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics