Measures as Lagrange multipliers in multistage stochastic programming
From MaRDI portal
Publication:1243226
DOI10.1016/0022-247X(77)90020-8zbMath0369.90091OpenAlexW2153492230MaRDI QIDQ1243226
R. Tyrrell Rockafellar, Roger J.-B. Wets
Publication date: 1977
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(77)90020-8
Related Items
GLOBAL CONVERGENCE OF A GENERAL SAMPLING ALGORITHM FOR DYNAMIC NONLINEAR STOCHASTIC PROGRAMS, Exact penalty functions in single-stage stochastic programming1, Projection and discretization methods in stochastic programming, A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential, Incorporating statistical model error into the calculation of acceptability prices of contingent claims, Epi-convergent discretizations of multistage stochastic programs via integration quadratures, Approximation-exact penalty function method for solving a class of stochastic programming, Epiconvergence of relaxed stochastic optimization problems, A parallelized variable fixing process for solving multistage stochastic programs with progressive hedging, Dynamics aggregation in stochastic control problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuous versus measurable recourse in N-stage stochastic programming
- Stochastic convex programming: basic duality
- Stochastic convex programming: Kuhn-Tucker conditions
- Stochastic convex programming: Singular multipliers and extended duality, singular multipliers and duality
- Integrals which are convex functionals
- A note on decision rules for stochastic programs
- Integrals which are convex functionals. II
- Duality for Stochastic Programming Interpreted as L. P. in $L_p $-Space
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- On decision rules in stochastic programming
- Multistage Stochastic Programming with Recourse: The Equivalent Deterministic Problem
- Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility
- Admissible Decision Rules for the E-Model of Chance-Constrained Programming
- Minimax Theorems
