[Help-glpk] Re: Conflict sets

[Andrew Makhorin]

>How can I find conflict sets when problems are infeasible? For example,
>if I have
>
>x>2 and x<4 and x>5
>
>that problem is infeasible, but if I drop the constraint x<4, it becomes
>feasible, because {x<4, x>5} is a conflict set. Can glpk find conflict
>sets? Or, can I infer conflict sets from problem infeasiblity?

Currently glpk has no features to analyze infeasibility. Therefore to
determine causes of infeasbility some standard ways can only be used
(such as replacing equality constraints by inequalities, introducing
explicit logical variables into violated ineqialities, etc.). Please note
that if you need to analyze the basic solution which is non-optimal, the
lp presolver must be disabled.