期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Interior-Point Methods Applied to the Predispatch Problem of a Hydroelectric System with Scheduled Line Manipulations
1
作者 Silvia M. S. Carvalho aurelio r. l. oliveira 《American Journal of Operations Research》 2012年第2期266-271,共6页
Transmission line manipulations in a power system are necessary for the execution of preventative or corrective main- tenance in a network, thus ensuring the stability of the system. In this study, primal-dual interio... Transmission line manipulations in a power system are necessary for the execution of preventative or corrective main- tenance in a network, thus ensuring the stability of the system. In this study, primal-dual interior-point methods are used to minimize costs and losses in the generation and transmission of the predispatch active power flow in a hydroelectric system with previously scheduled line manipulations for preventative maintenance, over a period of twenty-four hours. The matrix structure of this problem and the modification that it imposes on the system is also broached in this study. From the computational standpoint, the effort required to solve a problem with or without line manipulations is similar, and the reasons for this are also discussed in this study. Computational results sustain our findings. 展开更多
关键词 INTERIOR-POINT Methods Scheduled LINE MANIPULATIONS Hydroelectric Systems The BRAZILIAN Power System
下载PDF
Optimal Adjustment Algorithm for <i>p</i>Coordinates and The Starting Point in Interior Point Methods
2
作者 Carla T. l. S. Ghidini aurelio r. l. oliveira Jair Silva 《American Journal of Operations Research》 2011年第4期191-202,共12页
Optimal adjustment algorithm for p coordinates is a generalization of the optimal pair adjustment algorithm for linear programming, which in turn is based on von Neumann’s algorithm. Its main advantages are simplicit... Optimal adjustment algorithm for p coordinates is a generalization of the optimal pair adjustment algorithm for linear programming, which in turn is based on von Neumann’s algorithm. Its main advantages are simplicity and quick progress in the early iterations. In this work, to accelerate the convergence of the interior point method, few iterations of this generalized algorithm are applied to the Mehrotra’s heuristic, which determines the starting point for the interior point method in the PCx software. Computational experiments in a set of linear programming problems have shown that this approach reduces the total number of iterations and the running time for many of them, including large-scale ones. 展开更多
关键词 Von Neumann’s ALGORITHM Mehrotra’s HEURISTIC INTERIOR Point Methods Linear Programming
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部