首页> 外国专利> OPTIMUM POWER FLOW CALCULATING SYSTEM BASED ON NONLINEAR PROGRAMMING METHOD

OPTIMUM POWER FLOW CALCULATING SYSTEM BASED ON NONLINEAR PROGRAMMING METHOD

机译:基于非线性规划方法的最优潮流计算系统

摘要

PROBLEM TO BE SOLVED: To enable quick convergent solution of an unconstrained minimization problem through Newton's method, by calculating a Jacobian matrix in advance through a power equation of the constraint with a demand balance, and by calculating gradient vectors and a Hessian matrix through using the Jacobian matrix.;SOLUTION: After setting initial values (step 1), the unconstrained minimization of an extended Lagrange's function is executed subsequently, to denote the solution thereof by Kk (step 2). The comparisons of the specific values using the solution Xk with a threshold βCk are executed to check violation quantities with respect to an inequality constraint I or an equality constraint J. At this time, after calculating a Jacobian matrix in advance through a power equation of the constraint burdened by a demand balance, it is used to calculate gradient vectors and a Hessian matrix by Newton's method (step 3). Furthermore, by calculating search vectors dk (step 4), a linear search is conducted, and by calculating a step width t, the modifications of variables added by tdk are executed (step 5). Thereby, the optimum solution of a power flow can be calculated in a short time.;COPYRIGHT: (C)2001,JPO
机译:要解决的问题:通过牛顿方法,通过预先计算具有需求平衡的约束的幂方程式的雅可比矩阵,并通过使用来计算梯度矢量和黑森矩阵,以实现对非约束最小化问题的快速收敛解。雅可比矩阵。解决方案:设置初始值(步骤1)后,随后执行扩展Lagrange函数的无约束最小化,以Kk表示其解(步骤2)。执行使用具有阈值βCk的解X k的特定值的比较,以检查关于不等式约束I或等式约束J的违反量。此时,在通过幂方程式预先计算了雅可比矩阵之后在需求平衡负担的约束条件中,通过牛顿法将其用于计算梯度向量和Hessian矩阵(步骤3)。此外,通过计算搜索向量dk(步骤4),进行线性搜索,并且通过计算步长t,执行由tdk添加的变量的修改(步骤5)。因此,可以在短时间内计算出潮流的最优解。;版权所有:(C)2001,日本特许厅

著录项

  • 公开/公告号JP2001016775A

    专利类型

  • 公开/公告日2001-01-19

    原文格式PDF

  • 申请/专利权人 KAWAMURA TAKEO;

    申请/专利号JP19990177974

  • 发明设计人 KAWAMURA TAKEO;

    申请日1999-06-24

  • 分类号H02J3/00;

  • 国家 JP

  • 入库时间 2022-08-22 01:31:05

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号