The Optimal Recourse Problem in Discrete Time: $L^1 $-Multipliers for Inequality Constraints
- 1 January 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 16 (1) , 16-36
- https://doi.org/10.1137/0316002
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Stochastic Convex Programming: Relatively Complete Recourse and Induced FeasibilitySIAM Journal on Control and Optimization, 1976
- Nonanticipativity and L 1-martingales in stochastic optimization problemsPublished by Springer Nature ,1976
- Discretizations of multistage stochastic programming problemsPublished by Springer Nature ,1976
- Stochastic convex programming: Kuhn-Tucker conditionsJournal of Mathematical Economics, 1975
- Continuous versus measurable recourse in N-stage stochastic programmingJournal of Mathematical Analysis and Applications, 1974
- Conjugate Duality and OptimizationPublished by Society for Industrial & Applied Mathematics (SIAM) ,1974
- Integrals which are convex functionals. IIPacific Journal of Mathematics, 1971
- Symmetric Duality for Continuous Linear ProgramsSIAM Journal on Applied Mathematics, 1970
- Measurable dependence of convex sets and functions on parametersJournal of Mathematical Analysis and Applications, 1969
- Integrals which are convex functionalsPacific Journal of Mathematics, 1968