haku: @indexterm Algorithms / yhteensä: 403
viite: 30 / 403
| Tekijä: | Gotoh, J.-y. Konno, H. |
| Otsikko: | Bounding Option Prices by Semidefinite Programming: A Cutting Plane Algorithm |
| Lehti: | Management Science
2002 : MAY, VOL. 48:5, p. 665-678 |
| Asiasana: | OPTIONS OPTION PRICES ALGORITHMS |
| Kieli: | eng |
| Tiivistelmä: | 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 authors of the article state that the purpose of this paper is to improve and extend their results. The authors will show that a tight lower bound can be calculated by solving another SDP. Also, the authors 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. |
SCIMA