摘要
利用图论中的树与线性规划的单纯形法的基之间的一一对应关系,给出了求解可逆流网络模型的判别准则和计算方法。本文提出的算法简捷可行。实用性强。
By the use of the one-by-one corresponding relation between treein graph theory and base of simplex method of linear programming,the cru-cial criterion and algorithm are given for solving the network model withreversible currents.The algorithm given is simple and direct,and has muchpracticability.
出处
《吉林化工学院学报》
CAS
1991年第1期50-56,共7页
Journal of Jilin Institute of Chemical Technology
关键词
数学规划
电子电路
图论
树
mathematical programming
network graph theory
network programming
