Bounding Option Prices Using SDP With Change Of Numeraire
Recently, given the first few moments, tight upper and lower bounds of the no arbitrage prices can be obtained by solving semidefinite programming (SDP) or linear programming (LP) problems. In this paper, we compare SDP and LP formulations of the European-style options pricing problem and prefer SDP formulations due to the simplicity of moments constraints. We propose to employ the technique of change of numeraire when using SDP to bound the European type of options. In fact, this problem can then be cast as a truncated Hausdorff moment problem which has necessary and sufficient moment conditions expressed by positive semidefinite moment and localizing matrices. With four moments information we show stable numerical results for bounding European call options and exchange options. Moreover, A hedging strategy is also identified by the dual formulation.
When requesting a correction, please mention this item's handle: RePEc:com:wpaper:016. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anil Khuman)
If references are entirely missing, you can add them using this form.