--- Job parallel Start 09/03/08 02:46:26 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** License File has expired 2 days ago Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- parallel.gms(387) 2 Mb --- Starting execution: elapsed 0:00:00.041 --- parallel.gms(382) 3 Mb --- Generating MINLP model m --- parallel.gms(387) 5 Mb --- 116 rows 206 columns 752 non-zeroes --- 1,646 nl-code 155 nl-non-zeroes --- 25 discrete-columns --- parallel.gms(387) 3 Mb --- Executing BONMIN: elapsed 0:00:00.047 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 769.653220600318 22 0.064004 NLP0013I 2 OPT 793.6188941144394 20 0.056003 NLP0013I 3 OPT 797.0799459437147 17 0.052003 NLP0013I 4 OPT 793.357339488213 19 0.056004 NLP0013I 5 OPT 797.368430216128 16 0.044003 NLP0013I 6 OPT 793.7558852529398 17 0.048003 NLP0013I 7 OPT 878.3138893658521 22 0.088006 NLP0013I 8 OPT 793.6862178291705 19 0.064004 NLP0013I 9 OPT 878.271246481264 20 0.056004 NLP0013I 10 OPT 793.7824626535157 17 0.048003 NLP0013I 11 OPT 888.1942088993155 17 0.052003 NLP0013I 12 OPT 793.5310981244663 17 0.048003 NLP0013I 13 OPT 887.7922281877268 17 0.060004 NLP0013I 14 OPT 793.6669065815998 21 0.060004 NLP0013I 15 OPT 858.7039938238267 20 0.060004 NLP0013I 16 OPT 793.5542176612173 19 0.056003 NLP0013I 17 OPT 858.4029708336155 20 0.056004 NLP0013I 18 OPT 777.7530820360479 16 0.048003 NLP0013I 19 OPT 834.5705710874662 17 0.048003 NLP0013I 20 OPT 777.6754472050267 16 0.048003 NLP0012I Num Status Obj It time NLP0013I 21 OPT 834.5685889797223 17 0.044003 NLP0013I 22 OPT 777.7928905128642 17 0.052003 NLP0013I 23 OPT 855.5342210275617 16 0.044002 NLP0013I 24 OPT 777.6197026076894 17 0.048003 NLP0013I 25 OPT 855.6960266805221 16 0.048003 NLP0013I 26 OPT 781.7354262251655 17 0.048003 NLP0013I 27 OPT 862.118482931186 17 0.048003 NLP0013I 28 OPT 781.6863237377961 17 0.052003 NLP0013I 29 OPT 862.2151693463978 18 0.056004 NLP0013I 30 OPT 793.2708109020867 22 0.060004 NLP0013I 31 OPT 887.8487709156094 21 0.060004 NLP0013I 32 OPT 793.2707526765336 21 0.064004 NLP0013I 33 OPT 887.8919857225097 24 0.072004 Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible 769.653 (1.80 seconds) NLP0013I 34 OPT 793.7824626535157 17 0.048003 NLP0013I 35 OPT 838.2416043204573 21 0.056004 NLP0013I 36 OPT 878.5149943072654 22 0.064004 NLP0013I 37 OPT 887.9674340818223 23 0.064004 NLP0013I 38 OPT 924.4786426277456 19 0.064004 NLP0013I 39 OPT 924.478553042562 14 0.044003 NLP0012I Num Status Obj It time NLP0013I 1 OPT 924.4785531256726 8 0.020001 Cbc0004I Integer solution of 924.479 found after 116 iterations and 6 nodes (2.17 seconds) NLP0013I 40 OPT 924.5272595762119 22 0.064004 NLP0012I Num Status Obj It time NLP0013I 41 OPT 888.1581843833732 21 0.072005 NLP0013I 42 OPT 924.700898776569 19 0.056003 NLP0013I 43 OPT 924.6632555458233 19 0.052003 NLP0013I 44 OPT 887.8919851134033 28 0.116007 NLP0013I 45 OPT 924.554805131543 19 0.052003 NLP0013I 46 OPT 924.3092533313986 19 0.052003 NLP0013I 2 OPT 924.3092531883493 9 0.024001 Cbc0004I Integer solution of 924.309 found after 263 iterations and 13 nodes (2.67 seconds) NLP0013I 47 OPT 887.7922281876747 17 0.060004 NLP0013I 48 OPT 924.2955511427186 22 0.076005 NLP0013I 3 OPT 924.2955507351696 8 0.016001 Cbc0004I Integer solution of 924.296 found after 302 iterations and 15 nodes (2.83 seconds) NLP0013I 49 OPT 924.3811307952866 19 0.052004 NLP0013I 50 OPT 888.1942088993155 17 0.052003 NLP0013I 51 OPT 924.6056269284883 21 0.060004 NLP0013I 52 OPT 924.7274898303751 19 0.056003 Cbc0001I Search completed - best objective 924.2955507351696, took 378 iterations and 19 nodes (3.06 seconds) Cbc0032I Strong branching done 16 times (587 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 = 924.295551. Resolve with fixed discrete variables to get dual values. NLP0012I Num Status Obj It time NLP0013I 1 OPT 924.2955507351694 8 0.020002 MINLP solution: 924.2955507 (19 nodes, 3.15 seconds) Best possible: 924.2955507 Absolute gap: 2.2737e-13 Relative gap: 2.46e-16 GAMS/Bonmin finished. --- Restarting execution --- parallel.gms(387) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job parallel.gms Stop 09/03/08 02:46:30 elapsed 0:00:03.242