--- Job dcmulti Start 08/24/08 01:42:56 GAMS Rev 227 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 Cbc: elapsed 0:00:00.017 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 183976 - 0.01 seconds Optimal - objective value 183976 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 (8) obj. 192475 iterations 79 Pass 2: suminf. 1.04715 (8) obj. 192475 iterations 0 Pass 3: suminf. 0.66667 (2) obj. 199664 iterations 25 Pass 4: suminf. 1.00000 (2) obj. 199703 iterations 3 Pass 5: suminf. 2.29512 (6) obj. 201303 iterations 36 Pass 6: suminf. 1.89024 (4) obj. 201759 iterations 13 Pass 7: suminf. 1.89024 (4) obj. 201759 iterations 0 Pass 8: suminf. 0.00000 (0) obj. 202240 iterations 5 Solution found of 202240 Before mini branch and bound, 21 integers at bound fixed and 274 continuous Full problem 224 rows 500 columns, reduced to 151 rows 205 columns - too large Mini branch and bound improved solution from 202240 to 202240 (0.02 seconds) Freeing continuous variables gives a solution of 194576 Round again with cutoff of 193517 Pass 9: suminf. 1.04715 (13) obj. 191777 iterations 85 Pass 10: suminf. 1.04715 (13) obj. 191777 iterations 0 Pass 11: suminf. 4.50000 (9) obj. 193517 iterations 66 Pass 12: suminf. 1.00000 (4) obj. 193517 iterations 26 Pass 13: suminf. 0.89564 (4) obj. 193517 iterations 32 Pass 14: suminf. 0.19251 (5) obj. 193517 iterations 18 Pass 15: suminf. 1.50000 (3) obj. 193517 iterations 33 Pass 16: suminf. 1.00000 (3) obj. 193517 iterations 9 Pass 17: suminf. 2.78095 (10) obj. 193517 iterations 54 Pass 18: suminf. 1.30064 (9) obj. 193517 iterations 34 Pass 19: suminf. 1.10434 (11) obj. 193517 iterations 26 Pass 20: suminf. 2.50000 (5) obj. 192385 iterations 41 Pass 21: suminf. 0.66667 (2) obj. 192556 iterations 3 Pass 22: suminf. 0.66667 (2) obj. 192556 iterations 0 Pass 23: suminf. 1.00000 (2) obj. 192595 iterations 1 Pass 24: suminf. 1.96500 (8) obj. 193517 iterations 65 Pass 25: suminf. 1.38667 (5) obj. 193517 iterations 24 Pass 26: suminf. 1.30000 (4) obj. 193517 iterations 13 Pass 27: suminf. 0.66667 (2) obj. 193517 iterations 5 Pass 28: suminf. 1.00000 (2) obj. 193517 iterations 2 No solution found this major pass Before mini branch and bound, 16 integers at bound fixed and 217 continuous Full problem 224 rows 500 columns, reduced to 177 rows 265 columns - too large Mini branch and bound did not improve solution (0.08 seconds) After 0.08 seconds - Feasibility pump exiting with objective of 194576 - took 0.08 seconds Integer solution of 194576 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Full problem 224 rows 500 columns, reduced to 116 rows 252 columns - too large 54 added rows had average density of 144.019 At root node, 54 cuts changed objective from 183985 to 187118 in 63 passes Cut generator 0 (Probing) - 146 row cuts, 0 column cuts (28 active) in 0.156 seconds - new frequency is 1 Cut generator 1 (Gomory) - 2347 row cuts, 0 column cuts (26 active) in 0.244 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 47 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.808 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 355 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is -100 Optimal - objective value 187118 Optimal - objective value 187118 After 0 nodes, 1 on tree, 194576 best solution, best possible 187118 (2.89 seconds) Integer solution of 192644 found after 5488 iterations and 55 nodes (3.35 seconds) Full problem 224 rows 500 columns, reduced to 162 rows 429 columns - too large Integer solution of 188692 found after 6104 iterations and 86 nodes (3.46 seconds) Full problem 224 rows 500 columns, reduced to 173 rows 440 columns - too large Integer solution of 188189 found after 6710 iterations and 131 nodes (3.59 seconds) Full problem 224 rows 500 columns, reduced to 176 rows 443 columns - too large Integer solution of 188182 found after 6758 iterations and 140 nodes (3.62 seconds) Full problem 224 rows 500 columns, reduced to 176 rows 443 columns - too large Search completed - best objective 188182, took 7066 iterations and 197 nodes (3.72 seconds) Strong branching done 150 times (7092 iterations), fathomed 0 nodes and fixed 3 variables Maximum depth 26, 66 variables fixed on reduced cost Cuts at root node changed objective from 183985 to 187118 Probing was tried 161 times and created 294 cuts of which 97 were active after adding rounds of cuts (0.216 seconds) Gomory was tried 142 times and created 2441 cuts of which 92 were active after adding rounds of cuts (0.292 seconds) Knapsack was tried 63 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Clique was tried 63 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) MixedIntegerRounding2 was tried 63 times and created 47 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) FlowCover was tried 63 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.808 seconds) TwoMirCuts was tried 63 times and created 355 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) implication was tried 138 times and created 306 cuts of which 4 were active after adding rounds of cuts 70 bounds tightened after postprocessing Result - Finished objective 188182 after 197 nodes and 7066 iterations - took 3.74 seconds (total time 3.75) Total time 3.77 Solved to optimality. MIP solution: 188182 (197 nodes, 3.77 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/24/08 01:43:00 elapsed 0:00:03.865