Skip to main content
Log in

A selection theorem for optimization problems

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. G.Aumann, Reelle Funktionen. Berlin 1954.

  2. L. E.Dubins and L. J.Savage, How to gamble if you must. New York 1965.

  3. N. Furukawa, Markovian decision processes with compact action spaces. Ann. Math. Statist.43, 1612–1622 (1972).

    Google Scholar 

  4. K.Hinderer, Foundations of non-stationary dynamic programming with discrete time parameter. Lecture Notes in Operations Research and Mathematical Economics33. Berlin 1970.

  5. K.Kuratowski, Topology I. New York 1966.

  6. K.Kuratowski, Topology II. New York 1968.

  7. A. Maitra, Discounted dynamic programming on compact metric spaces. Sankhya30 A, 211–216 (1968).

    Google Scholar 

  8. T.Parthasarathy, Selection Theorems and their Applications. Lecture Notes in Math.263. Berlin 1972.

  9. M. Schäl, Ein verallgemeinertes stationäres Entscheidungsmodell der dynamischen Optimierung. In: Methods of Operations Research, Vol. X, pp. 145–162. Meisenheim 1971.

    Google Scholar 

  10. M. Schäl, On continuous dynamic programming with discrete time parameter. Z. Wahrscheinlichkeitstheorie verw. Geb.21, 279–288 (1972).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schäl, M. A selection theorem for optimization problems. Arch. Math 25, 219–224 (1974). https://doi.org/10.1007/BF01238668

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation