Shop : Review copy
Shop
Review copy
48,80 €ISBN 978-3-8440-7916-6Softcover200 pages37 figures296 g21 x 14,8 cmEnglishThesis
March 2021
Lukas Samuel Maxeiner
Dual-based methods for distributed optimization of interconnected systems
This book covers methods of and applications for dual-based distributed optimization.
After the motivation for the use of such methods has been outlined on the basis of numerous examples from different sectors and industries, an overview of the state-of-the-art methods is given. Subsequently, the methods developed during the authors stay at the Process Dynamics and Operations Group at TU Dortmund are explained and compared with the relevant alternatives, before the application of the methods to chemical Verbund sites is discussed.
Finally, the challenges and possible ways of overcoming them are identified and concrete next steps towards an industrial application of dual-based distributed optimization are discussed.
After the motivation for the use of such methods has been outlined on the basis of numerous examples from different sectors and industries, an overview of the state-of-the-art methods is given. Subsequently, the methods developed during the authors stay at the Process Dynamics and Operations Group at TU Dortmund are explained and compared with the relevant alternatives, before the application of the methods to chemical Verbund sites is discussed.
Finally, the challenges and possible ways of overcoming them are identified and concrete next steps towards an industrial application of dual-based distributed optimization are discussed.
Keywords: Distributed optimization; Dual methods; Dual decomposition; Network optimization; Price-based optimization
Schriftenreihe des Lehrstuhls für Systemdynamik und Prozessführung
Edited by Prof. Dr.-Ing. Sebastian Engell, Dortmund
Volume 2021,2
Shaker Verlag GmbH
Am Langen Graben 15a
52353 Düren
Germany
Am Langen Graben 15a
52353 Düren
Germany
Mon. - Thurs. 8:00 a.m. to 4:00 p.m.
Fri. 8:00 a.m. to 3:00 p.m.
Fri. 8:00 a.m. to 3:00 p.m.
Contact us. We will be happy to help you.
