Optimization Online


Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming

Ping-Qi Pan (panpq***at***seu.edu.cn)

Abstract: 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.

Keywords: linear programming, bounded-variable, dual face, dual optimal face, Gauss-Jordan elimination

Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )


Download: [PDF]

Entry Submitted: 05/05/2015
Entry Accepted: 05/05/2015
Entry Last Modified: 05/06/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society