Multistage Stochastic Programming with Recourse As Mathematical Programming in an $L_p $ Space
From MaRDI portal
Publication:4103330
DOI10.1137/0314035zbMath0336.90041OpenAlexW1990291608MaRDI QIDQ4103330
Publication date: 1976
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0314035
Related Items (11)
GLOBAL CONVERGENCE OF A GENERAL SAMPLING ALGORITHM FOR DYNAMIC NONLINEAR STOCHASTIC PROGRAMS ⋮ Discrete approximation of linear two–stage stochastic programming problem ⋮ Projection and discretization methods in stochastic programming ⋮ Stability in multistage stochastic programming ⋮ Stability of multistage stochastic programming ⋮ On optimality conditions for some nonsmooth optimization problems over \(L^p\) spaces ⋮ Executing join queries in an uncertain distributed environment ⋮ Multistage stochastic programming: Error analysis for the convex case ⋮ From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Multistage Stochastic Programming with Recourse As Mathematical Programming in an $L_p $ Space