This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
LPSPS: A New Linear Programming Program
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
LPSPS is a new linear programming program based on the saddle point algorithm which can solve large-scale,sparse linear programming problems. The saddle point algorithm is a new fast iterative method for linear programming. It has been widely used in many fields and shows better performance than other public domain simplex-based programs. Several aspects in the development of the program are described in this article such as the saddle point algorithm, pre-solving, post-solving and the data scaling. At the end of the paper, we compare LPSPS with CPLEX on the NETLIB test set.
Index Terms:
linear programming, the saddle point algorithm, program
Citation:
Zhang Guoguang, "LPSPS: A New Linear Programming Program," csie, vol. 7, pp.765-769, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.