Skip to main content
SpringerLink
Log in

Analytical solution of A dynamic transaction flow problem

  • Published:
Mathematical Programming Submit manuscript

Abstract

We analyze a mathematical programming model of a fractional flow process which consists ofn sectors and all possible time-dependent streams of flow between, into and out of the sectors. Assuming specific constraints on flow, least cost policies are determined for control of the system transactions involved over a given finite time horizon and over an infinite horizon. Several applications of the model are presented and discussed.

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. D.J. Bartholemew,Stochastic models for social processes (Second Ed.) (Wiley, New York, 1973) pp. 95–136.

    Google Scholar 

  2. R.E. Bellman,Dynamic programming (Princeton University Press, 1957).

  3. R.E. Bellman,Introduction to matrix analysis (Second Ed.) (McGraw Hill, New York, 1970) pp. 286–303.

    Google Scholar 

  4. J.S. Chipman, “The multisector multiplier”,Econometrica 18 (1950).

  5. D. Gale, “On optimal development in a multi-sector economy”,Review of Economic Studies 34 (1967).

  6. R.M. Goodwin, “The multiplier as matrix”,Economic Journal 59 (1949).

  7. R.C. Grinold and R.E. Stanford, “Optimal control of a graded manpower system”, ORC Rept. 73-8, University of California, Berkeley (April 1973).

    Google Scholar 

  8. J.G. Kemeny and L. Snell,Mathematical models in the social sciences (Ginn and Co., 1962) pp. 66–71.

  9. Kelvin Lancaster,Mathematical economics (MacMillan, 1971).

  10. Leon S. Lasdon,Optimization theory for large scale systems (MacMillan, 1970).

  11. L. Metzler, “A multiple region theory of income and trade”,Econometrica 18 (1950).

  12. Masao Nakamura, “Some programming problems in population projection”,Operations Research 21 (1973).

  13. R.E. Stanford, “Optimal control of a graded manpower system”, ORC Rept. 71-20, University of California, Berkeley (August 1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Auburn University, Auburn, Ala., USA

    Robert E. Stanford

Authors
  1. Robert E. Stanford
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stanford, R.E. Analytical solution of A dynamic transaction flow problem. Mathematical Programming 10, 214–229 (1976). https://doi.org/10.1007/BF01580668

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01580668

Keywords

Search

Navigation