Electrical Power Unit Commitment: Deterministic and Two-Stage Stochastic Programming Models and Algorithms. Questo articolo non è disponibile.
Lingua: inglese
Editore: Springer-Verlag New York Inc., 2017
- Brossura
- Nuovo
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Venditore AbeBooks dal 14 giugno 2006
Condizione: Nuovo
EUR 81,47
Descrizione dell’articolo da parte del venditore
New copy - Usually dispatched within 7-11 working days.
Codice articolo B9781493967667
- Titolo
- Electrical Power Unit Commitment: Deterministic and Two-Stage Stochastic Programming Models and Algorithms
- Autore
- Yuping Huang
- Editore
- Springer-Verlag New York Inc.
- Anno di pubblicazione
- 2017
- Condizione
- New
- Rilegatura
- Paperback / softback
- Lingua
- inglese
- ISBN 10
- 1493967665
- ISBN 13
- 9781493967667
- Peso dell'articolo
- 234 grammi
- Serie
- Libro 44 di 80: SpringerBriefs in Energy
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
"Riassunto" può appartenere a un’altra edizione di questo titolo.
Dalla quarta di copertina
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
"Descrizione articolo" può appartenere a un’altra edizione di questo titolo.