位置:成果数据库 > 期刊 > 期刊详情页
关于Kallio—Porteus的一类线性规划算法的推广
  • 时间:0
  • 分类:O221.1[理学—运筹学与控制论;理学—数学] TP334.2[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]Department of Mathematics, Southeast University, Nanjing 210096, China
  • 相关基金:Acknowledgments. The author would like thank Professor Michael. Saunders for kindly providing us the MINOS 5.51 package. The research is supported by National Natural Science Foundation of China under the Projects 10871043 and 70971136.
作者: 胡剑峰[1]
中文摘要:

最近,计算结果表明了一条所谓的“大距离”的规则和“到另外的主要规则的统治通常在实践使用了的嵌套的定价”的显著优势,例如 Dantzig 的原来的规则,陡峭边的规则干旱 Devex 统治。我们的计算实验证明用这些的联合的单一的算法裁定结果甚至更有效。[从作者抽象]

英文摘要:

Recently, computational results demonstrated remarkable superiority of a so-called "largest-distance" rule and "nested pricing" rule to other major rules commonly used in practice, such as Dantzig's original rule, the steepest-edge rule and Devex rule. Our computational experiments show that the simplex algorithm using a combination of these rules turned out to be even more efficient.

同期刊论文项目
期刊论文 22 会议论文 3 著作 2
同项目期刊论文