We investigate numerical solution of finite difference approximations to American option pricing problems, using a new direct numerical method: simplex solution of a linear programming formulation. This approach is based on an extension to the parabolic case of the equivalence between linear order complementarity problems and abstract linear programs known for certain elliptic operators. We test this method empirically, comparing simplex and interior point algorithms with the projected successive overrelaxation (PSOR) algorithm applied to the American vanilla and lookback puts. We conclude that simplex is roughly comparable with projected SOR on average (faster for fine discretizations, slower for coarse), but is more desirable for robustness of solution time under changes in parameters. Furthermore, significant speedups over the results given here have been achieved and will be published elsewhere. Copyright Blackwell Publishers Inc 1999.

No abstract

No abstract

The purpose of this paper is to present evidence in support of the hypothesis that fast, accurate and parametrically robust numerical valuation of a wide range of derivative securities can be achieved by use of direct numerical methods in the solution of the associated PDE problems. Specifically, linear programming methods for American vanilla and exotic options, and explicit methods for a three stochastic state variable problem (a multi-period terminable differential swap) are explored and promising numerical results are discussed. The resulting value surface gives, simultaneously, valuation for many maturities and underlying prices, and the parameters required for risk analysis.Options, Swaps, Parabolic Pdes, Direct Numerical Methods, Linear Programming,

No abstract