--- Job st_test5 Start 09/06/08 01:38:33 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 --- st_test5.gms(82) 2 Mb --- Starting execution: elapsed 0:00:00.002 --- st_test5.gms(77) 3 Mb --- Generating MINLP model m --- st_test5.gms(82) 5 Mb --- 12 rows 11 columns 112 non-zeroes --- 110 nl-code 7 nl-non-zeroes --- 10 discrete-columns --- st_test5.gms(82) 3 Mb --- Executing BONMIN: elapsed 0:00:00.004 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 -224.664613741445 16 0.020001 NLP0013I 2 OPT -191.7559248998844 11 0.020002 NLP0013I 3 OPT -216.7826480780448 9 0.012 NLP0013I 4 OPT -188.6197530862571 10 0.016001 NLP0013I 5 INFEAS -233.4516765285962 15 0.032002 NLP0013I 6 OPT -188.6197530862571 10 0.016001 NLP0013I 7 OPT -184.1358024690673 12 0.016001 NLP0013I 8 OPT -185.7555555554756 11 0.020001 NLP0013I 9 OPT -177.9591836733896 10 0.016001 NLP0013I 10 OPT -185.2118334549967 9 0.012001 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -188.62 (0.16 seconds) NLP0013I 11 OPT -185.2118334549967 9 0.016001 NLP0013I 12 INFEAS -188.5271911029496 16 0.032002 NLP0013I 13 INFEAS -141.2003625047006 13 0.028002 NLP0013I 14 INFEAS -188.5271911029514 14 0.028001 NLP0013I 15 OPT -141.1577263955555 11 0.016001 NLP0013I 16 INFEAS -142.9061143984212 16 0.036002 NLP0013I 17 OPT -136.6666666624398 18 0.024001 NLP0013I 18 OPT -136.6666666624398 18 0.028002 NLP0013I 19 INFEAS -133.3470507544569 15 0.032002 NLP0013I 20 OPT -136.6666666666066 10 0.016001 NLP0012I Num Status Obj It time NLP0013I 21 OPT -136.6666666666066 10 0.016001 NLP0013I 22 INFEAS -131.8827160493799 15 0.032002 NLP0013I 23 INFEAS -83.77150842868319 14 0.028002 NLP0013I 24 INFEAS -131.8827160493801 14 0.028002 NLP0013I 25 INFEAS -112.7040036867875 14 0.028002 NLP0013I 26 INFEAS -42.53086419753046 15 0.032002 NLP0013I 27 INFEAS -119.7108917809416 13 0.028002 NLP0013I 28 OPT -177.9591836733896 10 0.016001 NLP0013I 29 OPT -175.5555555535918 18 0.028002 NLP0013I 30 OPT -175.5555555555036 9 0.016001 NLP0013I 31 OPT -173.4664830118873 9 0.012 NLP0013I 32 INFEAS -175.5555555555468 10 0.020002 NLP0013I 33 OPT -131.9065010946576 7 0.012 NLP0013I 34 OPT -131.9065010946576 7 0.012001 NLP0013I 35 INFEAS -155.8641975308671 14 0.028002 NLP0013I 36 INFEAS -167.2222222222215 10 0.020001 NLP0013I 37 INFEAS -122.4999999999996 11 0.024001 NLP0013I 38 OPT -113.3333333333033 8 0.012001 NLP0013I 39 OPT -109.99999999998 7 0.012001 NLP0012I Num Status Obj It time NLP0013I 1 OPT -110 0 0 Cbc0004I Integer solution of -110 found after 206 iterations and 14 nodes (0.86 seconds) NLP0013I 40 INFEAS -119.9999999999993 9 0.020001 Branching on infeasible node, sequence of infeasibles size 1 NLP0012I Num Status Obj It time NLP0013I 41 INFEAS -125.0000000000023 13 0.028002 NLP0013I 42 INFEAS -125.0000000000028 13 0.024001 NLP0013I 43 INFEAS -125.0000000000031 12 0.028002 NLP0013I 44 INFEAS -81.77170035673132 20 0.044003 NLP0013I 45 INFEAS -40.00000000000284 13 0.028002 NLP0013I 46 INFEAS -40.00000000000306 13 0.024001 NLP0013I 47 INFEAS 5.312499999987746 12 0.024002 NLP0013I 48 OPT -169.3914782696407 10 0.012001 NLP0013I 49 INFEAS -140.5326032066642 21 0.044003 NLP0013I 50 INFEAS -140.5326032066647 21 0.044003 NLP0013I 51 INFEAS -140.5326032066654 20 0.044003 NLP0013I 52 INFEAS -42.08085612365934 13 0.032002 NLP0013I 53 INFEAS -111.5553259871187 19 0.040003 NLP0013I 54 INFEAS -111.5553259871192 18 0.040002 NLP0013I 55 INFEAS 3.209876543203869 14 0.032002 NLP0013I 56 OPT -165.2118334550267 9 0.012001 NLP0013I 57 INFEAS -141.2345679012378 14 0.028002 NLP0013I 58 INFEAS -141.234567901238 14 0.028002 NLP0013I 59 INFEAS -79.99999999999973 12 0.028002 NLP0013I 60 INFEAS -111.260404280616 13 0.024001 NLP0012I Num Status Obj It time NLP0013I 61 INFEAS -111.2604042806168 14 0.028002 NLP0013I 62 INFEAS -61.52777777777716 13 0.028002 NLP0013I 63 INFEAS -138.7086133333299 16 0.032002 NLP0013I 64 INFEAS -127.3456790123472 15 0.028002 NLP0013I 65 INFEAS -127.3456790123478 16 0.028002 NLP0013I 66 INFEAS -46.6049382715999 19 0.040002 NLP0013I 67 INFEAS -167.4925639500255 15 0.032002 NLP0013I 68 INFEAS -167.4925639500261 15 0.028001 NLP0013I 69 INFEAS -77.62573964496733 14 0.028001 NLP0013I 70 INFEAS -167.222222222222 8 0.020001 NLP0013I 71 INFEAS -122.4999999999999 12 0.028002 NLP0013I 72 INFEAS -119.9999999999998 8 0.020001 NLP0013I 73 INFEAS -170.5555555555553 10 0.024001 NLP0013I 74 INFEAS -80.00000000000007 10 0.024002 NLP0013I 75 INFEAS -111.2604042806174 14 0.028002 NLP0013I 76 INFEAS -61.52777777777773 12 0.028001 NLP0013I 77 INFEAS -80.00000000000007 10 0.028002 NLP0013I 78 INFEAS -36.24999999999987 12 0.028002 NLP0013I 79 INFEAS -120 0 0 NLP0013I 80 INFEAS -13.74999999999803 9 0.024001 NLP0012I Num Status Obj It time NLP0013I 81 INFEAS -119.9382716049383 13 0.028001 NLP0013I 82 INFEAS -35.00000000000006 11 0.028002 NLP0013I 83 INFEAS -23.75000000000011 13 0.032002 NLP0013I 84 INFEAS 21.63265306122441 16 0.036002 NLP0013I 85 INFEAS -75 0 0 NLP0013I 86 INFEAS 10 0 0 NLP0013I 87 INFEAS -35 0 0 Cbc0001I Search completed - best objective -110, took 804 iterations and 62 nodes (2.19 seconds) Cbc0032I Strong branching done 10 times (246 iterations), fathomed 3 nodes and fixed 4 variables Cbc0035I Maximum depth 7, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = -110.000000. All variables are discrete. Dual variables for fixed problem will be not available. NLP0012I Num Status Obj It time NLP0013I 1 OPT -110 0 0 MINLP solution: -110 (62 nodes, 2.22 seconds) Best possible: -110 Absolute gap: 0 Relative gap: 0 GAMS/Bonmin finished. --- Restarting execution --- st_test5.gms(82) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job st_test5.gms Stop 09/06/08 01:38:35 elapsed 0:00:02.266