Hello Andrew,

I have updated the implementation of duplicate row removal, to correctly set
the status and
the dual values.
http://old.nabble.com/file/p30143969/glpnpp06.c glpnpp06.c 

The current implementation has a worst case time complexity of
O(m^2 * n log(n)) where m the number of rows and n the number of columns)

I am considering to implement the algorithm from
R. E. Bixby and D. K. Wagner
A Note on Detecting Simple Redundancies in Linear Systems,
Operations Research Letters, vol 6, p 15-17, 1987
 ( also Technical Report 86-14, June 1986,
http://www.caam.rice.edu/caam/trs/86/TR86-14.pdf )

Best regards

Xypron

-- 
View this message in context: 
http://old.nabble.com/Preprocessing-tp29947151p30143969.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.


_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk

Reply via email to