--- Job rlp2 Start 07/18/08 16:01:25 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 --- rlp2.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/rlp2.gdx --- rlp2.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.026 --- rlp2.gms(123) 4 Mb --- Generating MIP model m --- rlp2.gms(124) 4 Mb --- 69 rows 452 columns 5,397 non-zeroes --- 450 discrete-columns --- rlp2.gms(124) 4 Mb --- Executing Cbc: elapsed 0:00:00.041 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" Problem statistics: 451 columns and 68 rows. 450 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is 10.211 - 0.03 seconds 69 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions 136 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 18 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 2 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 66 rows, 295 columns (294 integer) and 4026 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 2.52841 obj. 14 iterations 26 Pass 2: suminf. 0.68750 obj. 18.625 iterations 29 Pass 3: suminf. 0.68750 obj. 18.625 iterations 0 Pass 4: suminf. 0.72727 obj. 18.5455 iterations 3 Pass 5: suminf. 0.72727 obj. 18.5455 iterations 0 Pass 6: suminf. 0.88889 obj. 18.2222 iterations 5 Pass 7: suminf. 0.72727 obj. 18.5455 iterations 3 Pass 8: suminf. 1.46667 obj. 17.4 iterations 10 Pass 9: suminf. 1.46667 obj. 17.4 iterations 6 Pass 10: suminf. 1.58844 obj. 18 iterations 10 Pass 11: suminf. 0.59829 obj. 19.0342 iterations 8 Pass 12: suminf. 0.72727 obj. 17.5455 iterations 7 Pass 13: suminf. 0.12121 obj. 18.7576 iterations 3 Pass 14: suminf. 0.46667 obj. 18.0667 iterations 6 Pass 15: suminf. 0.42424 obj. 18.1515 iterations 4 Pass 16: suminf. 0.72727 obj. 17.5455 iterations 2 Pass 17: suminf. 0.68750 obj. 17.625 iterations 4 Pass 18: suminf. 0.37500 obj. 18.25 iterations 3 Pass 19: suminf. 0.41379 obj. 18.1724 iterations 3 Pass 20: suminf. 0.37500 obj. 18.25 iterations 2 No solution found this major pass Before mini branch and bound, 259 integers at bound fixed and 0 continuous Full problem 66 rows 295 columns, reduced to 39 rows 34 columns Mini branch and bound improved solution from 1.79769e+308 to 19 (0.04 seconds) Round again with cutoff of 18.2523 Pass 20: suminf. 2.52841 obj. 14 iterations 26 Pass 21: suminf. 0.75527 obj. 18.2523 iterations 29 Pass 22: suminf. 0.75527 obj. 18.2523 iterations 0 Pass 23: suminf. 1.27882 obj. 18.2523 iterations 6 Pass 24: suminf. 1.77396 obj. 18.2523 iterations 12 Pass 25: suminf. 0.13595 obj. 18.2523 iterations 7 Pass 26: suminf. 0.40950 obj. 18.2523 iterations 5 Pass 27: suminf. 0.40950 obj. 18.2523 iterations 5 Pass 28: suminf. 0.13595 obj. 18.2523 iterations 3 Pass 29: suminf. 0.40950 obj. 18.2523 iterations 3 Pass 30: suminf. 0.40950 obj. 18.2523 iterations 2 Pass 31: suminf. 0.36672 obj. 18.2523 iterations 9 Pass 32: suminf. 0.36323 obj. 18.2523 iterations 3 Pass 33: suminf. 1.68750 obj. 18.2523 iterations 11 Pass 34: suminf. 1.31250 obj. 18.2523 iterations 2 Pass 35: suminf. 1.65612 obj. 18.2523 iterations 3 Pass 36: suminf. 1.38247 obj. 18.2523 iterations 4 Pass 37: suminf. 2.00000 obj. 18.2523 iterations 9 Pass 38: suminf. 2.00000 obj. 18.2523 iterations 0 Pass 39: suminf. 2.00000 obj. 18.2523 iterations 0 No solution found this major pass Before mini branch and bound, 255 integers at bound fixed and 0 continuous Full problem 66 rows 295 columns, reduced to 40 rows 37 columns Mini branch and bound did not improve solution (0.08 seconds) After 0.08 seconds - Feasibility pump exiting with objective of 19 - took 0.08 seconds Integer solution of 19 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Full problem 66 rows 295 columns, reduced to 0 rows 0 columns 9 added rows had average density of 220.889 At root node, 9 cuts changed objective from 11.5225 to 16.0048 in 100 passes Cut generator 0 (Probing) - 8 row cuts (0 active), 46 column cuts in 3.832 seconds - new frequency is 1 Cut generator 1 (Gomory) - 797 row cuts (8 active), 0 column cuts in 0.132 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 236 row cuts (1 active), 0 column cuts in 0.048 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 169 row cuts (0 active), 0 column cuts in 0.056 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 153 row cuts (0 active), 0 column cuts in 0.100 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 223 row cuts (0 active), 0 column cuts in 0.064 seconds - new frequency is -100 After 0 nodes, 1 on tree, 19 best solution, best possible 16.0048 (4.62 seconds) Thread 0 used 55 times, waiting to start 0.0279017, 1.84411 cpu time, 333 locks, 0.00610671 locked, 0.00100369 waiting for locks Thread 1 used 53 times, waiting to start 0.100476, 1.76811 cpu time, 318 locks, 0.0055337 locked, 0.00133287 waiting for locks Main thread 1.00439 waiting for threads, 228 locks, 0.000405372 locked, 0.00109395 waiting for locks Search completed - best objective 19, took 5134 iterations and 108 nodes (6.50 seconds) Strong branching done 1970 times (19777 iterations), fathomed 3 nodes and fixed 202 variables Maximum depth 21, 1349 variables fixed on reduced cost Cuts at root node changed objective from 11.5225 to 16.0048 Probing was tried 384 times and created 114 cuts of which 22 were active after adding rounds of cuts (11.653 seconds) Gomory was tried 369 times and created 2442 cuts of which 32 were active after adding rounds of cuts (0.428 seconds) Knapsack was tried 378 times and created 1110 cuts of which 43 were active after adding rounds of cuts (0.292 seconds) Clique was tried 300 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 378 times and created 572 cuts of which 31 were active after adding rounds of cuts (0.264 seconds) FlowCover was tried 378 times and created 537 cuts of which 3 were active after adding rounds of cuts (0.420 seconds) TwoMirCuts was tried 300 times and created 669 cuts of which 0 were active after adding rounds of cuts (0.192 seconds) 1 bounds tightened after postprocessing Result - Finished objective 19 after 108 nodes and 5134 iterations - took 7.81 seconds (total time 7.84) Total time 7.85 Solved to optimality. wallclocktime: 7.02067 used seconds: 7.85 MIP solution: 19 (108 nodes, 7.85 seconds) Best possible: 19 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- rlp2.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job rlp2.gms Stop 07/18/08 16:01:32 elapsed 0:00:07.088