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

[Benedikt Schmidt]

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
-------------- next part --------------
A non-text attachment was scrubbed...
Name: main.cpp
Type: text/x-c
Size: 1784 bytes
Desc: not available
URL: <http://list.coin-or.org/pipermail/clp/attachments/20120919/44c6ea31/attachment.bin>