IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v192y2009i3p963-974.html
   My bibliography  Save this article

A stochastic programming approach to cash management in banking

Author

Listed:
  • Castro, Jordi

Abstract

The treasurer of a bank is responsible for the cash management of several banking activities. In this work, we focus on two of them: cash management in automatic teller machines (ATMs), and in the compensation of credit card transactions. In both cases a decision must be taken according to a future customers demand, which is uncertain. From historical data we can obtain a discrete probability distribution of this demand, which allows the application of stochastic programming techniques. We present stochastic programming models for each problem. Two short-term and one mid-term models are presented for ATMs. The short-term model with fixed costs results in an integer problem which is solved by a fast (i.e. linear running time) algorithm. The short-term model with fixed and staircase costs is solved through its MILP equivalent deterministic formulation. The mid-term model with fixed and staircase costs gives rise to a multi-stage stochastic problem, which is also solved by its MILP deterministic equivalent. The model for compensation of credit card transactions results in a closed form solution. The optimal solutions of those models are the best decisions to be taken by the bank, and provide the basis for a decision support system.

Suggested Citation

  • Castro, Jordi, 2009. "A stochastic programming approach to cash management in banking," European Journal of Operational Research, Elsevier, vol. 192(3), pages 963-974, February.
    • Handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:963-974
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01012-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. G. Kallberg & R. W. White & W. T. Ziemba, 1982. "Short Term Financial Planning under Uncertainty," Management Science, INFORMS, vol. 28(6), pages 670-682, June.
    2. Jacek Gondzio & Roy Kouwenberg, 2001. "High-Performance Computing for Asset-Liability Management," Operations Research, INFORMS, vol. 49(6), pages 879-891, December.
    3. Willem Klein Haneveld & Maarten van der Vlerk, 1999. "Stochastic integer programming:General models and algorithms," Annals of Operations Research, Springer, vol. 85(0), pages 39-57, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wong, Man Hong, 2013. "Investment models based on clustered scenario trees," European Journal of Operational Research, Elsevier, vol. 227(2), pages 314-324.
    2. Francisco Salas-Molina, 2024. "Fitting random cash management models to data," Papers 2401.08548, arXiv.org.
    3. Robert Ferstl & Alex Weissensteiner, 2010. "Cash management using multi-stage stochastic programming," Quantitative Finance, Taylor & Francis Journals, vol. 10(2), pages 209-219.
    4. Alaeddine Faleh, 2011. "Un modèle de programmation stochastique pour l'allocation stratégique d'actifs d'un régime de retraite partiellement provisionné," Working Papers hal-00561965, HAL.
    5. Venkatesh, Kamini & Ravi, Vadlamani & Prinzie, Anita & Poel, Dirk Van den, 2014. "Cash demand forecasting in ATMs by clustering and neural networks," European Journal of Operational Research, Elsevier, vol. 232(2), pages 383-392.
    6. Bruno Karoubi & R駩s Chenavaz, 2015. "Prices for cash and cash for prices? Theory and evidence on convenient pricing," Applied Economics, Taylor & Francis Journals, vol. 47(38), pages 4102-4115, August.
    7. Yeliz Ekinci & Nicoleta Serban & Ekrem Duman, 2021. "Optimal ATM replenishment policies under demand uncertainty," Operational Research, Springer, vol. 21(2), pages 999-1029, June.
    8. V. Kamini & V. Ravi & A. Prinzie & D. Van Den Poel, 2013. "Cash Demand Forecasting in ATMs by Clustering and Neural Networks," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 13/865, Ghent University, Faculty of Economics and Business Administration.
    9. Mike G. Tsionas & Dionisis Philippas & Constantin Zopounidis, 2023. "Exploring Uncertainty, Sensitivity and Robust Solutions in Mathematical Programming Through Bayesian Analysis," Computational Economics, Springer;Society for Computational Economics, vol. 62(1), pages 205-227, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gondzio, Jacek & Grothey, Andreas, 2007. "Solving non-linear portfolio optimization problems with the primal-dual interior point method," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1019-1029, September.
    2. Ferstl, Robert & Weissensteiner, Alex, 2011. "Asset-liability management under time-varying investment opportunities," Journal of Banking & Finance, Elsevier, vol. 35(1), pages 182-192, January.
    3. Robert Ferstl & Alexander Weissensteiner, 2011. "Backtesting Short-Term Treasury Management Strategies Based on Multi-Stage Stochastic Programming," Palgrave Macmillan Books, in: Gautam Mitra & Katharina Schwaiger (ed.), Asset and Liability Management Handbook, chapter 19, pages 469-494, Palgrave Macmillan.
    4. Klein Haneveld, W.K. & Vlerk, M.H. van der, 2000. "Optimizing electricity distribution using two-stage integer recourse models," Research Report 00A26, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    5. Qureshi, Saad Hassan, 2013. "Consumer Preference of Credit Vs. Debit Card," MPRA Paper 116427, University Library of Munich, Germany, revised 30 Dec 2021.
    6. Bjorn P. Berg & Brian T. Denton, 2017. "Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 631-644, November.
    7. Valeria Vannoni, 2020. "Financing Italian Firms Throught Invoice Trading Platforms," International Journal of Economics and Finance, Canadian Center of Science and Education, vol. 12(3), pages 1-78, March.
    8. Marchioni, Andrea & Magni, Carlo Alberto, 2018. "Investment decisions and sensitivity analysis: NPV-consistency of rates of return," European Journal of Operational Research, Elsevier, vol. 268(1), pages 361-372.
    9. Ward Romeijnders & David P. Morton & Maarten H. van der Vlerk, 2017. "Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 211-231, May.
    10. repec:dgr:rugsom:03a14 is not listed on IDEAS
    11. repec:dgr:rugsom:03a21 is not listed on IDEAS
    12. Aakil M. Caunhye & Xiaofeng Nie, 2018. "A Stochastic Programming Model for Casualty Response Planning During Catastrophic Health Events," Transportation Science, INFORMS, vol. 52(2), pages 437-453, March.
    13. Ali, Syed Babar & Umyani, Mr. Muhammad Mehdi, 2013. "Capital Structure and Financial Performance: Evidence from Pakistan," MPRA Paper 116404, University Library of Munich, Germany, revised 12 Nov 2022.
    14. John A. Buzacott & Rachel Q. Zhang, 2004. "Inventory Management with Asset-Based Financing," Management Science, INFORMS, vol. 50(9), pages 1274-1292, September.
    15. Nesbitt, Peter & Blake, Lewis R. & Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo K. & Newman, Alexandra & Brickey, Andrea, 2021. "Underground mine scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 294(1), pages 340-352.
    16. Amy V. Puelz, 2002. "A Stochastic Convergence Model for Portfolio Selection," Operations Research, INFORMS, vol. 50(3), pages 462-476, June.
    17. Enrico Bettiol & Lucas Létocart & Francesco Rinaldi & Emiliano Traversi, 2020. "A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs," Computational Optimization and Applications, Springer, vol. 75(2), pages 321-360, March.
    18. Alois Geyer & Michael Hanke & Alex Weissensteiner, 2009. "A stochastic programming approach for multi-period portfolio optimization," Computational Management Science, Springer, vol. 6(2), pages 187-208, May.
    19. repec:dgr:rugsom:00a26 is not listed on IDEAS
    20. Najafi, Amir Abbas & Mushakhian, Siamak, 2015. "Multi-stage stochastic mean–semivariance–CVaR portfolio optimization under transaction costs," Applied Mathematics and Computation, Elsevier, vol. 256(C), pages 445-458.
    21. repec:dgr:rugsom:05a03 is not listed on IDEAS
    22. Robert Ferstl & Alex Weissensteiner, 2010. "Cash management using multi-stage stochastic programming," Quantitative Finance, Taylor & Francis Journals, vol. 10(2), pages 209-219.
    23. W. A. Rijpkema & E. M. T. Hendrix & R. Rossi & J. G. A. J. Vorst, 2016. "Application of stochastic programming to reduce uncertainty in quality-based supply planning of slaughterhouses," Annals of Operations Research, Springer, vol. 239(2), pages 613-624, April.
    24. Brian Keller & Güzin Bayraksan, 2012. "Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 172-186, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:963-974. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.