The principle and models of dynamic programming (Q1320413): Difference between revisions

This paper is a sequel to the works of \textit{E. F. Beckenbach} and \textit{R. Bellman} and previous papers of the author [J. Math. Anal. Appl. 150, No. 2, 528-550 and 551-561 (1990; Zbl 0712.90087 and Zbl 0712.90088)]. The author reestablishes most of the known problems by use of the arithmetic- geometric inequality and the Jensen inequality. Further, he studies the use of simple inequalities to streamline the dynamic programming approach in solving optimization problems. In either case, solving an optimization problem is equivalent to establishing the corresponding inequality.