A Variant of the Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming
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, 2016 , 4(3) : 347 . DOI: 10.1007/s40305-015-0106-y
/
| 〈 |
|
〉 |
