Journal of the Operations Research Society of China
所属专题： Continuous Optimization
• • 上一篇 下一篇
出版日期:
发布日期:
Online:
Published:
Abstract:
Using Cholesky factorization, the dual face algorithm was described for solving standard Linear programming (LP) problems, as it would not be very suitable for sparse computations. To dodge this drawback, this paper presents a variant using Gauss-Jordan elimination for solving bounded-variable LP problems.
. [J]. Journal of the Operations Research Society of China, doi: 10.1007/s40305-015-0106-y.
Ping-Qi Pan. A Variant of the Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming[J]. Journal of the Operations Research Society of China, doi: 10.1007/s40305-015-0106-y.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jorsc.shu.edu.cn/CN/10.1007/s40305-015-0106-y
https://www.jorsc.shu.edu.cn/CN/Y2016/V4/I3/347
