Restricted recourse strategies for bounding the expected network recourse function
From MaRDI portal
Recommendations
- A piecewise linear upper bound on the network recourse function
- Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities
- Solving stochastic programs with network recourse
- A network recourse decomposition method for dynamic networks with random arc capacities
- Restricted-recourse bounds for stochastic linear programming
Cites work
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
- A piecewise linear upper bound on the network recourse function
- A tight upper bound for the expectation of a convex function of a multivariate random variable
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- More bounds on the expectation of a convex function of a random variable
- Refining bounds for stochastic linear programs with linearly transformed independent random variables
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- Solving stochastic programming problems with recourse including error bounds
Cited in
(4)
This page was built for publication: Restricted recourse strategies for bounding the expected network recourse function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918432)