Joint dynamic probabilistic constraints with projected linear decision rules
From MaRDI portal
(Redirected from Publication:4594843)
Abstract: We consider multistage stochastic linear optimization problems combining joint dynamic probabilistic constraints with hard constraints. We develop a method for projecting decision rules onto hard constraints of wait-and-see type. We establish the relation between the original (infinite dimensional) problem and approximating problems working with projections from different subclasses of decision policies. Considering the subclass of linear decision rules and a generalized linear model for the underlying stochastic process with noises that are Gaussian or truncated Gaussian, we show that the value and gradient of the objective and constraint functions of the approximating problems can be computed analytically.
Recommendations
- Primal and dual linear decision rules in stochastic and robust optimization
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- scientific article; zbMATH DE number 124612
- Bound-based decision rules in multistage stochastic programming
- Two-stage linear decision rules for multi-stage stochastic programming
Cited in
(6)- Dynamic probabilistic constraints under continuous random distributions
- On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints
- Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel
- Constant depth decision rules for multistage optimization under uncertainty
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- Relaxations for probabilistically constrained stochastic programming problems: review and extensions
This page was built for publication: Joint dynamic probabilistic constraints with projected linear decision rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594843)