IDEAS home Printed from https://ideas.repec.org/p/hhs/nhhfms/2006_021.html
   My bibliography  Save this paper

Managing Flexible Load Contracts: Two simple strategies

Author

Listed:
  • Bjerksund, Petter

    (Dept. of Finance and Management Science, Norwegian School of Economics and Business Administration)

  • Myksvoll, Bjarte

    (Viz Risk Management)

  • Stensland, Gunnar

    (Dept. of Finance and Management Science, Norwegian School of Economics and Business Administration)

Abstract

A flexible load contract is a type of swing option where the holder has the right to receive a given quantity of electricity within a specified period, at a fixed maximum effect (delivery rate). The contract is flexible, in the sense that delivery (the take hours) is called one day in advance. We investigate two simple strategies for managing flexible load contracts, where both use price information from the forward market. For 10 contracts traded in the period 1997-2001, we calculate the performance of the two strategies and compare with the reported performance of one complex dynamic programming approach as well as the actual results obtained by three anonymous market participants. The comparison indicates that our simple computer-efficient strategies perform better on average and produces more stable results.

Suggested Citation

  • Bjerksund, Petter & Myksvoll, Bjarte & Stensland, Gunnar, 2006. "Managing Flexible Load Contracts: Two simple strategies," Discussion Papers 2006/21, Norwegian School of Economics, Department of Business and Management Science.
    • Handle: RePEc:hhs:nhhfms:2006_021
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/11250/164110
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Flexible Load Contracts; computer-efficient strategies; dynamic programming;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hhs:nhhfms:2006_021. 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: Stein Fossen (email available below). General contact details of provider: https://edirc.repec.org/data/dfnhhno.html .

    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.