An interior-point/cutting-plane method to solve unit commitment problems

被引：43

作者：

Madrigal, M ^{[1
]}

Quintana, VH

机构：

[1] Univ Waterloo, Waterloo, ON N2L 3G1, Canada

[2] Inst Technol Morelia, Morelia, Michoacan, Mexico

[3] Univ Waterloo, Waterloo, ON N2L 3G1, Canada

来源：

IEEE TRANSACTIONS ON POWER SYSTEMS | 2000年 / 15卷 / 03期

关键词：

interior-point methods; Lagrangian relaxation; nondifferentiable optimization; unit commitment;

D O I：

10.1109/59.871728

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 [电气工程]; 0809 [电子科学与技术];

摘要：

An interior-point/cutting-plane method for nondifferentiable optimization is used to solve the dual to a unit commitment problem, The interior-point/cutting-plane method has two advantages over previous approaches, such as the sub-gradient and bundle methods: first, it has better convergence characteristics; and second, does not suffer from the parameter-tunning drawback. The results of a performance testing using systems with up to 104 units confirm the superiority of the interior-point /cutting-plane method over previous approaches.

引用

页码：1022 / 1027

页数：6

共 28 条

[1]

[Anonymous], LOQO USERS MANUAL VE

[2]

EXPERIMENTAL BEHAVIOR OF AN INTERIOR-POINT CUTTING PLANE ALGORITHM FOR CONVEX-PROGRAMMING - AN APPLICATION TO GEOMETRIC-PROGRAMMING [J].