[Cbc] Irreducible Inconsistent Subsystem (IIS)

[David Ibarra Gómez]

Hello Mario,
It will be very nice if that feature exists, I am not aware.
I think I do it by the "hard way". I do build an auxiliary  problem with artificial slacks for each constraint, I give the slacks exorbitants cost on the objective function I try to find the source of the problem by analizing the non zero slacks. Usually problems give the answer but, sometimes its difficult when several slack variables are not zero.
If it's linear programming (not hard MILP), I do repeated passes to try to issolate the problem by changing those exorbitant costs.
But all depends on the structure of the problem.
Regards
Date: Wed, 17 Sep 2014 21:03:12 -0300
From: mariohsouto at gmail.com
To: cbc at list.coin-or.org
Subject: [Cbc]  Irreducible Inconsistent Subsystem (IIS)

Dear all,
Is there some way of obtaining the Irreducible Inconsistent Subsystem (IIS), i.e. a set of violated constraints which becomes feasible if any member of the IIS is discarded, in Cbc?
If the answer is no, there is some other feature to deal with infeasibility in Cbc?
Thanks in advance,

Mario Souto.

_______________________________________________
Cbc mailing list
Cbc at list.coin-or.org
http://list.coin-or.org/mailman/listinfo/cbc 		 	   		  
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/cbc/attachments/20140921/6c19ea41/attachment.html>