Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-03T08:31:41.244Z Has data issue: false hasContentIssue false
  • English
  • Français

Identities relating forward and backward treatments of optimisation

Published online by Cambridge University Press:  14 July 2016

P. Whittle
Get access Rights & Permissions [Opens in a new window]

Abstract

A general form of Green's theorem is used to derive relations between expected costs for an optimisation problem and the distribution of state variable. A characterisation of the optimal stopping set and an alternative proof of the Howard improvement lemma emerge as non-trivial consequences.

Keywords

MARKOV DECISION PROCESSESDUALITYGREEN'S THEOREM
Type
Part 6 — Stochastic Processes
Information
Journal of Applied Probability , Volume 19 , Issue A , 1982 , pp. 395 - 399
Copyright
Copyright © 1982 Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Blackwell, D. (1965) Discounted dynamic programming. Ann. Math. Statist. 36, 226–235.CrossRefGoogle Scholar
Derman, C. (1970) Finite State Markovian Decision Processes. Academic Press, New York.Google Scholar
Margenau, H. and Murphy, G. M. (1943) The Mathematics of Physics and Chemistry. Van Nostrand, New York.Google Scholar
Reid, D. W. and Teo, H. L. (1980) Optimal parameter selection for parabolic systems. Math. Operat. Res. 5, 467–479.CrossRefGoogle Scholar
Whittle, P. (1975) An approximate characterisation of optimal stopping boundaries. J. Appl. Prob. 10, 158–165.CrossRefGoogle Scholar
Whittle, P. (1982) Optimisation Over Time. Wiley Interscience, New York.Google Scholar