<span style=" font-size:10pt;font-family:sans-serif">Hello,</span><br><br><span style=" font-size:10pt;font-family:sans-serif">there seems to
be something going wrong when preprocess=sos (the default) is used, cbc
selecting the wrong branch?</span><br><br><span style=" font-size:10pt;font-family:sans-serif">When preprocess=aggregate
the correct optimal solution is found, also solution time is longer, probably
the</span><br><br><br><span style=" font-size:10pt;font-family:sans-serif">Correct Optimal
Solution:</span><br><br><span style=" font-size:10pt;font-family:sans-serif">$ cbc Problem_25581_0.mps
timemode=elapsed -seconds=400 -keepNames=on -threads=8 -dualt=1e-06 -perturb=on
-pertvalue=61 -constraint=on -cuts=on -clique=forceon -zero=forceon -probing=forceonstrong
-combine=on -combine2=on -ratiogap=0.001 -multiple=8 -preprocess=aggregate
-solve</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Cbc0011I Exiting
as integer gap of 3.0000005e-05 less than 1e-10 or 0.1%</span><br><span style=" font-size:10pt;font-family:sans-serif">Cbc0001I Search
completed - best objective 180.9999999999945, took 1048 iterations and
0 nodes (117.76 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">Cbc0035I Maximum
depth 0, 289 variables fixed on reduced cost</span><br><span style=" font-size:10pt;font-family:sans-serif">Cuts at root node
changed objective from 177 to 181</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing was tried
108 times and created 793 cuts of which 0 were active after adding rounds
of cuts (1152.645 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">Gomory was tried
108 times and created 441 cuts of which 0 were active after adding rounds
of cuts (25.991 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">Knapsack was tried
108 times and created 18 cuts of which 0 were active after adding rounds
of cuts (9.414 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">Clique was tried
108 times and created 0 cuts of which 0 were active after adding rounds
of cuts (0.226 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">MixedIntegerRounding2
was tried 108 times and created 27 cuts of which 0 were active after adding
rounds of cuts (15.430 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">FlowCover was
tried 108 times and created 0 cuts of which 0 were active after adding
rounds of cuts (6.004 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">TwoMirCuts was
tried 108 times and created 1530 cuts of which 0 were active after adding
rounds of cuts (33.287 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">ZeroHalf was tried
108 times and created 27 cuts of which 0 were active after adding rounds
of cuts (67.834 seconds)</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Result - Optimal
solution found (within gap tolerance)</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Objective value:
181.00000000</span><br><span style=" font-size:10pt;font-family:sans-serif">Lower bound:
181.000</span><br><span style=" font-size:10pt;font-family:sans-serif">Gap:
0.00</span><br><span style=" font-size:10pt;font-family:sans-serif">Enumerated nodes:
0</span><br><span style=" font-size:10pt;font-family:sans-serif">Total iterations:
1048</span><br><span style=" font-size:10pt;font-family:sans-serif">Time (CPU seconds):
656.08</span><br><span style=" font-size:10pt;font-family:sans-serif">Time (Wallclock
seconds): 121.02</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Total time (CPU
seconds): 656.23 (Wallclock seconds):
121.18</span><br><br><br><br><br><br><span style=" font-size:10pt;font-family:sans-serif">Wrong Optimal
Solution:</span><br><br><span style=" font-size:10pt;font-family:sans-serif">$ cbc Problem_25581_0.mps
timemode=elapsed -seconds=400 -keepNames=on -threads=8 -dualt=1e-06 -perturb=on
-pertvalue=61 -constraint=on -cuts=on -clique=forceon -zero=forceon -probing=forceonstrong
-combine=on -combine2=on -ratiogap=0.001 -multiple=8 -solve</span><br><span style=" font-size:10pt;font-family:sans-serif">Cbc0011I Exiting
as integer gap of 49802 less than 1e-10 or 0.1%</span><br><span style=" font-size:10pt;font-family:sans-serif">Cbc0001I Search
completed - best objective 1200049979, took 0 iterations and 0 nodes (67.05
seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">Cbc0035I Maximum
depth 0, 0 variables fixed on reduced cost</span><br><span style=" font-size:10pt;font-family:sans-serif">Cuts at root node
changed objective from 1.2e+09 to 1.2e+09</span><br><span style=" font-size:10pt;font-family:sans-serif">Probing was tried
0 times and created 0 cuts of which 0 were active after adding rounds of
cuts (0.000 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">Gomory was tried
0 times and created 0 cuts of which 0 were active after adding rounds of
cuts (0.000 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">Knapsack was tried
0 times and created 0 cuts of which 0 were active after adding rounds of
cuts (0.000 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">Clique was tried
0 times and created 0 cuts of which 0 were active after adding rounds of
cuts (0.000 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">MixedIntegerRounding2
was tried 0 times and created 0 cuts of which 0 were active after adding
rounds of cuts (0.000 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">FlowCover was
tried 0 times and created 0 cuts of which 0 were active after adding rounds
of cuts (0.000 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">TwoMirCuts was
tried 0 times and created 0 cuts of which 0 were active after adding rounds
of cuts (0.000 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">ZeroHalf was tried
0 times and created 0 cuts of which 0 were active after adding rounds of
cuts (0.000 seconds)</span><br><span style=" font-size:10pt;font-family:sans-serif">Cgl0014I Postprocessing
changed objective from 1.20005e+09 to 49979 - possible tolerance issue
- try without preprocessing</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Result - Optimal
solution found (within gap tolerance)</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Objective value:
1200049979.00000000</span><br><span style=" font-size:10pt;font-family:sans-serif">Lower bound:
1200000177.000</span><br><span style=" font-size:10pt;font-family:sans-serif">Gap:
0.00</span><br><span style=" font-size:10pt;font-family:sans-serif">Enumerated nodes:
0</span><br><span style=" font-size:10pt;font-family:sans-serif">Total iterations:
0</span><br><span style=" font-size:10pt;font-family:sans-serif">Time (CPU seconds):
241.92</span><br><span style=" font-size:10pt;font-family:sans-serif">Time (Wallclock
seconds): 72.52</span><br><br><span style=" font-size:10pt;font-family:sans-serif">Total time (CPU
seconds): 242.06 (Wallclock seconds):
72.68</span><br><br><br><br><span style=" font-size:10pt;font-family:sans-serif">Thanks</span><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><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>