Piecewise affine decision rules for contextual chance-constrained stochastic programming
From MaRDI portal
Cites work
- A data-driven newsvendor problem: from data to decision
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A survey of contextual optimization methods for decision-making under uncertainty
- A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
- An integer programming approach for linear programs with probabilistic constraints
- Chance-constrained programming
- Convex Approximations of Chance Constrained Programs
- Data-Driven Approximation of Contextual Chance-Constrained Stochastic Programs
- Data-Driven Optimization: A Reproducing Kernel Hilbert Space Approach
- Generalization bounds for regularized portfolio selection with market side information
- Generalized decision rule approximations for stochastic programming via liftings
- Hybrid strategies using linear and piecewise-linear decision rules for multistage adaptive linear optimization
- Introduction to Piecewise Differentiable Equations
- Introduction to stochastic programming.
- Lectures on stochastic programming. Modeling and theory
- Model selection and error estimation
- Optimality of affine policies in multistage robust optimization
- Primal and dual linear decision rules in stochastic and robust optimization
- Sample average approximation method for chance constrained programming: Theory and applications
- Some aspects of the sequential design of experiments
- The big data newsvendor: practical insights from machine learning
- The robust capacitated vehicle routing problem under demand uncertainty
This page was built for publication: Piecewise affine decision rules for contextual chance-constrained stochastic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931718)
