Optimization Online


A reduced duality gaps simplex algorithm for linear programming

Yan Zizong (zzyan***at***yangtzeu.edu.cn)

Abstract: In this paper we devise a new version of primal simplex algorithms in which the classical iteration is decomposed two basic operations: the move and the pivot. The move operation decreases the primal objective value and the pivot operation increases the dual objective. We define the condition number of the pivot operation and present a reduced duality gaps pivot rule, acquire a sufficient condition of the strongly polynomial simplex methods for linear programming problems based on the new simplex version.

Keywords: Linear programming, Duality gap, Simplex method, Pivot rule

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

Citation: Report on the school of Information and Mathematics, Yangtzeu university

Download: [Postscript][PDF]

Entry Submitted: 04/12/2007
Entry Accepted: 04/12/2007
Entry Last Modified: 01/22/2009

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 Programming Society