Skip to main content

Strong and Weak Formulations of Single Stage Uncapacitated Warehouse Location Problem

  • Conference paper
Information Processing and Management (BAIP 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 70))

  • 1199 Accesses

Abstract

Some researchers have not used the ‘strong’ formulations for single and multistage warehouse location problems despite it being well known earlier. In this paper we give ‘strong’ and ‘weak’ formulations of the single stage uncapacitated warehouse location problem (SSUWLP) by borrowing from the literature on capacitated version of the problem. The constraints borrowed are ‘weak’ constraints, demand side ‘strong’ constraints and the supply side ‘strong’ constraints. We give four different formulations of the SSUWLP and also empirical results for the relative strengths of their linear programming (LP) relaxations.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Geoffrion, A., Graves, G.: Multicommodity distribution system design by Benders decomposition. Management Science 20(5), 822–844 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  2. Sharma, R.R.K.: Modeling fertilizer distribution system. Europ. J. of Operational Research 51, 24–34 (1991)

    Article  MATH  Google Scholar 

  3. Kouvelis, P., Rosenblatt, M., Munson, C.: A mathematical programming model for global plant location problems: Analysis and insights. IIE Transactions 36, 127–144 (2004)

    Article  Google Scholar 

  4. Sharma, R.R.K., Sharma, K.D.: A new dual based procedure for the transportation problem. Europ. J. of Operational Research 122(3), 611–624 (2000)

    Article  MATH  Google Scholar 

  5. Nemhauser, G., Wolsey, L.: Integer and Combinatorial optimization. Wiley and Sons, New York (1988)

    MATH  Google Scholar 

  6. Rardin, R., Choe, U.: Tighter relaxations of fixed charge network flow problems. Technical Report J-79-18, Georgia Institute of Technology, Atlanta, Georgia (1979)

    Google Scholar 

  7. Sharma, R.R.K., Berry, V.: Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort. Europ. J. of Operational Research 177(2), 803–812 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Verma, P., Sharma, R.R.K. (2010). Strong and Weak Formulations of Single Stage Uncapacitated Warehouse Location Problem. In: Das, V.V., et al. Information Processing and Management. BAIP 2010. Communications in Computer and Information Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12214-9_120

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12214-9_120

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12213-2

  • Online ISBN: 978-3-642-12214-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics