A NOTE ON LUH AND TSAIHS ALGORITHM FOR LINEAR PROGRAMMING

摘要：

In this paper, an improved algorithm is presented based on the effective method of starting an initial basic feasible solution from an interior feasible solution which was given by Luh and Teaih. By using QR decomposition,a much smaller matrix is handled in the process. This method substantially improves the efficiency of the traditional algorithms.

关键词： Linear programming Simplez method Projection QR decomposition

作者: ZHONGCHENG ZHANG XUEFENG CAO

作者单位: College of Mathematics and Information Science, Huanggang Normal University, huanggang 438000, China

会议类型: 国际会议

会议名称: The Second International Conference on Information & Systems Sciences(ICISS2008)(第二届信息与系统科学国际会议)

会议地点: 大连

会议语种:英文

页码: 1025-1028

在线出版日期: 2008-12-18（万方平台首次上网日期，不代表论文的发表时间）