Hacker News new | ask | show | jobs
by 7thaccount 2268 days ago
This has the full link:

https://arxiv.org/abs/1412.4504

Unit commitment is the MIP problem that combines linear and integer constraints and tries to determine the least cost set of units to bring online for each hour of the day. Constraints include things like the minimum amount of time the unit has to remain offline before being started up again, the minimum amount of time it has to run once online, how fast it can move (ramp), how much capacity it has..etc. You try to minimize the costs of starting up the unit, the cost of the unit just being online, and energy costs. The economic dispatch problem is much simpler and asks, with the set of units that were given to me by unit commitment, where should I set each one. The commitment problem runs the day ahead at hourly granularity for the next day and is also run periodically throughout the day. The dispatch problem generally runs every 5 minutes 24/7 365. There are also other constraints like not burning down the transmission grid.