--- Job stockcycle Start 09/06/08 16:06:50 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 --- stockcycle.gms(422) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- stockcycle.gms(417) 3 Mb --- Generating MINLP model m --- stockcycle.gms(422) 5 Mb --- 98 rows 481 columns 1,009 non-zeroes --- 291 nl-code 48 nl-non-zeroes --- 432 discrete-columns --- stockcycle.gms(422) 3 Mb --- Executing BONMIN: elapsed 0:00:00.015 GAMS/Bonmin MINLP Solver (Bonmin Library 0.99) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA 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 117916.2028820309 18 0.048003 Cbc0013I At root node, 0 cuts changed objective from 117916 to 117916 in 1 passes Cbc0014I Cut generator 0 (Mixed Integer Gomory) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Probing) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Mixed Integer Rounding) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 3 (Cover) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 4 (Clique) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 5 (Flow Covers) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 6 (Outer Approximation decomposition.) - 0 row cuts, 0 column cuts (0 active) Cbc0014I Cut generator 7 (Outer Approximation feasibility check.) - 0 row cuts, 0 column cuts (0 active) OA0003I New best feasible of 357714 found after 0.120008 sec. Cbc0016I Integer solution of 357714 found by strong branching after 0 iterations and 0 nodes (0.12 seconds) Cbc0010I After 0 nodes, 1 on tree, 357714 best solution, best possible 117916 (0.13 seconds) --- Restarting execution --- stockcycle.gms(422) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job stockcycle.gms Stop 09/06/08 16:06:50 elapsed 0:00:00.231