Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming

The dual face algorithm uses Cholesky factorization, as would be not very suitable for sparse computations. The purpose of this paper is to present a dual face algorithm using Gauss-Jordan elimination for solving bounded-variable LP problems.

Article

Download

View Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming