Share
Electrical Power Unit Commitment: Deterministic and Two-Stage Stochastic Programming Models and Algorithms (Springerbriefs in Energy) (in English)
Yuping Huang; Panos M. Pardalos; Qipeng P. Zheng (Author)
·
Springer
· Paperback
Electrical Power Unit Commitment: Deterministic and Two-Stage Stochastic Programming Models and Algorithms (Springerbriefs in Energy) (in English) - Yuping Huang; Panos M. Pardalos; Qipeng P. Zheng
$ 61.57
$ 64.99
You save: $ 3.42
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Wednesday, July 03 and
Thursday, July 04.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Electrical Power Unit Commitment: Deterministic and Two-Stage Stochastic Programming Models and Algorithms (Springerbriefs in Energy) (in English)"
This entry into the SpringerBriefs in Energy series offers a systematic review of unit commitment (UC) problems in electrical power generation. This book updates texts written in the late 1990s and early 2000s by including both basics of UC models and state-of-the-art models and solution algorithms, where stochastic models and mixed integer programming techniques are emphasizedThe UC problems are mostly formulated as mixed integer linear programs, although there are many variants. Some of the varieties of algorithms have been developed for or applied to UC problems include dynamic programming, Lagrangian relaxation, general mixed integer programming algorithms, and Benders decomposition. This book also 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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.