Abstract
This paper describes an application of convex programming for optimal long term planning of an electrical system.
After a short description of electrical system planning requirements (Section 1), the total costs function is established and the security constraints are expressed with a set of linear constraints, as are total capacity and annual rate limitations of various types of units (Section 2).
The resulting convex program is then solved with a feasible direction method (Section 3): each iteration, the locally best direction is computed by a process similar to the gradient projection method.
Additional comments can be found in Section 4.
Preview
Unable to display preview. Download preview PDF.
References
G. Zoutendijk, Methods of feasible directions (Elsevier, Amsterdam, 1960).
G. Hadley, Non linear and dynamic programming (Addison-Wesley, Reading, MA, 1964).
J.B. Rosen, “The gradient projection method for non linear programming, Part I, Linear constraints”, Journal of the Society for Industrial and Applied Mathematics 8 (1960) 181–217.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 The Mathematical Programming Society
About this chapter
Cite this chapter
Juseret, R. (1978). Long term optimization of electrical system generation by convex programming. In: Balinski, M.L., Lemarechal, C. (eds) Mathematical Programming in Use. Mathematical Programming Studies, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120834
Download citation
DOI: https://doi.org/10.1007/BFb0120834
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00795-8
Online ISBN: 978-3-642-00796-5
eBook Packages: Springer Book Archive