[Clp] Use simplex to solve mixed-integer-problem

[Bo Jensen]

"I nailed them down to booleans through upper and lower bounds."

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.

On Wed, Sep 19, 2012 at 12:28 PM, Benedikt Schmidt <benediktibk at aon.at>wrote:

> Hi all,
> at the moment I am trying to solve a mixed-integer problem. Actually the
> integers are not really integers, I nailed them down to booleans through
> upper and lower bounds. The problem is, that the clp can not solve the
> problem, it says "Clp6002E 1 bad bound pairs or bad objectives were found
> -
> first at R0", but the glpk is able to get the right solution. I've reduced
> the problem as much as possible and attached it to this mail.
> Could that be a bug or am I using the interface wrong?
>
> Thanks,
> Benedikt
> _______________________________________________
> Clp mailing list
> Clp at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/clp
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/clp/attachments/20120919/3eb22f08/attachment.html>