--- Job m3 Start 09/04/08 02:54:20 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 3 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- m3.gms(144) 2 Mb --- Starting execution: elapsed 0:00:00.003 --- m3.gms(139) 3 Mb --- Generating MINLP model m --- m3.gms(144) 5 Mb --- 44 rows 27 columns 157 non-zeroes --- 43 nl-code 6 nl-non-zeroes --- 6 discrete-columns --- m3.gms(144) 3 Mb --- Executing BONMIN: elapsed 0:00:00.005 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.nlp_failure_behavior = fathom 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 8.999689353682569e-11 22 0.036002 NLP0013I 2 OPT 1.90964987404743 19 0.024001 NLP0013I 3 OPT 1.909649874068229 18 0.020001 NLP0013I 4 OPT 9.000418730405471e-11 19 0.028002 NLP0013I 5 OPT 8.999776255105601e-11 19 0.028002 NLP0013I 6 OPT 4.924918734190864 18 0.024001 NLP0013I 7 OPT 4.924918734194795 19 0.028002 NLP0013I 8 OPT 8.99629084038755e-11 14 0.020001 NLP0013I 9 OPT 9.000295608222224e-11 16 0.024002 NLP0013I 10 OPT 5.292157906700126e-09 15 0.024001 NLP0013I 11 OPT 6.078915886073393e-10 15 0.024002 NLP0013I 12 OPT 8.999921572064332e-11 7 0.012001 NLP0013I 13 OPT 1.826043766904544e-09 15 0.024001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 8.99969e-11 (0.29 seconds) NLP0013I 14 OPT 4.924918734190864 18 0.028002 NLP0013I 15 OPT 6.83456860813738 19 0.028002 NLP0013I 16 OPT 18.33351446671211 25 0.040002 NLP0013I 17 OPT 18.63552233046451 23 0.036002 NLP0013I 18 OPT 41.20099128606522 29 0.044003 NLP0013I 19 OPT 46.65700366375598 27 0.040003 NLP0012I Num Status Obj It time NLP0013I 1 OPT 46.65700366374733 22 0.032002 Cbc0004I Integer solution of 46.657 found after 141 iterations and 6 nodes (0.54 seconds) NLP0013I 20 INFEAS 101.5787630359923 31 0.064004 NLP0012I Num Status Obj It time NLP0013I 21 INFEAS 25158.97157448927 35 0.076004 NLP0013I 22 OPT 18.33351446671213 23 0.032002 NLP0013I 23 INFEAS 78415.41556282132 35 0.072004 NLP0013I 24 OPT 22.71310761778273 31 0.040002 NLP0013I 25 INFEAS 4178.913877727905 32 0.068004 NLP0013I 26 INFEAS 8261.102131863539 29 0.064004 NLP0013I 27 OPT 34.80000000024268 19 0.028002 NLP0013I 28 OPT 39.38274168774035 21 0.032002 NLP0013I 29 OPT 44.80000000024926 22 0.036002 NLP0013I 30 OPT 67.49693845689242 20 0.024002 NLP0013I 31 INFEAS 44916.11438538217 32 0.064004 NLP0013I 32 INFEAS 2638.359003422518 32 0.068005 NLP0013I 33 OPT 39.23167672536498 30 0.044002 NLP0013I 34 OPT 59.50847603916134 23 0.032002 NLP0013I 35 OPT 49.80000001011941 18 0.024001 NLP0013I 36 OPT 6.834568608000881 18 0.024002 NLP0013I 37 INFEAS 3996.206043893812 30 0.060004 NLP0013I 38 OPT 6.83456860813067 19 0.024001 NLP0013I 39 OPT 12.18570786672902 23 0.032002 NLP0013I 40 OPT 40.57680045384716 24 0.036003 NLP0012I Num Status Obj It time NLP0013I 41 INFEAS 964.7317621829859 27 0.056003 NLP0013I 42 INFEAS 4069.563184101462 38 0.072005 NLP0013I 43 OPT 16.54915347318488 26 0.036002 NLP0013I 44 INFEAS 11773.76277862115 29 0.060004 NLP0013I 45 INFEAS 988.0025787869236 28 0.056004 NLP0013I 46 OPT 19.35619386447754 19 0.028002 NLP0013I 47 OPT 25.90288347402595 18 0.032002 NLP0013I 48 OPT 37.80000000045194 19 0.028001 NLP0013I 2 OPT 37.80000000073485 19 0.028002 Cbc0004I Integer solution of 37.8 found after 892 iterations and 35 nodes (1.92 seconds) NLP0013I 49 OPT 46.30631377178871 23 0.036002 NLP0013I 50 OPT 41.20099128577501 29 0.044003 NLP0013I 51 OPT 4.924918734194795 19 0.028002 NLP0013I 52 OPT 4.924918733749052 18 0.024002 NLP0013I 53 OPT 12.18570786672879 23 0.036002 NLP0013I 54 OPT 12.18570786672881 24 0.036002 NLP0013I 55 OPT 66.15360090750524 22 0.032002 NLP0013I 56 INFEAS 3396.165993022541 31 0.064004 NLP0013I 57 OPT 12.18570786672873 24 0.036002 NLP0013I 58 INFEAS 2167.192875445626 30 0.060004 NLP0013I 59 OPT 14.25817674274142 21 0.028002 NLP0013I 60 INFEAS 9585.165222779817 29 0.060004 NLP0012I Num Status Obj It time NLP0013I 61 INFEAS 18383.03429335478 30 0.064004 NLP0013I 62 INFEAS 42280.65741054308 33 0.072004 NLP0013I 63 OPT 9.697922058271839 18 0.028002 NLP0013I 64 OPT 25.19176829062771 31 0.048003 NLP0013I 65 OPT 25.19176829062365 31 0.040003 NLP0013I 66 OPT 54.26464789926853 23 0.032002 NLP0013I 67 OPT 25.19176829063459 31 0.044003 NLP0013I 68 INFEAS 5331.767370775906 31 0.064004 NLP0013I 69 INFEAS 4610.732564983096 28 0.060003 NLP0013I 70 INFEAS 11418.78270583931 32 0.068005 NLP0013I 71 OPT 24.63093444645528 24 0.036002 NLP0013I 72 OPT 24.63093444645145 20 0.032002 NLP0013I 73 OPT 55.80000000030416 17 0.024002 NLP0013I 74 OPT 44.32262730240487 31 0.044003 NLP0013I 75 INFEAS 2719.638204782471 35 0.080005 Cbc0001I Search completed - best objective 37.80000000073485, took 1600 iterations and 62 nodes (3.18 seconds) Cbc0032I Strong branching done 6 times (194 iterations), fathomed 0 nodes and fixed 0 variables Cbc0035I Maximum depth 5, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 37.800000. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 37.80000000028998 21 0.032002 MINLP solution: 37.8 (62 nodes, 3.24 seconds) Best possible: 37.8 Absolute gap: 4.4487e-10 Relative gap: 1.1769e-11 GAMS/Bonmin finished. --- Restarting execution --- m3.gms(144) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job m3.gms Stop 09/04/08 02:54:23 elapsed 0:00:03.374