coin-or / Cbc.old

This is a mirror of the subversion repository on COIN-OR
https://projects.coin-or.org/Cbc
Other
88 stars 30 forks source link

[Trac #172] Maximum Running Time for Infeasible Problem #38

Open s-c-e opened 5 years ago

s-c-e commented 5 years ago

image

Hello,

I used CbcModel::setMaximumSeconds to set the maximum running time (5-mins) for solving an MILP. When the MILP is feasible (or a feasible solution can be found within the maximum seconds, I guess), the problem can be solved within that running time. However, when the MILP is infeasible, the solver will not return until it determined that the program is infeasible, which takes much longer time than what I wanted. I wonder if there is any option to force the branch and bound solver to return upon the timeout, so that I would be able to take further action with respect to the best possible result.

Thank you.