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...
Saved in:
Main Author: | Wim van Ackooij |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2017
|
Subjects: | |
Online Access: | https://doaj.org/article/022951c84a9848a19f51583b8bb53bc1 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the construction of quadratic models for derivative-free trust-region algorithms
by: Adriano Verdério, et al.
Published: (2017) -
A globally convergent algorithm for MPCC
by: Abdeslam Kadrani, et al.
Published: (2015) -
On conditional cuts for stochastic dual dynamic programming
by: W. van Ackooij, et al.
Published: (2020) -
Learning to steer nonlinear interior-point methods
by: Renke Kuhlmann
Published: (2019) -
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
by: Ron Shefi, et al.
Published: (2016)