## Static-arbitrage bounds on the prices of basket options via linear programming

We show that the problem of computing sharp upper and lower static-arbitrage bounds on the price of a European basket option, given the prices of other similar options, can be cast as a linear program (LP). The LP formulations readily yield super-replicating (sub-replicating) strategies for the upper (lower) bound problem. The dual counterparts of the … Read more