城市电网规划的一种新方法──拉格朗日松驰法  

New Method of Urban Power Network Programming ──Lagrange Relaxation Method

作　　者：杨期余[1] 刘斌[1] 余景胡 

机构地区：[1]湖南大学电气工程系

出　　处：《湖南大学学报（自然科学版）》1996年第4期99-103,106,共6页Journal of Hunan University:Natural Sciences

摘　　要：采用拉格朗日松驰法处理城市电网规划的难点之一──离散性质的固定费用，把难求解的带固定费用的网络优化问题转化为易求解的线性规划问题，从而弥补了线性化方法和分枝定界法的不足．采用了速度较快的网络流法求解线性规划问题，并把功率最优流向的自动选择巧妙地嵌入到了网络流法中，不会因为人为选定功率流向而导致非最优解．实际计算结果证明了本方法的有效性．The Lagrange relaxation method is used to solve one of difficulties of the urban power network programming──Discrete Fixed Cost. Because the relatively difficult network optimization problem including fixed cost is changed into linear programming problem 'much easier to solve, it can make up the drawback of the linearizing method and the Branch and Bound method. The fast network flow method is presented to solve linear programming problem. The automatic choosing power flow optimal direction is embedded in this method cleverly, so non-optimal solution will not result from power flow direction determined manually. The effectiveness of the mothod is proved by the practical calculation.

关 键 词：城市电网规划 拉格朗日松驰法 离散性 固定费用 

分 类 号：TM715[电气工程—电力系统及自动化]