| 求解无功优化的线性规划最钝角松弛法 |
| |
| 引用本文： | 李展鹏,刘明波.求解无功优化的线性规划最钝角松弛法[J].湖南工业大学学报,2011,25(1):53-58. |
| |
| 作者姓名： | 李展鹏 刘明波 |
| |
| 作者单位： | 1. 佛山市顺德电力设计院有限公司,广东,佛山,528300
2. 华南理工大学,电力学院,广东,广州,510640 |
| |
| 基金项目： | 国家自然科学基金资助项目（50777021） |
| |
| 摘 要： | 采用最钝角松弛算法求解无功优化问题的线性规划模型,为解决线性化步长调整问题在该模型中增加了信赖域约束。首先,根据最钝角原理定义主元标的概念及其计算公式,计算各个不等式约束的主元标。然后,根据不等式约束的主元标值对其进行筛选,形成一个松弛的线性规划问题,用原始单纯形法对其求解。如果松弛问题的最优解能满足原问题的不等式约束,则直接获得原问题的最优解。否则,将所有剩余的约束条件全部添加到松弛模型中,得到改变约束条件顺序后的原问题,再用对偶单纯形法进行新的求解。该算法本质上是一种2阶段单纯形法,并且第二阶段的求解可以充分利用第一阶段松弛问题的解信息,大大提高第二阶段的计算效率。以5个试验系统和1个省级538节点实际系统为测试系统,通过与单纯形法、信赖域内点法进行比较,验证其有效性。
|
| 关 键 词： | 无功优化 线性规划 信赖域 单纯形法 最钝角松弛算法 |
| 收稿时间： | 2010/11/2 0:00:00 |
A Most-Obtuse-Angle Relaxation Algorithm for Solution of
Linear Programming Model of Reactive-Power Optimization Problem |
| |
| Li Zhanpeng and Liu Mingbo.A Most-Obtuse-Angle Relaxation Algorithm for Solution of
Linear Programming Model of Reactive-Power Optimization Problem[J].Journal of Hnnnan University of Technology,2011,25(1):53-58. |
| |
| Authors: | Li Zhanpeng and Liu Mingbo |
| |
| Affiliation: | Li Zhanpeng1,Liu Mingbo2(1.Shunde Electric Power Design Institute Co.Ltd.Foshan,Foshan Guangdong 528300,China,2.School of Electric Power Engineering,South China University of Technology,Guangzhou 510640,China) |
| |
| Abstract: | Linear programming(LP) model of reactive-power optimization problem is solved by the most-obtuse-angle relaxation algorithm(MRA),in which trust region constraints on linear step sizes are added.Firstly,the concept of pivoting indices and its calculation formulae are defined according to most-obtuse-angle principle,and pivoting indices corresponding to inequality constraints are computed.Then inequality constraints in the original LP model are filtered based on these values of pivoting indices and a relaxed ... |
| |
| Keywords: | reactive-power optimization linear programming trust region simplex method most-obtuse-angle relaxation algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《湖南工业大学学报》浏览原始摘要信息 |
|
点击此处可从《湖南工业大学学报》下载全文 |
|
