Journal of the Operations Research Society of China
Special Issue: Continuous Optimization
• Continuous Optimization • Previous Articles Next Articles
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.
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 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jorsc.shu.edu.cn/EN/10.1007/s40305-015-0106-y
https://www.jorsc.shu.edu.cn/EN/Y2016/V4/I3/347
