dual optimal face – Optimization Online

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

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. ArticleDownload View PDF

Generalized Dual Face Algorithm for Linear Programming

Published: 2014/12/21

Ping-Qi Pan

Applications - OR and Management Sciences, Linear Programming dual level face, dual optimal face, linear programming

As a natural extension of the dual simplex algorithm, the dual face algorithm performed remarkably in computational experiments with a set of Netlib standard problems. In this paper, we generalize it to bounded-variable LP problems via local duality. CitationDepartment of Mathematics, Southeast University, Nanjing, 210096, China, 12/2014ArticleDownload View PDF