--- Job fac3 Start 09/05/08 08:01:14 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 4 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- fac3.gms(191) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- fac3.gms(186) 3 Mb --- Generating MINLP model m --- fac3.gms(191) 5 Mb --- 34 rows 67 columns 217 non-zeroes --- 555 nl-code 54 nl-non-zeroes --- 12 discrete-columns --- fac3.gms(191) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 GAMS/Bonmin MINLP Solver (Bonmin Library 0.99) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-BB yes bonmin.max_consecutive_infeasible = 3 yes bonmin.nlp_failure_behavior = fathom yes bonmin.num_resolve_at_infeasibles = 1 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 22329872.36023375 24 0.048003 NLP0013I 2 OPT 22332870.48612661 37 0.096006 NLP0013I 3 OPT 26403327.38358495 23 0.048003 NLP0013I 4 OPT 22334318.60483371 24 0.048003 NLP0013I 5 OPT 22335043.44791192 27 0.056004 NLP0013I 6 OPT 22336335.32803604 18 0.036002 NLP0013I 7 OPT 24179680.06795464 17 0.032002 NLP0013I 8 OPT 22331457.08097099 26 0.056004 NLP0013I 9 OPT 22336335.32803404 18 0.036002 NLP0013I 10 OPT 57413807.17871661 16 0.032002 NLP0013I 11 OPT 24611390.14821943 10 0.020001 NLP0013I 12 OPT 28342398.63095935 46 0.120008 NLP0013I 13 OPT 24428258.59272304 12 0.024001 NLP0013I 14 OPT 26879410.41452606 15 0.028001 NLP0013I 15 OPT 24375889.26353601 14 0.028002 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 2.23299e+07 (0.67 seconds) NLP0013I 16 OPT 24611390.14821943 10 0.016001 NLP0013I 17 OPT 26710038.92703094 15 0.028001 NLP0013I 18 OPT 28756357.53255791 8 0.016001 NLP0013I 19 OPT 28759352.22292524 39 0.076004 NLP0013I 20 OPT 28767602.59068814 19 0.040003 NLP0012I Num Status Obj It time NLP0013I 21 OPT 32838182.52827349 28 0.060004 NLP0013I 22 OPT 28761515.99312886 19 0.036002 NLP0013I 23 OPT 30622088.08064116 23 0.040003 NLP0013I 24 OPT 28767602.59068814 19 0.040002 NLP0013I 25 INFEAS 33395542.82366699 23 0.064004 NLP0013I 26 OPT 32854819.78809958 33 0.068005 NLP0013I 27 OPT 32854819.78809958 33 0.072004 NLP0013I 28 OPT 32859572.67122995 55 0.348022 NLP0013I 29 OPT 36447338.1260009 29 0.056004 NLP0012I Num Status Obj It time NLP0013I 1 OPT 36447338.12600024 9 0.020001 Cbc0004I Integer solution of 3.64473e+07 found after 208 iterations and 7 nodes (1.68 seconds) NLP0013I 30 OPT 32838182.52827349 28 0.060004 NLP0013I 31 OPT 32845363.55446271 79 0.580036 NLP0013I 32 INFEAS 34930368.37719604 25 0.060004 NLP0013I 33 OPT 36446717.46800016 25 0.048003 NLP0013I 34 OPT 36446717.46800016 25 0.044003 NLP0013I 2 OPT 36446717.46799885 9 0.016001 Cbc0004I Integer solution of 3.64467e+07 found after 340 iterations and 9 nodes (2.49 seconds) NLP0013I 35 OPT 36432816.48200092 28 0.056004 NLP0013I 3 OPT 36432816.48200355 7 0.012 Cbc0004I Integer solution of 3.64328e+07 found after 368 iterations and 10 nodes (2.56 seconds) NLP0013I 36 OPT 32831379.29514468 19 0.040002 NLP0013I 37 OPT 32835339.91893457 29 0.064004 NLP0013I 38 OPT 36431469.80000041 30 0.060004 NLP0013I 39 INFEAS 33735116.79016536 30 0.076005 NLP0013I 40 OPT 36431469.80000041 30 0.060004 NLP0013I 4 OPT 36431469.80000388 7 0.012001 Cbc0004I Integer solution of 3.64315e+07 found after 446 iterations and 12 nodes (2.89 seconds) NLP0012I Num Status Obj It time NLP0013I 41 OPT 36423806.55200037 20 0.040002 NLP0013I 5 OPT 36423806.55199953 9 0.016001 Cbc0004I Integer solution of 3.64238e+07 found after 466 iterations and 13 nodes (2.95 seconds) NLP0013I 42 OPT 31206513.4018835 49 0.128008 NLP0013I 43 OPT 31214903.5208992 42 0.104006 NLP0013I 44 OPT 31216463.58519647 27 0.056004 NLP0013I 45 OPT 31995143.52400015 44 0.280017 NLP0013I 6 OPT 31995143.52399769 7 0.016001 Cbc0004I Integer solution of 3.19951e+07 found after 628 iterations and 17 nodes (3.54 seconds) NLP0013I 46 INFEAS 40471374.50425187 36 0.108007 Branching on infeasible node, sequence of infeasibles size 1 NLP0013I 47 OPT 31993130.90800024 43 0.104007 NLP0013I 7 OPT 31993130.90799811 9 0.016001 Cbc0004I Integer solution of 3.19931e+07 found after 707 iterations and 19 nodes (3.77 seconds) NLP0013I 48 OPT 31982309.84800036 30 0.064004 NLP0013I 8 OPT 31982309.84799739 7 0.016001 Cbc0004I Integer solution of 3.19823e+07 found after 737 iterations and 20 nodes (3.85 seconds) NLP0013I 49 OPT 30569576.22685569 35 0.080005 NLP0013I 50 OPT 32601818.63887207 42 0.116007 NLP0013I 51 OPT 38310067.34200014 37 0.084005 NLP0013I 52 OPT 57413807.17871661 16 0.032002 NLP0013I 53 INFEAS 34885498.28042215 26 0.068004 NLP0013I 54 INFEAS 34885498.32297262 29 0.076005 NLP0013I 55 INFEAS 40471375.06002685 34 0.148009 NLP0013I 56 INFEAS 34870428.31069518 32 0.096006 NLP0013I 57 INFEAS 40471375.61520871 23 0.056003 NLP0013I 58 INFEAS 20576406.22137081 21 0.060004 Cbc0001I Search completed - best objective 31982309.84799739, took 1032 iterations and 30 nodes (4.69 seconds) Cbc0032I Strong branching done 12 times (558 iterations), fathomed 0 nodes and fixed 3 variables Cbc0035I Maximum depth 7, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 31982309.847997. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 31982309.84799738 7 0.012001 MINLP solution: 31982309.85 (30 nodes, 4.75 seconds) Best possible: 31982309.85 Absolute gap: 3.7253e-09 Relative gap: 1.1648e-16 GAMS/Bonmin finished. --- Restarting execution --- fac3.gms(191) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job fac3.gms Stop 09/05/08 08:01:18 elapsed 0:00:04.860