“…Most approaches for efficient allocation of reservoir storage are limited by the so‐called curse of dimensionality where computational time and memory to increase exponentially with the number of storage units (Bellman & Dreyfus, ; Giuliani et al, ). Examples include dynamic programming (Banihabib et al, ; Fontane & Labadie, ; Ji et al, ; Mansouri et al, ; Marino & Mohammadi, ; Tauxe et al, ; Yakowitz, ; Yeh & Becker, ), stochastic dynamic programming (Butcher, ; Scarcelli et al, ; Soleimani et al, ; Stedinger et al, ; Torabi & Mobasheri, ; Zhou et al, ), and model predictive control (Anghileri et al, ; Galelli et al, ; Mayne et al, ; Raso & Malaterre, ). Other studies (Cai et al, ; Shiau, ) used nonlinear optimization formulations with constrained carryover storage volumes.…”