Constant Depth Decision Rules for multistage optimization under uncertainty
Vincent Guigues, Anatoli Juditsky, Arkadi Nemirovski

TL;DR
This paper introduces Constant Depth Decision Rules (CDDRs) for multistage optimization under uncertainty, providing a new approach that simplifies complex stochastic problems into linear constraints, with promising computational advantages.
Contribution
The paper proposes a novel class of decision rules, CDDRs, that enable reformulation of multistage stochastic problems with certain uncertainties into linear systems, improving computational efficiency.
Findings
CDDRs can be reformulated as linear inequalities with manageable complexity.
Numerical results show CDDRs perform comparably to SDDP in small-stage problems.
CDDRs offer a computationally efficient alternative for multistage stochastic optimization.
Abstract
In this paper, we introduce a new class of decision rules, referred to as Constant Depth Decision Rules (CDDRs), for multistage optimization under linear constraints with uncertainty-affected right-hand sides. We consider two uncertainty classes: discrete uncertainties which can take at each stage at most a fixed number d of different values, and polytopic uncertainties which, at each stage, are elements of a convex hull of at most d points. Given the depth mu of the decision rule, the decision at stage t is expressed as the sum of t functions of mu consecutive values of the underlying uncertain parameters. These functions are arbitrary in the case of discrete uncertainties and are poly-affine in the case of polytopic uncertainties. For these uncertainty classes, we show that when the uncertain right-hand sides of the constraints of the multistage problem are of the same additive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
