| 线性规划的单纯形法及其发展 |
| |
| 引用本文： | 燕子宗,费浦生,万仲平.线性规划的单纯形法及其发展[J].计算数学,2007,29(1):1-14. |
| |
| 作者姓名： | 燕子宗 费浦生 万仲平 |
| |
| 作者单位： | 1. 长江大学信息与数学学院,湖北荆州,434104
2. 武汉大学数学与统计学院,武汉,430072 |
| |
| 基金项目： | 中国教育部博士基金
,
湖北省教育厅资助项目 |
| |
| 摘 要： | 本文给出了一种新的原对偶单纯形法,并通过它分析了隐藏在经典单纯形法中的对偶信息．我们重新评价经典单纯形法并详细讨论了它与现代单纯形法之间的联系．两个修改版本一并给出．新算法具有计算量小和实施简单等特点,计算效果也不错．初步数值实验表明现代单纯形法比经典方法具有明显的优越性．
|
| 关 键 词： | 对偶间隙 单纯形算法 旋转规则 |
| 修稿时间： | 2004-11-22 |
CLASSICAL SIMPLEX METHODS FOR LINEAR PROGRAMMING AND THEIR DEVELPPMENTS |
| |
| Yan Zizong,Fei Pusheng,Wan Zhongping.CLASSICAL SIMPLEX METHODS FOR LINEAR PROGRAMMING AND THEIR DEVELPPMENTS[J].Mathematica Numerica Sinica,2007,29(1):1-14. |
| |
| Authors: | Yan Zizong Fei Pusheng Wan Zhongping |
| |
| Institution: | School of Information and Mathematics, Yangtze University, Jingzhou 434102, Hubei, China;School of Mathematics and Statistics, Wuhan University, Wuhan 430072, China |
| |
| Abstract: | This paper presents a new primal dual simplex method and investigates the duality formation implying in classical simplex methods. We reviews classical simplex methods for linear programming problems and give a detail discussion for the relation between modern and classical algorithms. The two modified versions are present. The advantages of the new algorithms are simplicity of implementation, low computational overhead and surprisingly good computational performance. They always proved to be more efficient than classical simplex methods on our test problems. |
| |
| Keywords: | duality gap simplex method pivot rule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算数学》浏览原始摘要信息 |
| 点击此处可从《计算数学》下载免费的PDF全文 |
|
