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

被引：42

作者：

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

共 50 条

[1] An interior-point/cutting-plane method to solve unit commitment problems
Madrigal, M
Quintana, VH
[J]. PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON POWER INDUSTRY COMPUTER APPLICATIONS, 1999, : 203 - 209
[2] An interior-point/cutting-plane algorithm to solve the dual unit commitment problem - On dual variables, duality gap, and cost recovery
Madrigal, M
Quintana, VH
[J]. NEXT GENERATION OF ELECTRIC POWER UNIT COMMITMENT MODELS, 2001, 36 : 167 - 184
[3] Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
Alexander Engau
Miguel F. Anjos
Immanuel Bomze
[J]. Mathematical Methods of Operations Research, 2013, 78 : 35 - 59
[4] Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
Engau, Alexander
Anjos, Miguel F.
Bomze, Immanuel
[J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2013, 78 (01) : 35 - 59
[5] A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
Castro, Jordi
Nasini, Stefano
Saldanha-da-Gama, Francisco
[J]. MATHEMATICAL PROGRAMMING, 2017, 163 (1-2) : 411 - 444
[6] A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
Jordi Castro
Stefano Nasini
Francisco Saldanha-da-Gama
[J]. Mathematical Programming, 2017, 163 : 411 - 444
[7] The integration of an interior-point cutting plane method within a branch-and-price algorithm
Samir Elhedhli
Jean-Louis Goffin
[J]. Mathematical Programming, 2004, 100 : 267 - 294
[8] The integration of an interior-point cutting plane method within a branch-and-price algorithm
Elhedhli, S
Goffin, JL
[J]. MATHEMATICAL PROGRAMMING, 2004, 100 (02) : 267 - 294
[9] A Gradient-Based Interior-Point Method to Solve the Many-to-Many Assignment Problems
Das, Nitish
Priya, P. Aruna
[J]. COMPLEXITY, 2019, 2019
[10] An Interior-Point Method for a Class of Saddle-Point Problems
B.V. Halldórsson
R.H. Tütüncü
[J]. Journal of Optimization Theory and Applications, 2003, 116 : 559 - 590

← 1 2 3 4 5 →