On Wed, 14 Jan 2009, Yaron Kretchmer wrote:
If finding the minimal set of conflicting constraints is a well known problem, are there any solutions provided in GLPK for it? Or is this outside of the scope of GLPK? And if it is, what other tools could be used to find out the minimal set?
Solve with dual simplex. When it gives up, the set of nonbasic constraints plus one violated constaint will usually be *a* minimal set. If there are zeros in the constraint row of the tableau, the corresponding nonbasic constraints need not be included. -- Michael [email protected] "Pessimist: The glass is half empty. Optimist: The glass is half full. Engineer: The glass is twice as big as it needs to be." _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
