Answers are grounded in this paper and cite their sources.
A dynamic programing solution procedure is developed for a class of variance‐constrained reservoir control problems. The variance constraint is incorporated as a penalty term in a nonseparable Lagrangian problem which is solved by a two‐stage procedure. First, the difficulty associated with the nonseparability of the problem is resolved by the consideration of a modified simpler separable problem which is solved by a simple additive dynamic programing recursion. Then the optimal solution to the nonseparable problem is found by a simple search algorithm. The entire discussion is devoted to the mathematical aspects of the problem and no consideration is given to the applicability of variance constraints as far as water resources management problems are concerned. The procedure is applied to a simple numerical example.
No takes yet. Share an insight, caveat, or question.
Moshe Sniedovich (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: