Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/475

Pansystems optimization, generalized principles of optimality, and fundamental equations of dynamic programming

Authors Chen, BF
Issue Date 1997
Source Kybernetes, v. 26, (2-3), 1997, p. 316-333
Summary Clarifies the relationship between the Bellman principle of optimality and the recursive functional equation of dynamic programming by optimum operators of pansystems methodology. Instead of the Bellman principle of optimality, two generalized principles of optimality are proposed by which a necessary and sufficient condition for the fundamental equation is obtained. A discrete generalized dynamic programming model is set up in detail. Some discrete optimization problems which cannot be treated by ordinary dynamic programming may be solved by the generalized model with the construction of appropriate optimum operators.
Subjects
ISSN 0368-492X
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Find@HKUST
Files in this item:
File Description Size Format
p316.pdf 143472 B Adobe PDF