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

[Benedikt Schmidt]

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? 

On Wed, 19 Sep 2012 12:35:39 +0200,
Bo Jensen  wrote:  

"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  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 [2]
http://list.coin-or.org/mailman/listinfo/clp
[3]

 

Links:
------
[1] mailto:benediktibk at aon.at
[2]
mailto:Clp at list.coin-or.org
[3]
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/c05fd66e/attachment.html>