Optimization Online


Classical Simplex Methods for Linear Programming and Their Developments

Yan Zizong (zzyan***at***jznu.net)
Fei Pusheng (pshfei***at***whu.edu.cn)
Wang Xiaoli (xliwang***at***whuee.edu.cn)

Abstract: This paper presents a new primal dual simplex method and investigates the duality formation implying in classical simplex methods. We reviews classical simplex methods for linear programming problems and give a detail discussion for the relation between modern and classical algorithms. The two modified versions are present. The advantages of the new algorithms are simplicity of implementation, low computational overhead and surprisingly good computational performance. they always proved to be more efficient than classical simplex methods on our test problems.

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

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Citation: 3,School of Information and Mathematics, Yangtze university, Jingzhou, Hubei, China, and School of Mathematics and Statistics, Wuhan university, China. 2004.10.04.

Download: [Postscript][Compressed Postscript][PDF]

Entry Submitted: 10/04/2004
Entry Accepted: 10/04/2004
Entry Last Modified: 11/19/2004

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