Pricing American Stock Options by Linear Programming
1999, Mathematical Finance
https://doi.org/10.1111/1467-9965.00069Abstract
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.
References (23)
- BABBS, S. H. (1992): Binomial Valuation of Lookback Options. Working paper, Midland Montagu Capital Markets.
- BAIOCCHI, C., and A. CAPELO (1984): Variational and Quasivariational Inequalities. New York: Wiley.
- BLACK, F., and M. SCHOLES (1973): The Pricing of Options and Corporate Liabilities, J. Political Econ. 81, 637-659.
- BORWEIN, J. M., and M. A. H. DEMPSTER (1989): The Linear Order Complementarity Problem, Math. Operations Res. 14(3), 534-558.
- CARR, P., and D. FAGUET (1994): Fast Accurate Valuation of American Options. Working paper, Johnson Graduate School of Management, Cornell University.
- CLARKE, N. (1998): Numerical Solution of Financial Derivatives, Ph.D. thesis, Linacre College, Oxford.
- CRYER, C. W. (1971): The Solution of a Quadratic Programme Using Systematic Overrelaxation, SIAM J. Control Optim. 9, 385-392.
- CRYER, C. W., and M. A. H. DEMPSTER (1980): Equivalence of Linear Complementarity Problems and Linear Programs in Vector Lattice Hilbert Spaces, SIAM J. Control Optim. 18(1), 76-90.
- DANTZIG, G. B. (1963): Linear Programming and Extensions. Princeton, NJ: Princeton University Press.
- DEMPSTER, M. A. H., and J. P. HUTTON (1997a): Fast Numerical Valuation of American, Exotic and Complex Options, Appl. Math. Finance 4(1), 1-20.
- DEMPSTER, M. A. H., and J. P. HUTTON (1997b): Numerical Valuation of Cross-Currency Swaps and Swaptions; in Mathematics of Derivative Securities, M. A. Dempster and S. R. Pliska, eds. Cambridge University Press.
- DEMPSTER, M. A. H., J. P. HUTTON, and D. G. RICHARDS (1998): LP Valuation of Exotic American Options Exploiting Structure. Working paper, Judge Institute of Management Studies, University of Cambridge.
- DUFFIE, D. (1992): Dynamic Asset Pricing Theory, Princeton, NJ: Princeton University Press.
- HUTTON, J. P. (1995): Fast Pricing of Derivative Securities, Ph.D. thesis, Department of Mathematics, University of Essex.
- IBM CORPORATION (1992): Optimization Subroutine Library-Guide and Reference Release 2, 4th ed. JACKA, S. (1991): Optimal Stopping and the American Put, Math. Finance 1, 1-14.
- JAILLET, P., D. LAMBERTON, and B. LAPEYRE (1990): Variational Inequalities and the Pricing of American Options, Acta Appl. Math. 21, 263-289.
- KARMARKAR, N. (1984): A New Polynomial Time Algorithm for Linear Programming, Combina- torica 4, 373-394.
- KOOPMANS, T. C. (1951): Activity Analysis of Production and Allocation. New Haven, CT: Yale University Press.
- LUENBERGER, D. G. (1984): Linear and Nonlinear Programming, 2nd ed. Reading, MA: Addison- Wesley.
- MANGASARIAN, O. (1979): Simplified Characterisations of Linear Complementarity Problems Solv- able as Linear Programs, Math. Operations Res. 4(3).
- MANIA, M. (1997): Semimartingale Characterization of Generalized Derivatives, Stoch. Stoch. Rep. 61, 35-66.
- MYNENI, R. (1992): The Pricing of the American Option, Ann. Appl. Prob. 2(1), 1-23.
- VAN MOERBECKE, P. (1976): On Optimal Stopping and Free Boundary Problems, Arch. Rational Mech. Anal. 60, 101-148.