Journal article
J. Ostrowski, M.F. Anjos, A. Vannelli
IEEE Transactions on Power Systems, vol. 27(1), 2012, pp. 39-46
IEEE Transactions on Power Systems, vol. 27(1), 2012, pp. 39-46
Semantic Scholar
DOI
Cite
Cite
APA
Click to copy
Ostrowski, J., Anjos, M. F., & Vannelli, A. (2012). Tight mixed integer linear programming formulations for the unit commitment problem. IEEE Transactions on Power Systems, 27(1), 39–46. https://doi.org/10.1109/TPWRS.2011.2162008
Chicago/Turabian
Click to copy
Ostrowski, J., M.F. Anjos, and A. Vannelli. “Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem.” IEEE Transactions on Power Systems 27, no. 1 (2012): 39–46.
MLA
Click to copy
Ostrowski, J., et al. “Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem.” IEEE Transactions on Power Systems, vol. 27, no. 1, 2012, pp. 39–46, doi:10.1109/TPWRS.2011.2162008.
BibTeX Click to copy
@article{j2012a,
title = {Tight mixed integer linear programming formulations for the unit commitment problem},
year = {2012},
issue = {1},
journal = {IEEE Transactions on Power Systems},
pages = {39-46},
volume = {27},
doi = {10.1109/TPWRS.2011.2162008},
author = {Ostrowski, J. and Anjos, M.F. and Vannelli, A.}
}
Abstract
This paper examines the polytope of feasible power generation schedules in the unit commitment (UC) problem. We provide computational results comparing formulations for the UC problem commonly found in the literature. We introduce a new class of inequalities, giving a tighter description of feasible operating schedules for generators. Computational results show that these inequalities can significantly reduce overall solution times.
