scientific article
From MaRDI portal
Publication:3796964
zbMath0651.90054MaRDI QIDQ3796964
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
upper boundpiecewise linear functionstochastic linear programs with recoursevariance of the recourse function
Related Items (23)
Projection and discretization methods in stochastic programming ⋮ Continuous approximation schemes for stochastic programs ⋮ SLP-IOR: An interactive model management system for stochastic linear programs ⋮ Duality and statistical tests of optimality for two stage stochastic programs ⋮ Barycentric scenario trees in convex multistage stochastic programming ⋮ Implementing bounds-based approximations in convex-concave two-stage 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 ⋮ Management of non-maturing deposits by multistage stochastic programming ⋮ An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems ⋮ 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 ⋮ A survey of adjustable robust optimization ⋮ Solving two-stage stochastic programming problems with level decomposition ⋮ Bounding multi-stage stochastic programs from above ⋮ Stochastic programs with recourse: An upper bound and the related moment problem ⋮ Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs ⋮ Some insights into the solution algorithms for SLP problems ⋮ Parallel processors for planning under uncertainty ⋮ Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set ⋮ On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems
This page was built for publication:
