Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
From MaRDI portal
Recommendations
Cited in
(39)- Convergent bounds for stochastic programs with expected value constraints
- A numerical method for solving stochastic programming problems with moment constraints on a distribution function
- Statistical verification of optimality conditions for stochastic programs with recourse
- An upper bound for SLP using first and total second moments
- Bounding separable recourse functions with limited distribution information
- An upper bound on the expectation of simplicial functions of multivariate random variables
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Multi-stage stochastic linear programs for portfolio optimization
- Inexact subgradient methods with applications in stochastic programming
- SLP-IOR: An interactive model management system for stochastic linear programs
- Cut sharing for multistage stochastic linear programs with interstage dependency
- Barycentric scenario trees in convex multistage stochastic programming
- An iterative algorithm to bound partial moments
- Monotonic bounds in multistage mixed-integer stochastic programming
- Algorithms for the solution of stochastic dynamic minimax problems
- Second-order scenario approximation and refinement in optimization under uncertainty
- Restricted recourse strategies for bounding the expected network recourse function
- A primal-dual approach to inexact subgradient methods
- An upper bound on the expected value of a non-increasing convex function with convex marginal return functions
- A hierarchy of bounds for stochastic mixed-integer programs
- Two-stage stochastic standard quadratic optimization
- On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems
- Problem-based optimal scenario generation and reduction in stochastic programming
- Solving two-stage stochastic programming problems with level decomposition
- Aggregation and discretization in multistage stochastic programming
- Multiperiod portfolio optimization with terminal liability: bounds for the convex case
- Total variation bounds on the expectation of periodic functions with applications to recourse approximations
- MINIMIZING MAKESPAN IN A MULTICLASS FLUID NETWORK WITH PARAMETER UNCERTAINTY
- scientific article; zbMATH DE number 3989107 (Why is no real title available?)
- scientific article; zbMATH DE number 4062822 (Why is no real title available?)
- scientific article; zbMATH DE number 4074816 (Why is no real title available?)
- Sharp Bounds on the Value of Perfect Information
- Multistage stochastic programming: Error analysis for the convex case
- On the role of bounds in stochastic linear programming
- Robust optimization with ambiguous stochastic constraints under mean and dispersion information
- Multilinear approximation on rectangles and the related moment problem
- On the safe side of stochastic programming: bounds and approximations
- Reduced cost-based variable fixing in two-stage stochastic programming
- Bounds in multi-horizon stochastic programs
This page was built for publication: Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798480)
