--- Job gastrans Start 09/02/08 17:26:17 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 1 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- gastrans.gms(529) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- gastrans.gms(524) 3 Mb --- Generating MINLP model m --- gastrans.gms(529) 5 Mb --- 150 rows 107 columns 419 non-zeroes --- 277 nl-code 45 nl-non-zeroes --- 21 discrete-columns --- gastrans.gms(529) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 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 ****************************************************************************** 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 89.08584000012 29 0.060004 NLP0013I 2 OPT 89.08584000012 18 0.036002 NLP0013I 3 OPT 89.08584000046567 10 0.020001 NLP0013I 4 OPT 89.08584000011999 16 0.032002 NLP0013I 5 OPT 89.08584000012587 12 0.028002 NLP0013I 6 OPT 89.08584000011997 16 0.032002 NLP0013I 7 OPT 89.08584000012586 12 0.028001 NLP0013I 8 OPT 89.08584000011997 37 0.088006 NLP0013I 9 OPT 89.08584000012 16 0.036002 NLP0013I 10 OPT 89.08584000012 37 0.092006 NLP0013I 11 OPT 89.08584000012 16 0.036002 NLP0013I 12 INFEAS 94.49551036109088 23 0.068004 NLP0013I 13 OPT 89.08584000011999 14 0.032002 NLP0013I 14 OPT 89.08584000011999 14 0.028002 NLP0013I 15 INFEAS 92.51616323610746 50 0.15601 NLP0013I 16 OPT 89.0858400001276 11 0.020002 NLP0013I 17 OPT 89.0858400001276 11 0.024001 NLP0013I 18 INFEAS 92.32102015843067 174 0.596037 NLP0013I 19 OPT 89.08584000011999 13 0.028002 NLP0013I 20 OPT 89.08584000011999 13 0.028002 NLP0012I Num Status Obj It time NLP0013I 21 INFEAS 91.46859609211056 53 0.188012 NLP0013I 22 OPT 89.08584000012017 11 0.024001 NLP0013I 23 OPT 89.08584000012017 11 0.020001 NLP0013I 24 INFEAS 90.62461566984477 30 0.080005 NLP0013I 25 OPT 89.08584000011732 12 0.024001 NLP0013I 26 OPT 89.08584000011732 12 0.020002 NLP0013I 27 OPT 89.08584000012 21 0.044002 NLP0013I 28 OPT 89.08584000012 16 0.028002 NLP0013I 29 INFEAS 89.54190559022641 31 0.092006 NLP0013I 30 OPT 89.08584000022259 11 0.024002 NLP0013I 31 OPT 89.08584000022259 11 0.024001 NLP0013I 32 INFEAS 89.63753071846489 33 0.096006 NLP0013I 33 OPT 89.08584000056945 11 0.024002 NLP0013I 34 OPT 89.08584000056945 11 0.024001 NLP0013I 35 INFEAS 92.32107133798345 39 0.108007 NLP0013I 36 OPT 89.08584000139714 11 0.020001 NLP0013I 37 OPT 89.08584000139714 11 0.024002 NLP0013I 38 INFEAS 87.96464031445734 32 0.092005 NLP0013I 39 OPT 89.08584000011999 16 0.032002 NLP0013I 40 OPT 89.08584000011999 16 0.028001 NLP0012I Num Status Obj It time NLP0013I 41 INFEAS 87.58658272738001 34 0.096006 NLP0013I 42 OPT 89.08584000011999 17 0.032002 NLP0013I 43 OPT 89.08584000011999 17 0.032002 NLP0013I 44 INFEAS 90.48199749338282 27 0.080005 NLP0013I 45 OPT 89.08584000012 17 0.032002 NLP0013I 46 OPT 89.08584000012 17 0.036003 NLP0013I 47 INFEAS 92.32107386751468 30 0.088005 NLP0013I 48 OPT 89.08584000012011 13 0.028002 NLP0013I 49 OPT 89.08584000012011 13 0.028002 NLP0013I 50 INFEAS 92.32107846071882 27 0.076005 NLP0013I 51 OPT 89.08584000012048 13 0.024001 NLP0013I 52 OPT 89.08584000012048 13 0.024001 NLP0013I 53 OPT 89.08584000011999 18 0.036002 NLP0013I 54 INFEAS 86.03881938338706 40 0.140009 NLP0013I 55 OPT 89.08584000011999 18 0.032002 NLP0013I 56 INFEAS 84.82275123505458 31 0.092005 NLP0013I 57 OPT 89.08584000015294 13 0.028002 NLP0013I 58 OPT 89.08584000015294 13 0.028002 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 89.0858 (3.42 seconds) NLP0013I 59 OPT 89.08584000026725 14 0.024001 NLP0013I 60 OPT 89.08584000011948 14 0.028002 NLP0012I Num Status Obj It time NLP0013I 61 OPT 89.08584000035349 18 0.040003 NLP0013I 62 INFEAS 87.77723230465318 46 0.140008 NLP0013I 63 INFEAS 90.23834656011147 59 0.216014 NLP0013I 64 OPT 89.08584000012 16 0.032002 NLP0013I 65 INFEAS 90.23834657440644 96 0.356022 NLP0013I 66 OPT 89.08584000044451 14 0.028002 NLP0013I 67 OPT 89.08584000012 52 0.112007 NLP0013I 68 OPT 89.08584000011999 15 0.032002 NLP0012I Num Status Obj It time NLP0013I 1 OPT 89.08584000011999 17 0.032002 Cbc0004I Integer solution of 89.0858 found after 545 iterations and 10 nodes (4.47 seconds) Cbc0001I Search completed - best objective 89.08584000011999, took 545 iterations and 10 nodes (4.47 seconds) Cbc0032I Strong branching done 21 times (1082 iterations), fathomed 0 nodes and fixed 15 variables Cbc0035I Maximum depth 5, 0 variables fixed on reduced cost Bonmin finished. Found feasible point. Objective function = 89.085840. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 89.08584000011997 10 0.020002 MINLP solution: 89.08584 (10 nodes, 4.55 seconds) Best possible: 89.08584 Absolute gap: 1.4211e-14 Relative gap: 1.5952e-16 GAMS/Bonmin finished. --- Restarting execution --- gastrans.gms(529) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job gastrans.gms Stop 09/02/08 17:26:22 elapsed 0:00:04.664