Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility
- 1 May 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 14 (3) , 574-589
- https://doi.org/10.1137/0314038
Abstract
Summary:King and Korf [KingKorf01] introduced, in the framework of a discrete- time dynamic market model on a general probability space, a new concept of arbitrage called free lunch in the limit which is slightly weaker than the common free lunch. The definition was motivated by the attempt at proposing the pricing theory based on the theory of conjugate duality in optimization. We show that this concept of arbitrage fails to have a basic property of other common concepts used in pricing theory – it depends on the underlying probability measure more than through its null sets. However, we show that the interesting pricing results obtained by conjugate duality are still valid if it is only assumed that the market admits no free lunch rather than no free lunch in the limitKeywords
This publication has 11 references indexed in Scilit:
- Stochastic convex programming: basic dualityPacific Journal of Mathematics, 1976
- Stochastic convex programming: Kuhn-Tucker conditionsJournal of Mathematical Economics, 1975
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic ProgramSIAM Review, 1974
- Convex AnalysisPublished by Walter de Gruyter GmbH ,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
- Stochastic Programs with RecourseSIAM Journal on Applied Mathematics, 1967
- A Note on Stochastic Linear ProgrammingEconometrica, 1960
- The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain DemandManagement Science, 1956
- Linear Programming under UncertaintyManagement Science, 1955