Semidefinite Programming Approaches for Bounding Asian Option Prices

Georgios V. Dalakouras (), Roy H. Kwon () and Panos M. Pardalos ()
Additional contact information
Georgios V. Dalakouras: University of Florida
Roy H. Kwon: University of Toronto
Panos M. Pardalos: University of Florida

A chapter in Computational Methods in Financial Engineering, 2008, pp 103-116 from Springer

Abstract: Abstract Semidefinite programming (SDP) approaches are considered for obtaining bounds for the price of an arithmetic average Asian option. A method for computing the moments of the distribution of prices is developed which enables the method of Bertsimas and Popescu to be extended for the case of the Asian option. In particular, several SDP formulations for upper and lower bounds of the price of an Asian option are given based on different representations of the payoffs of the option. The formulations are amenable to standard SDP computational methods.

Keywords: Asian options; semidefinite programming (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-77958-2_6

Ordering information: This item can be ordered from
http://www.springer.com/9783540779582

DOI: 10.1007/978-3-540-77958-2_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().