1997
DOI: 10.2139/ssrn.39780
|View full text |Cite
|
Sign up to set email alerts
|

Fast Numerical Valuation of American, Exotic and Complex Options

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0
1

Year Published

1997
1997
2008
2008

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 10 publications
0
2
0
1
Order By: Relevance
“…This parametric simplex method (e.g., the OSL routine EKKSPAR described in IBM Corporation 1992) could be exploited for many path-dependent options, such as continuous and discretely sampled lookback and Asian options. For such options, the path-dependent variable does not appear in the PDE, nor therefore in the constraint matrix, but is simply a parameter of the payoff function and boundary conditions-that is, the variable bounds and right-hand side (see Hutton 1997a andDempster et al 1998 for more details).…”
Section: Discussionmentioning
confidence: 99%
“…This parametric simplex method (e.g., the OSL routine EKKSPAR described in IBM Corporation 1992) could be exploited for many path-dependent options, such as continuous and discretely sampled lookback and Asian options. For such options, the path-dependent variable does not appear in the PDE, nor therefore in the constraint matrix, but is simply a parameter of the payoff function and boundary conditions-that is, the variable bounds and right-hand side (see Hutton 1997a andDempster et al 1998 for more details).…”
Section: Discussionmentioning
confidence: 99%
“…Jaillet et al (1990) have formulated the pricing problem as variational inequalities and have studied the numerical methods to solve the finite dimensional variational inequalities. Dempster and Hutton (1999a) have applied linear programming methods to the pricing problem of American stock options. The pricing methods of American options with the projected successive over-relaxation algorithm have been explained in Wilmott et al (1992), for example.…”
Section: Introductionmentioning
confidence: 99%
“…O problema de precificar uma opção pode ser formulado também em forma de programação linear. Métodos diretos e programação linear são considerados em [38] . Neste trabalho nós estudamos um método direto nos experimentos numéricos.…”
Section: Introductionunclassified