ifference between revisions of "EMK:Simplifying River Chains for Dynamic Programming"
Jump to navigation
Jump to search
| Line 4: | Line 4: | ||
== River Chain Simplification == | == River Chain Simplification == | ||
| − | [[File:SRC Fig 1.jpg]] | + | [[File:SRC Fig 1.jpg|200px|thumb|right|Figure 1]] |
Revision as of 16:29, 3 December 2012
Introduction
If too many reservoirs are modelled in the dynamic programming phase of water value calculation, a performance hit may occur. This is the well known ‘problem of dimensionality’ in dynamic programming. It might be necessary to simplify the problem to avoid slow DP (Dynamic Programming) solutions. The following is a method for doing this on a chain of stations.
