IDEAS home Printed from https://ideas.repec.org/a/taf/apmtfi/v15y2008i5-6p405-447.html
   My bibliography  Save this article

Pricing Asset Scheduling Flexibility using Optimal Switching

Author

Listed:
  • Rene Carmona
  • Michael Ludkovski

Abstract

We study the financial engineering aspects of operational flexibility of energy assets. The current practice relies on a representation that uses strips of European spark-spread options, ignoring the operational constraints. Instead, we propose a new approach based on a stochastic impulse control framework. The model reduces to a cascade of optimal stopping problems and directly demonstrates that the optimal dispatch policies can be described with the aid of 'switching boundaries', similar to the free boundaries of standard American options. Our main contribution is a new method of numerical solution relying on Monte Carlo regressions. The scheme uses dynamic programming to efficiently approximate the optimal dispatch policy along the simulated paths. Convergence analysis is carried out and results are illustrated with a variety of concrete computational examples. We benchmark and compare our scheme with alternative numerical methods.

Suggested Citation

  • Rene Carmona & Michael Ludkovski, 2008. "Pricing Asset Scheduling Flexibility using Optimal Switching," Applied Mathematical Finance, Taylor & Francis Journals, vol. 15(5-6), pages 405-447.
    • Handle: RePEc:taf:apmtfi:v:15:y:2008:i:5-6:p:405-447
    DOI: 10.1080/13504860802170507
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/13504860802170507
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/13504860802170507?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Erhan Bayraktar & Masahiko Egami, 2010. "On the One-Dimensional Optimal Switching Problem," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 140-159, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liangchen Li & Michael Ludkovski, 2018. "Stochastic Switching Games," Papers 1807.03893, arXiv.org.
    2. Pablo Azcue & Esther Frostig & Nora Muler, 2023. "Optimal Strategies in a Production Inventory Control Model," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-43, March.
    3. Christensen, Sören, 2014. "On the solution of general impulse control problems using superharmonic functions," Stochastic Processes and their Applications, Elsevier, vol. 124(1), pages 709-729.
    4. Jingchen Wu & Xiuli Chao, 2014. "Optimal Control of a Brownian Production/Inventory System with Average Cost Criterion," Mathematics of Operations Research, INFORMS, vol. 39(1), pages 163-189, February.
    5. Korn, Ralf & Melnyk, Yaroslav & Seifried, Frank Thomas, 2017. "Stochastic impulse control with regime-switching dynamics," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1024-1042.
    6. Yuki Shigeta, 2016. "Optimal Switching under Ambiguity and Its Applications in Finance," Papers 1608.06045, arXiv.org.
    7. Pui Chan Lon & Mihail Zervos, 2011. "A Model for Optimally Advertising and Launching a Product," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 363-376, May.
    8. Mihail Zervos & Carlos Oliveira & Kate Duckworth, 2018. "An investment model with switching costs and the option to abandon," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 88(3), pages 417-443, December.
    9. Randall Martyr, 2016. "Finite-Horizon Optimal Multiple Switching with Signed Switching Costs," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1432-1447, November.
    10. Juri Hinz & Tanya Tarnopolskaya & Jeremy Yee, 2020. "Efficient algorithms of pathwise dynamic programming for decision optimization in mining operations," Annals of Operations Research, Springer, vol. 286(1), pages 583-615, March.
    11. Vicky Henderson & Jonathan Muscat, 2020. "Partial liquidation under reference-dependent preferences," Finance and Stochastics, Springer, vol. 24(2), pages 335-357, April.
    12. Kiyoshi Suzuki, 2018. "Optimal pair-trading strategy over long/short/square positions—empirical study," Quantitative Finance, Taylor & Francis Journals, vol. 18(1), pages 97-119, January.
    13. Kiyoshi Suzuki, 2021. "Infinite-Horizon Optimal Switching Regions for a Pair-Trading Strategy with Quadratic Risk Aversion Considering Simultaneous Multiple Switchings: A Viscosity Solution Approach," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 336-360, February.
    14. Ajay Subramanian & Baozhong Yang, 2017. "Optimal Dynamic Risk Taking," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 599-625, August.
    15. Dalang, Robert C. & Vinckenbosch, Laura, 2014. "Optimal expulsion and optimal confinement of a Brownian particle with a switching cost," Stochastic Processes and their Applications, Elsevier, vol. 124(12), pages 4050-4079.
    16. Masahiko Egami & Tadao Oryu, 2010. "Options on Multiple Assets in a Mean-Reverting Model," Discussion papers e-10-005, Graduate School of Economics Project Center, Kyoto University.

    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:taf:apmtfi:v:15:y:2008:i:5-6:p:405-447. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAMF20 .

    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.