A primal-dual infeasible interior point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm. moving through the interior of polytope but not con...A primal-dual infeasible interior point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm. moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size, so providing the potential to dramatically improve the practical computation effectiveness.展开更多
提出了一种大规模电网分层分区无功优化模型及其算法。根据电网解环运行及分层分区管理的特点,采用节点分裂法将电网进行分层分区解耦,即将220 k V与110 k V电网进行分层,110 k V电网分区管理。建立相应的分解协调模型,并通过分解协调...提出了一种大规模电网分层分区无功优化模型及其算法。根据电网解环运行及分层分区管理的特点,采用节点分裂法将电网进行分层分区解耦,即将220 k V与110 k V电网进行分层,110 k V电网分区管理。建立相应的分解协调模型,并通过分解协调内点法进行求解。该方法仅交换子网间少许的边界变量就可以将大系统完全等效解耦,使修正方程仅保留220 k V及以上电压等级主干网部分,从而使问题的求解趋于简便、快速。通过对8个测试算例的仿真分析,结果表明所提模型满足电网分层分区无功优化运行,具有较强的收敛性和快速性。展开更多
基金Supported by the Doctoral Educational Foundation of China of the Ministry of Education(20020486035)
文摘A primal-dual infeasible interior point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm. moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size, so providing the potential to dramatically improve the practical computation effectiveness.
文摘提出了一种大规模电网分层分区无功优化模型及其算法。根据电网解环运行及分层分区管理的特点,采用节点分裂法将电网进行分层分区解耦,即将220 k V与110 k V电网进行分层,110 k V电网分区管理。建立相应的分解协调模型,并通过分解协调内点法进行求解。该方法仅交换子网间少许的边界变量就可以将大系统完全等效解耦,使修正方程仅保留220 k V及以上电压等级主干网部分,从而使问题的求解趋于简便、快速。通过对8个测试算例的仿真分析,结果表明所提模型满足电网分层分区无功优化运行,具有较强的收敛性和快速性。
