--- Job misc07 Start 08/21/08 08:29:03 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 --- misc07.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/misc07.gdx --- misc07.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.013 --- misc07.gms(123) 4 Mb --- Generating MIP model m --- misc07.gms(124) 4 Mb --- 213 rows 261 columns 8,621 non-zeroes --- 259 discrete-columns --- misc07.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.032 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 260 columns and 212 rows. 259 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.00.00, build Mar 20 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 1415 - 0.01 seconds 21 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 21 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 211 rows, 232 columns (232 integer) and 8260 elements Objective coefficients multiple of 5 Cutoff increment increased from 1e-05 to 4.995 Pass 1: obj. 8.00000 --> up = 0 , down = 0 -- rand = 16 ( 20) Pass 2: obj. 8.00000 --> up = 0 , down = 16 perturbation applied Pass 3: obj. 53.53571 --> up = 0 , down = 62 Pass 4: obj. 8.28571 --> up = 1 , down = 0 Pass 5: obj. 7.28571 --> up = 2 , down = 0 Pass 6: obj. 5.88571 --> up = 1 , down = 0 Pass 7: obj. 5.41071 --> up = 0 , down = 0 -- rand = 25 ( 25) Pass 8: obj. 17.16667 --> up = 1 , down = 20 Pass 9: obj. 6.33333 --> up = 2 , down = 0 Pass 10: obj. 5.12500 --> up = 0 , down = 0 -- rand = 28 ( 28) Pass 11: obj. 22.16667 --> up = 2 , down = 24 perturbation applied Pass 12: obj. 41.16667 --> up = 0 , down = 48 Pass 13: obj. 7.00000 --> up = 0 , down = 0 -- rand = 11 ( 11) Pass 14: obj. 7.00000 --> up = 0 , down = 11 perturbation applied Pass 15: obj. 34.00000 --> up = 0 , down = 41 Pass 16: obj. 8.00000 --> up = 0 , down = 0 -- rand = 23 ( 23) Pass 17: obj. 15.00000 --> up = 0 , down = 23 perturbation applied Pass 18: obj. 35.66667 --> up = 0 , down = 44 Pass 19: obj. 7.00000 --> up = 5 , down = 0 Pass 20: obj. 5.28000 --> No solution found this major pass Before mini branch and bound, 86 integers at bound fixed and 0 continuous Full problem 211 rows 232 columns, reduced to 211 rows 146 columns - too large Mini branch and bound did not improve solution (0.22 seconds) Full problem 212 rows 232 columns, reduced to 212 rows 232 columns - too large After 0.36 seconds - Feasibility pump exiting - took 0.35 seconds 8 added rows had average density of 230 At root node, 8 cuts changed objective from 1415 to 1470.17 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 1.548 seconds - new frequency is 10 Cut generator 1 (Gomory) - 3267 row cuts (8 active), 0 column cuts in 0.248 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 3 row cuts (0 active), 0 column cuts in 0.084 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 202 row cuts (0 active), 0 column cuts in 0.136 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 1470.17 (3.62 seconds) Full problem 211 rows 232 columns, reduced to 0 rows 0 columns Integer solution of 3165 found by rounding after 6573 iterations and 47 nodes (4.95 seconds) Full problem 211 rows 232 columns, reduced to 4 rows 3 columns Full problem 211 rows 232 columns, reduced to 54 rows 17 columns Full problem 211 rows 232 columns, reduced to 109 rows 36 columns Integer solution of 3135 found by combine solutions after 7266 iterations and 73 nodes (5.43 seconds) Full problem 211 rows 232 columns, reduced to 190 rows 49 columns After 1000 nodes, 293 on tree, 2865 best solution, best possible 2067.68 (28.79 seconds) After 2000 nodes, 571 on tree, 2865 best solution, best possible 2173.75 (42.37 seconds) After 3000 nodes, 873 on tree, 2865 best solution, best possible 2246.05 (49.67 seconds) After 4000 nodes, 1139 on tree, 2865 best solution, best possible 2304.55 (54.51 seconds) After 5000 nodes, 1383 on tree, 2865 best solution, best possible 2341.32 (58.23 seconds) After 6000 nodes, 1590 on tree, 2865 best solution, best possible 2374.64 (61.68 seconds) After 7000 nodes, 1775 on tree, 2865 best solution, best possible 2398.33 (64.71 seconds) Integer solution of 2810 found after 157998 iterations and 7484 nodes (66.06 seconds) Full problem 211 rows 232 columns, reduced to 192 rows 56 columns After 8000 nodes, 1739 on tree, 2810 best solution, best possible 2425.71 (69.22 seconds) After 9000 nodes, 1841 on tree, 2810 best solution, best possible 2450 (71.74 seconds) After 10000 nodes, 1933 on tree, 2810 best solution, best possible 2475 (74.06 seconds) After 11000 nodes, 1965 on tree, 2810 best solution, best possible 2500 (76.32 seconds) After 12000 nodes, 2014 on tree, 2810 best solution, best possible 2522.5 (78.46 seconds) After 13000 nodes, 2074 on tree, 2810 best solution, best possible 2541.67 (80.49 seconds) After 14000 nodes, 2020 on tree, 2810 best solution, best possible 2541.67 (82.11 seconds) After 15000 nodes, 2045 on tree, 2810 best solution, best possible 2563.89 (83.95 seconds) After 16000 nodes, 2070 on tree, 2810 best solution, best possible 2584.44 (85.72 seconds) After 17000 nodes, 2068 on tree, 2810 best solution, best possible 2603.33 (87.42 seconds) After 18000 nodes, 1875 on tree, 2810 best solution, best possible 2603.33 (88.72 seconds) After 19000 nodes, 1874 on tree, 2810 best solution, best possible 2620.71 (90.37 seconds) After 20000 nodes, 1867 on tree, 2810 best solution, best possible 2635.83 (91.95 seconds) After 21000 nodes, 1848 on tree, 2810 best solution, best possible 2648.89 (93.48 seconds) After 22000 nodes, 1649 on tree, 2810 best solution, best possible 2648.89 (94.65 seconds) After 23000 nodes, 1615 on tree, 2810 best solution, best possible 2662.86 (96.16 seconds) After 24000 nodes, 1565 on tree, 2810 best solution, best possible 2676.67 (97.61 seconds) After 25000 nodes, 1494 on tree, 2810 best solution, best possible 2691.67 (99.00 seconds) After 26000 nodes, 1223 on tree, 2810 best solution, best possible 2691.67 (100.06 seconds) After 27000 nodes, 1159 on tree, 2810 best solution, best possible 2709.17 (101.40 seconds) After 28000 nodes, 1064 on tree, 2810 best solution, best possible 2725 (102.65 seconds) After 29000 nodes, 950 on tree, 2810 best solution, best possible 2739.29 (103.81 seconds) After 30000 nodes, 646 on tree, 2810 best solution, best possible 2739.29 (104.77 seconds) After 31000 nodes, 481 on tree, 2810 best solution, best possible 2762.19 (105.87 seconds) After 32000 nodes, 219 on tree, 2810 best solution, best possible 2787.5 (106.84 seconds) Search completed - best objective 2810, took 290650 iterations and 32568 nodes (107.36 seconds) Strong branching done 28978 times (574969 iterations), fathomed 637 nodes and fixed 3373 variables Maximum depth 103, 280426 variables fixed on reduced cost Cuts at root node changed objective from 1415 to 1470.17 Probing was tried 1355 times and created 1347 cuts of which 351 were active after adding rounds of cuts (3.636 seconds) Gomory was tried 3696 times and created 4400 cuts of which 287 were active after adding rounds of cuts (2.444 seconds) Knapsack was tried 100 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.084 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 100 times and created 202 cuts of which 0 were active after adding rounds of cuts (0.136 seconds) Result - Finished objective 2810 after 32568 nodes and 290650 iterations - took 108.70 seconds (total time 108.71) Total time 108.72 Solved to optimality. Writing solution. Objective: 2810 Time: 108.72 s --- Restarting execution --- misc07.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job misc07.gms Stop 08/21/08 08:30:52 elapsed 0:01:49.024