I practically use technique like MIP infeasible analysis. It is work. That is why I written "I do not agree". If the problem contains many types of constraints then you have no chance find the contradiction manually. Is not it? I can give you an example.
What about "number of mip instances" do you say? 1 original problem converted to 1 "analysis" problem. Number of integer variables not changed... Could you please explain difficulty more detailed? -----Original Message----- From: Andrew Makhorin [mailto:[EMAIL PROTECTED] Sent: Monday, April 07, 2008 11:25 AM To: [EMAIL PROTECTED] Cc: [email protected] Subject: Re: [Help-glpk] infeasible solution support > Andrew, I do not agree. With what do you not agree? I did not say that it is impossible to determine a minimal/irreducible infeasible system for mip. I only said that this is impractical. It is always possible to minimize the sum of residuals, however, to obtain the minimal/irreducible system one should solve a number of mip instances that makes such analysis impractical in non-trivial cases. _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
