首页> 外文会议>International Conference on Intelligent Computing(ICIC 2006); 20060816-19; Kunming(CN) >On Auxiliary Algorithm for the Simplex Method by H. Luh and R. Tsaih
【24h】

On Auxiliary Algorithm for the Simplex Method by H. Luh and R. Tsaih

机译:H. Luh和R. Tsaih的单纯形法辅助算法

获取原文
获取原文并翻译 | 示例

摘要

The interesting auxiliary algorithm for simplex method by Luh and Tsaih (Computers and Operations Research 29 (2002)) and its modified version by B. J. Chaderjian and T. Gao (Computers and Operations Research 30 (2003)) present an effective method to start an initial basic feasible solution from an interior feasible solution. We modify the algorithm in the above reference. By using QR decomposition, a much smaller (n - m - k) x (n - m - k) matrix, in stead of a n x n matrix, is handled in kth iteration. The QR factors at each iteration can be obtained from its predecessor cheaply by an updating process. This substantially improve the efficiency of the algorithm proposed by Luh and Tsaih.
机译:Luh和Tsaih(Computers and Operations Research 29(2002))的有趣的单纯形方法辅助算法以及BJ Chaderjian和T. Gao(Computers and Operations Research 30(2003))的改进版本提出了一种有效的方法来启动初始内部可行解的基本可行解。我们在上述参考文献中修改了算法。通过使用QR分解,在第k次迭代中处理了一个较小的(n-m-k)x(n-m-k)矩阵,而不是n x n矩阵。每次迭代的QR因子可以通过更新过程廉价地从其前身获得。这大大提高了Luh和Tsaih提出的算法的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号