IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v39y1991i2p220-232.html
   My bibliography  Save this article

A Rapid Method for Optimization of Linear Systems with Storage

Author

Listed:
  • C. H. Bannister

    (Intelligent Energy Systems Ltd., Crows Nest, New South Wales, Australia)

  • R. J. Kaye

    (University of New South Wales, Kensington, New South Wales, Australia)

Abstract

A new method for optimizing the operation of a single storage connected to a general linear memoryless system is presented. The model is shown to cover a wide variety of practical situations where a deterministic approximation is valid. The method combines linear and dynamic programming concepts to produce a fast but exact optimization.

Suggested Citation

  • C. H. Bannister & R. J. Kaye, 1991. "A Rapid Method for Optimization of Linear Systems with Storage," Operations Research, INFORMS, vol. 39(2), pages 220-232, April.
    • Handle: RePEc:inm:oropre:v:39:y:1991:i:2:p:220-232
    DOI: 10.1287/opre.39.2.220
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.2.220
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.39.2.220?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guoming Lai & Mulan X. Wang & Sunder Kekre & Alan Scheller-Wolf & Nicola Secomandi, 2011. "Valuation of Storage at a Liquefied Natural Gas Terminal," Operations Research, INFORMS, vol. 59(3), pages 602-616, June.
    2. James Cruise & Lisa Flatley & Richard Gibbens & Stan Zachary, 2019. "Control of Energy Storage with Market Impact: Lagrangian Approach and Horizons," Operations Research, INFORMS, vol. 67(1), pages 1-9, January.
    3. Antonio Frangioni & Claudio Gentile, 2006. "Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints," Operations Research, INFORMS, vol. 54(4), pages 767-775, August.

    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:inm:oropre:v:39:y:1991:i:2:p:220-232. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.