<span style=" font-size:10pt;font-family:sans-serif">Hi John,</span><br><br><span style=" font-size:10pt;font-family:sans-serif">thanks for looking
into that.</span><br><span style=" font-size:10pt;font-family:sans-serif">I noticed that
the time spent is always too little, but wasn't sure if that is a real
bug. Glad you found that.</span><br><br><br><span style=" font-size:10pt;font-family:sans-serif">I still have a
test run output on that problem with cplex, which was on another machine,
i guess some cplex 12.x version back then.</span><br><span style=" font-size:10pt;font-family:sans-serif">I'd say your end
solution is relatively near to optimal, as cplex reached optimal as 382710
(in 33 seconds).</span><br><br><br><span style=" font-size:10pt;font-family:sans-serif">Thanks for the
tip with the eventhandler, i'll look into that.</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Any options which
could be a good idea to reduce solve time to anywhere around ~300 seconds?<br>I'd happily try some things if you can point me to something or a good
direction. :-)</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Thank you.</span><br><br><br><br><br><span style=" font-size:10pt;font-family:sans-serif">CPLEX> read
23844-T1_0</span><br><span style=" font-size:10pt;font-family:sans-serif">Selected objective
sense: MINIMIZE</span><br><span style=" font-size:10pt;font-family:sans-serif">Selected objective
name: OBJ</span><br><span style=" font-size:10pt;font-family:sans-serif">Selected RHS
name: RHS1</span><br><span style=" font-size:10pt;font-family:sans-serif">Selected bound
name: BND1</span><br><span style=" font-size:10pt;font-family:sans-serif">Problem '23844-T1_0.mps'
read.</span><br><span style=" font-size:10pt;font-family:sans-serif">Read time = 0.23
sec. (46.52 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">CPLEX> opt</span><br><span style=" font-size:10pt;font-family:sans-serif">Tried aggregator
3 times.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve eliminated
42470 rows and 27224 columns.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve modified
2970 coefficients.</span><br><span style=" font-size:10pt;font-family:sans-serif">Aggregator did
4530 substitutions.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
13575 rows, 13306 columns, and 117592 nonzeros.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
7871 binaries, 0 generals, 0 SOSs, and 0 indicators.</span><br><span style=" font-size:10pt;font-family:sans-serif">Presolve time
= 0.28 sec. (291.99 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Found incumbent
of value 6.1417173e+07 after 0.38 sec. (326.45 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing time =
0.03 sec. (7.70 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Tried aggregator
2 times.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve eliminated
2638 rows and 3354 columns.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve modified
34 coefficients.</span><br><span style=" font-size:10pt;font-family:sans-serif">Aggregator did
2 substitutions.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
10935 rows, 9946 columns, and 67620 nonzeros.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
8637 binaries, 1059 generals, 0 SOSs, and 0 indicators.</span><br><span style=" font-size:10pt;font-family:sans-serif">Presolve time
= 0.14 sec. (132.26 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing time =
0.02 sec. (6.15 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Clique table members:
15956.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP emphasis:
balance optimality and feasibility.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP search method:
dynamic search.</span><br><span style=" font-size:10pt;font-family:sans-serif">Parallel mode:
deterministic, using up to 8 threads.</span><br><span style=" font-size:10pt;font-family:sans-serif">Root relaxation
solution time = 1.03 sec. (699.23 ticks)</span><br><br><span style=" font-size:10pt;font-family:sans-serif">
Nodes
Cuts/</span><br><span style=" font-size:10pt;font-family:sans-serif"> Node
Left Objective IInf Best Integer
Best Bound ItCnt Gap</span><br><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
4.20351e+07 369432.0000
99.12%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 376997.5000 1119 4.20351e+07
376997.5000 30 99.10%</span><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
4.02933e+07 376997.5000
99.06%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 377106.5278 565 4.02933e+07
Cuts: 125 1277 99.06%</span><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
1740037.6667 377106.5278
78.33%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 377209.3421 877 1740037.6667
Cuts: 66 2240 78.32%</span><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
497583.0000 377209.3421
24.19%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 377210.0000 720 497583.0000
Cuts: 54 3172 24.19%</span><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
423436.0000 377210.0000
10.92%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 377313.4091 773 423436.0000
Cuts: 50 3953 10.89%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 377410.0000 456 423436.0000
ZeroHalf: 33 4510 10.87%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 377697.5000 565 423436.0000
ZeroHalf: 40 5416 10.80%</span><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
388340.0000 377697.5000
2.74%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 379711.5625 669 388340.0000
ZeroHalf: 28 7060 2.22%</span><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
387815.0000 379711.5625
2.09%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 379917.6613 806 387815.0000
Cuts: 63 7559 2.04%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 380124.1250 673 387815.0000
Cuts: 67 8145 1.98%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 382454.6500 508 387815.0000
Cuts: 55 8479 1.38%</span><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
382815.0000 382454.6500
0.09%</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Repeating presolve.</span><br><span style=" font-size:10pt;font-family:sans-serif">Tried aggregator
5 times.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve eliminated
6846 rows and 6632 columns.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve added
14 rows and 0 columns.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve modified
337 coefficients.</span><br><span style=" font-size:10pt;font-family:sans-serif">Aggregator did
475 substitutions.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
3607 rows, 2827 columns, and 16429 nonzeros.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
2537 binaries, 90 generals, 0 SOSs, and 0 indicators.</span><br><span style=" font-size:10pt;font-family:sans-serif">Presolve time
= 0.08 sec. (78.55 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing fixed
120 vars, tightened 0 bounds.</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing changed
sense of 19 constraints.</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing time =
0.02 sec. (2.82 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Cover probing
fixed 25 vars, tightened 0 bounds.</span><br><span style=" font-size:10pt;font-family:sans-serif">Tried aggregator
2 times.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve eliminated
404 rows and 451 columns.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve modified
577 coefficients.</span><br><span style=" font-size:10pt;font-family:sans-serif">Aggregator did
68 substitutions.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
3123 rows, 2303 columns, and 12783 nonzeros.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
2217 binaries, 86 generals, 0 SOSs, and 0 indicators.</span><br><span style=" font-size:10pt;font-family:sans-serif">Presolve time
= 0.03 sec. (23.50 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing fixed
8 vars, tightened 0 bounds.</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing changed
sense of 7 constraints.</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing time =
0.00 sec. (2.08 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Tried aggregator
2 times.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve eliminated
45 rows and 19 columns.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP Presolve modified
8 coefficients.</span><br><span style=" font-size:10pt;font-family:sans-serif">Aggregator did
15 substitutions.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
3063 rows, 2269 columns, and 12536 nonzeros.</span><br><span style=" font-size:10pt;font-family:sans-serif">Reduced MIP has
2183 binaries, 86 generals, 0 SOSs, and 0 indicators.</span><br><span style=" font-size:10pt;font-family:sans-serif">Presolve time
= 0.01 sec. (20.33 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Represolve time
= 0.24 sec. (200.68 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing fixed
1 vars, tightened 0 bounds.</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing changed
sense of 1 constraints.</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing time =
0.00 sec. (1.97 ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Clique table members:
6970.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP emphasis:
balance optimality and feasibility.</span><br><span style=" font-size:10pt;font-family:sans-serif">MIP search method:
dynamic search.</span><br><span style=" font-size:10pt;font-family:sans-serif">Parallel mode:
deterministic, using up to 8 threads.</span><br><span style=" font-size:10pt;font-family:sans-serif">Root relaxation
solution time = 0.23 sec. (195.57 ticks)</span><br><br><span style=" font-size:10pt;font-family:sans-serif">
Nodes
Cuts/</span><br><span style=" font-size:10pt;font-family:sans-serif"> Node
Left Objective IInf Best Integer
Best Bound ItCnt Gap</span><br><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
382815.0000 382455.2000
0.09%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 382459.3333 393 382815.0000
382459.3333 8526 0.09%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 382460.0000 389 382815.0000
Cuts: 90 8634 0.09%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 382460.0000 423 382815.0000
Cuts: 34 8684 0.09%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 382460.0000 271 382815.0000
Cuts: 5 8766 0.09%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 0 382460.0000 395 382815.0000
Cuts: 26 9141 0.09%</span><br><span style=" font-size:10pt;font-family:sans-serif">*
0+ 0
382710.0000 382460.0000
0.07%</span><br><span style=" font-size:10pt;font-family:sans-serif">
0 2 382460.0000 139 382710.0000
382520.8500 9141 0.05%</span><br><span style=" font-size:10pt;font-family:sans-serif">Elapsed time =
14.55 sec. (8080.38 ticks, tree = 0.01 MB, solutions = 15)</span><br><span style=" font-size:10pt;font-family:sans-serif">
31 21 382630.3125 303 382710.0000
382520.8500 12397 0.05%</span><br><span style=" font-size:10pt;font-family:sans-serif">
164 86 382627.9558 282 382710.0000
382520.8500 30324 0.05%</span><br><span style=" font-size:10pt;font-family:sans-serif">
292 140 382627.9558 286 382710.0000
382520.8500 50041 0.05%</span><br><span style=" font-size:10pt;font-family:sans-serif">
372 180 382547.5636 275 382710.0000
382520.8500 64456 0.05%</span><br><span style=" font-size:10pt;font-family:sans-serif">
481 233 382611.6667 267 382710.0000
382520.8500 75253 0.05%</span><br><span style=" font-size:10pt;font-family:sans-serif">
600 289 382633.5317 286 382710.0000
382547.8667 89473 0.04%</span><br><span style=" font-size:10pt;font-family:sans-serif">
748 347 cutoff
382710.0000 382560.2667 107733 0.04%</span><br><span style=" font-size:10pt;font-family:sans-serif">
877 424 382676.3393 226 382710.0000
382576.4348 124048 0.03%</span><br><span style=" font-size:10pt;font-family:sans-serif"> 1039
485 382652.2885 237 382710.0000 382577.5000
146785 0.03%</span><br><span style=" font-size:10pt;font-family:sans-serif"> 1758
876 cutoff
382710.0000 382611.6667 239269 0.03%</span><br><span style=" font-size:10pt;font-family:sans-serif">Elapsed time =
20.01 sec. (11210.54 ticks, tree = 3.57 MB, solutions = 15)</span><br><span style=" font-size:10pt;font-family:sans-serif"> 2585
1068 382627.9558 282 382710.0000 382620.5556
318110 0.02%</span><br><span style=" font-size:10pt;font-family:sans-serif"> 3393
1424 382693.9000 181 382710.0000 382627.9558
415392 0.02%</span><br><span style=" font-size:10pt;font-family:sans-serif"> 4310
1842 382627.9558 349 382710.0000 382627.9558
516917 0.02%</span><br><span style=" font-size:10pt;font-family:sans-serif"> 5006
2244 382585.0000 100 382710.0000 382627.9558
620717 0.02%</span><br><span style=" font-size:10pt;font-family:sans-serif"> 5043
46 382646.8500 328 382710.0000
382627.9558 624613 0.02%</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Clique cuts applied:
12</span><br><span style=" font-size:10pt;font-family:sans-serif">Cover cuts applied:
5</span><br><span style=" font-size:10pt;font-family:sans-serif">Mixed integer
rounding cuts applied: 8</span><br><span style=" font-size:10pt;font-family:sans-serif">Zero-half cuts
applied: 170</span><br><span style=" font-size:10pt;font-family:sans-serif">Lift and project
cuts applied: 7</span><br><span style=" font-size:10pt;font-family:sans-serif">Gomory fractional
cuts applied: 33</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Root node processing
(before b&c):</span><br><span style=" font-size:10pt;font-family:sans-serif"> Real time
= 14.53 sec. (8079.98
ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif">Parallel b&c,
8 threads:</span><br><span style=" font-size:10pt;font-family:sans-serif"> Real time
= 19.20 sec. (11312.85
ticks)</span><br><span style=" font-size:10pt;font-family:sans-serif"> Sync time
(average) = 2.06 sec.</span><br><span style=" font-size:10pt;font-family:sans-serif"> Wait time
(average) = 0.02 sec.</span><br><span style=" font-size:10pt;font-family:sans-serif">
------------</span><br><span style=" font-size:10pt;font-family:sans-serif">Total (root+branch&cut)
= 33.73 sec. (19392.83 ticks)</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Solution pool:
19 solutions saved.</span><br><br><span style=" font-size:10pt;font-family:sans-serif">MIP - Integer
optimal, tolerance (0.0001/1e-06): Objective = 3.8271000000e+05</span><br><span style=" font-size:10pt;font-family:sans-serif">Current MIP best
bound = 3.8267319672e+05 (gap = 36.8033, 0.01%)</span><br><span style=" font-size:10pt;font-family:sans-serif">Solution time
= 33.77 sec. Iterations = 659328 Nodes = 5309 (16)</span><br><span style=" font-size:10pt;font-family:sans-serif">Deterministic
time = 19392.96 ticks (574.33 ticks/sec)</span><br><br><br><br><br><br><br><span style=" font-size:10pt;color:#808080;font-family:Arial">Mit freundlichen
Grüßen / Kind regards</span><br><span style=" font-size:12pt;color:#ffbf18;font-family:Calibri">________________________________________</span><br><br><span style=" font-size:12pt;font-family:Arial"><b>Pieter Zieschang</b></span><br><br><span style=" font-size:7pt;font-family:Arial"><b>Modis IT Outsourcing
GmbH</b></span><br><span style=" font-size:7pt;font-family:Arial">Atriumstraße 1, 04315
Leipzig</span><br><br><span style=" font-size:7pt;font-family:Arial">Amtsgericht Düsseldorf:
HRB 78227</span><br><span style=" font-size:7pt;font-family:Arial">Geschäftsführer: Martin
Wimmer, Jörg Brinkmann</span><br><br><a href=https://ito.modis.de/><span style=" font-size:10pt;color:blue;font-family:Arial">ito.modis.de</span></a><br><br><br><br><br><br><br><span style=" font-size:9pt;color:#5f5f5f;font-family:sans-serif">From:
</span><span style=" font-size:9pt;font-family:sans-serif">"John
Forrest" <jjhforrest@gmail.com></span><br><span style=" font-size:9pt;color:#5f5f5f;font-family:sans-serif">To:
</span><span style=" font-size:9pt;font-family:sans-serif">"Pieter
Zieschang" <pieter.zieschang@modis.de></span><br><span style=" font-size:9pt;color:#5f5f5f;font-family:sans-serif">Cc:
</span><span style=" font-size:9pt;font-family:sans-serif">cbc@list.coin-or.org</span><br><span style=" font-size:9pt;color:#5f5f5f;font-family:sans-serif">Date:
</span><span style=" font-size:9pt;font-family:sans-serif">28.01.2020
18:55</span><br><span style=" font-size:9pt;color:#5f5f5f;font-family:sans-serif">Subject:
</span><span style=" font-size:9pt;font-family:sans-serif">Re:
[Cbc] wrong optimal solution - preprocess SOS - preprocess aggregate works
fine</span><br><hr noshade><br><br><br><tt><span style=" font-size:10pt">Pieter,<br><br>There seems to be a minor bug in that the time spent before entering <br>Branch and Bound counts twice against the maximum time limit! So
time <br>in solving it was less than 600 seconds - just 460 Cpu seconds which is
<br>not a lot. Problem still has 23000 rows after preprocessing so is
not <br>going to solve very quickly.<br><br>I have tried a local fix for time problem (needs a bit more thinking to
<br>make some printout better) just solved normally giving ratiogap of 0.001
<br>and 1500 seconds elapsed with 4 cores.<br><br>I had 710059 as solution at root node and 382785 at end.<br><br>Probably you should look at some of the examples using the event handler
<br>to decide when to stop - as that would give you greater control.<br><br>John Forrest<br><br>On 27/01/2020 09:37, Pieter Zieschang wrote:<br>> Hi John,<br>> <br>> Presolve=SOS is working now for most problems i have.<br>> <br>> Except this one <br>> </span></tt><a href="https://mega.nz/#!pvwDCC4A!GQBkhIZxkTdYaasgv_zGJwtIa1xQnWA98zisqsb2G-Q"><tt><span style=" font-size:10pt">https://mega.nz/#!pvwDCC4A!GQBkhIZxkTdYaasgv_zGJwtIa1xQnWA98zisqsb2G-Q</span></tt></a><tt><span style=" font-size:10pt"><br>> <br>> <br>> Seems like it didn't find any solution at all?<br>> Maybe my parameters are too bad.<br>> <br>> <br>> /opt/msp/cbc-trunk-2020-01-24/bin/cbc 23844-T1_0.mps timemode=elapsed
<br>> -seconds=600 -keepNames=on -threads=8 -dualt=1e-06 -perturb=on <br>> -pertvalue=61 -constraint=on -cuts=on -clique=forceon -zero=forceon
<br>> -probing=forceonstrong -combine=on -combine2=on -ratiogap=0.001 <br>> -multiple=8 -preprocess=sos -solve<br>> <br>> ...<br>> <br>> Cbc0012I Integer solution of 1.0045498e+09 found by Multiple root
<br>> solvers after 0 iterations and 0 nodes (334.98 seconds)<br>> Cbc0030I Thread 0 used 0 times, waiting to start 0.54918051,
0 cpu <br>> time, 0 locks, 0 locked, 0 waiting for locks<br>> Cbc0030I Thread 1 used 0 times, waiting to start 0.48254895,
0 cpu <br>> time, 0 locks, 0 locked, 0 waiting for locks<br>> Cbc0030I Thread 2 used 0 times, waiting to start 0.41087604,
0 cpu <br>> time, 0 locks, 0 locked, 0 waiting for locks<br>> Cbc0030I Thread 3 used 0 times, waiting to start 0.34028697,
0 cpu <br>> time, 0 locks, 0 locked, 0 waiting for locks<br>> Cbc0030I Thread 4 used 0 times, waiting to start 0.27142525,
0 cpu <br>> time, 0 locks, 0 locked, 0 waiting for locks<br>> Cbc0030I Thread 5 used 0 times, waiting to start 0.20406055,
0 cpu <br>> time, 0 locks, 0 locked, 0 waiting for locks<br>> Cbc0030I Thread 6 used 0 times, waiting to start 0.13375831,
0 cpu <br>> time, 0 locks, 0 locked, 0 waiting for locks<br>> Cbc0030I Thread 7 used 0 times, waiting to start 0.064822912,
0 cpu <br>> time, 0 locks, 0 locked, 0 waiting for locks<br>> Cbc0030I Main thread 0 waiting for threads, 1 locks, 1.1205673e-05
<br>> locked, 2.1457672e-06 waiting for locks<br>> Cbc0020I Exiting on maximum time<br>> Cbc0005I Partial search - best objective 1.0045498e+09 (best possible
<br>> 376997.5), took 0 iterations and 0 nodes (335.73 seconds)<br>> Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost<br>> Cuts at root node changed objective from 376997 to 376997<br>> Probing was tried 0 times and created 0 cuts of which 0 were active
<br>> after adding rounds of cuts (0.000 seconds)<br>> Gomory was tried 0 times and created 0 cuts of which 0 were active
after <br>> adding rounds of cuts (0.000 seconds)<br>> Knapsack was tried 0 times and created 0 cuts of which 0 were active
<br>> after adding rounds of cuts (0.000 seconds)<br>> Clique was tried 0 times and created 0 cuts of which 0 were active
after <br>> adding rounds of cuts (0.000 seconds)<br>> MixedIntegerRounding2 was tried 0 times and created 0 cuts of which
0 <br>> were active after adding rounds of cuts (0.000 seconds)<br>> FlowCover was tried 0 times and created 0 cuts of which 0 were active
<br>> after adding rounds of cuts (0.000 seconds)<br>> TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active
<br>> after adding rounds of cuts (0.000 seconds)<br>> ZeroHalf was tried 0 times and created 0 cuts of which 0 were active
<br>> after adding rounds of cuts (0.000 seconds)<br>> <br>> Result - Stopped on time limit<br>> <br>> Objective value:
1004549786.00000000<br>> Lower bound:
376997.500<br>> Gap: 2663.61<br>> Enumerated nodes:
0<br>> Total iterations:
0<br>> Time (CPU seconds): 459.71<br>> Time (Wallclock seconds): 341.82<br>> <br>> Total time (CPU seconds): 460.09 (Wallclock
seconds): 342.24<br>> <br>> <br>> Thank you<br>> <br>> <br>> Mit freundlichen Grüßen / Kind regards<br>> ________________________________________<br>> <br>> *Pieter Zieschang*<br>> <br>> *Modis IT Outsourcing GmbH*<br>> Atriumstraße 1, 04315 Leipzig<br>> <br>> Amtsgericht Düsseldorf: HRB 78227<br>> Geschäftsführer: Martin Wimmer, Jörg Brinkmann<br>> <br>> ito.modis.de <</span></tt><a href=https://ito.modis.de/><tt><span style=" font-size:10pt">https://ito.modis.de/</span></tt></a><tt><span style=" font-size:10pt">><br>> <br>> <br>> <br>> <br>> <br>> <br>> From: "John Forrest" <jjhforrest@gmail.com><br>> To: cbc@list.coin-or.org<br>> Date: 24.01.2020 18:57<br>> Subject: Re: [Cbc] wrong optimal solution - preprocess SOS - preprocess
<br>> aggregate works fine<br>> Sent by: "Cbc" <cbc-bounces@coin-or.org><br>> ------------------------------------------------------------------------<br>> <br>> <br>> <br>> Pieter,<br>> <br>> I think I have fixed the problem in trunk.<br>> <br>> With some options, pre-processing tries to move costs from continuous<br>> variables to integer variables - and when it does that the offset
to the<br>> objective will change. It does this before presolving the problem.<br>> Your model has some fixed variables at non-zero values (which would
have<br>> vanished in presolving). There was a section of the code in<br>> CglPreProcess.cpp which got confused and adjusted the objective incorrectly.<br>> <br>> When I ran the problem the solution values produced by the bad code
were<br>> good, but the objective value did not match the correct value.<br>> <br>> I have tested the changes on other models - but if anyone finds they<br>> have problems, add -DSKIP_MOVE_COSTS_TO_INTEGERS to your configure
AND<br>> inform me.<br>> <br>> John Forrest<br>> <br>> <br>> <br>> On 24/01/2020 09:18, Pieter Zieschang wrote:<br>>> Hi Ted,<br>>> <br>>> the version is current trunk, as of January 22th.<br>>> <br>>> <br>>> The problem is available for testing here: <br>>> </span></tt><a href=https://mega.nz/#!c3Y0CA7R!jFnYcFVzcnYSWucZrCIdgb_AQzE5etB1JlySKom1QuE><tt><span style=" font-size:10pt">https://mega.nz/#!c3Y0CA7R!jFnYcFVzcnYSWucZrCIdgb_AQzE5etB1JlySKom1QuE</span></tt></a><tt><span style=" font-size:10pt"><br>>> <br>>> Command is in the post below.<br>>> <br>>> <br>>> I'm not sure if i make it to opening an issue on github today.<br>>> <br>>> <br>>> Thank you<br>>> <br>>> <br>>> Mit freundlichen Grüßen / Kind regards<br>>> ________________________________________<br>>> <br>>> *Pieter Zieschang*<br>>> <br>>> *Modis IT Outsourcing GmbH*<br>>> Atriumstraße 1, 04315 Leipzig<br>>> <br>>> Amtsgericht Düsseldorf: HRB 78227<br>>> Geschäftsführer: Martin Wimmer, Jörg Brinkmann<br>>> <br>>> ito.modis.de <</span></tt><a href=https://ito.modis.de/><tt><span style=" font-size:10pt">https://ito.modis.de/</span></tt></a><tt><span style=" font-size:10pt">><br>>> <br>>> <br>>> <br>>> <br>>> <br>>> <br>>> From: "Ted Ralphs" <ted@lehigh.edu><br>>> To: "Pieter Zieschang" <pieter.zieschang@modis.de><br>>> Cc: "cbc" <cbc@list.coin-or.org><br>>> Date: 24.01.2020 04:36<br>>> Subject: Re: [Cbc] wrong optimal solution - preprocess SOS - preprocess<br>>> aggregate works fine<br>>> ------------------------------------------------------------------------<br>>> <br>>> <br>>> <br>>> Hi Pieter,<br>>> <br>>> Forgive me if I missed something, but what Cbc version? Could
you open<br>>> an issue on Github?<br>>> <br>>> Ted<br>>> <br>>> On Thu, Jan 23, 2020 at 5:23 AM Pieter Zieschang <br>>> <_pieter.zieschang@modis.de_ <</span></tt><a href=mailto:pieter.zieschang@modis.de><tt><span style=" font-size:10pt">mailto:pieter.zieschang@modis.de</span></tt></a><tt><span style=" font-size:10pt">>>
wrote:<br>>> Hello,<br>>> <br>>> there seems to be something going wrong when preprocess=sos (the
<br>>> default) is used, cbc selecting the wrong branch?<br>>> <br>>> When preprocess=aggregate the correct optimal solution is found,
also<br>>> solution time is longer, probably the<br>>> <br>>> <br>>> Correct Optimal Solution:<br>>> <br>>> $ cbc Problem_25581_0.mps timemode=elapsed -seconds=400 -keepNames=on<br>>> -threads=8 -dualt=1e-06 -perturb=on -pertvalue=61 -constraint=on
<br>>> -cuts=on -clique=forceon -zero=forceon -probing=forceonstrong
<br>>> -combine=on -combine2=on -ratiogap=0.001 -multiple=8 <br>>> -preprocess=aggregate -solve<br>>> <br>>> Cbc0011I Exiting as integer gap of 3.0000005e-05 less than 1e-10
or 0.1%<br>>> Cbc0001I Search completed - best objective 180.9999999999945,
took 1048<br>>> iterations and 0 nodes (117.76 seconds)<br>>> Cbc0035I Maximum depth 0, 289 variables fixed on reduced cost<br>>> Cuts at root node changed objective from 177 to 181<br>>> Probing was tried 108 times and created 793 cuts of which 0 were
active<br>>> after adding rounds of cuts (1152.645 seconds)<br>>> Gomory was tried 108 times and created 441 cuts of which 0 were
active<br>>> after adding rounds of cuts (25.991 seconds)<br>>> Knapsack was tried 108 times and created 18 cuts of which 0 were
active<br>>> after adding rounds of cuts (9.414 seconds)<br>>> Clique was tried 108 times and created 0 cuts of which 0 were
active<br>>> after adding rounds of cuts (0.226 seconds)<br>>> MixedIntegerRounding2 was tried 108 times and created 27 cuts
of which 0<br>>> were active after adding rounds of cuts (15.430 seconds)<br>>> FlowCover was tried 108 times and created 0 cuts of which 0 were
active<br>>> after adding rounds of cuts (6.004 seconds)<br>>> TwoMirCuts was tried 108 times and created 1530 cuts of which
0 were<br>>> active after adding rounds of cuts (33.287 seconds)<br>>> ZeroHalf was tried 108 times and created 27 cuts of which 0 were
active<br>>> after adding rounds of cuts (67.834 seconds)<br>>> <br>>> Result - Optimal solution found (within gap tolerance)<br>>> <br>>> Objective value:
181.00000000<br>>> Lower bound: 181.000<br>>> Gap: 0.00<br>>> Enumerated nodes: 0<br>>> Total iterations: 1048<br>>> Time (CPU seconds):
656.08<br>>> Time (Wallclock seconds): 121.02<br>>> <br>>> Total time (CPU seconds): 656.23 (Wallclock
seconds): 121.18<br>>> <br>>> <br>>> <br>>> <br>>> <br>>> Wrong Optimal Solution:<br>>> <br>>> $ cbc Problem_25581_0.mps timemode=elapsed -seconds=400 -keepNames=on<br>>> -threads=8 -dualt=1e-06 -perturb=on -pertvalue=61 -constraint=on
<br>>> -cuts=on -clique=forceon -zero=forceon -probing=forceonstrong
<br>>> -combine=on -combine2=on -ratiogap=0.001 -multiple=8 -solve<br>>> Cbc0011I Exiting as integer gap of 49802 less than 1e-10 or 0.1%<br>>> Cbc0001I Search completed - best objective 1200049979, took 0
iterations<br>>> and 0 nodes (67.05 seconds)<br>>> Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost<br>>> Cuts at root node changed objective from 1.2e+09 to 1.2e+09<br>>> Probing was tried 0 times and created 0 cuts of which 0 were active<br>>> after adding rounds of cuts (0.000 seconds)<br>>> Gomory was tried 0 times and created 0 cuts of which 0 were active
after<br>>> adding rounds of cuts (0.000 seconds)<br>>> Knapsack was tried 0 times and created 0 cuts of which 0 were
active<br>>> after adding rounds of cuts (0.000 seconds)<br>>> Clique was tried 0 times and created 0 cuts of which 0 were active
after<br>>> adding rounds of cuts (0.000 seconds)<br>>> MixedIntegerRounding2 was tried 0 times and created 0 cuts of
which 0<br>>> were active after adding rounds of cuts (0.000 seconds)<br>>> FlowCover was tried 0 times and created 0 cuts of which 0 were
active<br>>> after adding rounds of cuts (0.000 seconds)<br>>> TwoMirCuts was tried 0 times and created 0 cuts of which 0 were
active<br>>> after adding rounds of cuts (0.000 seconds)<br>>> ZeroHalf was tried 0 times and created 0 cuts of which 0 were
active<br>>> after adding rounds of cuts (0.000 seconds)<br>>> Cgl0014I Postprocessing changed objective from 1.20005e+09 to
49979 -<br>>> possible tolerance issue - try without preprocessing<br>>> <br>>> Result - Optimal solution found (within gap tolerance)<br>>> <br>>> Objective value:
1200049979.00000000<br>>> Lower bound: 1200000177.000<br>>> Gap: 0.00<br>>> Enumerated nodes: 0<br>>> Total iterations: 0<br>>> Time (CPU seconds):
241.92<br>>> Time (Wallclock seconds): 72.52<br>>> <br>>> Total time (CPU seconds): 242.06 (Wallclock
seconds): 72.68<br>>> <br>>> <br>>> <br>>> Thanks<br>>> <br>>> <br>>> <br>>> <br>>> <br>>> Mit freundlichen Grüßen / Kind regards<br>>> ________________________________________<br>>> *<br>>> Pieter Zieschang*<br>>> *<br>>> Modis IT Outsourcing GmbH*<br>>> Atriumstraße 1, 04315 Leipzig<br>>> <br>>> Amtsgericht Düsseldorf: HRB 78227<br>>> Geschäftsführer: Martin Wimmer, Jörg Brinkmann<br>>> _<br>>> __ito.modis.de_ <</span></tt><a href=https://ito.modis.de/><tt><span style=" font-size:10pt">https://ito.modis.de/</span></tt></a><tt><span style=" font-size:10pt">><br>>> <br>>> <br>>> Diese E-Mail und alle Anhänge sind vertraulich und für den Adressaten<br>>> bestimmt und können auch privilegiert oder von der Offenlegung
nach<br>>> geltendem Recht ausgenommen sein. Wenn Sie nicht der Adressat
sind oder<br>>> diese E-Mail irrtümlicherweise erhalten haben, benachrichtigen
Sie den<br>>> Absender unverzüglich, löschen Sie die E-Mail aus Ihrem System
und<br>>> kopieren Sie keine Teile dieser E-Mail oder deren Anhänge und
geben Sie<br>>> sie nicht weiter.<br>>> <br>>> This email and any attachments are confidential and intended for
the<br>>> addressee and may also be privileged or exempt from disclosure
under<br>>> applicable law. If you are not the addressee, or have received
this<br>>> email in error, please notify the sender immediately, delete it
from<br>>> your system and do not copy, or disclose or otherwise act upon
any part<br>>> of this email or its attachments.<br>>> _______________________________________________<br>>> Cbc mailing list_<br>>> __Cbc@list.coin-or.org_ <</span></tt><a href="mailto:Cbc@list.coin-or.org"><tt><span style=" font-size:10pt">mailto:Cbc@list.coin-or.org</span></tt></a><tt><span style=" font-size:10pt">>_<br>>> __</span></tt><a href="https://list.coin-or.org/mailman/listinfo/cbc_"><tt><span style=" font-size:10pt">https://list.coin-or.org/mailman/listinfo/cbc_</span></tt></a><tt><span style=" font-size:10pt"><br>>> <br>>> <br>>> -- <br>>> Dr. Ted Ralphs<br>>> Professor, Industrial and Systems Engineering<br>>> Lehigh University<br>>> (610) 628-1280<br>>> ted 'at' lehigh 'dot' edu_<br>>> __coral.ie.lehigh.edu/~ted_ <</span></tt><a href=http://coral.ie.lehigh.edu/~ted><tt><span style=" font-size:10pt">http://coral.ie.lehigh.edu/~ted</span></tt></a><tt><span style=" font-size:10pt">><br>>> <br>>> Diese E-Mail und alle Anhänge sind vertraulich und für den Adressaten<br>>> bestimmt und können auch privilegiert oder von der Offenlegung
nach<br>>> geltendem Recht ausgenommen sein. Wenn Sie nicht der Adressat
sind oder<br>>> diese E-Mail irrtümlicherweise erhalten haben, benachrichtigen
Sie den<br>>> Absender unverzüglich, löschen Sie die E-Mail aus Ihrem System
und<br>>> kopieren Sie keine Teile dieser E-Mail oder deren Anhänge und
geben Sie<br>>> sie nicht weiter.<br>>> <br>>> This email and any attachments are confidential and intended for
the<br>>> addressee and may also be privileged or exempt from disclosure
under<br>>> applicable law. If you are not the addressee, or have received
this<br>>> email in error, please notify the sender immediately, delete it
from<br>>> your system and do not copy, or disclose or otherwise act upon
any part<br>>> of this email or its attachments.<br>>> <br>>> _______________________________________________<br>>> Cbc mailing list<br>>> Cbc@list.coin-or.org<br>>> </span></tt><a href="https://list.coin-or.org/mailman/listinfo/cbc"><tt><span style=" font-size:10pt">https://list.coin-or.org/mailman/listinfo/cbc</span></tt></a><tt><span style=" font-size:10pt"><br>>> <br>> <br>> _______________________________________________<br>> Cbc mailing list<br>> Cbc@list.coin-or.org<br>> </span></tt><a href="https://list.coin-or.org/mailman/listinfo/cbc"><tt><span style=" font-size:10pt">https://list.coin-or.org/mailman/listinfo/cbc</span></tt></a><tt><span style=" font-size:10pt"><br>> <br>> <br>> Diese E-Mail und alle Anhänge sind vertraulich und für den Adressaten
<br>> bestimmt und können auch privilegiert oder von der Offenlegung nach
<br>> geltendem Recht ausgenommen sein. Wenn Sie nicht der Adressat sind
oder <br>> diese E-Mail irrtümlicherweise erhalten haben, benachrichtigen Sie
den <br>> Absender unverzüglich, löschen Sie die E-Mail aus Ihrem System und
<br>> kopieren Sie keine Teile dieser E-Mail oder deren Anhänge und geben
Sie <br>> sie nicht weiter.<br>> <br>> This email and any attachments are confidential and intended for the
<br>> addressee and may also be privileged or exempt from disclosure under
<br>> applicable law. If you are not the addressee, or have received this
<br>> email in error, please notify the sender immediately, delete it from
<br>> your system and do not copy, or disclose or otherwise act upon any
part <br>> of this email or its attachments.<br><br></span></tt><br><br><font face="sans-serif"><div style="color:#968080; font-size: 12px;font-family:Arial">
Diese E-Mail und alle Anhänge sind vertraulich und für den Adressaten bestimmt und können auch privilegiert oder von der Offenlegung nach geltendem Recht ausgenommen sein. Wenn Sie nicht der Adressat sind oder diese E-Mail irrtümlicherweise erhalten haben, benachrichtigen Sie den Absender unverzüglich, löschen Sie die E-Mail aus Ihrem System und kopieren Sie keine Teile dieser E-Mail oder deren Anhänge und geben Sie sie nicht weiter.<br> <br>
This email and any attachments are confidential and intended for the addressee and may also be privileged or exempt from disclosure under applicable law. If you are not the addressee, or have received this email in error, please notify the sender immediately, delete it from your system and do not copy, or disclose or otherwise act upon any part of this email or its attachments.
</div>
</font>