Maximum Altitude : An Invariant Imbedding

DOI HANDLE Web Site オープンアクセス

この論文をさがす

抄録

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.

収録刊行物

  • 經濟學研究

    經濟學研究 71 (5/6), 1-18, 2005-08-09

    九州大学経済学会

詳細情報 詳細情報について

問題の指摘

ページトップへ