| 线性规划流动等值面算法 |
| |
| 引用本文： | 燕子宗,费浦生.线性规划流动等值面算法[J].计算数学,2004,26(4):437-444. |
| |
| 作者姓名： | 燕子宗 费浦生 |
| |
| 作者单位： | 1. 武汉大学数学与统计学院,武汉,430072;长江大学信息与数学学院,荆州,434100
2. 武汉大学数学与统计学院,武汉,430072 |
| |
| 基金项目： | 国家自然科学基金(70371032)，高等学校博士学科与专项科研基金(20020486035) |
| |
| 摘 要： | 对于线性规划问题，本文给出了基于流动等值面的等价模型，提出了一种不可行流动等值面算法．新算法保留了传统单纯形算法的优点并克服了它的不足。初步数值结果表明新算法比传统方法更为有效．
|
| 关 键 词： | 新算法 等价模型 数值 单纯形算法 线性规划问题 优点 流动 |
CURRENT EQUIVALENT FACET ALGORITHM FOR LINEAR PROGRAMMING |
| |
| Yan Zizong.CURRENT EQUIVALENT FACET ALGORITHM FOR LINEAR PROGRAMMING[J].Mathematica Numerica Sinica,2004,26(4):437-444. |
| |
| Authors: | Yan Zizong |
| |
| Institution: | Yan Zizong (School of Mathematics and Statistics,Wuhan university; School of Information and Mathematics, Yangtze University, Jingzhou, 434100) Fei Pusheng (School of Mathematics and Statistics,Wuhan university, Wuhan, 430072) |
| |
| Abstract: | 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. |
| |
| Keywords: | Simplex algorithm Linear programming Extreme point Current equivalent facet |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算数学》浏览原始摘要信息 |
| 点击此处可从《计算数学》下载免费的PDF全文 |
