A deterministic method for the unit commitment problem in power systems

DOI10.1016/j.cor.2015.01.012zbMath1349.90898OpenAlexW2052585610MaRDI QIDQ342197

Ran Quan, Linfeng Yang, Jin-Bao Jian, Hai-Yan Zheng

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.01.012

zbMATH Keywords

unit commitmentapproximate integer cutcut-and-branch methodgeneralized flow cover inequalitymixed-integer quadratic programming

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Quadratic programming (90C20)

Related Items (3)

Chance constrained unit commitment approximation under stochastic wind energy ⋮ A data mining transmission switching heuristic for post-contingency AC power flow violation reduction in real-world, large-scale systems ⋮ Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages

Uses Software

• TOMLAB

Cites Work

• Cutting planes in integer and mixed integer programming
• Valid inequalities for mixed 0-1 programs
• Min-up/min-down polytopes
• Unnamed Item

This page was built for publication: A deterministic method for the unit commitment problem in power systems