Abstract
The numerical results show that the OPF problem can be very satisfactorily solved by developing efficient parallel algorithm based on the multisplitting stategy and using advanced high performance computing tools.
This is a preview of subscription content, log in via an institution to check access.
References
L. Grandinetti, D. Conforti, Numerical Comparisons of Nonlinear Programming Algorithms on Serial and Vector Processors using Automatic Differentiation, Mathematical Programming 42 (1988) 375–389.
V.S. Sunderam, G.A. Geist, J. Dongarra, R. Manchek, The PVM concurrent computing system: Evolution, experiences, and trends, Parallel Computing 20 (1994) 531–545.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Conforti, D., Grandinetti, L., Triki, C. (1996). A parallel algorithm for the optimal power flows problem. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_657
Download citation
DOI: https://doi.org/10.1007/3-540-61142-8_657
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61142-4
Online ISBN: 978-3-540-49955-8
eBook Packages: Springer Book Archive