-
Notifications
You must be signed in to change notification settings - Fork 117
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Best solution not reported when stopped on time limit #358
Comments
Dexin,
Definitely looks like a bug. It also looks like a maximization model
(and so it was flipped to a minimization model during the search).
Maybe there is some path the code took which confused it.
Things you could try -
a) send the problem to me and I will see if I can reproduce bug.
b) turn off preprocessing
c) turn it into a minimization problem. You could test that by -
cbc (or clp)input.mps -presolve off -reallyObjectiveScale -1 -export min.mps
cbc min.mps .....
John Forrest
…On 26/01/2021 21:01, Dexin Wang wrote:
I have a MILP that sometimes takes a very long time to solve. So I set a
time limit to the solver (1200 seconds in this case). From the log
(attached below), I see some feasible solutions were found. However,
when the solver stops as the time limit is reached (as expected), the
best solution currently available is not reported. This is the expected
behavior or a bug? Any help is really appreciated.
|Cbc0010I After 3000 nodes, 1337 on tree, 1944379 best solution, best
possible 1911366.5 (1133.55 seconds) Cbc0010I After 3100 nodes, 1269 on
tree, 1944379 best solution, best possible 1911366.5 (1146.47 seconds)
Cbc0010I After 3200 nodes, 1169 on tree, 1944379 best solution, best
possible 1911366.5 (1158.33 seconds) Cbc0010I After 3300 nodes, 1069 on
tree, 1944379 best solution, best possible 1911366.5 (1171.06 seconds)
Cbc0010I After 3400 nodes, 969 on tree, 1944379 best solution, best
possible 1911366.5 (1183.59 seconds) Cbc0020I Exiting on maximum time
Cbc0005I Partial search - best objective 1944379 (best possible
1911366.5), took 17987 iterations and 3496 nodes (1195.81 seconds)
Cbc0032I Strong branching done 2026 times (26893 iterations), fathomed 0
nodes and fixed 0 variables Cbc0035I Maximum depth 1208, 9 variables
fixed on reduced cost Cuts at root node changed objective from
1.89712e+06 to 1.91129e+06 Probing was tried 16 times and created 0 cuts
of which 1390 were active after adding rounds of cuts (1.375 seconds)
Gomory was tried 608 times and created 2742 cuts of which 0 were active
after adding rounds of cuts (49.328 seconds) Knapsack was tried 16 times
and created 0 cuts of which 0 were active after adding rounds of cuts
(0.699 seconds) Clique was tried 16 times and created 0 cuts of which 0
were active after adding rounds of cuts (0.027 seconds)
MixedIntegerRounding2 was tried 608 times and created 669 cuts of which
0 were active after adding rounds of cuts (31.155 seconds) FlowCover was
tried 16 times and created 0 cuts of which 0 were active after adding
rounds of cuts (1.540 seconds) TwoMirCuts was tried 608 times and
created 3623 cuts of which 0 were active after adding rounds of cuts
(23.419 seconds) ZeroHalf was tried 1 times and created 0 cuts of which
0 were active after adding rounds of cuts (0.000 seconds) Result -
Stopped on time limit Objective value:
-100000000000000007629769841091887003294964970946560.00000000 Upper
bound: -1911366.499 Gap:
-52318589899578552273037687760527490690318336.00 Enumerated nodes: 3496
Total iterations: 17987 Time (CPU seconds): 1196.45 Time (Wallclock
seconds): 1218.29 Total time (CPU seconds): 1196.47 (Wallclock seconds):
1218.31 |
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#358>, or unsubscribe
<https://github.com/notifications/unsubscribe-auth/ABWJYHEBIZZES73UUE7J47DS34UTBANCNFSM4WUDL3LQ>.
|
Thanks for the tips.
For the master branch, this doesn't seems to be an issue. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
I have a MILP that sometimes takes a very long time to solve. So I set a time limit to the solver (1200 seconds in this case). From the log (attached below), I see some feasible solutions were found. However, when the solver stops as the time limit is reached (as expected), the best solution currently available is not reported. This is the expected behavior or a bug? Any help is really appreciated.
The text was updated successfully, but these errors were encountered: