期刊文献+

A Variant of the Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming

原文传递
导出
摘要 Using Cholesky factorization, the dual face algorithm was described forsolving standard Linear programming (LP) problems, as it would not be very suitablefor sparse computations. To dodge this drawback, this paper presents a variant usingGauss-Jordan elimination for solving bounded-variable LP problems.
作者 Ping-Qi Pan
出处 《Journal of the Operations Research Society of China》 EI CSCD 2016年第3期347-356,共10页 中国运筹学会会刊(英文)
基金 the National Natural Science Foundation of China(Nos.10871043 and 70971136).
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部