The fundamental goal, in preparing this thesis, is two-fold. First, the author shows the systematic development of the basic theory of Dynamic Programming. Secondly, the author demonstrates the applicability of this theory in the actual problem solving of Dynamic Programming.
A very careful balance has been maintained in the setting of the theory and in its applicability of solving problems. Basic theory has been established and expanded systematically and explained vividly. However, it is short and precise. Nevertheless, it presents the tools to handle highly complex problems in Dynamic Programming. Also, the theory is used to prove a general case of an N-stage optimization which demonstrates the sufficiency and capability of the theory.
|01 May 1981
|Yohannes, Arega W.
|DigitalCommons@Robert W. Woodruff Library, Atlanta University Center
|Atlanta University Center
|ETD Collection for Robert W. Woodruff Library, Atlanta University Center
Page generated in 0.003 seconds