Bounding option prices by semidefinite programming: A cutting plane algorithm

Bounding option prices by semidefinite programming: A cutting plane algorithm

0.00 Avg rating0 Votes
Article ID: iaor20032394
Country: United States
Volume: 48
Issue: 5
Start Page Number: 665
End Page Number: 678
Publication Date: May 2002
Journal: Management Science
Authors: ,
Keywords: programming: integer
Abstract:

In a recent article, Bertsimas and Popescu showed that a tight upper bound on a European-type call option price, given the first n moments of the distribution of the underlying security price, can be obtained by solving an associated semidefinite programming problem (SDP). The purpose of this paper is to improve and extend their results. We will show that a tight lower bound can be calculated by solving another SDP. Also, we will show that these problems can be solved very quickly by a newly developed cutting plane algorithm when n is less than six or seven.

Reviews

Required fields are marked *. Your email address will not be published.