Dear All, Recently I read an article about Maros's GDPO algorithm for phase-1 of the dual simplex method. It seems to work quite well for a broad class of problems. Is this already part of CLP or is there an intention to implement it in the near future? Best regards, Rolf Steenge