--- Job acc-tight-1 Start 07/17/08 09:54:49 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 --- acc-tight-1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-1.gdx --- acc-tight-1.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.025 --- acc-tight-1.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-1.gms(124) 5 Mb --- 2,521 rows 1,621 columns 15,329 non-zeroes --- 1,620 discrete-columns --- acc-tight-1.gms(124) 5 Mb --- Executing Cbc: elapsed 0:00:00.079 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: 1620 columns and 2520 rows. 1620 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 0 - 0.34 seconds processed model has 2520 rows, 1620 columns (1620 integer) and 15327 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 54.72734 obj. 0.411435 iterations 2742 Pass 2: suminf. 43.01427 obj. 0.00095554 iterations 1352 Pass 3: suminf. 36.19843 obj. 0 iterations 1225 Pass 4: suminf. 32.99620 obj. 0 iterations 1058 Pass 5: suminf. 20.20516 obj. 0.0112523 iterations 1078 Pass 6: suminf. 0.00000 obj. 0 iterations 3073 Solution found of 0 Before mini branch and bound, 781 integers at bound fixed and 0 continuous Full problem 2520 rows 1620 columns, reduced to 1736 rows 824 columns - too large Mini branch and bound did not improve solution (3.68 seconds) After 3.68 seconds - Feasibility pump exiting with objective of 0 - took 3.68 seconds Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (3.79 seconds) Full problem 2520 rows 1620 columns, reduced to 0 rows 0 columns Thread 0 used 0 times, waiting to start 0.00307104, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Thread 1 used 0 times, waiting to start 0.000258595, 0 cpu time, 0 locks, 0 locked, 0 waiting for locks Main thread 0 waiting for threads, 1 locks, 7.89191e-06 locked, 2.15042e-06 waiting for locks Search completed - best objective 0, took 0 iterations and 0 nodes (3.83 seconds) Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Finished objective 0 after 0 nodes and 0 iterations - took 4.07 seconds (total time 4.42) Total time 4.44 Solved to optimality. wallclocktime: 4.47136 used seconds: 4.45 MIP solution: 0 (0 nodes, 4.45 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- acc-tight-1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-1.gms Stop 07/17/08 09:54:54 elapsed 0:00:04.589