Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
From MaRDI portal
Publication:3798480
DOI10.1287/moor.13.3.377zbMath0652.90080OpenAlexW2165543410MaRDI QIDQ3798480
Publication date: 1988
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.13.3.377
upper boundsconvex functionrecoursestochastic linear programmingapproximations for stochastic programsBounding the expectation
Related Items (33)
Bounds in multi-horizon stochastic programs ⋮ Total variation bounds on the expectation of periodic functions with applications to recourse approximations ⋮ MINIMIZING MAKESPAN IN A MULTICLASS FLUID NETWORK WITH PARAMETER UNCERTAINTY ⋮ 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 ⋮ Algorithms for the solution of stochastic dynamic minimax problems ⋮ Multistage stochastic programming: Error analysis for the convex case ⋮ 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 ⋮ On the safe side of stochastic programming: bounds and approximations ⋮ A hierarchy of bounds for stochastic mixed-integer programs ⋮ An iterative algorithm to bound partial moments ⋮ 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 ⋮ Solving two-stage stochastic programming problems with level decomposition ⋮ An upper bound on the expectation of simplicial functions of multivariate random variables ⋮ Aggregation and discretization in multistage stochastic programming ⋮ Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs ⋮ Monotonic bounds in multistage mixed-integer stochastic programming ⋮ Robust Optimization with Ambiguous Stochastic Constraints Under Mean and Dispersion Information ⋮ Convergent bounds for stochastic programs with expected value constraints ⋮ Two-stage stochastic standard quadratic optimization ⋮ On the role of bounds in stochastic linear programming ⋮ On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems ⋮ Multiperiod portfolio optimization with terminal liability: bounds for the convex case ⋮ Multi-stage stochastic linear programs for portfolio optimization ⋮ Inexact subgradient methods with applications in stochastic programming ⋮ Problem-based optimal scenario generation and reduction in stochastic programming
This page was built for publication: Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
