<html>
<head>
<style><!--
.hmmessage P
{
margin:0px;
padding:0px
}
body.hmmessage
{
font-size: 12pt;
font-family:Calibri
}
--></style></head>
<body class='hmmessage'><div dir='ltr'>Hello Mario,<div><br></div><div>It will be very nice if that feature exists, I am not aware.</div><div><br></div><div>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.</div><div><br></div><div>If it's linear programming (not hard MILP), I do repeated passes to try to issolate the problem by changing those exorbitant costs.</div><div><br></div><div>But all depends on the structure of the problem.</div><div><br></div><div>Regards</div><div><br><div><hr id="stopSpelling">Date: Wed, 17 Sep 2014 21:03:12 -0300<br>From: mariohsouto@gmail.com<br>To: cbc@list.coin-or.org<br>Subject: [Cbc] Irreducible Inconsistent Subsystem (IIS)<br><br><div dir="ltr">Dear all,<div><br></div><div>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?</div><div><br></div><div>If the answer is no, there is some other feature to deal with infeasibility in Cbc?</div><div><br></div><div><span style="font-family:arial,sans-serif;font-size:12.8000001907349px;">Thanks in advance,</span><br></div><div><span style="font-family:arial,sans-serif;font-size:12.8000001907349px;"><br></span></div><div><span style="font-family:arial,sans-serif;font-size:12.8000001907349px;">Mario Souto.</span></div></div>
<br>_______________________________________________
Cbc mailing list
Cbc@list.coin-or.org
http://list.coin-or.org/mailman/listinfo/cbc</div></div> </div></body>
</html>