-
- Iwamoto Seiichi
- Graduate School of Economics, Kyushu University
Search this article
Abstract
In this paper we solve a continuous non-optimization dynamic programming problem: Maximum Altitude problem. The problem has been originated by R. Bellman. We consider three maximum altitude problems. A complete solution through an invariant imbedding is derived. Each problem accompanies a few typical examples.
Journal
-
- 經濟學研究
-
經濟學研究 71 (5/6), 1-18, 2005-08-09
Society of Political Economy, Kyushu University
- Tweet
Details 詳細情報について
-
- CRID
- 1390572174788942976
-
- NII Article ID
- 110006263600
-
- NII Book ID
- AN00070058
-
- ISSN
- 0022975X
-
- DOI
- 10.15017/7621
-
- HANDLE
- 2324/7621
-
- NDL BIB ID
- 7454089
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- IRDB
- NDL
- CiNii Articles
-
- Abstract License Flag
- Allowed