https://hackerpaper.kaipfister.de/p/1412.4504/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=22732183urn:hackerpapers:mention:1412.4504:22732183Mon, 30 Mar 2020 20:53:41 GMT<p>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…</p><p><a href="https://hackerpaper.kaipfister.de/p/1412.4504/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.OC