Thanks Ali. 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?
Regards Kretch On Wed, Jan 14, 2009 at 2:34 PM, Ali Baharev <[email protected]> wrote: > > Do you think that makes sense? > > If i were you i would try the proposal without binary variables. Maybe > it turns out that there is only one violated constraint. > > > *) Each companion variable denotes whether the original debugging > variables > > are bigger than zero. > > Well, i do not know anything about your problem but i am afraid it > would result in a big M formulation. > > If you have thousands of constraints, it would yield thousands of new > binary variables. > > Please do not forget the fact that the conflicting constraints are > ambiguous. > > Please also keep in mind that we are re-inventing the wheel, i.e. > finding the minimal set of conflicting constraints is a well-known > problem. > > Good luck, > > Ali >
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
