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

[Benedikt Schmidt]

You are damned right, quite a bad mistake. 

Thank you,
Benedikt 

On
Wed, 19 Sep 2012 11:54:34 +0100, John Forrest  wrote: 
Benedikt,

numeric_limits::min() is 2.22507e-308 - you
want

-numeric_limits::max() or -COIN_DBL_MAX

John Forrest 

 On 19/09/12
11:28, 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
[1]
http://list.coin-or.org/mailman/listinfo/clp [2]

 

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