首页> 外文期刊>IEEE Transactions on Power Systems >Interior-point linear programming algorithm for auction methods
【24h】

Interior-point linear programming algorithm for auction methods

机译:拍卖方法的内点线性规划算法

获取原文
获取原文并翻译 | 示例

摘要

Interior-point programming (IP) has been applied to many powernsystem problems because of its efficiency for big problems. This papernillustrates application of interior-point linear programming (IPLP) tonauction methods. An extended algorithm of IPLP is developed and used innthis paper. This extended IPLP algorithm can find the exact optimalnsolution (i.e., exact optimal vertex) and can recover the optimal basis.nSensitivity analysis can be performed after the optimal basis is found.nThe sensitivity analysis performed in this paper is increase in the bidnprice and increase in the flow limit of the transmission line. Thisnextended algorithm is expanded from the affine-scaling primal algorithm.nThe concept used in this extended algorithm to find the optimal vertexnand optimal basis is simple
机译:内部点编程(IP)已被用于许多电源系统问题,因为它可以解决大问题。本文阐述了内点线性规划(IPLP)航海方法的应用。本文开发并使用了扩展的IPLP算法。这种扩展的IPLP算法可以找到精确的最优解(即精确的最优顶点)并可以恢复最优基础。n可以在找到最优基础之后进行灵敏度分析。传输线的流量限制。此扩展算法是从仿射缩放原始算法扩展而来的。n在此扩展算法中用于查找最佳顶点和最佳基础的概念很简单

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号