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: linear programming, dual level face, dual optimal face

Category 1: Applications -- OR and Management Sciences

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

Citation: Department of Mathematics, Southeast University, Nanjing, 210096, China, 12/2014

Download: [PDF]

Entry Submitted: 12/21/2014
Entry Accepted: 12/22/2014
Entry Last Modified: 12/21/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