IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1011.1234.html
   My bibliography  Save this paper

Storage option an Analytic approach

Author

Listed:
  • Dmitry Lesnik

Abstract

The mathematical problem of the static storage optimisation is formulated and solved by means of a variational analysis. The solution obtained in implicit form is shedding light on the most important features of the optimal exercise strategy. We show how the solution depends on different constraint types including carry cost and cycling constraint. We investigate the relation between intrinsic and stochastic solutions. In particular we give another proof that the stochastic problem has a "bang-bang" optimal exercise strategy. We also show why the optimal stochastic exercise decision is always close to the intrinsic one. In the second half we develop a perturbation analysis to solve the stochastic optimisation problem. The obtained approximate solution allows us to estimate the time value of the storage option. In particular we find an answer to rather academic question of asymptotic time value for the mean reversion parameter approaching zero or infinity. We also investigate the differences between swing and storage problems. The analytical results are compared with numerical valuations and found to be in a good agreement.

Suggested Citation

  • Dmitry Lesnik, 2010. "Storage option an Analytic approach," Papers 1011.1234, arXiv.org, revised May 2012.
  • Handle: RePEc:arx:papers:1011.1234
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1011.1234
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:1011.1234. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.