Option Pricing by Mathematical Programming

Sjur Flåm

No 2007:10, Working Papers from Lund University, Department of Economics

Abstract: Financial options typically incorporate times of exercise. Alternatively, they embody set-up costs or indivisibilities. Such features lead to planning problems with integer decision variables. Provided the sample space be finite, it is shown here that integrality constraints can often be relaxed. In fact, simple mathematical programming, aimed at arbitrage or replication, may bound or identify option prices. When the asset market is incomplete, the bounds stem from nonlinear pricing functionals.

Keywords: asset pricing; arbitrage; options; finite sample space; scenario tree; equivalent martingale measures; bid-ask intervals; incomplete market; linear programming; combinatorial optimization; totally unimodular matrices. (search for similar items in EconPapers)
JEL-codes: C61 G12 (search for similar items in EconPapers)
Pages: 20 pages
Date: 2007-06-04
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://project.nek.lu.se/publications/workpap/Papers/WP07_10.pdf (application/pdf)

Related works:
Working Paper: Option pricing by mathematical programming (2007)
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:hhs:lunewp:2007_010

Access Statistics for this paper

More papers in Working Papers from Lund University, Department of Economics School of Economics and Management, Box 7080, S-22007 Lund, Sweden. Contact information at EDIRC.
Bibliographic data for series maintained by Iker Arregui Alegria ().