Skip to main content

Solving a Dynamic Program by Linear Programming — General State and Action Spaces

  • Conference paper
Vorträge der Jahrestagung 1977 / Papers of the Annual Meeting 1977 DGOR

Part of the book series: Proceedings in Operations Research 7 ((ORP,volume 1977))

  • 133 Accesses

Summary

In the past two decades it has been shown by various authors that stochastic dynamic programming problems with finite state and action spaces and different notions of optimality can be solved by linear programming. In the present lecture it will bedemonstrated that dynamic programs with general state and action spaces can be treated by a generalized linear programming approach in the discounted reward case, in the average reward case, and in the optimal stopping case.

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. C. Derman. Finite State Markovian Decision Processes. Academic Press. New York 1970.

    Google Scholar 

  2. U. Dieter. Optimierungsaufgaben in topologischen Vektorräumen I: Dualitätstheorie. Zeitschr.f.Wahrsch.Theorie u. verw. Geb. 5, 1966, 89–117.

    Article  Google Scholar 

  3. F. d’Epenoux. A Probabilistic Production and Inventory Problem. Man.Sci. 10, 1963, 98–108.

    Article  Google Scholar 

  4. G.T. de Ghellinck and G.D. Eppen. Linear Programming Solutions for Separable Markovian Decision Problems. Man.Sci. 13, 1967, 371–394.

    Article  Google Scholar 

  5. R.C. Grinold. Continuous Programming. Part One: Linear Objectives. Journ.Math.Anal.Appl.28, 1969, 32–51.

    Article  Google Scholar 

  6. R.C. Grinold. Continuous Programming. Part Two: Nonlinear Objectives. Journ.Math.Anal.App1.27, 1969, 639–655.

    Article  Google Scholar 

  7. W.-R. Heilmann. Solving a General Discounted Dynamic Program by Linear Programming, 1977. To be published.

    Google Scholar 

  8. W.-R. Heilmann. Generalized Linear Programming in Markovian Decision Problems, 1977. To be published in Bonner Mathematische Schriften.

    Google Scholar 

  9. K. Hinderer. Foundations of Non-stationary Dynamic Programming with Discrete Time Parameter. Springer-Verlag. Berlin-Heidelberg-New York 1970.

    Book  Google Scholar 

  10. K. Hinderer. Grundbegriffe der Wahrscheinlichkeitstheorie. Springer-Verlag. Berlin-Heidelberg-New York 1972.

    Book  Google Scholar 

  11. C. Kallina and A.C. Williams. Linear Programming in Reflexive Spaces. SIAM Review 13, 1971, 350–376.

    Article  Google Scholar 

  12. W. Krabs. Lineare Optimierung in halbgeordneten Vektorraumen. Num.Math. 11, 1968, 220–231.

    Article  Google Scholar 

  13. W. Krabs. Zur Dualitätstheorie bei linearen Optimierungsaufgaben in halbgeordneten Vektorräumen. Math.Zeitschr. 121, 1971, 320–328.

    Article  Google Scholar 

  14. W. Krabs. Optimierung und Approximation. Teubner-Verlag. Stuttgart 1975.

    Google Scholar 

  15. K.S. Kretschmer. Programmes in Paired Spaces. Canad.Journ. Math. 13, 1961, 221–238.

    Article  Google Scholar 

  16. A. S. Manne. Linear Programming and Sequential Decisions. Man. Sci. 6, 1960, 259–267.

    Article  Google Scholar 

  17. U. Rieder. On Stopped Decision Processes with Discrete Time Parameter. Stoch.Proc. and their Appl. 3, 1975, 365–383.

    Article  Google Scholar 

  18. S.M. Ross. Arbitrary State Markovian Decision Processes. Ann. Math.Stat. 39, 1968, 412–423.

    Article  Google Scholar 

  19. M. Schechter. Duality in Continuous Linear Programming. Journ. Math.Anal.Appl. 37, 1972, 130–141.

    Article  Google Scholar 

  20. M. Schechter. Linear Programs in Topological Vector Spaces. Journ.Math.Anal.Appl. 37, 1972, 492–500.

    Article  Google Scholar 

  21. R.M. van Slyke and R.J.-B. Wets. A Duality Theory for Abstract Mathematical Programs with Applications to Optimal Control Theory. Journ.Math.Anal.Appl. 22, 1968, 679–706.

    Article  Google Scholar 

  22. H.M. Wagner. On the Optimality of Pure Strategies. Man.Sci. 6, 1960, 268–269.

    Article  Google Scholar 

  23. K. Yamada. Duality Theorem in Markovian Decision Problems. Journ.Math.Anal.Appl. 50, 1975, 579–595.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

K. Brockhoff W. Dinkelbach P. Kall D. B. Pressmar K. Spicher

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heilmann, WR. (1978). Solving a Dynamic Program by Linear Programming — General State and Action Spaces. In: Brockhoff, K., Dinkelbach, W., Kall, P., Pressmar, D.B., Spicher, K. (eds) Vorträge der Jahrestagung 1977 / Papers of the Annual Meeting 1977 DGOR. Proceedings in Operations Research 7, vol 1977. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-00409-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-00409-8_5

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-0194-1

  • Online ISBN: 978-3-662-00409-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics