Electrical Power Unit Commitment

Yuping Huang

ISBN 10: 1493967665 / ISBN 13: 9781493967667

Published by SPRINGER NATURE Jan 2017, 2017

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -This volume in the SpringerBriefs in Energy series offers a systematic review of unit commitment (UC) problems in electrical power generation. It updates texts written in the late 1990s and early 2000s by including the fundamentals of both UC and state-of-the-art modeling as well as solution algorithms and highlighting stochastic models and mixed-integer programming techniques.The UC problems are mostly formulated as mixed-integer linear programs, although there are many variants. A number of algorithms have been developed for, or applied to, UC problems, including dynamic programming, Lagrangian relaxation, general mixed-integer programming algorithms, and Benders decomposition. In addition the book discusses the recent trends in solving UC problems, especially stochastic programming models, and advanced techniques to handle large numbers of integer- decision variables due to scenario propagation 93 pp. Englisch.

Seller Inventory # 9781493967667

Bibliographic Details

• Title: Electrical Power Unit Commitment
• Publisher: SPRINGER NATURE Jan 2017
• Publication Date: 2017
• Language: English
• ISBN 10: 1493967665
• ISBN 13: 9781493967667
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 238W x 156H x 10D millimeters 238 millimeters width by 156 millimeters height by 10 millimeters depth
• Weight: 183 grams

About this title

Synopsis

This volume in the SpringerBriefs in Energy series offers a systematic review of unit commitment (UC) problems in electrical power generation. It updates texts written in the late 1990s and early 2000s by including the fundamentals of both UC and state-of-the-art modeling as well as solution algorithms and highlighting stochastic models and mixed-integer programming techniques.

The UC problems are mostly formulated as mixed-integer linear programs, although there are many variants. A number of algorithms have been developed for, or applied to, UC problems, including dynamic programming, Lagrangian relaxation, general mixed-integer programming algorithms, and Benders decomposition. In addition the book discusses the recent trends in solving UC problems, especially stochastic programming models, and advanced techniques to handle large numbers of integer- decision variables due to scenario propagation