A comparison of four approaches from stochastic programming for large-scale unit-commitment
In energy management, the unit-commitment problem deals with computing the most cost-efficient production schedule that meets customer load, while satisfying the operational constraints of the units. When the problem is large scale and/or much modelling detail is required, decomposition approaches a...
Guardado en:
Autor principal: | Wim van Ackooij |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/022951c84a9848a19f51583b8bb53bc1 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
On the construction of quadratic models for derivative-free trust-region algorithms
por: Adriano Verdério, et al.
Publicado: (2017) -
A globally convergent algorithm for MPCC
por: Abdeslam Kadrani, et al.
Publicado: (2015) -
On conditional cuts for stochastic dual dynamic programming
por: W. van Ackooij, et al.
Publicado: (2020) -
Learning to steer nonlinear interior-point methods
por: Renke Kuhlmann
Publicado: (2019) -
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
por: Ron Shefi, et al.
Publicado: (2016)