A New Version of the Improved Primal Simplex for Degenerate Linear Programs

, , and

BibTeX reference

The Improved Primal Simplex algorithm IPS [8] is a dynamic constraint reduction method particularly effective on degenerate linear programs. It is able to achieve a reduction in CPU time of over a factor of three on some problems compared to the commercial implementation of the simplex method CPLEX. We present a number of further improvements and effective parameter choices for IPS. On certain types of degenerate problems, our improvements yield CPU times lower than those of CPLEX by a factor of twelve.

, 22 pages

Research Axis


A new version of the improved primal simplex for degenerate linear programs
, , and
Computers & Operations Research, 37(1), 91–98, 2010 BibTeX reference