--- Job m6 Start 09/06/08 15:03:35 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 5 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- m6.gms(392) 2 Mb --- Starting execution: elapsed 0:00:00.004 --- m6.gms(387) 3 Mb --- Generating MINLP model m --- m6.gms(392) 5 Mb --- 158 rows 87 columns 635 non-zeroes --- 85 nl-code 12 nl-non-zeroes --- 30 discrete-columns --- m6.gms(392) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 GAMS/Bonmin MINLP Solver (Bonmin Library 0.99) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Common Public License (CPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** NLP0012I Num Status Obj It time NLP0013I 1 OPT 1.700074022813877e-10 22 0.044003 Cbc0031I 20 added rows had average density of 44.1 Cbc0013I At root node, 20 cuts changed objective from 0 to 0 in 10 passes Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 233 row cuts, 0 column cuts (20 active) Cbc0014I Cut generator 1 (Probing) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 3 (Cover) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 4 (Clique) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 5 (Flow Covers) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 6 (Outer Approximation decomposition.) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 7 (Outer Approximation feasibility check.) - 0 row cuts, 0 column cuts (0 active) Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.37 seconds) Cbc0010I After 100 nodes, 43 on tree, 1e+50 best solution, best possible 10.606 (2.11 seconds) Cbc0010I After 200 nodes, 58 on tree, 1e+50 best solution, best possible 32.9586 (2.43 seconds) Cbc0010I After 300 nodes, 58 on tree, 1e+50 best solution, best possible 32.9586 (2.63 seconds) Cbc0010I After 400 nodes, 57 on tree, 1e+50 best solution, best possible 32.9586 (2.83 seconds) Cbc0010I After 500 nodes, 58 on tree, 1e+50 best solution, best possible 32.9586 (3.04 seconds) Cbc0010I After 600 nodes, 58 on tree, 1e+50 best solution, best possible 32.9586 (3.20 seconds) Cbc0010I After 700 nodes, 56 on tree, 1e+50 best solution, best possible 32.9586 (3.38 seconds) Cbc0010I After 800 nodes, 57 on tree, 1e+50 best solution, best possible 32.9586 (3.57 seconds) Cbc0010I After 900 nodes, 57 on tree, 1e+50 best solution, best possible 32.9586 (3.76 seconds) Cbc0010I After 1000 nodes, 56 on tree, 1e+50 best solution, best possible 32.9586 (3.94 seconds) Cbc0010I After 1100 nodes, 58 on tree, 1e+50 best solution, best possible 32.9586 (4.11 seconds) OA0003I New best feasible of 129.956 found after 4.18826 sec. Cbc0012I Integer solution of 129.956 found by noonlinear programm after 19198 iterations and 1125 nodes (4.19 seconds) Cbc0010I After 1200 nodes, 71 on tree, 129.956 best solution, best possible 32.9586 (4.36 seconds) Cbc0010I After 1300 nodes, 80 on tree, 129.956 best solution, best possible 44.7899 (4.73 seconds) Cbc0010I After 1400 nodes, 89 on tree, 129.956 best solution, best possible 44.7899 (4.96 seconds) Cbc0010I After 1500 nodes, 105 on tree, 129.956 best solution, best possible 47.5332 (5.21 seconds) Cbc0010I After 1600 nodes, 118 on tree, 129.956 best solution, best possible 47.5332 (5.42 seconds) Cbc0010I After 1700 nodes, 135 on tree, 129.956 best solution, best possible 47.5332 (5.63 seconds) Cbc0010I After 1800 nodes, 140 on tree, 129.956 best solution, best possible 47.5332 (5.80 seconds) Cbc0010I After 1900 nodes, 151 on tree, 129.956 best solution, best possible 47.5332 (6.06 seconds) Cbc0010I After 2000 nodes, 168 on tree, 129.956 best solution, best possible 47.5332 (6.41 seconds) Cbc0010I After 2100 nodes, 174 on tree, 129.956 best solution, best possible 47.5332 (6.64 seconds) OA0003I New best feasible of 82.2855 found after 6.98444 sec. Cbc0010I After 2200 nodes, 193 on tree, 82.2855 best solution, best possible 47.5332 (6.99 seconds) Cbc0012I Integer solution of 82.2855 found by noonlinear programm after 36839 iterations and 2214 nodes (7.00 seconds) Cbc0010I After 2300 nodes, 43 on tree, 82.2855 best solution, best possible 56.8121 (7.28 seconds) Cbc0010I After 2400 nodes, 49 on tree, 82.2855 best solution, best possible 56.8121 (7.62 seconds) OA0003I New best feasible of 82.2569 found after 7.86449 sec. Cbc0012I Integer solution of 82.2569 found by noonlinear programm after 45020 iterations and 2459 nodes (7.86 seconds) Cbc0010I After 2500 nodes, 46 on tree, 82.2569 best solution, best possible 56.8121 (7.97 seconds) Cbc0010I After 2600 nodes, 46 on tree, 82.2569 best solution, best possible 57.4285 (8.24 seconds) Cbc0010I After 2700 nodes, 40 on tree, 82.2569 best solution, best possible 57.4285 (8.56 seconds) Cbc0010I After 2800 nodes, 41 on tree, 82.2569 best solution, best possible 57.4285 (8.86 seconds) Cbc0010I After 2900 nodes, 45 on tree, 82.2569 best solution, best possible 57.4285 (9.21 seconds) Cbc0010I After 3000 nodes, 42 on tree, 82.2569 best solution, best possible 58.9775 (9.60 seconds) Cbc0010I After 3100 nodes, 41 on tree, 82.2569 best solution, best possible 58.9775 (9.93 seconds) Cbc0010I After 3200 nodes, 32 on tree, 82.2569 best solution, best possible 58.9775 (10.28 seconds) Cbc0010I After 3300 nodes, 29 on tree, 82.2569 best solution, best possible 59.2316 (10.63 seconds) Cbc0010I After 3400 nodes, 26 on tree, 82.2569 best solution, best possible 59.2316 (11.02 seconds) Cbc0010I After 3500 nodes, 16 on tree, 82.2569 best solution, best possible 67.0693 (11.37 seconds) Cbc0010I After 3600 nodes, 19 on tree, 82.2569 best solution, best possible 67.0693 (11.63 seconds) Cbc0010I After 3700 nodes, 14 on tree, 82.2569 best solution, best possible 72.3157 (11.98 seconds) Cbc0010I After 3800 nodes, 13 on tree, 82.2569 best solution, best possible 72.3157 (12.30 seconds) Cbc0010I After 3900 nodes, 4 on tree, 82.2569 best solution, best possible 72.6 (12.59 seconds) Cbc0001I Search completed - best objective 82.25687691424582, took 78577 iterations and 3935 nodes (12.69 seconds) Cbc0032I Strong branching done 462 times (11470 iterations), fathomed 1 nodes and fixed 6 variables Cbc0035I Maximum depth 24, 0 variables fixed on reduced cost Mixed Integer Gomory was tried 523 times and created 5025 cuts of which 2272 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 5 times and created 76 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible point. Objective function = 82.256877. Resolve with fixed discrete variables to get dual values. MINLP solution: 82.25687691 (3935 nodes, 12.73 seconds) Best possible: 82.25687691 Absolute gap: 2.1316e-13 Relative gap: 2.5914e-15 GAMS/Bonmin finished. --- Restarting execution --- m6.gms(392) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job m6.gms Stop 09/06/08 15:03:48 elapsed 0:00:13.001