A Rapid Method for Optimization of Linear Systems with Storage

C. H. Bannister and R. J. Kaye
Additional contact information
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

Operations Research, 1991, vol. 39, issue 2, 220-232

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.

Keywords: dynamic programming; deterministic: rapid; exact dynamic programming; production/scheduling: optimal utilization of storage; programming; linear: fast optimization of linear systems (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.2.220 (application/pdf)

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:inm:oropre:v:39:y:1991:i:2:p:220-232

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().