Hello Andrew,
@ARTICLE{Gondzio94presolveanalysis,
author = {Jacek Gondzio},
title = {Presolve Analysis of Linear Programs Prior to Applying an Interior
Point Method},
journal = {INFORMS Journal on Computing},
year = {1994},
volume = {9},
pages = {73--91}
}
http://www.maths.ed.ac.uk/~gondzio/software/presolve.ps
gives a nice overview of preprocessing for linear programming.
Most of the ideas have already been implemented in GLPK.
According to my understanding the following are not yet implemented in GLPK:
- identify linear dependent rows and columns, especially duplicates
- improving sparsity
Would you consider these preprocessing steps worthwhile to implement?
Best regards
Xypron
--
Neu: GMX De-Mail - Einfach wie E-Mail, sicher wie ein Brief!
Jetzt De-Mail-Adresse reservieren: http://portal.gmx.net/de/go/demail
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
