<p>So, do I understand this right: Clp can solve stuff which contains integers, but only under certain circumstances? And under these circumstances I will have to use Cbc?</p>
<p>On Wed, 19 Sep 2012 12:35:39 +0200, Bo Jensen <jensen.bo@gmail.com> wrote:</p>
<blockquote style="padding-left: 5px; border-left: #1010ff 2px solid; margin-left: 5px; width: 100%;"><!-- html ignored --><!-- head ignored --><!-- meta ignored -->
<p>"I nailed them down to booleans through upper and lower bounds."<br /><br />That's an binary variable, but still an integer :-) So it can not be solved with simplex unless your matrix is totally modular (and RHS integer too), probably need to use Cbc.<br /><br /></p>
<div class="gmail_quote">On Wed, Sep 19, 2012 at 12:28 PM, Benedikt Schmidt <span><<a href="mailto:benediktibk@aon.at">benediktibk@aon.at</a>></span> wrote:<br />
<blockquote class="gmail_quote" style="margin: 0 0 0 .8ex; border-left: 1px #ccc solid; padding-left: 1ex;">Hi all,<br /> at the moment I am trying to solve a mixed-integer problem. Actually the<br /> integers are not really integers, I nailed them down to booleans through<br /> upper and lower bounds. The problem is, that the clp can not solve the<br /> problem, it says "Clp6002E 1 bad bound pairs or bad objectives were found<br /> -<br /> first at R0", but the glpk is able to get the right solution. I've reduced<br /> the problem as much as possible and attached it to this mail.<br /> Could that be a bug or am I using the interface wrong?<br /><br /> Thanks,<br /> Benedikt<br />_______________________________________________<br /> Clp mailing list<br /><a href="mailto:Clp@list.coin-or.org">Clp@list.coin-or.org</a><br /><a href="http://list.coin-or.org/mailman/listinfo/clp">http://list.coin-or.org/mailman/listinfo/clp</a><br /><br /></blockquote>
</div>
<br /></blockquote>
<p> </p>