摘要
对于线性规划问题,本文给出了基于流动等值面的等价模型,提出了一种不可行流动等值面算法,新算法保留了传统单纯形算法的优点并克服了它的不足。初步数值结果表明新算法比传统方法更为有效。
This paper, presents an equivalent model of linear programming based on the current equivqlent facet and puts forward to an infeasible current equivqlent facet simplex algorithm for linear programming. Compared with the simplex algorithm, the new algorithm keeps its primary advantagethe and overcomes its disadvantage. The abecedarian numerical computation shows that the new algorithm is more effective than the primary simplex algorithm.
出处
《计算数学》
CSCD
北大核心
2004年第4期437-444,共8页
Mathematica Numerica Sinica
基金
国家自然科学基金(70371032)
高等学校博士学科与专项科研基金(20020486035)
