摘要
研究讨论了线性规划的“双进基迭代”方法, 说明了此方法不会出现循环的情况. 对于有些线性规划问题的计算比单纯形方法要快捷一些.
In this paper we descride a method to solve the linear programming problem that each time we chose two nonbasic variable to enters the basis and at the same time we induce two basic variable leave the basis by the suitable select this method can prevent the cyclicard may be faster.
出处
《华中师范大学学报(自然科学版)》
CAS
CSCD
北大核心
2000年第4期391-394,共4页
Journal of Central China Normal University:Natural Sciences
关键词
线性规划
双进基迭代法
最优解
linear programming
iterative method of two enter ba sis
optimal solution