AI SearchA chance-constrained dynamic programming (CCDP) model for water quality management
Call Number: AIT Thesis no.EV-82-3 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. EV-82-3Publication details: Bangkok : Asian Institute of Technology, 1982Description: vi, 47 pSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 1982 Summary: A chance-constrained dynamic programming model with the objective of minimizing the operation costs has been developed for a regional water quality management system. A zero order decision rule is used to find deterministic equivalents for chance-constrained programming model into straight forward dynamic programming model which can be solved by available algorithm.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22-AIT Thesis (Replacement)
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.EV-82-3 (Browse shelf(Opens below)) | 3 | Available | 30050120655708 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no.EV-82-3 (Browse shelf(Opens below)) | Available | 30050160084579 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Environment, Resources and Development
Thesis (M.Eng.) - Asian Institute of Technology, 1982
A chance-constrained dynamic programming model with the objective of minimizing the operation costs has been developed for a regional water quality management system. A zero order decision rule is used to find deterministic equivalents for chance-constrained programming model into straight forward dynamic programming model which can be solved by available algorithm.
There are no comments on this title.