--- Job dcmulti Start 08/21/08 21:27:58 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- dcmulti.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/dcmulti.gdx --- dcmulti.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.007 --- dcmulti.gms(123) 4 Mb --- Generating MIP model m --- dcmulti.gms(124) 4 Mb --- 291 rows 549 columns 1,834 non-zeroes --- 75 discrete-columns --- dcmulti.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.016 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 548 columns and 290 rows. 75 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 183976 - 0.01 seconds 0 fixed, 18 tightened bounds, 18 strengthened rows, 0 substitutions 0 fixed, 0 tightened bounds, 18 strengthened rows, 0 substitutions processed model has 224 rows, 500 columns (72 integer) and 1324 elements Pass 1: suminf. 1.04715 obj. 192564 iterations 80 Pass 2: suminf. 1.04715 obj. 192564 iterations 0 Pass 3: suminf. 0.66667 obj. 200142 iterations 26 Pass 4: suminf. 1.00000 obj. 200181 iterations 6 Pass 5: suminf. 2.29512 obj. 201708 iterations 36 Pass 6: suminf. 1.89024 obj. 202163 iterations 11 Pass 7: suminf. 1.89024 obj. 202163 iterations 1 Pass 8: suminf. 0.00000 obj. 202645 iterations 4 Solution found of 202645 Before mini branch and bound, 21 integers at bound fixed and 273 continuous Full problem 224 rows 500 columns, reduced to 152 rows 206 columns - too large Mini branch and bound did not improve solution (0.02 seconds) After 0.02 seconds - Feasibility pump exiting with objective of 2.22045e-16 - took 0.02 seconds Integer solution of 194576 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Full problem 224 rows 500 columns, reduced to 124 rows 260 columns Integer solution of 193138 found by combine solutions after 0 iterations and 0 nodes (0.07 seconds) Integer solution of 192538 found by combine solutions after 3499 iterations and 0 nodes (2.57 seconds) 45 added rows had average density of 155.622 At root node, 45 cuts changed objective from 183985 to 186848 in 66 passes Cut generator 0 (Probing) - 107 row cuts (1 active), 0 column cuts in 0.292 seconds - new frequency is 1 Cut generator 1 (Gomory) - 1696 row cuts (21 active), 0 column cuts in 0.344 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.040 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 57 row cuts (7 active), 0 column cuts in 0.024 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.964 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 169 row cuts (16 active), 0 column cuts in 0.044 seconds - new frequency is -100 After 0 nodes, 1 on tree, 192538 best solution, best possible 186848 (3.27 seconds) Integer solution of 188651 found after 6576 iterations and 78 nodes (5.75 seconds) Full problem 224 rows 500 columns, reduced to 140 rows 314 columns - too large Integer solution of 188644 found after 6962 iterations and 101 nodes (5.99 seconds) Full problem 224 rows 500 columns, reduced to 142 rows 316 columns - too large Integer solution of 188641 found after 6976 iterations and 108 nodes (6.01 seconds) Full problem 224 rows 500 columns, reduced to 144 rows 318 columns - too large Integer solution of 188626 found after 6998 iterations and 118 nodes (6.04 seconds) Full problem 224 rows 500 columns, reduced to 144 rows 318 columns - too large Integer solution of 188619 found after 7007 iterations and 123 nodes (6.05 seconds) Full problem 224 rows 500 columns, reduced to 144 rows 318 columns - too large Integer solution of 188182 found after 7688 iterations and 202 nodes (6.25 seconds) Search completed - best objective 188182, took 7704 iterations and 207 nodes (6.26 seconds) Strong branching done 1290 times (36016 iterations), fathomed 7 nodes and fixed 50 variables Maximum depth 22, 125 variables fixed on reduced cost Cuts at root node changed objective from 183985 to 186848 Probing was tried 234 times and created 154 cuts of which 28 were active after adding rounds of cuts (0.352 seconds) Gomory was tried 127 times and created 1712 cuts of which 32 were active after adding rounds of cuts (0.380 seconds) Knapsack was tried 66 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) Clique was tried 66 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 66 times and created 57 cuts of which 7 were active after adding rounds of cuts (0.024 seconds) FlowCover was tried 66 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.964 seconds) TwoMirCuts was tried 66 times and created 169 cuts of which 16 were active after adding rounds of cuts (0.044 seconds) 70 bounds tightened after postprocessing Result - Finished objective 188182 after 207 nodes and 7704 iterations - took 6.27 seconds (total time 6.28) Total time 6.30 Solved to optimality. MIP solution: 188182 (207 nodes, 6.3 seconds) Best possible: 188182 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- dcmulti.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job dcmulti.gms Stop 08/21/08 21:28:04 elapsed 0:00:06.379