Abstract
This paper presents a convex quadratic programming (CQP) model of the thermal unit commitment (UC) problem based on the recent advancement in mathematics. The proposed model employs convex transformation techniques and is able to achieve the global optimal solution. In the CQP model, the startup cost is represented by using two kinds of binary variables (0–1); the nonconvex constraints, namely the minimum up and down times, are expressed as equivalent linear constraints via a set of linear inequalities; then the nonconvex UC problem is transformed into a convex problem with a quadratic objective function and linear constraints. Comparison studies are carried out based on the results obtained from 20 algorithms applied to 10–60 unit 24‐h systems. The appendices give the details of these results. The CQP model shows unbeatable performance on global optimal searching and arrives at the overall global optimization solution constantly, and so, for the first time, is able to get the globally optimal solution of the UC problem. The proposed CQP formulation serves as a reliable standard reference for various optimization algorithms. © 2017 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEJ Transactions on Electrical and Electronic Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
