Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming

Published: 2015/05/05, Updated: 2015/05/06

Linear Programming bounded-variable, dual face, dual optimal face, gauss-jordan elimination, linear programming Short URL: https://optimization-online.org/?p=13411

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