[Bonmin] Bonmin solution time for a convex MILP of 5000 variables

[Kashif Rashid]

Hi,
I am solving a convex MILP problem with 5000 variables and 5250 linear inequality
constraints with Bonmin. The solution time is over 3 hours (using B-BB and MA57).

Does anyone have experience of solving such high dimensional problems, and in
particular, is aware of the expected solution time? Are there any benchmark tests
that indicate the performance that should be expected?

Any suggestions for potentially speeding up the solution time would be welcome.

Thanks and Regards,
Kashif
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/bonmin/attachments/20120816/b4e95c9d/attachment.html>