|
|
|
|
LEADER |
02486nmm a2200385 u 4500 |
001 |
EB001345456 |
003 |
EBX01000000000000000899646 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
170203 ||| eng |
020 |
|
|
|a 9781493967681
|
100 |
1 |
|
|a Huang, Yuping
|
245 |
0 |
0 |
|a Electrical Power Unit Commitment
|h Elektronische Ressource
|b Deterministic and Two-Stage Stochastic Programming Models and Algorithms
|c by Yuping Huang, Panos M. Pardalos, Qipeng P. Zheng
|
250 |
|
|
|a 1st ed. 2017
|
260 |
|
|
|a New York, NY
|b Springer US
|c 2017, 2017
|
300 |
|
|
|a VIII, 93 p. 24 illus., 16 illus. in color
|b online resource
|
505 |
0 |
|
|a Introduction -- Deterministic Unit Commitment Models and Algorithms -- Two-Stage Stochastic Programming Models and Algorithms -- Nomenclature -- Renewable Energy Scenario Generation
|
653 |
|
|
|a Mechanical Power Engineering
|
653 |
|
|
|a Operations Research, Management Science
|
653 |
|
|
|a Electric power production
|
653 |
|
|
|a Operations research
|
653 |
|
|
|a Management science
|
653 |
|
|
|a Electrical Power Engineering
|
653 |
|
|
|a Energy policy
|
653 |
|
|
|a Energy Policy, Economics and Management
|
653 |
|
|
|a Energy and state
|
700 |
1 |
|
|a Pardalos, Panos M.
|e [author]
|
700 |
1 |
|
|a Zheng, Qipeng P.
|e [author]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a SpringerBriefs in Energy
|
028 |
5 |
0 |
|a 10.1007/978-1-4939-6768-1
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4939-6768-1?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 333.7
|
520 |
|
|
|a 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
|