Dynamic Programming and Pricing of Contingent Claims in an Incomplete Market
SIAM Journal on Control and Optimization
A Farkas lemma Without A Standard Closure Condition
SIAM Journal on Control and Optimization
Convex analysis and variational problems
Convex analysis and variational problems
Hi-index | 0.00 |
This paper constructs an infinite-dimensional version of the Duality Theorem for a Linear Program (LP). The algebraic dual LP is replaced with a new program called the topological dual LP that closes the range of the adjoint operator. Under some mild nondegeneracy conditions involving strict positivity, the new Duality Theorem asserts that the optimal value of the primal LP equals the optimal value of the topological dual LP. Some applications to mathematical finance are also included.