Pricing American Stock Options by Linear Programming

M. A. H. Dempster and J. P. Hutton

Mathematical Finance, 1999, vol. 9, issue 3, 229-254

Abstract: 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.

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
https://doi.org/10.1111/1467-9965.00069

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:mathfi:v:9:y:1999:i:3:p:229-254

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0960-1627

Access Statistics for this article

Mathematical Finance is currently edited by Jerome Detemple

More articles in Mathematical Finance from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().