Optimization Online


Generalized Dual Face Algorithm for Linear Programming

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

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

Keywords: dual face algorithm, generalization, optimal dual face

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

Category 2: Linear, Cone and Semidefinite Programming

Category 3: Optimization Software and Modeling Systems

Citation: Department of Mathematics, Southeast University, China, 10/2014

Download: [PDF]

Entry Submitted: 10/01/2014
Entry Accepted: 10/02/2014
Entry Last Modified: 10/03/2014

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