Simulation-and Discretization-Free Explicit Stochastic Reservoir Operation Optimization Method
Bibliographic record
Abstract
The Fletcher-Ponnambalam (FP) method is an explicit stochastic optimization method for design and operations management of storage systems. It has been applied successfully in many real-world operations optimization problems (for example, the Great Lakes system and the Parambikulam-Aliyar project) and groundwater management problems. The FP method faces no curse of dimensionality unlike stochastic dynamic programming (SDP) and no need for scenarios generation as in implicit stochastic programming (ISP) methods. The paper introduces a novel implementation for the FP method by removing the need for nonlinear constraints and by decreasing the number of decision variables to just one third of its original value, significantly reducing solving time (~27 times faster than the original formulation). Additionally, new expressions derived for first and second moments of both reservoir release deficit and spill terms and the already-derived expression for second moments of reservoir storage are incorporated into the new formulation enabling the FP method to reach an improved optimality for a nonlinear objective function. The enhanced procedure is applied to solving a water reservoir operation optimization problem for a major dam in Brazil. The result comparisons made with SDP, two-stage stochastic programming and ISP along with a thorough analysis of release operation policies for both non-Gaussian correlated and Gaussian independent inflows prove the optimality of this highly numerically efficient and convenient-to-use FP method.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".