IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v22y1994i2p149-155.html
   My bibliography  Save this article

Cash flow management network models with quantity discounting

Author

Listed:
  • Jorjani, S
  • Lamar, BW

Abstract

Cash flow management concerns the financial control and planning of a firm's net cash inflows and outflows. In this paper, we develop a network model to represent cash flow problems that involve a decrease in marginal costs (or an increase in marginal revenues) as the volume of cash increases. This type of problem, referred to as quantity-based discounting, is converted to a minimum concave cost network flow model. By making this conversion, we are able to solve efficiently the quantity-based discounting problem using established algorithms. A short-term money market investment problem is used to illustrate the mathematical models developed in this paper.

Suggested Citation

  • Jorjani, S & Lamar, BW, 1994. "Cash flow management network models with quantity discounting," Omega, Elsevier, vol. 22(2), pages 149-155, March.
    • Handle: RePEc:eee:jomega:v:22:y:1994:i:2:p:149-155
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(94)90075-2
    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.

    Citations

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


    Cited by:

    1. Juliana Nascimento & Warren Powell, 2010. "Dynamic Programming Models and Algorithms for the Mutual Fund Cash Balance Problem," Management Science, INFORMS, vol. 56(5), pages 801-815, May.
    2. Fontes, Dalila B.M.M. & Hadjiconstantinou, Eleni & Christofides, Nicos, 2006. "A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1205-1219, October.
    3. Yenisey, Mehmet Mutlu, 2006. "A flow-network approach for equilibrium of material requirements planning," International Journal of Production Economics, Elsevier, vol. 102(2), pages 317-332, August.
    4. Shuvomoy Das Gupta & Lacra Pavel, 2019. "On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems," Journal of Global Optimization, Springer, vol. 74(3), pages 523-548, July.

    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:jomega:v:22:y:1994:i:2:p:149-155. 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.

    We have no bibliographic references for this item. You can help adding them by using 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/wps/find/journaldescription.cws_home/375/description#description .

    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.