On the theory and modeling of dynamic programming with applications in reservoir operation

Persistent Link:
http://hdl.handle.net/10150/191028
Title:
On the theory and modeling of dynamic programming with applications in reservoir operation
Author:
Sniedovich, Moshe,1945-
Issue Date:
1976
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
This dissertation contains a discussion concerning the validity of the principle of optimality and the dynamic programming algorithm in the context of discrete time and state multistage decision processes. The multistage decision model developed for the purpose of the investigation is of a general structure, especially as far as the reward function is concerned. The validity of the dynamic programming algorithm as a solution method is investigated and results are obtained for a rather wide class of decision processes. The intimate relationship between the principle and the algorithm is investigated and certain important conclusions are derived. In addition to the theoretical considerations involved in the implementation of the dynamic programming algorithm, some modeling and computational aspects are also investigated. It is demonstrated that the multistage decision model and the dynamic programming algorithm as defined in this study provide a solid framework for handling a wide class of multistage decision processes. The flexibility of the dynamic programming algorithm as a solution procedure for nonroutine reservoir control problems is demonstrated by two examples, one of which is a reliability problem. To the best of the author's knowledge, many of the theoretical derivations presented in this study, especially those concerning the relation between the principle of optimality and the dynamic programming algorithm, are novel.
Type:
Dissertation-Reproduction (electronic); text
Keywords:
Hydrology.; Dynamic programming.; Decision making -- Mathematical models.; Mathematical optimization.; Reservoirs -- Mathematical models.
Degree Name:
Ph. D.
Degree Level:
doctoral
Degree Program:
Hydrology and Water Resources; Graduate College
Degree Grantor:
University of Arizona
Committee Chair:
Yakowitz, Sidney J.

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titleOn the theory and modeling of dynamic programming with applications in reservoir operationen_US
dc.creatorSniedovich, Moshe,1945-en_US
dc.contributor.authorSniedovich, Moshe,1945-en_US
dc.date.issued1976en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThis dissertation contains a discussion concerning the validity of the principle of optimality and the dynamic programming algorithm in the context of discrete time and state multistage decision processes. The multistage decision model developed for the purpose of the investigation is of a general structure, especially as far as the reward function is concerned. The validity of the dynamic programming algorithm as a solution method is investigated and results are obtained for a rather wide class of decision processes. The intimate relationship between the principle and the algorithm is investigated and certain important conclusions are derived. In addition to the theoretical considerations involved in the implementation of the dynamic programming algorithm, some modeling and computational aspects are also investigated. It is demonstrated that the multistage decision model and the dynamic programming algorithm as defined in this study provide a solid framework for handling a wide class of multistage decision processes. The flexibility of the dynamic programming algorithm as a solution procedure for nonroutine reservoir control problems is demonstrated by two examples, one of which is a reliability problem. To the best of the author's knowledge, many of the theoretical derivations presented in this study, especially those concerning the relation between the principle of optimality and the dynamic programming algorithm, are novel.en_US
dc.description.notehydrology collectionen_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.typetexten_US
dc.subjectHydrology.en_US
dc.subjectDynamic programming.en_US
dc.subjectDecision making -- Mathematical models.en_US
dc.subjectMathematical optimization.en_US
dc.subjectReservoirs -- Mathematical models.en_US
thesis.degree.namePh. D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineHydrology and Water Resourcesen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.chairYakowitz, Sidney J.en_US
dc.contributor.committeememberDavis, Donald R.en_US
dc.contributor.committeememberFogel, Martin M.en_US
dc.contributor.committeememberDuckstein, Lucienen_US
dc.contributor.committeememberDietrich, D.en_US
dc.identifier.oclc212647568en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.