10.1287/mnsc.48.5.665.7801

Bounding Option Prices by Semidefinite Programming: A Cutting Plane Algorithm

Abstract

In a recent article, Bertsimas and Popescu showed that a tight upper bound on a Europeantype 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.bounds on option prices, semidefinite programming problem, cutting plane algorithm

Similar works

Full text

thumbnail-image

Research Papers in Economics

Provided original full text link
Last time updated on 7/6/2012

This paper was published in Research Papers in Economics.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.