Multistage Stochastic Programming with Recourse: The Equivalent Deterministic Problem
Author:
- Paul OlsenPOPaul Olsen
- 1 May 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 14 (3) , 495-517
Abstract
Multistage stochastic programming with recourse is defined recursively as a natural extension of two-stage stochastic programming with recourse. Some existing results for two-stage problems are extended to problems with $K + 1$ stages, where $1 \leqq K < + \infty $, in the special case of a fixed technology matrix. These results generally involve characterization of the “equivalent deterministic problem”—showing, for example, that it has a convex objective function, a lower-semicontinuous convex objective function, a Lipschitzian objective function, or linear induced constraints.
Keywords
This publication has 19 references indexed in Scilit:
- When Is a Multistage Stochastic Programming Problem Well-Defined?SIAM Journal on Control and Optimization, 1976
- Discretizations of multistage stochastic programming problems1976
- Lagrange Multipliers for an N-Stage Model in Stochastic Convex Programming1974
- Convex Analysis1970
- A duality theory for abstract mathematical programs with applications to optimal control theoryJournal of Mathematical Analysis and Applications, 1968
- Duality and stability in extremum problems involving convex functionsPacific Journal of Mathematics, 1967
- Constrained Generalized Medians and Hypermedians as Deterministic Equivalents for Two-Stage Linear Programs under UncertaintyManagement Science, 1965
- Linear Programming and Extensions1963
- Inequalities for Stochastic Linear Programming ProblemsManagement Science, 1960
- Linear Programming under UncertaintyManagement Science, 1955