Linux opt202 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Batch/gms/BatchS101006M.gms =========== ----------------------------- Sa 8. Sep 19:58:54 CEST 2012 ----------------------------- @03 1347127134 --- Job BatchS101006M.gms Start 09/08/12 19:58:54 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- BatchS101006M.gms(2453) 2 Mb --- Starting execution: elapsed 0:00:00.024 --- BatchS101006M.gms(2451) 3 Mb --- Generating MINLP model m --- BatchS101006M.gms(2453) 5 Mb --- 1,020 rows 279 columns 2,866 non-zeroes --- 131 nl-code 49 nl-non-zeroes --- 129 discrete-columns --- BatchS101006M.gms(2453) 3 Mb --- Executing BONMIN: elapsed 0:00:00.031 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 120 Number of nonzeros in inequality constraint Jacobian.: 2706 Number of nonzeros in Lagrangian Hessian.............: 79 Total number of variables............................: 278 variables with only lower bounds: 0 variables with lower and upper bounds: 268 variables with only upper bounds: 0 Total number of equality constraints.................: 20 Total number of inequality constraints...............: 999 inequality constraints with only lower bounds: 689 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 310 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 9.3119412e+04 1.61e+06 7.68e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 9.4831393e+04 1.59e+06 7.60e+00 0.2 8.15e+00 - 4.46e-02 1.48e-02f 1 2 1.8562290e+05 7.24e+05 1.09e+02 0.2 1.22e+01 - 3.42e-02 7.84e-01f 1 3 1.3392680e+05 4.57e+05 5.98e+01 -0.7 2.10e+00 - 5.18e-01 4.60e-01f 1 4 1.0376225e+05 2.63e+05 2.69e+01 -0.6 1.79e+00 - 7.27e-01 5.49e-01f 1 5 1.0211735e+05 2.15e+05 2.11e+01 -0.9 1.27e+00 - 4.09e-01 2.05e-01f 1 6 1.0193918e+05 1.84e+05 1.79e+01 -0.9 1.41e+00 - 4.26e-01 1.52e-01h 1 7 1.0260207e+05 1.65e+05 2.07e+01 -0.9 2.38e+00 - 3.16e-01 1.15e-01h 1 8 1.0430838e+05 1.43e+05 1.68e+01 -0.9 2.93e+00 - 1.26e-01 1.45e-01h 1 9 1.0540203e+05 1.34e+05 2.14e+01 -0.8 3.04e+00 - 1.25e-01 6.24e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.0688399e+05 1.27e+05 2.38e+01 -0.8 3.47e+00 - 9.18e-02 5.91e-02h 1 11 1.1311764e+05 1.05e+05 2.79e+01 -0.8 3.13e+00 - 2.66e-02 1.86e-01h 1 12 1.1534414e+05 9.95e+04 2.37e+01 -0.8 2.69e+00 - 7.27e-02 5.76e-02h 1 13 1.1764669e+05 9.41e+04 3.40e+01 -0.8 2.44e+00 - 2.44e-01 5.64e-02h 1 14 1.2183769e+05 8.64e+04 1.96e+01 -0.8 2.36e+00 - 1.85e-02 8.55e-02h 1 15 1.2322045e+05 8.43e+04 2.14e+01 -0.8 2.47e+00 - 4.22e-02 2.50e-02h 1 16 1.2586784e+05 8.06e+04 2.31e+01 -0.8 2.48e+00 - 6.20e-02 4.41e-02h 1 17 1.3121834e+05 7.45e+04 2.16e+01 -0.8 2.58e+00 - 3.55e-02 7.98e-02h 1 18 1.3617495e+05 6.95e+04 2.02e+01 -0.8 2.33e+00 - 8.08e-02 6.90e-02h 1 19 1.4536878e+05 6.14e+04 1.79e+01 -0.8 2.36e+00 - 2.64e-02 1.23e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.5747289e+05 5.29e+04 2.04e+01 -0.9 2.44e+00 - 7.05e-02 1.49e-01h 1 21 1.6398657e+05 4.90e+04 1.54e+01 -0.9 2.21e+00 - 1.80e-01 7.69e-02h 1 22 1.7417752e+05 4.37e+04 1.34e+01 -0.9 2.19e+00 - 1.44e-01 1.14e-01h 1 23 2.5084692e+05 2.12e+04 7.17e+01 -0.9 2.16e+00 - 2.69e-01 6.85e-01h 1 24 2.8547942e+05 1.59e+04 7.00e+01 -1.6 1.86e+00 - 6.29e-01 2.80e-01h 1 25 3.2570117e+05 1.16e+04 1.53e+02 -1.9 1.74e+00 - 7.12e-01 3.01e-01h 1 26 3.2629755e+05 1.15e+04 1.92e+02 -1.5 1.60e+00 - 1.40e-01 4.55e-03h 1 27 3.4346638e+05 1.01e+04 1.69e+02 -1.5 1.77e+00 - 1.27e-01 1.26e-01h 1 28 3.4409604e+05 1.01e+04 1.88e+02 -1.5 1.75e+00 - 4.94e-02 4.59e-03h 1 29 3.4902136e+05 9.74e+03 1.89e+02 -1.5 1.78e+00 - 5.29e-02 3.54e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 3.5000727e+05 9.67e+03 1.93e+02 -1.4 2.98e+00 - 1.24e-02 6.96e-03h 1 31 3.6208826e+05 8.88e+03 1.42e+02 -1.5 1.58e+00 - 2.23e-03 8.36e-02h 1 32 3.6262596e+05 8.85e+03 1.87e+02 -1.5 1.52e+00 - 7.87e-02 3.72e-03h 1 33 3.6370744e+05 8.79e+03 1.99e+02 -1.5 1.96e+00 - 2.43e-02 7.37e-03h 1 34 3.8178363e+05 7.79e+03 1.13e+02 -1.5 1.96e+00 - 1.91e-03 1.18e-01h 1 35 3.8359723e+05 7.69e+03 1.67e+02 -1.6 1.86e+00 - 9.45e-02 1.20e-02h 1 36 3.9027737e+05 7.36e+03 1.91e+02 -1.5 1.64e+00 - 9.33e-02 4.36e-02h 1 37 3.9929929e+05 6.94e+03 2.01e+02 -1.5 1.34e+00 - 9.39e-02 5.80e-02h 1 38 4.0008904e+05 6.91e+03 2.37e+02 -1.5 1.42e+00 - 5.14e-02 5.09e-03h 1 39 4.1290177e+05 6.36e+03 1.95e+02 -1.5 1.31e+00 - 4.32e-02 8.05e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 4.1402490e+05 6.32e+03 2.16e+02 -1.5 1.15e+00 - 3.91e-02 7.15e-03h 1 41 4.6513718e+05 4.54e+03 5.46e+01 -1.5 1.26e+00 - 1.16e-02 3.04e-01h 1 42 4.6571867e+05 4.52e+03 1.27e+02 -1.7 7.89e-01 - 1.61e-01 3.85e-03h 1 43 4.7208881e+05 4.34e+03 1.56e+02 -1.5 9.74e-01 - 7.83e-02 4.16e-02h 1 44 4.9765697e+05 3.65e+03 6.17e+01 -1.6 1.33e+00 - 8.91e-02 1.63e-01h 1 45 4.9870484e+05 3.63e+03 1.39e+02 -1.5 8.04e-01 - 7.70e-02 7.12e-03h 1 46 5.0207075e+05 3.55e+03 1.50e+02 -1.6 8.56e-01 - 3.43e-02 2.27e-02h 1 47 5.2201394e+05 3.09e+03 2.44e+02 -1.6 8.85e-01 - 2.56e-01 1.32e-01h 1 48 5.3112510e+05 2.89e+03 2.50e+02 -1.7 8.95e-01 - 8.91e-02 6.38e-02h 1 49 5.7898494e+05 1.99e+03 6.27e+01 -1.7 8.15e-01 - 5.04e-02 3.28e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 5.8064313e+05 1.96e+03 4.18e+02 -2.1 5.33e-01 - 4.45e-01 1.41e-02h 1 51 6.9093423e+05 4.56e+02 3.37e+02 -2.1 2.89e-01 - 2.20e-01 8.51e-01h 1 52 7.3350598e+05 1.58e+01 3.78e+02 -1.9 3.63e-01 - 6.08e-01 1.00e+00h 1 53 7.3463799e+05 3.25e+00 5.91e+01 -4.1 8.87e-03 - 8.37e-01 7.95e-01h 1 54 7.3493134e+05 1.26e-01 3.21e+00 -6.5 2.48e-03 - 9.49e-01 9.62e-01h 1 55 7.3494326e+05 1.56e-03 1.87e-01 -8.1 8.95e-04 - 9.48e-01 9.88e-01h 1 56 7.3494340e+05 3.15e-05 5.77e-03 -10.1 3.64e-04 - 9.71e-01 9.85e-01h 1 57 7.3494340e+05 9.42e-06 7.43e+00 -10.5 9.49e-05 - 9.94e-01 7.10e-01h 1 58 7.3494340e+05 5.98e-06 1.36e+01 -8.1 6.21e-01 - 1.00e+00 3.66e-01h 1 59 7.3494340e+05 2.50e-08 1.45e-08 -8.1 1.58e-01 - 1.00e+00 1.00e+00f 1 In iteration 59, 1 Slack too small, adjusting variable bound iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 7.3494340e+05 7.54e-09 8.18e+00 -11.0 4.44e-07 - 1.00e+00 6.98e-01h 1 In iteration 60, 1 Slack too small, adjusting variable bound 61 7.3494340e+05 2.88e-09 7.86e+00 -9.6 9.48e-03 - 7.11e-01 6.02e-01h 1 62 7.3494340e+05 3.18e-10 1.69e+01 -9.6 7.41e-03 - 1.00e+00 8.34e-01h 1 63 7.3494340e+05 4.44e-16 1.02e-12 -9.6 8.31e-04 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 63 (scaled) (unscaled) Objective...............: 9.5949150049744385e+03 7.3494339881026605e+05 Dual infeasibility......: 1.0247346315285832e-12 7.8491779508599087e-11 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Complementarity.........: 4.4317431447889144e-10 3.3945901217432818e-08 Overall NLP error.......: 4.4317431447889144e-10 3.3945901217432818e-08 Number of objective function evaluations = 64 Number of objective gradient evaluations = 64 Number of equality constraint evaluations = 64 Number of inequality constraint evaluations = 64 Number of equality constraint Jacobian evaluations = 64 Number of inequality constraint Jacobian evaluations = 64 Number of Lagrangian Hessian evaluations = 63 Total CPU secs in IPOPT (w/o function evaluations) = 0.180 Total CPU secs in NLP function evaluations = 0.024 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 734943.4 63 0.203969 build initial OA NLP0014I 2 OPT 782384.31 22 0.031996 OA decomposition OA0003I New best feasible of 782384.31 found after 0.908862 sec and NLP0014I 3 OPT 769440.42 29 0.045993 OA decomposition OA0003I New best feasible of 769440.42 found after 1.397787 sec and NLP0014I 4 OPT 776812.38 18 0.027996 OA decomposition NLP0014I 5 OPT 778946.26 21 0.029996 OA decomposition NLP0014I 6 OPT 780665.18 19 0.027996 OA decomposition NLP0014I 7 OPT 779807.14 20 0.027996 OA decomposition NLP0014I 8 OPT 783168.95 19 0.027995 OA decomposition NLP0014I 9 OPT 774648.84 19 0.027996 OA decomposition NLP0014I 10 OPT 779632.34 22 0.032995 OA decomposition NLP0014I 11 OPT 779883.17 20 0.028996 OA decomposition OA0008I OA converged in 5.45917 seconds found solution of value 769440.42 (lower bound 1e+50 ). OA0010I Performed 10 iterations, explored 11616 branch-and-bound nodes in total Cbc0012I Integer solution of 769440.42 found by nonlinear programm after 0 iterations and 0 nodes (5.44 seconds) Cbc0013I At root node, 0 cuts changed objective from 734943.36 to 734943.36 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 769440.4199767639, took 0 iterations and 0 nodes (5.44 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 769440. Best solution: 7.694404e+05 (0 nodes, 5.496 seconds) Best possible: 7.694404e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- BatchS101006M.gms(2453) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job BatchS101006M.gms Stop 09/08/12 19:59:00 elapsed 0:00:05.833 @04 1347127140 ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- =ready= Linux opt203 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Batch/gms/BatchS121208M.gms =========== ----------------------------- Sa 8. Sep 19:58:54 CEST 2012 ----------------------------- @03 1347127134 --- Job BatchS121208M.gms Start 09/08/12 19:58:54 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- BatchS121208M.gms(3600) 2 Mb --- Starting execution: elapsed 0:00:00.032 --- BatchS121208M.gms(3598) 3 Mb --- Generating MINLP model m --- BatchS121208M.gms(3600) 6 Mb --- 1,512 rows 407 columns 4,256 non-zeroes --- 157 nl-code 59 nl-non-zeroes --- 203 discrete-columns --- BatchS121208M.gms(3600) 3 Mb --- Executing BONMIN: elapsed 0:00:00.043 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 192 Number of nonzeros in inequality constraint Jacobian.: 4016 Number of nonzeros in Lagrangian Hessian.............: 95 Total number of variables............................: 406 variables with only lower bounds: 0 variables with lower and upper bounds: 394 variables with only upper bounds: 0 Total number of equality constraints.................: 24 Total number of inequality constraints...............: 1487 inequality constraints with only lower bounds: 1019 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 468 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.1205028e+05 1.97e+06 6.11e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1409276e+05 1.95e+06 6.05e+00 0.2 7.80e+00 - 4.51e-02 1.42e-02f 1 2 2.4574515e+05 9.08e+05 1.12e+02 0.2 1.22e+01 - 3.34e-02 7.60e-01f 1 3 1.7311630e+05 5.60e+05 6.68e+01 -0.7 2.16e+00 - 5.54e-01 4.83e-01f 1 4 1.3266559e+05 3.25e+05 3.24e+01 -0.6 1.82e+00 - 6.68e-01 5.44e-01f 1 5 1.3043519e+05 2.80e+05 2.44e+01 -0.8 1.43e+00 - 3.98e-01 1.48e-01f 1 6 1.2932399e+05 2.32e+05 1.97e+01 -0.9 2.19e+00 - 4.42e-01 1.89e-01h 1 7 1.3009877e+05 2.08e+05 3.78e+01 -0.9 2.64e+00 - 3.80e-01 1.10e-01h 1 8 1.3314094e+05 1.83e+05 2.85e+01 -0.7 2.97e+00 - 2.28e-02 1.30e-01h 1 9 1.3536938e+05 1.71e+05 2.64e+01 -0.7 3.07e+00 - 1.19e-01 7.17e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.3844015e+05 1.58e+05 2.44e+01 -0.7 2.90e+00 - 6.23e-02 7.86e-02h 1 11 1.4326943e+05 1.42e+05 2.20e+01 -0.7 2.90e+00 - 7.26e-02 1.09e-01h 1 12 1.4938959e+05 1.25e+05 1.95e+01 -0.7 2.73e+00 - 7.00e-02 1.24e-01h 1 13 1.5164792e+05 1.20e+05 1.87e+01 -0.7 2.51e+00 - 1.11e-01 4.14e-02h 1 14 1.5522143e+05 1.13e+05 3.06e+01 -0.7 2.53e+00 - 1.43e-01 5.89e-02h 1 15 1.5993498e+05 1.06e+05 2.57e+01 -0.7 2.42e+00 - 4.30e-02 6.76e-02h 1 16 1.6449835e+05 9.98e+04 2.44e+01 -0.7 2.60e+00 - 3.93e-02 5.87e-02h 1 17 1.7109653e+05 9.24e+04 2.27e+01 -0.8 2.66e+00 - 9.09e-02 7.74e-02h 1 18 1.8884866e+05 7.70e+04 4.88e+01 -0.7 2.56e+00 - 2.17e-02 1.82e-01h 1 19 2.0128109e+05 6.84e+04 5.11e+01 -0.8 2.46e+00 - 8.03e-02 1.19e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 2.0351361e+05 6.70e+04 4.56e+01 -0.8 2.52e+00 - 8.05e-02 2.05e-02h 1 21 2.2671170e+05 5.46e+04 4.55e+01 -0.8 2.32e+00 - 4.82e-02 2.03e-01h 1 22 2.3610003e+05 5.05e+04 3.38e+01 -0.9 2.22e+00 - 2.06e-01 7.77e-02h 1 23 2.9316630e+05 3.32e+04 4.53e+01 -0.8 2.19e+00 - 2.54e-02 4.08e-01h 1 24 3.2466500e+05 2.70e+04 4.47e+01 -1.1 2.08e+00 - 3.84e-01 2.05e-01h 1 25 3.2525987e+05 2.69e+04 5.77e+01 -1.1 1.94e+00 - 1.77e-01 3.70e-03h 1 26 3.5680768e+05 2.23e+04 4.62e+01 -1.0 3.14e+00 - 6.16e-02 1.84e-01h 1 27 3.5742054e+05 2.22e+04 9.77e+01 -1.0 1.88e+00 - 2.17e-01 3.50e-03h 1 28 3.8999471e+05 1.86e+04 5.22e+01 -1.0 2.78e+00 - 4.67e-02 1.73e-01h 1 29 3.9183023e+05 1.84e+04 7.81e+01 -1.0 1.77e+00 - 8.59e-02 9.56e-03h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 4.0646655e+05 1.71e+04 8.80e+01 -1.1 2.44e+00 - 1.12e-01 7.43e-02h 1 31 4.4125022e+05 1.44e+04 4.73e+01 -1.0 1.79e+00 - 3.39e-02 1.67e-01h 1 32 4.4900852e+05 1.39e+04 4.60e+01 -1.0 1.69e+00 - 7.43e-02 3.69e-02h 1 33 4.4969242e+05 1.38e+04 8.06e+01 -1.0 1.71e+00 - 5.69e-02 3.23e-03h 1 34 4.5543258e+05 1.35e+04 7.60e+01 -1.0 2.75e+00 - 2.29e-02 2.64e-02h 1 35 4.5765479e+05 1.34e+04 8.69e+01 -1.0 3.25e+00 - 2.21e-02 9.98e-03h 1 36 4.6012215e+05 1.32e+04 1.10e+02 -1.0 2.91e+00 - 3.69e-02 1.09e-02h 1 37 4.6770182e+05 1.28e+04 1.13e+02 -1.0 2.65e+00 - 4.13e-02 3.28e-02h 1 38 4.8384999e+05 1.19e+04 8.69e+01 -1.0 2.70e+00 - 4.29e-02 6.77e-02h 1 39 5.0516329e+05 1.09e+04 8.72e+01 -1.0 2.06e+00 - 9.72e-02 8.71e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 5.2049738e+05 1.03e+04 9.20e+01 -1.1 1.74e+00 - 7.31e-02 6.15e-02h 1 41 5.3732390e+05 9.60e+03 1.36e+02 -1.1 2.49e+00 - 1.19e-01 6.61e-02h 1 42 5.4076122e+05 9.47e+03 2.40e+02 -1.0 2.16e+00 - 1.14e-01 1.34e-02h 1 43 5.8073237e+05 8.13e+03 1.14e+02 -1.1 1.91e+00 - 4.38e-02 1.48e-01h 1 44 6.0415227e+05 7.45e+03 1.87e+02 -1.2 1.65e+00 - 1.58e-01 8.62e-02h 1 45 6.3183047e+05 6.72e+03 5.41e+02 -1.2 1.24e+00 - 4.23e-01 1.01e-01h 1 46 7.1562578e+05 4.93e+03 4.17e+02 -1.4 6.74e-01 - 3.24e-01 2.88e-01h 1 47 7.9463268e+05 3.64e+03 3.65e+02 -1.3 5.05e-01 - 3.26e-01 2.77e-01h 1 48 8.8081973e+05 2.55e+03 3.37e+02 -1.3 4.38e-01 - 3.78e-01 3.19e-01h 1 49 9.1461819e+05 2.18e+03 1.12e+03 -2.2 3.13e-01 - 6.80e-01 1.47e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 1.0962590e+06 6.54e+02 3.15e+02 -2.9 2.80e-01 - 8.64e-01 7.76e-01h 1 51 1.1632848e+06 2.25e+02 3.06e+02 -4.5 1.05e-01 - 8.84e-01 6.78e-01h 1 52 1.1947040e+06 4.28e+01 7.84e+01 -5.5 4.25e-02 - 9.06e-01 8.22e-01h 1 53 1.2021201e+06 1.36e+00 9.95e-01 -8.4 9.16e-03 - 9.49e-01 9.72e-01h 1 54 1.2023623e+06 1.48e-02 8.81e-03 -11.0 3.31e-04 - 9.89e-01 9.89e-01h 1 55 1.2023648e+06 6.83e-04 1.68e-01 -11.0 7.32e-05 - 9.91e-01 9.54e-01h 1 56 1.2023649e+06 4.53e-04 7.14e+01 -9.9 1.01e-01 - 1.00e+00 3.36e-01h 1 57 1.2023649e+06 1.81e-04 3.62e+01 -9.2 7.02e-01 - 7.70e-01 6.01e-01h 1 58 1.2023649e+06 1.81e-04 8.34e+01 -9.2 3.21e-01 - 1.00e+00 1.28e-05f 17 59 1.2023649e+06 5.55e-16 5.91e-12 -9.2 2.66e-01 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 59 (scaled) (unscaled) Objective...............: 1.5697248913242647e+04 1.2023649466710456e+06 Dual infeasibility......: 5.9117155615240335e-12 4.5282072069773258e-10 Constraint violation....: 5.5511151231257827e-16 5.5511151231257827e-16 Complementarity.........: 8.1262476500501185e-10 6.2244762610251831e-08 Overall NLP error.......: 8.1262476500501185e-10 6.2244762610251831e-08 Number of objective function evaluations = 76 Number of objective gradient evaluations = 60 Number of equality constraint evaluations = 76 Number of inequality constraint evaluations = 76 Number of equality constraint Jacobian evaluations = 60 Number of inequality constraint Jacobian evaluations = 60 Number of Lagrangian Hessian evaluations = 59 Total CPU secs in IPOPT (w/o function evaluations) = 0.240 Total CPU secs in NLP function evaluations = 0.037 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 1202364.9 59 0.276957 build initial OA NLP0014I 2 OPT 1243886.3 15 0.030995 OA decomposition OA0003I New best feasible of 1243886.3 found after 1.302802 sec and NLP0014I 3 OPT 1241125.5 21 0.043994 OA decomposition OA0003I New best feasible of 1241125.5 found after 2.388637 sec and NLP0014I 4 OPT 1243940.8 24 0.049992 OA decomposition NLP0014I 5 OPT 1249557.2 20 0.040994 OA decomposition OA0008I OA converged in 5.200209 seconds found solution of value 1241125.5 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 9616 branch-and-bound nodes in total Cbc0012I Integer solution of 1241125.5 found by nonlinear programm after 0 iterations and 0 nodes (5.18 seconds) Cbc0013I At root node, 0 cuts changed objective from 1202364.9 to 1202364.9 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 1241125.513417068, took 0 iterations and 0 nodes (5.18 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 1.24113e+06. Best solution: 1.241126e+06 (0 nodes, 5.238 seconds) Best possible: 1.241126e+06 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- BatchS121208M.gms(3600) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job BatchS121208M.gms Stop 09/08/12 19:59:00 elapsed 0:00:05.666 @04 1347127140 ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- =ready= Linux opt204 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Batch/gms/BatchS151208M.gms =========== ----------------------------- Sa 8. Sep 19:58:54 CEST 2012 ----------------------------- @03 1347127134 --- Job BatchS151208M.gms Start 09/08/12 19:58:54 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- BatchS151208M.gms(4241) 2 Mb --- Starting execution: elapsed 0:00:00.033 --- BatchS151208M.gms(4239) 3 Mb --- Generating MINLP model m --- BatchS151208M.gms(4241) 6 Mb --- 1,782 rows 446 columns 5,069 non-zeroes --- 166 nl-code 62 nl-non-zeroes --- 203 discrete-columns --- BatchS151208M.gms(4241) 3 Mb --- Executing BONMIN: elapsed 0:00:00.047 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 192 Number of nonzeros in inequality constraint Jacobian.: 4829 Number of nonzeros in Lagrangian Hessian.............: 98 Total number of variables............................: 445 variables with only lower bounds: 0 variables with lower and upper bounds: 430 variables with only upper bounds: 0 Total number of equality constraints.................: 24 Total number of inequality constraints...............: 1757 inequality constraints with only lower bounds: 1223 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 534 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.1205028e+05 2.59e+06 5.89e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1432927e+05 2.56e+06 5.84e+00 0.2 7.96e+00 - 4.88e-02 1.45e-02f 1 2 2.5287982e+05 1.16e+06 1.30e+02 0.2 1.23e+01 - 3.22e-02 7.85e-01f 1 3 1.7590952e+05 7.03e+05 6.59e+01 -0.7 2.09e+00 - 5.65e-01 5.04e-01f 1 4 1.3336294e+05 3.95e+05 3.13e+01 -0.6 1.79e+00 - 6.58e-01 5.78e-01f 1 5 1.3122964e+05 3.38e+05 2.42e+01 -0.9 1.35e+00 - 4.18e-01 1.55e-01f 1 6 1.3044506e+05 2.87e+05 2.31e+01 -0.9 1.89e+00 - 5.18e-01 1.63e-01h 1 7 1.3147507e+05 2.56e+05 3.02e+01 -0.9 2.32e+00 - 2.30e-01 1.19e-01h 1 8 1.3467897e+05 2.22e+05 2.60e+01 -0.7 2.62e+00 - 7.18e-02 1.42e-01h 1 9 1.3700910e+05 2.06e+05 2.40e+01 -0.8 2.68e+00 - 1.05e-01 7.74e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.3949823e+05 1.93e+05 2.25e+01 -0.7 2.58e+00 - 5.09e-02 6.50e-02h 1 11 1.4327645e+05 1.77e+05 2.07e+01 -0.7 2.69e+00 - 1.16e-01 8.74e-02h 1 12 1.4728502e+05 1.64e+05 1.92e+01 -0.7 2.76e+00 - 2.93e-02 7.66e-02h 1 13 1.4974401e+05 1.57e+05 1.84e+01 -0.7 2.56e+00 - 4.68e-02 4.31e-02h 1 14 1.5236746e+05 1.50e+05 1.77e+01 -0.7 2.74e+00 - 8.00e-02 4.24e-02h 1 15 1.5707396e+05 1.40e+05 1.70e+01 -0.7 2.80e+00 - 1.05e-01 6.94e-02h 1 16 1.6322837e+05 1.29e+05 1.53e+01 -0.7 2.48e+00 - 3.88e-02 8.12e-02h 1 17 1.6677746e+05 1.24e+05 1.82e+01 -0.7 2.41e+00 - 1.12e-01 4.31e-02h 1 18 1.8011649e+05 1.07e+05 1.41e+01 -0.8 2.40e+00 - 3.62e-02 1.45e-01h 1 19 1.9359695e+05 9.37e+04 2.22e+01 -0.8 2.36e+00 - 3.74e-02 1.35e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.9482632e+05 9.26e+04 4.67e+01 -0.8 2.36e+00 - 1.63e-01 1.17e-02h 1 21 2.3512483e+05 6.57e+04 2.37e+01 -0.8 2.29e+00 - 1.82e-02 3.40e-01h 1 22 2.9144117e+05 4.36e+04 4.31e+01 -1.0 2.23e+00 - 1.61e-01 4.01e-01h 1 23 3.2450228e+05 3.53e+04 4.30e+01 -1.4 2.09e+00 - 4.30e-01 2.08e-01h 1 24 3.2505811e+05 3.52e+04 4.28e+01 -1.1 1.95e+00 - 8.68e-02 3.29e-03h 1 25 3.3982424e+05 3.24e+04 4.14e+01 -1.0 3.56e+00 - 3.14e-02 8.39e-02h 1 26 3.6797818e+05 2.77e+04 4.13e+01 -1.1 3.76e+00 - 1.11e-01 1.52e-01h 1 27 3.6840494e+05 2.77e+04 7.86e+01 -1.1 1.95e+00 - 1.59e-01 2.25e-03h 1 28 3.8654026e+05 2.53e+04 6.03e+01 -1.0 3.14e+00 - 3.38e-02 9.11e-02h 1 29 3.8745917e+05 2.51e+04 6.44e+01 -1.0 2.27e+00 - 3.53e-02 4.52e-03h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 4.0387008e+05 2.32e+04 5.13e+01 -1.0 1.91e+00 - 2.02e-02 7.85e-02h 1 31 4.0423311e+05 2.32e+04 8.47e+01 -1.1 1.76e+00 - 7.45e-02 1.71e-03h 1 32 4.1546942e+05 2.20e+04 5.28e+01 -1.0 1.92e+00 - 5.35e-03 5.09e-02h 1 33 4.2475894e+05 2.11e+04 5.53e+01 -1.1 2.73e+00 - 6.14e-02 4.09e-02h 1 34 4.2561995e+05 2.11e+04 7.14e+01 -1.0 1.86e+00 - 2.48e-02 3.70e-03h 1 35 4.3858009e+05 1.99e+04 4.68e+01 -1.0 2.04e+00 - 7.62e-03 5.44e-02h 1 36 4.4382192e+05 1.95e+04 9.16e+01 -1.1 2.12e+00 - 9.32e-02 2.16e-02h 1 37 4.5382760e+05 1.88e+04 1.24e+02 -1.1 2.87e+00 - 9.29e-02 3.99e-02h 1 38 4.5625397e+05 1.86e+04 1.30e+02 -1.1 3.15e+00 - 1.88e-02 9.47e-03h 1 39 4.7364545e+05 1.74e+04 8.23e+01 -1.0 2.75e+00 - 9.06e-03 6.64e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 4.7647761e+05 1.72e+04 1.51e+02 -1.1 2.87e+00 - 9.40e-02 1.07e-02h 1 41 5.0122208e+05 1.57e+04 9.99e+01 -1.1 3.02e+00 - 4.24e-02 8.97e-02h 1 42 5.3183236e+05 1.41e+04 1.03e+02 -1.1 2.62e+00 - 1.21e-01 1.06e-01h 1 43 5.4383501e+05 1.35e+04 1.44e+02 -1.2 1.49e+00 - 8.39e-02 4.09e-02h 1 44 5.6114078e+05 1.28e+04 1.85e+02 -1.1 1.82e+00 - 1.04e-01 5.75e-02h 1 45 6.0797525e+05 1.10e+04 9.25e+01 -1.1 1.46e+00 - 8.74e-02 1.47e-01h 1 46 6.4101486e+05 9.90e+03 2.66e+02 -1.3 1.44e+00 - 2.33e-01 1.01e-01h 1 47 6.8944022e+05 8.55e+03 2.02e+02 -1.1 1.02e+00 - 1.23e-01 1.42e-01h 1 48 7.2421668e+05 7.71e+03 7.45e+02 -1.5 6.49e-01 - 4.42e-01 1.01e-01h 1 49 9.4886546e+05 3.99e+03 4.59e+02 -1.8 6.08e-01 - 6.69e-01 5.63e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 1.1968621e+06 1.69e+03 7.99e+02 -2.0 4.25e-01 - 2.66e-01 6.56e-01h 1 51 1.4615505e+06 1.73e+02 3.28e+03 -1.8 2.62e-01 - 1.54e-01 1.00e+00h 1 52 1.4799100e+06 8.88e+01 1.04e+02 -4.3 3.30e-02 - 8.82e-01 4.91e-01h 1 53 1.4983381e+06 6.88e+00 1.45e+01 -6.4 1.73e-02 - 9.41e-01 9.29e-01h 1 54 1.4998889e+06 1.05e-01 2.73e-01 -9.2 1.61e-03 - 9.74e-01 9.85e-01h 1 55 1.4999128e+06 1.35e-03 4.96e-03 -11.0 1.37e-04 - 9.86e-01 9.87e-01h 1 56 1.4999131e+06 2.72e-04 5.69e+00 -11.0 1.18e-05 - 9.95e-01 7.98e-01h 1 57 1.4999131e+06 2.03e-04 1.18e+02 -9.0 8.82e-02 - 1.00e+00 2.53e-01h 1 58 1.4999131e+06 2.03e-04 1.14e+02 -9.0 6.16e-03 - 1.00e+00 1.23e-05f 17 In iteration 58, 1 Slack too small, adjusting variable bound 59 1.4999131e+06 4.41e-06 2.48e+00 -9.0 6.19e-03 - 1.00e+00 9.78e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 1.4999131e+06 2.22e-16 3.08e-12 -9.0 1.39e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 60 (scaled) (unscaled) Objective...............: 1.9581832981563406e+04 1.4999131184532589e+06 Dual infeasibility......: 3.0794629531507237e-12 2.3587816756329061e-10 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 2.0113763524585998e-09 1.5406574961801418e-07 Overall NLP error.......: 2.0113763524585998e-09 1.5406574961801418e-07 Number of objective function evaluations = 77 Number of objective gradient evaluations = 61 Number of equality constraint evaluations = 77 Number of inequality constraint evaluations = 77 Number of equality constraint Jacobian evaluations = 61 Number of inequality constraint Jacobian evaluations = 61 Number of Lagrangian Hessian evaluations = 60 Total CPU secs in IPOPT (w/o function evaluations) = 0.288 Total CPU secs in NLP function evaluations = 0.038 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 1499913.1 60 0.325951 build initial OA NLP0014I 2 OPT 1545222.5 17 0.038995 OA decomposition OA0003I New best feasible of 1545222.5 found after 1.766732 sec and NLP0014I 3 OPT 1544419 22 0.053991 OA decomposition OA0003I New best feasible of 1544419 found after 2.951551 sec and NLP0014I 4 OPT 1543472.4 20 0.049992 OA decomposition OA0003I New best feasible of 1543472.4 found after 4.053384 sec and NLP0014I 5 OPT 1543877.7 21 0.052992 OA decomposition NLP0014I 6 OPT 1550283.3 20 0.049992 OA decomposition NLP0014I 7 OPT 1545653.9 17 0.040994 OA decomposition OA0008I OA converged in 9.01463 seconds found solution of value 1543472.4 (lower bound 1e+50 ). OA0010I Performed 6 iterations, explored 10010 branch-and-bound nodes in total Cbc0012I Integer solution of 1543472.4 found by nonlinear programm after 0 iterations and 0 nodes (8.98 seconds) Cbc0013I At root node, 0 cuts changed objective from 1499913 to 1499913 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 1543472.396808868, took 0 iterations and 0 nodes (8.99 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 1.54347e+06. Best solution: 1.543472e+06 (0 nodes, 9.071 seconds) Best possible: 1.543472e+06 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- BatchS151208M.gms(4241) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job BatchS151208M.gms Stop 09/08/12 19:59:04 elapsed 0:00:09.562 @04 1347127144 ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- =ready= Linux opt205 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Batch/gms/BatchS201210M.gms =========== ----------------------------- Sa 8. Sep 19:58:54 CEST 2012 ----------------------------- @03 1347127134 --- Job BatchS201210M.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- BatchS201210M.gms(5540) 3 Mb --- Starting execution: elapsed 0:00:00.044 --- BatchS201210M.gms(5538) 3 Mb --- Generating MINLP model m --- BatchS201210M.gms(5540) 6 Mb --- 2,328 rows 559 columns 6,664 non-zeroes --- 181 nl-code 67 nl-non-zeroes --- 251 discrete-columns --- BatchS201210M.gms(5540) 4 Mb --- Executing BONMIN: elapsed 0:00:00.061 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 240 Number of nonzeros in inequality constraint Jacobian.: 6376 Number of nonzeros in Lagrangian Hessian.............: 103 Total number of variables............................: 558 variables with only lower bounds: 0 variables with lower and upper bounds: 538 variables with only upper bounds: 0 Total number of equality constraints.................: 24 Total number of inequality constraints...............: 2303 inequality constraints with only lower bounds: 1611 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 692 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.1205028e+05 3.90e+06 5.13e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1457154e+05 3.85e+06 5.35e+00 0.2 7.71e+00 - 4.81e-02 1.44e-02f 1 2 2.8820020e+05 1.75e+06 1.36e+02 0.2 1.19e+01 - 3.25e-02 7.87e-01f 1 3 1.8745970e+05 9.88e+05 7.36e+01 -0.9 2.19e+00 - 6.00e-01 5.76e-01f 1 4 1.4620417e+05 5.99e+05 4.03e+01 -0.6 1.91e+00 - 8.37e-01 5.03e-01f 1 5 1.4294642e+05 5.27e+05 3.49e+01 -0.8 1.36e+00 - 3.85e-01 1.28e-01f 1 6 1.4002548e+05 4.37e+05 2.90e+01 -0.9 1.63e+00 - 4.28e-01 1.91e-01f 1 7 1.4073398e+05 3.71e+05 2.35e+01 -0.8 1.91e+00 - 1.21e-01 1.65e-01h 1 8 1.4299000e+05 3.30e+05 2.10e+01 -0.7 2.33e+00 - 1.57e-01 1.19e-01h 1 9 1.4555552e+05 3.01e+05 1.92e+01 -0.7 2.48e+00 - 1.05e-01 9.07e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.4888434e+05 2.73e+05 1.75e+01 -0.8 2.31e+00 - 1.21e-01 1.00e-01h 1 11 1.5181018e+05 2.55e+05 3.90e+01 -0.7 2.45e+00 - 2.29e-01 6.58e-02h 1 12 1.5935219e+05 2.23e+05 3.19e+01 -0.7 2.35e+00 - 2.23e-02 1.35e-01h 1 13 1.6320604e+05 2.11e+05 3.02e+01 -0.7 2.78e+00 - 6.82e-02 5.58e-02h 1 14 1.6911002e+05 1.96e+05 2.81e+01 -0.7 3.86e+00 - 4.17e-02 7.29e-02h 1 15 1.7262384e+05 1.89e+05 2.70e+01 -0.7 3.15e+00 - 6.83e-02 4.00e-02h 1 16 1.7872295e+05 1.77e+05 2.53e+01 -0.7 3.45e+00 - 1.20e-01 6.47e-02h 1 17 1.9277927e+05 1.55e+05 2.22e+01 -0.7 2.20e+00 - 3.14e-02 1.34e-01h 1 18 2.0576163e+05 1.38e+05 1.99e+01 -0.8 2.26e+00 - 5.06e-02 1.14e-01h 1 19 2.2342269e+05 1.19e+05 1.77e+01 -0.8 2.46e+00 - 5.59e-02 1.47e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 2.8202120e+05 7.77e+04 4.22e+01 -0.8 2.37e+00 - 7.09e-02 4.23e-01h 1 21 3.1188882e+05 6.42e+04 3.69e+01 -1.1 2.22e+00 - 2.98e-01 1.90e-01h 1 22 3.3814756e+05 5.52e+04 8.76e+01 -1.1 2.20e+00 - 5.87e-01 1.50e-01h 1 23 3.3931660e+05 5.48e+04 9.23e+01 -0.9 2.04e+00 - 3.17e-02 6.33e-03h 1 24 3.5027768e+05 5.17e+04 8.12e+01 -0.9 2.06e+00 - 2.94e-02 5.82e-02h 1 25 3.5627455e+05 5.01e+04 8.11e+01 -1.0 2.51e+00 - 4.11e-02 3.10e-02h 1 26 3.7936451e+05 4.47e+04 6.39e+01 -1.0 4.04e+00 - 8.23e-02 1.14e-01h 1 27 3.8513363e+05 4.35e+04 7.04e+01 -1.0 3.77e+00 - 5.31e-02 2.75e-02h 1 28 3.8683582e+05 4.31e+04 8.49e+01 -0.9 2.98e+00 - 4.47e-02 7.94e-03h 1 29 4.1708792e+05 3.77e+04 4.08e+01 -1.0 4.02e+00 - 4.59e-02 1.35e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 4.2245079e+05 3.68e+04 8.23e+01 -1.0 4.79e+00 - 1.12e-01 2.30e-02h 1 31 4.2557150e+05 3.63e+04 1.16e+02 -1.0 1.91e+00 - 7.78e-02 1.32e-02h 1 32 4.3835282e+05 3.45e+04 1.05e+02 -1.0 3.42e+00 - 4.32e-02 5.18e-02h 1 33 4.4408470e+05 3.37e+04 1.40e+02 -1.0 2.91e+00 - 8.05e-02 2.20e-02h 1 34 4.6219324e+05 3.16e+04 1.06e+02 -1.0 4.19e+00 - 2.66e-02 6.60e-02h 1 35 4.6548356e+05 3.12e+04 1.23e+02 -1.0 4.13e+00 - 3.35e-02 1.15e-02h 1 36 4.8790410e+05 2.89e+04 7.86e+01 -1.0 4.61e+00 - 3.23e-02 7.50e-02h 1 37 4.9450309e+05 2.83e+04 1.01e+02 -1.0 4.60e+00 - 4.76e-02 2.14e-02h 1 38 5.1642511e+05 2.64e+04 1.19e+02 -1.0 4.42e+00 - 9.63e-02 6.85e-02h 1 39 5.4303315e+05 2.44e+04 1.71e+02 -1.0 3.55e+00 - 1.45e-01 7.93e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 5.5878476e+05 2.33e+04 2.76e+02 -1.1 1.54e+00 - 1.58e-01 4.54e-02h 1 41 5.9446381e+05 2.11e+04 2.96e+02 -1.1 9.13e-01 - 1.46e-01 9.81e-02h 1 42 6.5752426e+05 1.79e+04 3.68e+02 -1.1 8.64e-01 - 2.65e-01 1.60e-01h 1 43 6.9389304e+05 1.64e+04 6.61e+02 -1.3 7.85e-01 - 3.17e-01 8.75e-02h 1 44 8.7977105e+05 1.09e+04 1.13e+02 -1.2 7.99e-01 - 1.25e-01 3.84e-01h 1 45 8.9057577e+05 1.07e+04 5.83e+02 -1.4 7.33e-01 - 1.91e-01 2.20e-02h 1 46 9.7721861e+05 9.00e+03 2.44e+02 -1.3 7.12e-01 - 7.45e-02 1.67e-01h 1 47 1.0938024e+06 7.20e+03 2.21e+02 -1.2 8.78e-01 - 2.22e-01 2.13e-01h 1 48 1.1045109e+06 7.06e+03 5.98e+02 -1.3 5.95e-01 - 1.11e-01 2.01e-02h 1 49 1.2615268e+06 5.25e+03 9.95e+02 -1.2 5.86e-01 - 4.20e-01 2.75e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 1.5827907e+06 2.77e+03 5.51e+02 -1.5 4.82e-01 - 2.95e-01 5.34e-01h 1 51 1.6814511e+06 2.21e+03 9.94e+02 -1.5 3.31e-01 - 4.16e-01 2.07e-01h 1 52 2.0494721e+06 6.42e+02 1.90e+03 -1.9 2.88e-01 - 3.80e-01 7.88e-01h 1 53 2.2449240e+06 3.01e+01 4.14e+03 -2.0 1.15e-01 - 3.31e-01 1.00e+00h 1 54 2.2514477e+06 1.11e+01 3.91e+01 -3.2 7.46e-03 - 9.60e-01 6.32e-01h 1 55 2.2538111e+06 4.30e+00 6.90e+01 -5.0 3.14e-03 - 8.76e-01 6.14e-01h 1 56 2.2548512e+06 1.30e+00 2.02e+01 -4.9 7.26e-03 - 6.76e-01 6.97e-01h 1 57 2.2552430e+06 1.75e-01 2.84e+00 -6.5 7.30e-04 - 8.75e-01 8.66e-01h 1 58 2.2553032e+06 1.92e-03 2.78e-02 -10.2 4.88e-05 - 9.64e-01 9.89e-01h 1 59 2.2553038e+06 6.16e-05 7.79e-02 -11.0 3.43e-06 - 9.90e-01 9.68e-01h 1 In iteration 59, 1 Slack too small, adjusting variable bound iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 2.2553038e+06 2.46e-05 5.04e+01 -8.4 1.16e-01 - 1.00e+00 6.00e-01h 1 61 2.2553038e+06 6.66e-16 2.91e+01 -8.4 2.62e-02 - 7.56e-01 1.00e+00h 1 62 2.2553038e+06 6.66e-16 4.48e-12 -8.4 1.92e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 62 (scaled) (unscaled) Objective...............: 2.9443694085424449e+04 2.2553038347346177e+06 Dual infeasibility......: 4.4790786390467748e-12 3.4308477738602620e-10 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Complementarity.........: 6.7047598369748094e-09 5.1356567309227136e-07 Overall NLP error.......: 6.7047598369748094e-09 5.1356567309227136e-07 Number of objective function evaluations = 63 Number of objective gradient evaluations = 63 Number of equality constraint evaluations = 63 Number of inequality constraint evaluations = 63 Number of equality constraint Jacobian evaluations = 63 Number of inequality constraint Jacobian evaluations = 63 Number of Lagrangian Hessian evaluations = 62 Total CPU secs in IPOPT (w/o function evaluations) = 0.397 Total CPU secs in NLP function evaluations = 0.046 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 2255303.8 62 0.442933 build initial OA NLP0014I 2 OPT 2311640.5 23 0.076989 OA decomposition OA0003I New best feasible of 2311640.5 found after 2.808573 sec and NLP0014I 3 OPT 2295348.8 22 0.072989 OA decomposition OA0003I New best feasible of 2295348.8 found after 5.491165 sec and NLP0014I 4 OPT 2296535.2 21 0.07099 OA decomposition NLP0014I 5 OPT 2298404.4 24 0.082987 OA decomposition NLP0014I 6 OPT 2296898 21 0.071989 OA decomposition NLP0014I 7 OPT 2295891.3 26 0.086987 OA decomposition NLP0014I 8 OPT 2295585.5 17 0.052992 OA decomposition NLP0014I 9 OPT 2299312.3 25 0.082987 OA decomposition OA0008I OA converged in 18.229228 seconds found solution of value 2295348.8 (lower bound 1e+50 ). OA0010I Performed 8 iterations, explored 16825 branch-and-bound nodes in total Cbc0012I Integer solution of 2295348.8 found by nonlinear programm after 0 iterations and 0 nodes (18.18 seconds) Cbc0013I At root node, 0 cuts changed objective from 2255303.7 to 2255303.7 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 2295348.846878975, took 0 iterations and 0 nodes (18.18 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 2.29535e+06. Best solution: 2.295349e+06 (0 nodes, 18.315 seconds) Best possible: 2.295349e+06 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- BatchS201210M.gms(5540) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job BatchS201210M.gms Stop 09/08/12 19:59:13 elapsed 0:00:18.935 @04 1347127153 ----------------------------- Sa 8. Sep 19:59:13 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0203h.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0203h.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0203h.gms(386) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- clay0203h.gms(384) 3 Mb --- Generating MINLP model m --- clay0203h.gms(386) 5 Mb --- 133 rows 91 columns 367 non-zeroes --- 816 nl-code 72 nl-non-zeroes --- 18 discrete-columns --- clay0203h.gms(386) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 96 Number of nonzeros in inequality constraint Jacobian.: 264 Number of nonzeros in Lagrangian Hessian.............: 30 Total number of variables............................: 90 variables with only lower bounds: 66 variables with lower and upper bounds: 24 variables with only upper bounds: 0 Total number of equality constraints.................: 24 Total number of inequality constraints...............: 108 inequality constraints with only lower bounds: 12 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 96 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.2800000e+01 1.26e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.8879800e+01 1.25e+01 3.20e+01 0.3 2.16e+01 - 1.40e-02 9.78e-03f 1 2 2.9884033e+01 1.25e+01 3.20e+01 0.3 5.98e+01 - 4.56e-03 8.12e-04h 1 3 3.3011781e+01 1.25e+01 3.20e+01 0.3 2.79e+02 - 1.75e-03 1.52e-03f 1 4 3.5175015e+01 1.24e+01 3.19e+01 0.2 3.59e+02 - 3.05e-03 1.86e-03f 1 5 3.5869295e+01 1.24e+01 8.83e+01 0.2 6.88e+02 - 1.40e-04 6.14e-04f 1 6 3.7100475e+01 1.24e+01 8.71e+01 0.2 3.12e+02 - 6.78e-04 1.09e-03f 1 7 3.7593385e+01 1.24e+01 8.85e+01 0.2 2.28e+02 - 1.80e-03 4.73e-04f 1 8r 3.7593385e+01 1.24e+01 9.99e+02 1.1 0.00e+00 - 0.00e+00 3.66e-06R 4 9r 9.8201629e+01 1.79e+01 9.96e+02 0.9 1.25e+03 - 1.08e-03 2.86e-03f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10r 1.8316139e+02 2.88e+01 9.95e+02 0.9 1.69e+03 - 3.31e-04 1.55e-03f 1 11r 5.0875065e+02 8.24e+01 9.90e+02 0.9 1.64e+03 - 7.66e-04 5.01e-03f 1 12r 5.4430008e+02 8.30e+01 9.90e+02 0.9 8.27e+03 - 8.05e-04 6.05e-04f 1 13r 5.6907060e+02 8.34e+01 9.89e+02 0.9 8.44e+04 - 2.01e-06 4.50e-04f 1 14r 9.0662066e+02 8.39e+01 9.85e+02 0.8 4.09e+02 0.0 6.64e-03 7.28e-03f 1 15r 9.8217987e+02 8.52e+01 9.84e+02 0.8 3.39e+02 -0.5 1.56e-03 2.96e-03f 1 16r 1.0552656e+03 9.62e+01 9.78e+02 0.8 9.99e+02 -1.0 6.02e-03 3.52e-03f 1 17r 1.1171312e+03 1.00e+02 9.71e+02 0.8 4.40e+02 -0.5 1.21e-02 4.47e-03f 1 18r 1.3403258e+03 1.25e+02 9.46e+02 0.9 1.98e+02 -0.1 8.35e-02 2.59e-02f 1 19r 1.4032095e+03 1.25e+02 9.18e+02 0.9 7.58e+01 0.3 8.50e-02 3.09e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20r 1.4445213e+03 1.25e+02 8.93e+02 0.8 1.50e+02 -0.2 1.39e-02 2.74e-02f 1 21r 1.6079948e+03 1.52e+02 1.48e+03 0.8 5.77e+01 0.3 3.19e-02 1.38e-01f 1 22r 1.6571690e+03 1.42e+02 2.66e+03 0.8 2.34e+01 0.7 5.71e-02 6.66e-02f 1 23r 1.7402640e+03 1.31e+02 2.40e+03 0.8 8.26e+01 0.2 1.58e-02 6.84e-02f 1 24r 2.1092214e+03 1.17e+02 1.95e+03 0.8 6.69e+01 0.6 3.41e-02 1.37e-01f 1 25r 2.1263602e+03 1.16e+02 1.78e+03 0.7 1.71e+01 1.1 2.74e-01 1.26e-02f 1 26r 2.2480826e+03 1.14e+02 1.75e+03 0.8 1.67e+02 0.6 5.88e-02 9.45e-03f 1 27r 2.6030979e+03 1.06e+02 1.61e+03 0.7 3.61e+01 1.0 1.09e-02 7.82e-02f 1 28r 2.9313276e+03 9.90e+01 1.51e+03 0.7 2.85e+01 1.4 7.46e-02 6.33e-02f 1 29r 2.6940656e+03 5.15e+01 3.42e+03 0.6 8.49e+00 1.9 1.43e-01 4.83e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30r 2.6202361e+03 1.72e+01 5.67e+02 0.2 7.22e+00 1.4 2.27e-01 6.62e-01f 1 31r 2.5425228e+03 1.34e+01 3.38e+02 0.2 2.02e+01 0.9 4.19e-01 2.19e-01f 1 32r 2.5372040e+03 1.30e+01 3.27e+02 0.3 6.56e+00 1.3 2.24e-01 2.71e-02f 1 33r 2.6261623e+03 1.17e+01 3.09e+02 0.4 4.64e+01 0.9 8.26e-02 9.36e-02f 1 34r 2.6457971e+03 1.10e+01 5.92e+02 0.2 1.06e+01 1.3 4.00e-01 5.78e-02f 1 35r 2.6630828e+03 5.34e+00 1.37e+04 0.3 9.88e+00 0.8 6.76e-02 8.80e-01f 1 36r 2.7304860e+03 5.03e+00 1.28e+04 0.3 2.65e+01 1.2 4.81e-02 6.39e-02f 1 37r 2.7308627e+03 5.01e+00 1.28e+04 0.1 6.99e+00 0.8 6.69e-01 3.75e-03f 1 38r 2.6734416e+03 9.82e-01 2.53e+03 -1.8 8.78e-01 1.2 7.86e-01 8.02e-01f 1 39 1.8350983e+03 8.00e-01 9.37e+01 0.7 4.49e+01 - 1.14e-01 3.13e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 1.0503023e+03 3.60e+00 8.54e+01 0.7 4.18e+01 - 1.50e-01 8.60e-02f 1 41 4.9484686e+02 5.35e+00 7.62e+01 0.8 1.17e+02 - 1.23e-01 8.91e-02f 1 42 1.7010209e+02 1.48e+01 5.03e+01 0.5 2.99e+01 - 2.91e-01 3.47e-01f 1 43 1.2423188e+02 2.13e+01 8.65e+01 0.3 2.90e+01 - 2.27e-01 3.81e-01f 1 44 1.4674164e+02 4.08e+01 8.95e+01 0.4 2.33e+01 - 4.96e-01 1.00e+00f 1 45 1.4724617e+02 3.80e+01 5.77e+01 0.4 6.88e+01 - 3.69e-01 3.13e-01f 1 46 1.4820556e+02 1.88e+02 2.37e+01 0.4 5.65e+01 - 3.78e-01 1.00e+00f 1 47 1.4818025e+02 1.95e+01 1.27e+01 0.4 5.98e+01 - 6.79e-01 1.00e+00f 1 48 1.4818525e+02 3.55e-15 3.28e+01 0.4 1.51e+02 - 5.27e-01 1.00e+00f 1 49 1.4818654e+02 5.33e-15 4.46e+00 0.4 4.50e+02 - 5.05e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 1.4818655e+02 7.99e-15 1.67e+01 0.4 1.08e+03 - 5.15e-01 1.00e+00f 1 51 1.4818662e+02 7.11e-15 1.75e+01 0.4 4.81e+02 - 1.00e+00 1.00e+00h 1 52 1.4818661e+02 7.11e-15 1.25e+00 0.4 8.89e+01 - 1.00e+00 1.00e+00h 1 53 1.4818664e+02 7.11e-15 6.76e-03 0.4 3.29e+01 - 1.00e+00 1.00e+00h 1 54 1.5447797e+00 7.11e-15 3.07e-03 -11.0 2.47e-01 - 9.90e-01 9.90e-01f 1 55 1.5454552e-02 7.11e-15 3.08e-05 -11.0 2.62e-03 - 9.90e-01 9.90e-01f 1 56 4.4753683e-06 3.55e-15 9.17e-09 -11.0 2.62e-05 - 1.00e+00 1.00e+00h 1 57 -1.2746000e-07 7.11e-15 1.96e-14 -11.0 7.49e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 57 (scaled) (unscaled) Objective...............: -4.2486666666473681e-08 -1.2745999999942106e-07 Dual infeasibility......: 1.9584374883329067e-14 5.8753124649987201e-14 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.0002306789427071e-11 3.0006920368281218e-11 Overall NLP error.......: 1.0002306789427071e-11 3.0006920368281218e-11 Number of objective function evaluations = 61 Number of objective gradient evaluations = 28 Number of equality constraint evaluations = 61 Number of inequality constraint evaluations = 61 Number of equality constraint Jacobian evaluations = 58 Number of inequality constraint Jacobian evaluations = 58 Number of Lagrangian Hessian evaluations = 57 Total CPU secs in IPOPT (w/o function evaluations) = 0.056 Total CPU secs in NLP function evaluations = 0.021 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.2746e-07 57 0.076988 build initial OA NLP0014I 2 INFEAS 1.1465353 187 0.221966 OA decomposition NLP0014I 3 INFEAS 0.68167453 136 0.161975 OA decomposition NLP0014I 4 INFEAS 0.68177179 121 0.067989 OA decomposition NLP0014I 5 INFEAS 0.25675683 113 0.055992 OA decomposition NLP0014I 6 INFEAS 0.37098303 96 0.054992 OA decomposition NLP0014I 7 OPT 41709.808 55 0.027995 OA decomposition OA0003I New best feasible of 41709.808 found after 0.814876 sec and NLP0014I 8 OPT 41573.302 54 0.027996 OA decomposition OA0003I New best feasible of 41573.302 found after 0.876867 sec and NLP0014I 9 OPT 42098.883 56 0.029995 OA decomposition OA0008I OA converged in 0.973852 seconds found solution of value 41573.302 (lower bound 1e+50 ). OA0010I Performed 8 iterations, explored 807 branch-and-bound nodes in total Cbc0012I Integer solution of 41573.302 found by nonlinear programm after 1 iterations and 0 nodes (0.97 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 3.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 41573.30175996847, took 1 iterations and 0 nodes (0.97 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 41573.3. Best solution: 4.157330e+04 (0 nodes, 1.013 seconds) Best possible: 4.157330e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0203h.gms(386) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0203h.gms Stop 09/08/12 19:58:56 elapsed 0:00:01.201 @04 1347127136 ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- =ready= Linux opt207 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0203m.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0203m.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0203m.gms(170) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- clay0203m.gms(168) 3 Mb --- Generating MIQCP model m --- clay0203m.gms(170) 5 Mb --- 55 rows 31 columns 169 non-zeroes --- 216 nl-code 48 nl-non-zeroes --- 18 discrete-columns --- clay0203m.gms(170) 3 Mb --- Executing BONMIN: elapsed 0:00:00.011 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 18 Number of nonzeros in inequality constraint Jacobian.: 144 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 30 variables with only lower bounds: 6 variables with lower and upper bounds: 24 variables with only upper bounds: 0 Total number of equality constraints.................: 6 Total number of inequality constraints...............: 48 inequality constraints with only lower bounds: 12 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 36 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.2800000e+01 5.74e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.6759434e+04 9.77e-15 2.03e+03 1.3 5.12e+01 - 3.57e-02 1.00e+00H 1 2 4.7829162e+03 9.21e-15 1.96e+03 0.9 3.34e+02 - 7.19e-01 6.04e-02f 1 3 9.5118393e+02 3.66e-15 7.84e+02 -1.0 1.67e+01 - 9.39e-01 6.03e-01f 1 4 1.1182324e+01 2.22e-16 2.13e+01 -6.1 3.20e+00 - 9.64e-01 9.73e-01f 1 5 1.1603866e-01 1.11e-16 2.36e-01 -11.0 3.82e-02 - 9.90e-01 9.89e-01f 1 6 1.1607492e-03 0.00e+00 2.36e-03 -11.0 3.94e-04 - 9.90e-01 9.90e-01h 1 7 2.6152571e-06 1.11e-16 5.58e-06 -11.0 9.92e-06 - 9.98e-01 9.98e-01h 1 8 -1.2746000e-07 0.00e+00 1.98e-12 -11.0 4.39e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -4.2486666821267086e-08 -1.2746000046380126e-07 Dual infeasibility......: 1.9822203682866512e-12 5.9466611048599537e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.7867995879269221e-11 5.3603987637807662e-11 Overall NLP error.......: 1.7867995879269221e-11 5.3603987637807662e-11 Number of objective function evaluations = 10 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 10 Number of inequality constraint evaluations = 10 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total CPU secs in IPOPT (w/o function evaluations) = 0.008 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.2746e-07 8 0.007999 build initial OA NLP0014I 2 INFEAS 0.86245995 44 0.039994 OA decomposition NLP0014I 3 INFEAS 3.8937516 49 0.039994 OA decomposition NLP0014I 4 INFEAS 0.86245995 44 0.038995 OA decomposition NLP0014I 5 INFEAS 1.4642512 43 0.035994 OA decomposition NLP0014I 6 INFEAS 1.4642512 45 0.035995 OA decomposition NLP0014I 7 OPT 42098.845 35 0.017997 OA decomposition OA0003I New best feasible of 42098.845 found after 0.388941 sec and NLP0014I 8 OPT 41709.769 34 0.020996 OA decomposition OA0003I New best feasible of 41709.769 found after 0.45693 sec and NLP0014I 9 OPT 41737.46 37 0.026996 OA decomposition NLP0014I 10 OPT 41737.46 35 0.030996 OA decomposition NLP0014I 11 OPT 41573.262 32 0.008999 OA decomposition OA0003I New best feasible of 41573.262 found after 0.671898 sec and OA0008I OA converged in 0.705893 seconds found solution of value 41573.262 (lower bound 1e+50 ). OA0010I Performed 10 iterations, explored 577 branch-and-bound nodes in total Cbc0012I Integer solution of 41573.262 found by nonlinear programm after 3 iterations and 0 nodes (0.70 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 5 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 41573.26243945388, took 3 iterations and 0 nodes (0.71 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 5 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 41573.3. Best solution: 4.157326e+04 (0 nodes, 0.745 seconds) Best possible: 4.157326e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0203m.gms(170) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0203m.gms Stop 09/08/12 19:58:56 elapsed 0:00:00.852 @04 1347127136 ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- =ready= Linux opt208 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0204h.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0204h.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0204h.gms(630) 2 Mb --- Starting execution: elapsed 0:00:00.012 --- clay0204h.gms(628) 3 Mb --- Generating MINLP model m --- clay0204h.gms(630) 5 Mb --- 235 rows 165 columns 653 non-zeroes --- 1,088 nl-code 96 nl-non-zeroes --- 32 discrete-columns --- clay0204h.gms(630) 3 Mb --- Executing BONMIN: elapsed 0:00:00.015 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 176 Number of nonzeros in inequality constraint Jacobian.: 464 Number of nonzeros in Lagrangian Hessian.............: 40 Total number of variables............................: 164 variables with only lower bounds: 124 variables with lower and upper bounds: 40 variables with only upper bounds: 0 Total number of equality constraints.................: 42 Total number of inequality constraints...............: 192 inequality constraints with only lower bounds: 24 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 168 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.2400000e+01 1.26e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.7013222e+01 1.25e+01 3.20e+01 0.2 2.22e+01 - 1.34e-02 1.01e-02f 1 2 4.8635655e+01 1.25e+01 3.20e+01 0.2 9.06e+01 - 2.94e-03 6.27e-04h 1 3 5.3436619e+01 1.25e+01 3.20e+01 0.2 2.92e+02 - 1.70e-03 1.16e-03f 1 4 5.7457866e+01 1.24e+01 3.19e+01 0.1 4.08e+02 - 3.56e-03 1.72e-03f 1 5 6.2321579e+01 1.24e+01 1.40e+02 0.1 2.69e+02 - 5.15e-04 2.09e-03f 1 6 6.2618561e+01 1.24e+01 1.41e+02 0.1 2.18e+02 - 1.15e-03 1.34e-04f 2 7 6.2773434e+01 1.24e+01 1.42e+02 0.1 2.36e+02 - 1.06e-03 7.35e-05f 2 8 6.2917344e+01 1.24e+01 1.42e+02 0.1 3.32e+02 - 6.27e-04 7.93e-05f 2 9 6.3556221e+01 1.24e+01 1.42e+02 0.1 4.73e+02 - 9.48e-05 3.65e-04f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.4596826e+01 1.24e+01 1.43e+02 0.1 3.46e+02 - 4.38e-04 5.75e-04f 1 11 6.5994352e+01 1.24e+01 1.45e+02 0.1 3.60e+02 - 7.84e-04 6.95e-04f 1 12 6.6691949e+01 1.24e+01 1.45e+02 0.1 3.78e+02 - 1.48e-03 2.68e-04f 1 13 6.8703753e+01 1.24e+01 1.47e+02 0.1 3.89e+02 - 4.20e-04 6.65e-04f 1 14 7.1017517e+01 1.24e+01 1.48e+02 0.1 3.74e+02 - 1.90e-03 6.48e-04f 1 15 7.5506189e+01 1.23e+01 1.52e+02 0.1 3.62e+02 - 9.18e-04 1.67e-03f 1 16 8.7673427e+01 1.23e+01 1.53e+02 0.1 3.33e+02 - 3.97e-03 4.73e-03f 1 17 1.4373231e+02 1.20e+01 2.34e+02 0.1 2.86e+02 - 3.75e-03 2.21e-02f 1 18 1.5056876e+02 1.20e+01 2.32e+02 0.1 2.19e+02 0.0 3.66e-03 2.74e-03f 1 19 1.5092760e+02 1.20e+01 2.32e+02 0.1 1.59e+02 0.4 2.65e-04 1.45e-04h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.5308601e+02 1.20e+01 2.30e+02 0.1 1.67e+02 0.9 1.86e-03 9.53e-04h 1 21 1.5445752e+02 1.20e+01 2.27e+02 0.1 1.86e+02 1.3 2.44e-04 6.92e-04h 1 22 1.5892404e+02 1.19e+01 1.26e+03 0.1 3.16e+02 0.8 1.55e-03 2.01e-03f 1 23r 1.5892404e+02 1.19e+01 9.99e+02 1.1 0.00e+00 2.1 0.00e+00 3.42e-06R 7 24r 5.3691170e+02 5.66e+01 9.94e+02 0.8 4.88e+03 - 5.21e-04 4.72e-03f 1 25r 7.2428402e+02 5.95e+01 9.93e+02 0.8 8.26e+03 - 1.51e-03 1.46e-03f 1 26r 1.3864668e+03 1.36e+02 9.90e+02 0.8 8.60e+03 - 2.06e-03 5.25e-03f 1 27r 1.5867399e+03 1.46e+02 9.85e+02 0.8 6.68e+03 - 4.27e-03 2.26e-03f 1 28r 1.8369753e+03 1.54e+02 9.81e+02 0.8 3.93e+03 - 5.70e-03 4.15e-03f 1 29r 1.8978845e+03 1.53e+02 9.79e+02 0.8 1.06e+03 - 1.59e-03 1.66e-03f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30r 2.0707483e+03 1.52e+02 9.77e+02 0.8 1.39e+03 - 3.31e-03 5.37e-03f 1 31r 2.1887215e+03 1.51e+02 9.78e+02 0.8 3.10e+03 - 1.78e-03 5.18e-03f 1 32r 2.2762636e+03 1.50e+02 9.74e+02 0.8 1.47e+03 - 4.07e-03 4.89e-03f 1 33r 2.3918373e+03 1.49e+02 9.47e+02 0.8 2.67e+02 - 4.73e-02 8.41e-03f 1 34r 2.7905955e+03 1.38e+02 8.96e+02 0.7 1.18e+02 - 3.48e-02 7.31e-02f 1 35r 2.8632778e+03 1.34e+02 8.71e+02 0.7 2.64e+02 - 2.78e-02 3.54e-02f 1 36r 2.8904336e+03 1.53e+02 8.60e+02 0.7 2.16e+03 - 1.26e-02 1.22e-02f 1 37r 2.9867444e+03 1.46e+02 7.96e+02 0.7 7.07e+01 - 7.98e-02 4.88e-02f 1 38r 3.0818435e+03 1.39e+02 7.85e+02 0.7 6.94e+02 - 9.61e-03 5.36e-02f 1 39r 3.4335219e+03 1.22e+02 6.18e+02 0.7 7.72e+01 - 2.11e-01 1.89e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40r 3.5565189e+03 9.49e+01 5.64e+02 0.6 7.15e+01 - 1.01e-01 2.77e-01f 1 41r 3.5503145e+03 9.49e+01 5.64e+02 0.7 6.69e+04 -4.0 6.03e-05 4.75e-04f 1 42r 4.9771501e+03 2.39e+01 4.30e+02 0.6 4.47e+01 - 4.70e-01 8.76e-01f 1 43r 4.5873485e+03 1.01e+01 4.03e+02 0.0 7.19e+01 - 9.08e-02 5.00e-01f 1 44r 4.6653154e+03 1.73e+01 3.07e+02 0.4 4.90e+02 - 2.28e-01 8.73e-02f 1 45r 4.6514162e+03 1.39e+01 2.82e+02 0.3 2.31e+01 - 8.61e-02 1.30e-01f 1 46r 4.4107778e+03 5.74e+00 2.40e+02 0.3 4.89e+01 - 1.72e-01 3.32e-01f 1 47r 4.4854773e+03 2.01e+01 2.35e+02 0.3 2.64e+02 - 2.60e-02 9.86e-02f 1 48r 4.4836812e+03 2.35e-01 4.62e+02 0.3 2.25e+01 - 1.81e-01 6.94e-01f 1 49r 4.5102619e+03 7.69e+00 4.69e+02 0.2 1.60e+02 - 8.53e-02 2.49e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50r 4.5046235e+03 6.87e+00 6.08e+02 -0.0 1.03e+02 - 6.67e-01 2.60e-02f 1 51r 3.7435646e+03 5.59e-04 9.04e+01 -0.9 6.05e+01 - 7.11e-01 8.02e-01f 1 52r 3.4159995e+03 9.69e-05 2.30e+01 -2.4 1.96e+01 - 7.06e-01 9.12e-01f 1 53r 3.3196416e+03 5.02e-06 4.92e+00 -3.6 7.69e+00 - 8.53e-01 9.84e-01f 1 54r 3.2360215e+03 4.94e-08 3.94e-01 -4.9 3.23e+00 - 9.37e-01 9.97e-01h 1 55 2.8769832e+03 4.53e-08 2.59e+02 1.0 1.50e+02 - 1.42e-01 8.36e-02f 1 56 2.6618555e+03 4.17e-08 2.36e+02 1.1 1.77e+02 - 8.65e-02 7.78e-02f 1 57 2.4727458e+03 3.42e-08 1.88e+02 1.0 7.50e+01 - 1.97e-01 1.80e-01f 1 58 1.8738431e+03 4.64e-10 2.03e+02 0.9 1.61e+01 - 1.75e-01 9.86e-01f 1 59 1.3801921e+03 4.06e-10 1.61e+02 0.9 7.06e+01 - 2.31e-01 1.26e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 7.8096880e+02 3.08e-10 1.34e+02 0.9 4.23e+01 - 1.52e-01 2.42e-01f 1 61 5.5079150e+02 2.32e-10 9.60e+01 0.5 1.74e+01 - 3.12e-01 2.46e-01f 1 62 3.6243795e+02 1.55e-10 6.44e+01 0.5 1.88e+01 - 7.15e-01 3.33e-01f 1 63 4.9732394e+01 2.89e-11 1.20e+01 -1.8 1.35e+00 - 8.57e-01 8.13e-01f 1 64 2.0798620e+00 1.35e-12 5.56e-01 -5.2 3.21e-01 - 9.75e-01 9.53e-01f 1 65 2.2040372e-02 1.47e-14 5.97e-03 -10.2 1.56e-02 - 9.88e-01 9.89e-01f 1 66 1.3513084e-04 1.78e-15 3.67e-05 -11.0 1.65e-04 - 9.94e-01 9.94e-01h 1 67 -2.1817109e-07 1.78e-15 6.38e-09 -11.0 1.04e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 67 (scaled) (unscaled) Objective...............: -7.2723695227133528e-08 -2.1817108568140060e-07 Dual infeasibility......: 6.3752523260518501e-09 1.9125756978155550e-08 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 3.5063701701041593e-09 1.0519110510312479e-08 Overall NLP error.......: 6.3752523260518501e-09 1.9125756978155550e-08 Number of objective function evaluations = 77 Number of objective gradient evaluations = 37 Number of equality constraint evaluations = 77 Number of inequality constraint evaluations = 77 Number of equality constraint Jacobian evaluations = 68 Number of inequality constraint Jacobian evaluations = 68 Number of Lagrangian Hessian evaluations = 67 Total CPU secs in IPOPT (w/o function evaluations) = 0.089 Total CPU secs in NLP function evaluations = 0.022 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2.1817109e-07 67 0.110983 build initial OA NLP0014I 2 INFEAS 0.68177179 113 0.081987 OA decomposition NLP0014I 3 OPT 6545 54 0.039994 OA decomposition OA0003I New best feasible of 6545 found after 0.900863 sec and OA0008I OA converged in 0.901863 seconds found solution of value 6545 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 2051 branch-and-bound nodes in total Cbc0012I Integer solution of 6545 found by nonlinear programm after 2 iterations and 0 nodes (0.90 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 2 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 6544.999998735548, took 2 iterations and 0 nodes (0.90 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 2 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 6545. Best solution: 6.545000e+03 (0 nodes, 0.913 seconds) Best possible: 6.545000e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0204h.gms(630) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0204h.gms Stop 09/08/12 19:58:56 elapsed 0:00:01.139 @04 1347127136 ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- =ready= Linux opt209 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0204m.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0204m.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0204m.gms(250) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- clay0204m.gms(248) 3 Mb --- Generating MIQCP model m --- clay0204m.gms(250) 5 Mb --- 91 rows 53 columns 285 non-zeroes --- 288 nl-code 64 nl-non-zeroes --- 32 discrete-columns --- clay0204m.gms(250) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 32 Number of nonzeros in inequality constraint Jacobian.: 240 Number of nonzeros in Lagrangian Hessian.............: 8 Total number of variables............................: 52 variables with only lower bounds: 12 variables with lower and upper bounds: 40 variables with only upper bounds: 0 Total number of equality constraints.................: 10 Total number of inequality constraints...............: 80 inequality constraints with only lower bounds: 24 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 56 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.2400000e+01 5.70e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.5140116e+04 1.33e-14 1.94e+03 1.3 5.35e+01 - 4.31e-02 1.00e+00H 1 2 1.0555527e+04 1.24e-14 1.88e+03 1.0 2.91e+02 - 8.35e-01 6.74e-02f 1 3 1.9748670e+03 3.66e-15 5.70e+02 -0.9 1.38e+01 - 9.37e-01 6.97e-01f 1 4 2.2318044e+01 2.22e-16 1.17e+01 -6.5 2.68e+00 - 9.70e-01 9.79e-01f 1 5 2.2845960e-01 2.22e-16 1.23e-01 -11.0 3.09e-02 - 9.90e-01 9.89e-01f 1 6 2.2849583e-03 2.22e-16 1.23e-03 -11.0 3.14e-04 - 9.90e-01 9.90e-01f 1 7 2.5990355e-06 2.22e-16 1.53e-06 -11.0 1.84e-05 - 9.99e-01 9.99e-01h 1 8 -2.2292000e-07 2.22e-16 2.06e-12 -11.0 1.52e-02 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -7.4306666705302959e-08 -2.2292000011590888e-07 Dual infeasibility......: 2.0552099045841312e-12 6.1656297137523935e-12 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 1.8534174822063413e-11 5.5602524466190240e-11 Overall NLP error.......: 1.8534174822063413e-11 5.5602524466190240e-11 Number of objective function evaluations = 10 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 10 Number of inequality constraint evaluations = 10 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total CPU secs in IPOPT (w/o function evaluations) = 0.007 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2.2292e-07 8 0.007998 build initial OA NLP0014I 2 INFEAS 0.86245992 51 0.048993 OA decomposition NLP0014I 3 INFEAS 0.86245992 52 0.048993 OA decomposition NLP0014I 4 OPT 6545 19 0.006999 OA decomposition OA0003I New best feasible of 6545 found after 0.72789 sec and OA0008I OA converged in 0.72789 seconds found solution of value 6545 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 1719 branch-and-bound nodes in total Cbc0012I Integer solution of 6545 found by nonlinear programm after 5 iterations and 0 nodes (0.73 seconds) Cbc0031I 4 added rows had average density of 3 Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 22 row cuts average 3.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 6544.999990907055, took 5 iterations and 0 nodes (0.73 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 22 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 6545. Best solution: 6.545000e+03 (0 nodes, 0.742 seconds) Best possible: 6.545000e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0204m.gms(250) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0204m.gms Stop 09/08/12 19:58:56 elapsed 0:00:00.850 @04 1347127136 ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- =ready= Linux opt210 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0205h.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0205h.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0205h.gms(938) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- clay0205h.gms(936) 3 Mb --- Generating MINLP model m --- clay0205h.gms(938) 5 Mb --- 366 rows 261 columns 1,021 non-zeroes --- 1,360 nl-code 120 nl-non-zeroes --- 50 discrete-columns --- clay0205h.gms(938) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 280 Number of nonzeros in inequality constraint Jacobian.: 720 Number of nonzeros in Lagrangian Hessian.............: 50 Total number of variables............................: 260 variables with only lower bounds: 200 variables with lower and upper bounds: 60 variables with only upper bounds: 0 Total number of equality constraints.................: 65 Total number of inequality constraints...............: 300 inequality constraints with only lower bounds: 40 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 260 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5700000e+01 1.36e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.8484261e+01 1.35e+01 3.20e+01 0.1 2.24e+01 - 1.31e-02 1.02e-02f 1 2 4.9617340e+01 1.35e+01 3.20e+01 0.1 1.18e+02 - 2.61e-03 4.05e-04h 1 3 5.5277500e+01 1.35e+01 3.20e+01 0.1 2.72e+02 - 1.43e-03 1.20e-03f 1 4 5.9870828e+01 1.34e+01 3.19e+01 0.0 4.40e+02 - 3.22e-03 1.57e-03f 1 5 6.3295172e+01 1.34e+01 6.75e+01 0.0 4.18e+02 - 8.54e-05 1.18e-03f 1 6 6.5422665e+01 1.34e+01 6.80e+01 0.0 2.40e+02 - 1.23e-03 7.42e-04f 1 7r 6.5422665e+01 1.34e+01 9.99e+02 1.1 0.00e+00 - 0.00e+00 3.29e-06R 3 8r 1.9561860e+02 5.48e+01 9.96e+02 0.9 2.51e+03 - 6.00e-04 2.55e-03f 1 9r 4.6317074e+02 5.29e+01 9.93e+02 0.9 9.16e+00 2.0 1.13e-02 3.07e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10r 5.9181860e+02 5.05e+01 2.32e+03 0.9 3.31e+00 2.4 5.91e-01 4.36e-02f 1 11r 1.0095858e+03 5.10e+01 2.22e+03 1.0 2.90e+02 - 5.91e-03 1.78e-02f 1 12r 1.7535851e+03 5.33e+01 2.16e+03 1.0 1.99e+02 - 1.26e-02 1.79e-02f 1 13r 2.4705726e+03 5.24e+02 2.10e+03 1.0 2.47e+03 - 2.36e-03 1.18e-02f 1 14r 2.5580482e+03 5.26e+02 2.11e+03 0.9 1.98e+03 - 8.43e-03 3.21e-03f 1 15r 2.6742862e+03 5.23e+02 2.09e+03 1.0 3.47e+03 - 7.98e-03 6.32e-03f 1 16r 2.7671432e+03 5.13e+02 2.08e+03 1.0 8.08e+00 1.9 6.62e-02 1.94e-02f 1 17r 2.9181974e+03 4.98e+02 2.03e+03 0.9 2.12e+01 1.5 1.77e-02 2.94e-02f 1 18r 2.9634698e+03 4.91e+02 1.91e+03 1.0 4.73e+01 1.0 7.64e-02 1.28e-02f 1 19r 3.0050202e+03 4.80e+02 1.86e+03 0.9 6.22e+01 0.5 1.81e-02 2.35e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20r 3.0258256e+03 4.77e+02 1.83e+03 1.0 1.19e+02 0.0 1.65e-02 1.43e-02f 1 21r 3.0542035e+03 5.16e+02 1.80e+03 0.9 7.59e+02 -0.4 1.40e-02 2.24e-02f 1 22r 3.0594029e+03 5.15e+02 1.69e+03 1.0 1.56e+02 -0.0 6.19e-02 5.08e-03f 1 23r 3.0743897e+03 5.13e+02 1.67e+03 1.0 7.12e+02 -0.5 1.33e-02 1.80e-02f 1 24r 3.0939632e+03 4.99e+02 1.62e+03 1.0 2.86e+02 -0.1 2.57e-02 2.67e-02f 1 25r 3.0983573e+03 5.06e+02 1.72e+03 1.0 1.62e+03 -0.5 2.37e-03 7.53e-03f 1 26r 3.1044759e+03 5.01e+02 1.71e+03 0.9 2.04e+01 0.8 1.98e-01 1.03e-02f 1 27r 3.1686687e+03 4.11e+02 1.44e+03 0.8 6.89e+00 1.2 1.63e-01 1.79e-01f 1 28r 3.2464166e+03 2.36e+02 1.18e+03 0.7 2.09e+01 0.7 1.59e-01 4.38e-01f 1 29r 3.2516961e+03 1.80e+02 2.99e+03 0.6 8.38e+01 0.3 8.65e-02 2.40e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30r 3.2516570e+03 1.80e+02 2.99e+03 0.8 6.63e+02 -0.2 3.64e-02 1.68e-03f 1 31r 3.2449917e+03 1.60e+02 2.67e+03 0.7 9.21e+01 0.2 8.15e-02 1.06e-01f 1 32r 3.2424665e+03 1.59e+02 2.68e+03 0.7 1.65e+01 0.6 1.62e-01 1.08e-02f 1 33r 3.1796303e+03 1.11e+02 2.05e+03 0.7 6.30e+00 1.1 7.07e-02 3.01e-01f 1 34r 3.1738313e+03 7.89e+01 1.55e+03 0.6 2.39e+00 1.5 4.60e-02 2.79e-01f 1 35r 3.1814916e+03 6.77e+01 1.29e+03 0.6 6.96e+00 1.0 1.87e-01 1.36e-01f 1 36r 3.2873334e+03 5.40e+01 1.00e+03 0.6 2.41e+01 0.5 1.07e-01 1.92e-01f 1 37r 3.2706860e+03 5.24e+01 9.72e+02 0.7 7.50e+01 0.1 5.03e-02 2.77e-02f 1 38r 3.2377788e+03 2.94e+01 6.67e+02 0.6 2.68e+01 0.5 2.40e-01 5.18e-01f 1 39r 3.2387328e+03 2.89e+01 6.51e+02 0.5 6.88e+00 0.9 2.13e-01 1.57e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40r 3.3181435e+03 1.42e+01 5.93e+02 0.5 3.32e+00 1.3 5.81e-01 5.09e-01f 1 41r 3.3128692e+03 3.74e+00 2.64e+02 -0.4 1.12e+00 1.8 6.21e-01 7.32e-01f 1 42r 3.3206329e+03 3.05e+00 1.60e+02 -0.6 3.70e+00 1.3 3.61e-01 6.35e-01f 1 43r 3.3208233e+03 2.84e+00 7.20e+01 -1.1 1.41e+00 1.7 5.16e-01 9.54e-01f 1 44r 3.3305835e+03 2.69e+00 7.21e+01 -0.9 4.24e+00 1.2 6.72e-01 2.34e-01f 1 45r 3.3344295e+03 2.44e+00 6.87e+01 -1.4 1.51e+00 1.7 5.38e-01 1.00e+00f 1 46r 3.3456559e+03 2.07e+00 1.11e+02 -1.5 4.64e+00 1.2 5.64e-01 4.60e-01f 1 47r 3.3511294e+03 1.83e+00 7.00e+01 -2.2 1.73e+00 1.6 6.12e-01 8.09e-01f 1 48r 3.3584815e+03 1.52e+00 1.64e+02 -2.3 5.36e+00 1.1 7.87e-01 2.97e-01f 1 49r 3.3663679e+03 1.28e+00 1.46e+02 -3.4 1.96e+00 1.6 7.42e-01 6.34e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 3.0744376e+03 1.26e+00 9.72e+01 0.6 5.89e+02 - 5.29e-03 1.56e-02f 1 51 2.6864323e+03 1.22e+00 4.79e+02 0.6 8.40e+01 0.0 1.24e-02 3.64e-02f 1 52 2.4360163e+03 1.15e+00 7.87e+02 0.6 3.99e+01 0.4 4.13e-02 5.50e-02f 1 53 2.3019896e+03 1.07e+00 7.99e+02 0.6 2.29e+01 0.9 1.50e-01 6.88e-02f 1 54 1.9659305e+03 1.96e+00 7.54e+02 0.5 2.49e+01 0.4 6.43e-02 1.63e-01f 1 55 1.7002767e+03 2.41e+00 7.88e+02 0.6 2.44e+01 -0.1 2.89e-02 5.97e-02f 1 56 1.7010828e+03 2.48e+00 6.98e+02 0.5 1.33e+01 1.2 5.23e-02 3.67e-02f 1 57 1.4572194e+03 1.93e+01 9.33e+03 0.6 1.88e+01 0.7 8.43e-02 4.65e-01f 1 58 1.4005265e+03 1.86e+01 8.97e+03 0.4 1.74e+01 0.3 1.64e-01 3.84e-02f 1 59 1.3911860e+03 1.68e+01 7.90e+03 0.6 9.44e+00 0.7 1.04e-02 1.24e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 5.9946582e+02 1.25e+01 7.21e+02 0.5 8.80e+00 0.2 3.58e-01 7.48e-01f 1 61 4.5570191e+02 1.10e+01 6.33e+02 -0.6 5.84e+00 -0.3 6.58e-01 1.20e-01f 1 62 1.7079002e+02 2.21e+00 2.10e+02 -0.4 2.16e+00 0.2 9.42e-01 8.21e-01f 1 63 4.7123583e+01 9.41e-01 1.04e+02 -1.1 2.19e+00 -0.3 4.68e-01 5.24e-01f 1 64 3.4906315e+01 6.74e-01 8.17e+01 -3.4 2.81e-01 -0.8 9.58e-01 2.19e-01f 1 65 1.7409748e+00 2.96e-04 6.90e+00 -5.3 2.05e-01 -1.3 9.16e-01 9.45e-01f 1 66 3.1809785e-02 5.51e-06 1.36e-01 -9.2 5.73e-03 -1.7 9.84e-01 9.81e-01h 1 67 3.2239998e-04 5.59e-08 1.39e-03 -11.0 9.69e-05 -2.2 9.90e-01 9.90e-01h 1 68 1.9119752e-07 7.74e-11 1.92e-06 -11.0 9.79e-07 -2.7 9.99e-01 9.99e-01h 1 69 -2.5520000e-07 2.66e-15 3.45e-11 -11.0 5.10e-08 -3.2 1.00e+00 1.00e+00h 1 Number of Iterations....: 69 (scaled) (unscaled) Objective...............: -8.5066666700551499e-08 -2.5520000010165450e-07 Dual infeasibility......: 3.4512667095623928e-11 6.2372289931850480e-11 Constraint violation....: 2.6645352591003757e-15 2.6645352591003757e-15 Complementarity.........: 1.6380773895506416e-11 4.9142321686519247e-11 Overall NLP error.......: 3.4512667095623928e-11 6.2372289931850480e-11 Number of objective function evaluations = 72 Number of objective gradient evaluations = 28 Number of equality constraint evaluations = 72 Number of inequality constraint evaluations = 72 Number of equality constraint Jacobian evaluations = 70 Number of inequality constraint Jacobian evaluations = 70 Number of Lagrangian Hessian evaluations = 69 Total CPU secs in IPOPT (w/o function evaluations) = 0.162 Total CPU secs in NLP function evaluations = 0.029 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2.552e-07 69 0.190971 build initial OA NLP0014I 2 OPT 8278.463 79 0.06699 OA decomposition OA0003I New best feasible of 8278.463 found after 3.195515 sec and NLP0014I 3 INFEAS 0.10695099 101 0.091986 OA decomposition NLP0014I 4 OPT 8278.463 77 0.057991 OA decomposition NLP0014I 5 OPT 8092.5 61 0.045993 OA decomposition OA0003I New best feasible of 8092.5 found after 13.261984 sec and OA0008I OA converged in 13.261984 seconds found solution of value 8092.5 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 31749 branch-and-bound nodes in total Cbc0012I Integer solution of 8092.5 found by nonlinear programm after 0 iterations and 0 nodes (13.26 seconds) Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 8092.499998522632, took 0 iterations and 0 nodes (13.26 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 8092.5. Best solution: 8.092500e+03 (0 nodes, 13.415 seconds) Best possible: 8.092500e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0205h.gms(938) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0205h.gms Stop 09/08/12 19:59:09 elapsed 0:00:13.717 @04 1347127149 ----------------------------- Sa 8. Sep 19:59:09 CEST 2012 ----------------------------- =ready= Linux opt211 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0205m.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0205m.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0205m.gms(353) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- clay0205m.gms(351) 3 Mb --- Generating MIQCP model m --- clay0205m.gms(353) 5 Mb --- 136 rows 81 columns 431 non-zeroes --- 360 nl-code 80 nl-non-zeroes --- 50 discrete-columns --- clay0205m.gms(353) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 50 Number of nonzeros in inequality constraint Jacobian.: 360 Number of nonzeros in Lagrangian Hessian.............: 10 Total number of variables............................: 80 variables with only lower bounds: 20 variables with lower and upper bounds: 60 variables with only upper bounds: 0 Total number of equality constraints.................: 15 Total number of inequality constraints...............: 120 inequality constraints with only lower bounds: 40 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 80 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5700000e+01 5.70e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.8679681e+04 1.69e-14 1.83e+03 1.3 5.93e+01 - 3.61e-02 1.00e+00H 1 2 1.5730284e+04 1.59e-14 1.78e+03 1.1 2.99e+02 - 8.91e-01 6.05e-02f 1 3 2.7162251e+03 4.00e-15 4.38e+02 -1.1 1.92e+01 - 9.31e-01 7.53e-01f 1 4 6.1677894e+01 2.22e-16 1.25e+01 -4.9 4.25e+00 - 9.65e-01 9.71e-01f 1 5 6.4353085e-01 1.11e-16 1.34e-01 -10.4 1.32e-01 - 9.88e-01 9.89e-01f 1 6 6.4391408e-03 2.22e-16 1.34e-03 -11.0 1.34e-03 - 9.90e-01 9.90e-01f 1 7 8.3888746e-06 2.22e-16 1.80e-06 -11.0 1.88e-05 - 9.99e-01 9.99e-01h 1 8 -2.5520000e-07 0.00e+00 1.80e-12 -11.0 1.80e-08 -4.0 1.00e+00 1.00e+00h 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -8.5066666802999181e-08 -2.5520000040899754e-07 Dual infeasibility......: 1.7952306308188781e-12 5.3856918924566344e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.8638389455620232e-11 5.5915168366860697e-11 Overall NLP error.......: 1.8638389455620232e-11 5.5915168366860697e-11 Number of objective function evaluations = 10 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 10 Number of inequality constraint evaluations = 10 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total CPU secs in IPOPT (w/o function evaluations) = 0.009 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2.552e-07 8 0.009999 build initial OA NLP0014I 2 INFEAS 7.6266027 101 0.044993 OA decomposition NLP0014I 3 OPT 8278.4705 46 0.018997 OA decomposition OA0003I New best feasible of 8278.4705 found after 2.711587 sec and NLP0014I 4 OPT 8278.4705 43 0.016997 OA decomposition NLP0014I 5 OPT 8278.4705 42 0.016997 OA decomposition NLP0014I 6 OPT 8278.4705 39 0.015998 OA decomposition NLP0014I 7 OPT 8092.5 21 0.007999 OA decomposition OA0003I New best feasible of 8092.5 found after 6.686983 sec and OA0008I OA converged in 6.686983 seconds found solution of value 8092.5 (lower bound 1e+50 ). OA0010I Performed 6 iterations, explored 31530 branch-and-bound nodes in total Cbc0012I Integer solution of 8092.5 found by nonlinear programm after 7 iterations and 0 nodes (6.69 seconds) Cbc0031I 5 added rows had average density of 3 Cbc0013I At root node, 5 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 16 row cuts average 3.0 elements, 0 column cuts (5 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 8092.499988918745, took 7 iterations and 0 nodes (6.69 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 16 cuts of which 5 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 8092.5. Best solution: 8.092500e+03 (0 nodes, 6.755 seconds) Best possible: 8.092500e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0205m.gms(353) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0205m.gms Stop 09/08/12 19:59:02 elapsed 0:00:06.868 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt212 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0303h.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0303h.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0303h.gms(448) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- clay0303h.gms(446) 3 Mb --- Generating MINLP model m --- clay0303h.gms(448) 5 Mb --- 151 rows 100 columns 424 non-zeroes --- 1,224 nl-code 108 nl-non-zeroes --- 21 discrete-columns --- clay0303h.gms(448) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 105 Number of nonzeros in inequality constraint Jacobian.: 312 Number of nonzeros in Lagrangian Hessian.............: 45 Total number of variables............................: 99 variables with only lower bounds: 72 variables with lower and upper bounds: 27 variables with only upper bounds: 0 Total number of equality constraints.................: 24 Total number of inequality constraints...............: 126 inequality constraints with only lower bounds: 12 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 114 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.2800000e+01 1.26e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.6176885e+01 1.25e+01 3.20e+01 0.2 2.08e+01 - 1.98e-02 9.81e-03f 1 2 2.7358031e+01 1.25e+01 3.20e+01 0.2 7.90e+01 - 3.13e-03 9.59e-04h 1 3 2.9912301e+01 1.24e+01 3.19e+01 0.2 1.65e+02 - 2.44e-03 1.52e-03f 1 4 3.0955538e+01 1.24e+01 1.15e+02 0.1 4.60e+02 - 1.78e-03 9.59e-04f 1 5 3.1013927e+01 1.24e+01 1.17e+02 0.1 1.58e+03 - 6.27e-04 9.09e-05f 3 6 3.2308657e+01 1.24e+01 1.18e+02 0.1 2.41e+02 - 2.31e-03 1.38e-03f 1 7 3.3305638e+01 1.24e+01 1.19e+02 0.1 1.56e+02 0.0 2.49e-03 6.40e-04h 1 8r 3.3305638e+01 1.24e+01 9.99e+02 1.1 0.00e+00 -0.5 0.00e+00 4.88e-06R 5 9r 9.5814960e+01 1.23e+01 9.96e+02 0.9 8.03e+02 - 9.97e-04 3.24e-03f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10r 3.2965979e+02 1.20e+01 9.92e+02 0.9 1.43e+03 - 4.05e-04 4.50e-03f 1 11r 3.9444191e+02 1.20e+01 9.91e+02 0.9 5.43e+03 - 2.55e-04 1.00e-03f 1 12r 6.6692935e+02 1.37e+01 9.87e+02 0.8 5.70e+03 - 4.67e-04 4.35e-03f 1 13r 7.5897262e+02 2.91e+01 9.87e+02 0.8 1.32e+04 - 4.83e-04 1.84e-03f 1 14r 8.3828098e+02 2.90e+01 9.82e+02 0.9 2.63e+02 0.0 1.03e-02 2.05e-03f 1 15r 9.9162865e+02 2.88e+01 9.76e+02 0.8 3.11e+02 -0.5 8.67e-03 6.19e-03f 1 16r 1.2443457e+03 2.80e+01 9.63e+02 0.8 1.46e+02 -0.1 1.00e-02 1.85e-02f 1 17r 1.3669800e+03 2.71e+01 9.37e+02 0.8 6.04e+01 0.4 2.71e-02 2.55e-02f 1 18r 1.3999574e+03 3.31e+01 9.25e+02 0.8 2.00e+02 -0.1 1.32e-02 1.66e-02f 1 19r 1.4738643e+03 6.77e+01 9.34e+02 0.8 1.01e+02 0.3 1.19e-02 5.04e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20r 1.5117184e+03 6.93e+01 8.79e+02 0.8 3.04e+01 0.7 5.55e-02 4.22e-02f 1 21r 1.5347768e+03 6.72e+01 8.58e+02 0.8 7.27e+01 0.3 2.46e-02 2.81e-02f 1 22r 1.7100009e+03 5.99e+01 7.36e+02 0.8 2.75e+01 0.7 1.44e-01 1.52e-01f 1 23r 1.8248585e+03 4.97e+01 7.10e+02 0.7 9.40e+00 1.1 5.85e-02 1.94e-01f 1 24r 2.0915079e+03 2.77e+01 5.52e+02 0.6 4.58e+00 1.6 5.61e-01 4.68e-01f 1 25r 2.2836441e+03 2.59e+01 4.21e+02 0.6 2.19e+01 1.1 1.49e-01 8.22e-02f 1 26r 2.6333637e+03 1.87e+01 3.86e+02 0.4 6.98e+00 1.5 7.08e-01 3.29e-01f 1 27r 2.6702472e+03 1.78e+01 3.68e+02 0.5 4.85e+00 1.9 1.36e-01 4.83e-02f 1 28r 2.7323025e+03 1.66e+01 1.23e+03 0.5 8.75e+00 1.4 3.47e-02 6.83e-02f 1 29r 2.8684260e+03 1.20e+01 8.79e+02 0.3 6.31e+00 1.9 4.33e-01 2.91e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30r 2.9678140e+03 1.02e+01 8.02e+02 0.3 9.18e+00 1.4 4.12e-01 1.80e-01f 1 31r 2.9858106e+03 1.00e+01 7.86e+02 0.4 2.38e+01 0.9 1.79e-01 2.26e-02f 1 32r 2.9859313e+03 8.56e+00 7.54e+02 0.3 8.46e+00 1.3 1.94e-02 1.88e-01f 1 33r 2.9814585e+03 8.14e+00 7.22e+02 0.3 3.59e+00 1.8 3.39e-01 4.91e-02f 1 34r 2.9584825e+03 5.86e+00 6.04e+02 0.1 7.74e+00 1.3 1.84e-01 2.81e-01f 1 35r 2.9542606e+03 5.76e+00 5.85e+02 0.1 2.02e+00 1.7 4.34e-01 3.55e-02f 1 36r 2.7519396e+03 4.64e+00 4.98e+02 0.1 7.15e+00 1.2 2.33e-01 6.74e-01f 1 37r 2.7509366e+03 4.63e+00 5.05e+02 0.2 2.97e+01 0.8 3.92e-02 2.31e-03f 1 38r 2.7786869e+03 4.07e+00 4.81e+03 0.1 4.11e+00 1.2 1.39e-01 6.38e-01f 1 39r 2.7397279e+03 3.23e+00 3.67e+02 -0.3 2.54e+00 1.6 2.39e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40r 2.7029105e+03 1.23e+01 8.46e+02 -0.3 2.14e+01 1.1 1.47e-01 4.15e-01f 1 41r 2.7047463e+03 1.23e+01 8.43e+02 -0.2 1.23e+02 1.6 4.06e-02 5.31e-04f 1 42r 2.7767441e+03 9.82e+00 7.17e+02 -0.4 2.91e+00 2.0 4.03e-01 2.57e-01f 1 43r 2.7774150e+03 9.79e+00 8.56e+02 -0.5 2.66e+00 1.5 6.19e-01 3.10e-03f 1 44r 2.7274615e+03 4.29e+00 1.32e+03 -0.8 2.75e+00 1.0 9.33e-02 5.72e-01f 1 45r 2.7112877e+03 1.68e+00 7.80e+02 -0.9 1.14e+00 1.5 3.30e-01 6.07e-01f 1 46r 2.6622757e+03 6.93e-01 4.18e+02 -0.8 1.50e+00 1.0 7.73e-01 4.71e-01f 1 47 1.5577051e+03 7.02e-01 1.11e+02 0.4 5.97e+01 - 1.74e-01 3.92e-02f 1 48 8.9842643e+02 3.90e+00 1.05e+02 0.6 6.13e+01 - 8.34e-02 1.23e-01f 1 49 6.2231118e+02 3.91e+00 8.59e+01 0.4 3.86e+01 - 1.79e-01 1.68e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 2.2170118e+02 6.39e+00 7.22e+01 0.6 1.01e+02 - 1.48e-01 1.06e-01f 1 51 3.9972658e+01 1.09e+01 3.38e+01 -0.2 2.49e+01 - 5.36e-01 4.76e-01f 1 52 1.4020807e+01 8.12e+00 2.31e+01 -0.5 1.74e+01 - 6.63e-01 9.61e-01f 1 53 9.8017274e-01 1.07e-03 3.31e+00 -3.7 1.75e+00 - 9.30e-01 8.59e-01h 1 54 1.5355602e-02 2.17e-05 6.84e-02 -6.8 2.57e-01 - 9.76e-01 9.80e-01h 1 55 1.5552698e-04 2.22e-07 7.02e-04 -11.0 7.00e-03 - 9.90e-01 9.90e-01h 1 56 -1.8496954e-08 1.56e-10 4.92e-07 -11.0 7.28e-05 - 9.99e-01 9.99e-01h 1 57 -1.2746000e-07 1.78e-15 1.68e-05 -11.0 2.68e-02 - 9.99e-01 1.00e+00h 1 58 -1.2746000e-07 2.25e+01 3.63e+00 -11.0 9.07e+01 - 2.58e-01 8.10e-01h 1 59 -1.2734869e-07 1.78e-15 2.38e+00 -10.9 6.37e+01 - 5.92e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 -1.2734870e-07 2.22e-15 2.62e+01 -10.9 6.83e+00 -1.0 1.00e+00 1.00e+00h 1 61 -1.2734915e-07 2.22e-15 5.17e+00 -10.9 5.59e-01 -1.4 1.00e+00 1.00e+00h 1 62 -1.2734869e-07 2.22e-15 4.58e-03 -10.9 6.29e-03 -1.9 1.00e+00 1.00e+00h 1 63 -1.2734869e-07 2.66e-15 7.39e-09 -10.9 1.80e-06 -2.4 1.00e+00 1.00e+00h 1 Number of Iterations....: 63 (scaled) (unscaled) Objective...............: -4.2449563901455201e-08 -1.2734869170436560e-07 Dual infeasibility......: 7.3896887418427207e-09 2.2169066225528163e-08 Constraint violation....: 2.6645352591003757e-15 2.6645352591003757e-15 Complementarity.........: 1.2061264734157859e-11 3.6183794202473578e-11 Overall NLP error.......: 7.3896887418427207e-09 2.2169066225528163e-08 Number of objective function evaluations = 72 Number of objective gradient evaluations = 26 Number of equality constraint evaluations = 72 Number of inequality constraint evaluations = 72 Number of equality constraint Jacobian evaluations = 64 Number of inequality constraint Jacobian evaluations = 64 Number of Lagrangian Hessian evaluations = 63 Total CPU secs in IPOPT (w/o function evaluations) = 0.096 Total CPU secs in NLP function evaluations = 0.016 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.2734869e-07 63 0.111983 build initial OA NLP0014I 2 INFEAS 42.882306 133 0.19397 OA decomposition NLP0014I 3 INFEAS 0.68161561 96 0.088987 OA decomposition NLP0014I 4 OPT 28351.446 82 0.043993 OA decomposition OA0003I New best feasible of 28351.446 found after 0.505923 sec and NLP0014I 5 INFEAS 4.6130075 135 0.085987 OA decomposition NLP0014I 6 INFEAS 0.68177179 152 0.094985 OA decomposition NLP0014I 7 INFEAS 0.33660448 97 0.063991 OA decomposition NLP0014I 8 OPT 26669.134 86 0.046993 OA decomposition OA0003I New best feasible of 26669.134 found after 0.942857 sec and NLP0014I 9 INFEAS 0.30960279 136 0.088987 OA decomposition NLP0014I 10 INFEAS 0.3926131 128 0.084987 OA decomposition NLP0014I 11 INFEAS 0.14045444 122 0.073989 OA decomposition OA0008I OA converged in 1.418784 seconds found solution of value 26669.134 (lower bound 1e+50 ). OA0010I Performed 10 iterations, explored 1406 branch-and-bound nodes in total Cbc0012I Integer solution of 26669.134 found by nonlinear programm after 1 iterations and 0 nodes (1.42 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 3.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 26669.13373787306, took 1 iterations and 0 nodes (1.42 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 26669.1. Best solution: 2.666913e+04 (0 nodes, 1.459 seconds) Best possible: 2.666913e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0303h.gms(448) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0303h.gms Stop 09/08/12 19:58:57 elapsed 0:00:01.676 @04 1347127137 ----------------------------- Sa 8. Sep 19:58:57 CEST 2012 ----------------------------- =ready= Linux opt213 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0303m.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0303m.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0303m.gms(194) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- clay0303m.gms(192) 3 Mb --- Generating MIQCP model m --- clay0303m.gms(194) 5 Mb --- 67 rows 34 columns 208 non-zeroes --- 324 nl-code 72 nl-non-zeroes --- 21 discrete-columns --- clay0303m.gms(194) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 21 Number of nonzeros in inequality constraint Jacobian.: 180 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 33 variables with only lower bounds: 6 variables with lower and upper bounds: 27 variables with only upper bounds: 0 Total number of equality constraints.................: 6 Total number of inequality constraints...............: 60 inequality constraints with only lower bounds: 12 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 48 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.2800000e+01 5.74e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.7690972e+02 4.71e+00 5.00e+01 1.3 3.40e+01 - 6.28e-02 3.67e-02f 1 2 4.7709653e+02 8.19e-01 1.07e+02 1.2 3.17e+01 - 8.10e-02 1.24e-01f 1 3 5.1831048e+02 6.42e-01 1.12e+02 1.2 4.40e+01 - 2.94e-01 2.36e-01f 1 4 6.5898285e+02 3.28e-01 7.96e+01 1.2 3.76e+01 - 4.08e-01 6.52e-01f 1 5 6.7645685e+01 5.79e-02 2.51e+01 0.5 9.87e+00 - 6.85e-01 7.34e-01f 1 6 2.3652721e+01 1.18e-03 6.61e-01 -0.2 4.43e+00 - 1.00e+00 9.80e-01f 1 7 3.0753747e-01 1.51e-05 6.16e-03 -6.7 4.90e-01 - 9.85e-01 9.87e-01f 1 8 3.0874279e-03 1.52e-07 6.15e-05 -11.0 5.92e-03 - 9.90e-01 9.90e-01h 1 9 7.5908880e-07 4.36e-11 1.76e-08 -11.0 6.11e-05 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.2746163e-07 0.00e+00 1.38e-12 -11.0 6.53e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 10 (scaled) (unscaled) Objective...............: -4.2487210465682782e-08 -1.2746163139704835e-07 Dual infeasibility......: 1.3792914453737496e-12 4.1378743361212492e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.6391017511396775e-11 4.9173052534190326e-11 Overall NLP error.......: 1.6391017511396775e-11 4.9173052534190326e-11 Number of objective function evaluations = 11 Number of objective gradient evaluations = 11 Number of equality constraint evaluations = 11 Number of inequality constraint evaluations = 11 Number of equality constraint Jacobian evaluations = 11 Number of inequality constraint Jacobian evaluations = 11 Number of Lagrangian Hessian evaluations = 10 Total CPU secs in IPOPT (w/o function evaluations) = 0.008 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.2746163e-07 10 0.008999 build initial OA NLP0014I 2 INFEAS 0.86245995 50 0.043993 OA decomposition NLP0014I 3 INFEAS 20.584553 91 0.072989 OA decomposition NLP0014I 4 INFEAS 3.8937516 43 0.040993 OA decomposition NLP0014I 5 INFEAS 0.86245995 54 0.045993 OA decomposition NLP0014I 6 INFEAS 2.303003 49 0.044993 OA decomposition NLP0014I 7 INFEAS 1.4642512 42 0.035995 OA decomposition NLP0014I 8 INFEAS 1.6461494 76 0.063991 OA decomposition NLP0014I 9 INFEAS 2.1694017 46 0.016998 OA decomposition NLP0014I 10 INFEAS 1.6461494 76 0.032995 OA decomposition NLP0014I 11 INFEAS 2.1694017 67 0.024996 OA decomposition NLP0014I 12 OPT 26669.109 40 0.013998 OA decomposition OA0003I New best feasible of 26669.109 found after 1.064838 sec and OA0008I OA converged in 1.126829 seconds found solution of value 26669.109 (lower bound 1e+50 ). OA0010I Performed 11 iterations, explored 972 branch-and-bound nodes in total Cbc0012I Integer solution of 26669.109 found by nonlinear programm after 6 iterations and 0 nodes (1.13 seconds) Cbc0031I 3 added rows had average density of 3 Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 32 row cuts average 3.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 26669.10946070298, took 6 iterations and 0 nodes (1.13 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 32 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 26669.1. Best solution: 2.666911e+04 (0 nodes, 1.18 seconds) Best possible: 2.666911e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0303m.gms(194) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0303m.gms Stop 09/08/12 19:58:56 elapsed 0:00:01.287 @04 1347127136 ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- =ready= Linux opt214 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0304h.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0304h.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0304h.gms(713) 2 Mb --- Starting execution: elapsed 0:00:00.014 --- clay0304h.gms(711) 3 Mb --- Generating MINLP model m --- clay0304h.gms(713) 5 Mb --- 259 rows 177 columns 729 non-zeroes --- 1,632 nl-code 144 nl-non-zeroes --- 36 discrete-columns --- clay0304h.gms(713) 3 Mb --- Executing BONMIN: elapsed 0:00:00.017 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 188 Number of nonzeros in inequality constraint Jacobian.: 528 Number of nonzeros in Lagrangian Hessian.............: 60 Total number of variables............................: 176 variables with only lower bounds: 132 variables with lower and upper bounds: 44 variables with only upper bounds: 0 Total number of equality constraints.................: 42 Total number of inequality constraints...............: 216 inequality constraints with only lower bounds: 24 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 192 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.2400000e+01 1.26e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.0719668e+01 1.25e+01 3.20e+01 0.1 2.07e+01 - 1.90e-02 9.94e-03f 1 2 4.2099416e+01 1.25e+01 3.20e+01 0.1 8.33e+01 - 3.02e-03 7.61e-04h 1 3 4.6749385e+01 1.24e+01 3.19e+01 0.1 1.63e+02 - 2.54e-03 1.54e-03f 1 4 4.8804433e+01 1.24e+01 1.13e+02 0.0 4.52e+02 - 1.78e-03 9.77e-04f 1 5 4.8835882e+01 1.24e+01 1.14e+02 0.0 2.88e+03 - 3.45e-04 5.32e-05f 3 6 5.0493120e+01 1.24e+01 1.15e+02 0.0 4.07e+02 - 2.02e-03 1.01e-03f 1 7 5.2199074e+01 1.24e+01 1.21e+02 0.0 1.53e+02 0.0 4.59e-03 6.18e-04h 1 8 5.5151194e+01 1.24e+01 1.21e+02 0.0 8.16e+02 -0.5 1.18e-03 1.05e-03f 1 9 5.7679569e+01 1.24e+01 1.21e+02 0.0 2.48e+02 -0.1 1.69e-03 8.26e-04f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.0317223e+01 1.24e+01 1.27e+02 0.0 2.91e+02 0.4 1.45e-03 8.85e-04f 1 11 6.1698042e+01 1.24e+01 1.43e+02 0.0 2.90e+02 0.8 6.35e-04 5.42e-04f 2 12 6.2628176e+01 1.24e+01 1.90e+03 0.0 2.83e+02 1.2 4.33e-03 4.05e-04h 2 13 6.4341592e+01 1.24e+01 3.09e+03 0.0 2.87e+02 1.7 1.89e-03 8.84e-04f 2 14 6.4917987e+01 1.23e+01 2.71e+04 0.0 2.84e+02 2.1 8.81e-03 3.67e-04h 3 15 6.6005900e+01 1.23e+01 7.08e+04 0.0 2.83e+02 2.5 6.72e-03 8.21e-04f 3 16r 6.6005900e+01 1.23e+01 1.00e+03 1.1 0.00e+00 2.9 0.00e+00 1.99e-03R 1 17r 5.0807253e+02 1.15e+02 1.01e+03 0.9 4.29e+03 - 3.86e-04 9.36e-03f 1 18r 1.7079630e+03 1.14e+02 1.02e+03 0.8 4.63e+02 0.0 2.67e-03 1.18e-02f 1 19r 1.8856621e+03 1.13e+02 1.01e+03 0.8 6.52e+02 -0.5 8.39e-03 2.52e-03f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20r 2.0862284e+03 1.12e+02 9.83e+02 0.8 2.62e+02 -0.1 1.35e-02 5.48e-03f 1 21r 2.2857297e+03 1.11e+02 9.64e+02 0.8 6.54e+01 0.4 3.42e-02 1.17e-02f 1 22r 2.3876481e+03 1.09e+02 9.51e+02 0.8 1.77e+02 -0.1 2.07e-02 1.46e-02f 1 23r 2.4473387e+03 1.08e+02 9.39e+02 0.8 6.14e+01 0.3 1.34e-02 1.27e-02f 1 24r 2.6086156e+03 1.03e+02 8.98e+02 0.8 2.30e+01 0.7 4.76e-02 4.37e-02f 1 25r 2.6765255e+03 1.00e+02 9.23e+02 0.8 7.75e+01 0.3 1.59e-02 3.13e-02f 1 26r 2.8798796e+03 8.97e+01 7.81e+02 0.8 2.98e+01 0.7 2.95e-01 1.08e-01f 1 27r 2.9384604e+03 8.69e+01 8.29e+02 0.8 1.99e+02 0.2 5.48e-03 4.04e-02f 1 28r 2.9509191e+03 8.61e+01 7.80e+02 0.8 4.80e+01 0.6 4.10e-02 9.12e-03f 1 29r 3.1340038e+03 7.04e+01 8.32e+02 0.8 1.51e+01 1.1 1.69e-02 1.88e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30r 3.1423032e+03 6.92e+01 7.97e+02 0.8 3.99e+00 1.5 1.78e-01 1.82e-02f 1 31r 3.3039359e+03 5.21e+01 2.30e+03 0.7 2.17e+01 1.0 9.15e-02 2.78e-01f 1 32r 3.3217853e+03 4.91e+01 2.12e+03 0.6 5.33e+00 1.4 3.55e-01 6.87e-02f 1 33r 3.4581238e+03 8.82e+00 1.45e+03 0.6 2.09e+00 1.9 1.75e-01 1.00e+00f 1 34r 3.4629090e+03 8.57e+00 1.30e+03 0.4 1.19e+01 1.4 1.26e-01 2.04e-01f 1 35r 3.4782542e+03 8.32e+00 8.53e+02 0.3 2.70e+00 1.8 5.20e-01 5.20e-01f 1 36r 3.4911160e+03 1.24e+01 7.52e+02 0.4 1.54e+01 1.3 6.20e-02 1.40e-01f 1 37r 3.4915787e+03 1.20e+01 7.88e+02 0.1 3.85e+00 1.8 7.86e-01 3.37e-02f 1 38r 3.4971299e+03 1.16e+01 7.62e+02 0.3 1.87e+01 1.3 7.92e-02 3.94e-02f 1 39r 3.5004334e+03 9.98e+00 7.33e+02 0.1 3.15e+00 1.7 4.90e-01 1.44e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40r 3.5173103e+03 9.50e+00 6.73e+02 0.2 3.87e+01 1.2 6.64e-02 1.21e-01f 1 41r 3.5398114e+03 8.32e+00 5.96e+02 0.2 3.50e+00 1.7 7.48e-02 1.32e-01f 1 42r 3.5408759e+03 8.26e+00 1.81e+03 0.3 1.63e+01 1.2 1.36e-01 7.50e-03f 1 43r 3.5566915e+03 7.46e+00 1.50e+03 0.2 3.22e+00 1.6 1.79e-02 1.15e-01f 1 44r 3.5612971e+03 7.44e+00 1.48e+03 0.2 2.67e+01 1.1 4.64e-02 9.85e-03f 1 45r 3.5955972e+03 6.92e+00 6.84e+02 0.2 3.61e+00 1.6 2.14e-01 5.56e-01f 1 46r 3.8616902e+03 6.66e+00 6.31e+02 0.2 5.13e+01 1.1 3.24e-02 8.22e-02f 1 47r 3.8653210e+03 6.66e+00 1.90e+03 -0.0 5.88e+00 1.5 3.57e-01 6.18e-03f 1 48r 3.9143277e+03 6.56e+00 1.44e+03 -0.0 1.48e+00 1.9 5.39e-01 2.47e-01f 1 49r 4.0459414e+03 6.54e+00 1.29e+03 0.1 1.18e+01 1.5 2.40e-01 9.99e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50r 4.1724899e+03 6.42e+00 7.53e+02 -0.3 2.25e+00 1.9 1.97e-02 4.00e-01f 1 51r 4.1862639e+03 6.41e+00 7.07e+02 -0.3 1.02e+00 2.3 5.39e-01 7.57e-02f 1 52r 4.2756240e+03 6.37e+00 6.45e+02 -0.1 3.83e+00 1.8 8.25e-02 8.75e-02f 1 53r 4.5420027e+03 6.21e+00 1.57e+03 -0.1 1.19e+00 2.3 2.81e-01 1.00e+00f 1 54r 4.5877162e+03 6.18e+00 1.46e+03 -0.4 2.69e+00 1.8 2.71e-01 7.27e-02f 1 55r 4.6355583e+03 6.16e+00 1.43e+03 -0.2 1.01e+01 1.3 4.49e-02 2.06e-02f 1 56r 4.6516225e+03 6.15e+00 1.40e+03 -0.4 2.57e+00 1.7 3.89e-01 2.31e-02f 1 57r 4.7237761e+03 6.09e+00 1.35e+03 -0.3 8.84e+00 1.3 4.43e-01 3.71e-02f 1 58r 4.7156056e+03 6.06e+00 1.24e+03 -0.5 1.51e+00 1.7 4.11e-01 8.32e-02f 1 59r 4.4692666e+03 6.31e+00 4.49e+02 -0.8 4.66e+00 1.2 2.49e-01 8.79e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60r 4.0912907e+03 1.87e+01 2.75e+02 -0.9 1.47e+01 0.7 2.87e-01 4.59e-01f 1 61r 3.9697649e+03 1.94e+01 2.64e+02 -0.8 5.17e+01 0.3 2.31e-01 4.25e-02f 1 62r 3.9462658e+03 1.86e+01 2.51e+02 -0.7 1.64e+01 0.7 6.22e-02 5.22e-02f 1 63r 4.1942176e+03 3.60e+01 2.21e+02 -0.7 5.82e+01 0.2 4.86e-03 1.44e-01f 1 64r 4.2046809e+03 3.57e+01 2.20e+02 -0.8 1.88e+01 0.6 2.49e-01 8.18e-03f 1 65r 4.2345004e+03 3.55e+01 2.18e+02 -0.7 8.18e+01 0.2 1.56e-03 6.71e-03f 1 66r 4.2697027e+03 3.48e+01 9.91e+02 -0.7 2.03e+01 0.6 3.64e-01 2.22e-02f 1 67r 4.2951539e+03 3.40e+01 7.77e+02 -0.8 1.01e+01 0.1 6.69e-01 2.14e-02f 1 68r 4.4171605e+03 2.10e+01 5.56e+02 -1.2 1.64e+00 0.5 1.03e-01 3.84e-01f 1 69r 4.4276829e+03 1.69e+01 4.83e+02 -1.0 5.24e-01 1.0 7.88e-01 1.93e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 70r 4.4684500e+03 1.08e+00 2.60e+02 -1.2 1.52e+00 0.5 6.21e-01 1.00e+00f 1 71 3.8768905e+03 9.87e-01 9.73e+01 0.7 1.25e+02 - 1.25e-02 1.81e-02f 1 72 3.3448442e+03 8.58e-01 9.50e+01 0.7 1.04e+02 - 5.74e-02 2.05e-02f 1 73 1.9031786e+03 2.32e+01 8.91e+01 0.7 2.29e+02 - 7.49e-02 6.16e-02f 1 74 4.7650420e+02 3.54e+01 7.58e+01 0.6 5.90e+01 - 1.20e-01 1.60e-01f 1 75 4.8038068e+02 3.47e+01 7.30e+01 0.6 8.30e+00 2.5 5.39e-02 1.85e-02h 1 76 5.1201773e+02 3.36e+01 1.35e+02 0.6 8.18e+00 2.0 9.83e-02 3.30e-02f 1 77 5.6300863e+02 3.24e+01 4.60e+02 0.6 7.92e+00 1.5 1.42e-01 3.32e-02h 1 78 9.6142160e+02 2.45e+01 5.94e+02 0.6 7.74e+00 1.0 3.93e-01 2.34e-01h 1 79 1.0274939e+03 1.47e+01 3.72e+02 0.2 7.06e+00 0.5 3.50e-01 3.77e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 80 1.1407459e+03 8.89e+00 2.99e+02 -0.7 3.69e+00 1.0 6.27e-01 3.56e-01h 1 81 1.1436428e+03 8.73e+00 2.34e+03 -1.1 2.83e+00 1.4 7.60e-01 1.56e-02h 1 82 1.0869663e+03 5.92e+00 1.52e+03 -1.0 4.28e+00 0.9 4.17e-01 2.71e-01f 1 83 1.0814976e+03 9.62e-01 6.02e+02 -2.4 2.63e+00 1.3 7.98e-01 6.66e-01h 1 84 1.0722844e+03 2.74e-01 2.03e+02 -2.9 7.94e-01 1.8 9.90e-01 6.23e-01h 1 85 9.8087793e+02 1.49e-01 3.16e+02 -2.7 9.67e-01 1.3 5.88e-01 4.54e-01f 1 86 7.3092614e+02 1.34e-01 3.65e+02 -2.7 8.04e+00 0.8 2.18e-01 2.54e-01f 1 87 7.2737905e+02 1.32e-01 3.58e+02 -2.5 7.99e-01 1.2 2.60e-03 1.79e-02f 1 88 7.2729579e+02 1.32e-01 3.58e+02 -2.4 6.28e+00 0.8 5.40e-04 9.96e-05f 1 89 6.9267493e+02 9.32e-02 2.83e+02 -2.4 8.03e-01 1.2 9.31e-02 3.28e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 90 6.5740627e+02 8.80e-02 2.69e+02 -2.7 3.51e+00 0.7 8.49e-02 7.15e-02f 1 91 6.5066067e+02 8.38e-02 2.56e+02 -2.6 8.31e-01 1.1 4.17e-01 4.85e-02f 1 92 5.0227728e+02 9.69e-02 2.73e+02 -2.8 4.35e+00 0.7 4.56e-01 2.82e-01f 1 93 3.9821200e+02 6.09e-02 2.35e+02 -3.5 9.30e-01 1.1 5.82e-01 5.28e-01f 1 94 3.3861757e+02 5.91e-02 2.19e+02 -3.1 5.34e+00 0.6 6.25e-01 6.68e-02f 1 95 3.3657252e+02 5.86e-02 2.17e+02 -3.5 1.06e+00 1.0 9.56e-01 8.56e-03f 1 96 1.9660691e+02 6.36e-02 1.91e+02 -3.4 5.42e+00 0.6 1.83e-01 1.31e-01f 1 97 1.9507252e+02 6.32e-02 2.40e+02 -3.6 1.08e+00 1.0 6.29e-01 5.56e-03f 1 98 1.7390852e+02 6.04e-02 2.94e+02 -3.5 2.55e+00 0.5 3.17e-01 5.34e-02f 1 99 1.2914608e+02 4.19e-02 3.76e+02 -4.0 7.28e-01 0.9 1.00e+00 3.85e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 100 7.9207256e+01 4.03e-02 3.07e+02 -3.7 2.60e+00 0.5 3.34e-01 1.16e-01f 1 101 7.8392277e+01 4.01e-02 3.40e+02 -3.9 8.12e-01 0.9 1.00e+00 6.21e-03f 1 102 9.7451337e-01 4.24e-02 2.04e+02 -4.1 2.99e+00 0.4 1.00e+00 1.73e-01f 1 103 2.0084367e-01 4.25e-02 1.98e+02 -3.7 2.38e+02 -0.1 1.49e-02 9.63e-05f 1 104 1.6024607e-01 3.93e-02 3.49e+02 -3.9 1.36e-01 0.4 3.95e-01 7.31e-02h 1 105 9.8945364e-02 2.50e-02 3.47e+02 -4.4 1.90e-01 -0.1 7.87e-01 3.65e-01h 1 106 2.2278770e-02 5.59e-03 7.94e+01 -5.8 8.14e-02 0.3 8.05e-01 7.77e-01h 1 107 7.8363491e-04 7.27e-05 1.72e+00 -6.3 1.84e-02 -0.2 3.54e-01 9.69e-01h 1 108 2.4022245e-05 9.25e-10 3.83e-02 -6.7 5.02e-04 -0.6 9.89e-01 9.99e-01h 1 109 2.4797972e-08 9.44e-12 3.88e-04 -11.0 4.36e-07 -1.1 9.90e-01 9.90e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 110 -2.2291996e-07 2.22e-15 3.19e-08 -11.0 1.28e-06 -1.6 1.00e+00 1.00e+00h 1 111 -2.2292000e-07 2.22e-15 1.78e-07 -11.0 2.14e-05 -2.1 1.00e+00 1.00e+00h 1 112 -2.2292000e-07 3.55e-15 5.84e-08 -11.0 2.10e-05 -2.6 1.00e+00 1.00e+00h 1 113 -2.2292000e-07 2.22e-15 4.70e-08 -11.0 5.08e-05 -3.0 1.00e+00 1.00e+00h 1 114 -2.2292000e-07 3.55e-15 2.84e-08 -11.0 9.20e-05 -3.5 1.00e+00 1.00e+00h 1 115 -2.2292000e-07 2.22e-15 1.74e-08 -11.0 1.70e-04 -4.0 1.00e+00 1.00e+00h 1 116 -2.2292000e-07 1.78e-15 8.79e-09 -11.0 2.57e-04 -4.5 1.00e+00 1.00e+00h 1 Number of Iterations....: 116 (scaled) (unscaled) Objective...............: -7.4306666666666662e-08 -2.2291999999999999e-07 Dual infeasibility......: 8.7924699917133670e-09 1.8373122880329602e-08 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 1.0000000000000158e-11 3.0000000000000478e-11 Overall NLP error.......: 8.7924699917133670e-09 1.8373122880329602e-08 Number of objective function evaluations = 132 Number of objective gradient evaluations = 63 Number of equality constraint evaluations = 132 Number of inequality constraint evaluations = 132 Number of equality constraint Jacobian evaluations = 117 Number of inequality constraint Jacobian evaluations = 117 Number of Lagrangian Hessian evaluations = 116 Total CPU secs in IPOPT (w/o function evaluations) = 0.205 Total CPU secs in NLP function evaluations = 0.057 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2.2292e-07 116 0.26196 build initial OA NLP0014I 2 INFEAS 28.879029 219 0.173974 OA decomposition NLP0014I 3 INFEAS 3.131754 145 0.115982 OA decomposition NLP0014I 4 INFEAS 0.6816152 165 0.13298 OA decomposition NLP0014I 5 INFEAS 32.92932 175 0.138979 OA decomposition NLP0014I 6 INFEAS 0.85627991 197 0.153977 OA decomposition NLP0014I 7 INFEAS 0.4605742 145 0.118982 OA decomposition NLP0014I 8 INFEAS 2.7548891 116 0.089987 OA decomposition NLP0014I 9 INFEAS 0.50580657 134 0.107983 OA decomposition NLP0014I 10 INFEAS 0.099083997 128 0.099985 OA decomposition NLP0014I 11 INFEAS 0.099063884 131 0.105984 OA decomposition NLP0014I 12 OPT 40576.267 66 0.047993 OA decomposition OA0003I New best feasible of 40576.267 found after 5.927099 sec and NLP0014I 13 OPT 40791.003 86 0.062991 OA decomposition NLP0014I 14 OPT 40262.424 72 0.057992 OA decomposition OA0003I New best feasible of 40262.424 found after 6.817964 sec and OA0008I OA converged in 7.121917 seconds found solution of value 40262.424 (lower bound 1e+50 ). OA0010I Performed 13 iterations, explored 15574 branch-and-bound nodes in total Cbc0012I Integer solution of 40262.424 found by nonlinear programm after 5 iterations and 0 nodes (7.12 seconds) Cbc0031I 5 added rows had average density of 3 Cbc0013I At root node, 5 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 3.0 elements, 0 column cuts (5 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 40262.42384223903, took 5 iterations and 0 nodes (7.12 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 5 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 40262.4. Best solution: 4.026242e+04 (0 nodes, 7.215 seconds) Best possible: 4.026242e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0304h.gms(713) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0304h.gms Stop 09/08/12 19:59:03 elapsed 0:00:07.600 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt215 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0304m.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0304m.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0304m.gms(285) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- clay0304m.gms(283) 3 Mb --- Generating MIQCP model m --- clay0304m.gms(285) 5 Mb --- 107 rows 57 columns 337 non-zeroes --- 432 nl-code 96 nl-non-zeroes --- 36 discrete-columns --- clay0304m.gms(285) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 36 Number of nonzeros in inequality constraint Jacobian.: 288 Number of nonzeros in Lagrangian Hessian.............: 8 Total number of variables............................: 56 variables with only lower bounds: 12 variables with lower and upper bounds: 44 variables with only upper bounds: 0 Total number of equality constraints.................: 10 Total number of inequality constraints...............: 96 inequality constraints with only lower bounds: 24 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 72 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.2400000e+01 5.78e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.0521669e+03 1.44e+00 8.74e+01 1.3 2.56e+01 - 1.01e-01 5.21e-02f 1 2 1.0626066e+03 7.96e-01 2.07e+02 1.1 3.27e+01 - 7.79e-02 1.35e-01f 1 3 1.0551510e+03 6.60e-01 2.12e+02 1.2 4.26e+01 - 2.76e-01 1.93e-01f 1 4 1.7984106e+02 3.58e-01 1.38e+02 0.7 1.35e+01 - 3.64e-01 5.44e-01f 1 5 9.8884868e+02 5.43e-02 2.63e+01 1.0 2.87e+01 - 7.74e-01 8.15e-01f 1 6 1.2852838e+02 1.11e-16 1.17e+01 0.3 9.85e+00 - 8.22e-01 1.00e+00f 1 7 3.8676875e+01 1.11e-16 3.98e-02 -0.4 3.94e+00 - 1.00e+00 1.00e+00f 1 8 3.9121055e-01 0.00e+00 1.05e-03 -8.9 1.44e-01 - 9.89e-01 9.90e-01f 1 9 3.1086433e-03 1.11e-16 8.52e-06 -11.0 1.39e-03 - 9.92e-01 9.92e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.6773731e-08 2.22e-16 5.43e-10 -11.0 1.40e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 10 (scaled) (unscaled) Objective...............: -8.9245770741070545e-09 -2.6773731222321164e-08 Dual infeasibility......: 5.4291838234588199e-10 1.6287551470376460e-09 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 4.0233766531233033e-09 1.2070129959369911e-08 Overall NLP error.......: 4.0233766531233033e-09 1.2070129959369911e-08 Number of objective function evaluations = 11 Number of objective gradient evaluations = 11 Number of equality constraint evaluations = 11 Number of inequality constraint evaluations = 11 Number of equality constraint Jacobian evaluations = 11 Number of inequality constraint Jacobian evaluations = 11 Number of Lagrangian Hessian evaluations = 10 Total CPU secs in IPOPT (w/o function evaluations) = 0.009 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2.6773731e-08 10 0.008999 build initial OA NLP0014I 2 INFEAS 0.86245995 47 0.045993 OA decomposition NLP0014I 3 INFEAS 0.86245995 49 0.049993 OA decomposition NLP0014I 4 INFEAS 19.756367 95 0.040993 OA decomposition NLP0014I 5 INFEAS 5.002501 47 0.021997 OA decomposition NLP0014I 6 INFEAS 2.303003 49 0.021997 OA decomposition NLP0014I 7 INFEAS 1.7265064 53 0.022996 OA decomposition NLP0014I 8 INFEAS 2.2143702 99 0.043993 OA decomposition NLP0014I 9 INFEAS 0.099158583 65 0.026996 OA decomposition NLP0014I 10 INFEAS 1.8016263 66 0.028995 OA decomposition NLP0014I 11 INFEAS 0.099158583 71 0.032995 OA decomposition NLP0014I 12 INFEAS 0.099158578 82 0.036995 OA decomposition NLP0014I 13 INFEAS 0.099158578 76 0.034994 OA decomposition NLP0014I 14 OPT 40262.387 38 0.012998 OA decomposition OA0003I New best feasible of 40262.387 found after 2.606604 sec and OA0008I OA converged in 2.83157 seconds found solution of value 40262.387 (lower bound 1e+50 ). OA0010I Performed 13 iterations, explored 6106 branch-and-bound nodes in total Cbc0012I Integer solution of 40262.387 found by nonlinear programm after 8 iterations and 0 nodes (2.83 seconds) Cbc0031I 4 added rows had average density of 3 Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 42 row cuts average 3.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 40262.38740871196, took 8 iterations and 0 nodes (2.83 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 42 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 40262.4. Best solution: 4.026239e+04 (0 nodes, 2.876 seconds) Best possible: 4.026239e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0304m.gms(285) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0304m.gms Stop 09/08/12 19:58:58 elapsed 0:00:02.985 @04 1347127138 ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- =ready= Linux opt216 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0305h.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0305h.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0305h.gms(1043) 2 Mb --- Starting execution: elapsed 0:00:00.078 --- clay0305h.gms(1041) 3 Mb --- Generating MINLP model m --- clay0305h.gms(1043) 5 Mb --- 396 rows 276 columns 1,116 non-zeroes --- 2,040 nl-code 180 nl-non-zeroes --- 55 discrete-columns --- clay0305h.gms(1043) 3 Mb --- Executing BONMIN: elapsed 0:00:00.082 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 295 Number of nonzeros in inequality constraint Jacobian.: 800 Number of nonzeros in Lagrangian Hessian.............: 75 Total number of variables............................: 275 variables with only lower bounds: 210 variables with lower and upper bounds: 65 variables with only upper bounds: 0 Total number of equality constraints.................: 65 Total number of inequality constraints...............: 330 inequality constraints with only lower bounds: 40 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 290 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5700000e+01 1.36e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.5903784e+01 1.35e+01 3.20e+01 0.1 2.24e+01 - 1.86e-02 1.00e-02f 1 2 4.7105065e+01 1.35e+01 3.20e+01 0.1 1.03e+02 - 2.93e-03 5.61e-04h 1 3 5.2535386e+01 1.34e+01 3.19e+01 0.1 2.18e+02 - 2.73e-03 1.52e-03f 1 4 5.3522097e+01 1.34e+01 6.17e+01 0.0 1.51e+03 - 4.92e-04 3.66e-04f 1 5 5.5414380e+01 1.34e+01 7.43e+01 0.0 5.27e+02 - 1.82e-03 7.64e-04f 1 6 5.6592784e+01 1.34e+01 8.89e+01 0.0 4.93e+02 - 1.91e-03 6.94e-04f 1 7 5.7866537e+01 1.34e+01 1.02e+02 0.0 2.43e+02 - 4.13e-03 3.23e-04f 1 8 6.0212110e+01 1.34e+01 1.03e+02 0.0 5.39e+02 - 2.16e-03 6.60e-04f 1 9 6.6316707e+01 1.34e+01 1.03e+02 0.0 4.32e+02 - 1.86e-03 1.62e-03f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 7.2239269e+01 1.34e+01 1.02e+02 0.0 3.63e+02 - 1.65e-03 1.56e-03f 1 11 8.3997168e+01 1.33e+01 2.19e+03 0.0 5.56e+02 - 2.39e-03 3.61e-03f 1 12r 8.3997168e+01 1.33e+01 9.99e+02 1.1 0.00e+00 0.0 0.00e+00 1.27e-06R 2 13r 3.5700905e+02 1.27e+01 9.95e+02 0.9 6.03e+03 - 4.45e-04 3.63e-03f 1 14r 2.0831612e+03 1.26e+01 9.89e+02 0.9 4.62e+02 0.0 1.25e-03 1.38e-02f 1 15r 2.3401417e+03 1.26e+01 9.86e+02 0.9 3.64e+01 1.3 4.58e-02 1.04e-02f 1 16r 2.7232219e+03 1.26e+01 9.80e+02 0.9 9.28e+01 0.9 3.54e-02 1.42e-02f 1 17r 2.8743415e+03 1.26e+01 9.74e+02 0.8 1.81e+02 0.4 8.80e-03 1.15e-02f 1 18r 2.9122899e+03 1.25e+01 9.69e+02 0.9 2.17e+02 -0.1 8.59e-03 4.92e-03f 1 19r 2.9674012e+03 1.25e+01 9.61e+02 0.9 9.48e+01 0.3 1.04e-02 8.72e-03f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20r 3.0075213e+03 2.85e+01 9.54e+02 0.9 3.78e+02 -0.2 7.68e-03 7.78e-03f 1 21r 3.0781414e+03 2.89e+01 9.12e+02 0.9 7.47e+01 0.3 9.54e-02 1.63e-02f 1 22r 3.2517239e+03 2.92e+01 9.36e+02 0.8 2.67e+01 0.7 2.15e-01 8.37e-02f 1 23r 3.2605760e+03 2.92e+01 1.35e+03 0.9 1.20e+03 0.2 5.17e-03 5.97e-03f 1 24r 3.2829219e+03 2.88e+01 1.33e+03 0.9 3.17e+01 0.6 1.02e-01 1.60e-02f 1 25r 3.4580645e+03 2.57e+01 1.92e+03 0.8 1.16e+01 1.1 7.06e-02 1.71e-01f 1 26r 3.6222811e+03 1.81e+01 4.49e+03 0.6 4.53e+00 1.5 4.57e-02 3.28e-01f 1 27r 3.7180389e+03 3.51e+01 2.04e+03 0.7 3.67e+01 1.0 5.01e-02 1.51e-01f 1 28r 3.7857574e+03 3.10e+01 1.60e+03 0.5 6.08e+00 1.4 3.54e-01 2.23e-01f 1 29r 3.7941187e+03 3.17e+01 1.58e+03 0.7 5.38e+01 1.0 6.91e-02 1.24e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30r 3.8501214e+03 2.68e+01 1.85e+03 0.6 6.10e+00 1.4 7.72e-02 1.69e-01f 1 31r 3.8924858e+03 2.10e+01 1.63e+03 0.6 2.24e+00 1.8 5.14e-01 2.20e-01f 1 32r 3.9159629e+03 1.98e+01 1.53e+03 0.6 6.09e+00 1.3 2.60e-01 6.48e-02f 1 33r 3.9186282e+03 1.97e+01 1.54e+03 0.7 3.42e+02 0.9 5.28e-03 6.63e-03f 1 34r 4.0218440e+03 1.64e+01 6.35e+03 0.6 7.19e+00 1.3 1.98e-01 3.55e-01f 1 35r 4.0266860e+03 1.09e+01 3.22e+03 0.3 4.42e-01 2.6 3.43e-01 4.97e-01f 1 36r 4.0266815e+03 1.09e+01 1.45e+03 -0.3 1.50e-01 3.0 5.55e-01 5.48e-01f 1 37r 4.0257951e+03 1.08e+01 2.66e+02 -0.7 3.95e-01 2.6 6.60e-01 9.44e-01f 1 38r 4.0252698e+03 1.08e+01 1.46e+02 -2.8 1.46e-01 3.0 8.87e-01 8.02e-01f 1 39r 4.0252649e+03 1.08e+01 1.46e+02 -1.9 4.38e-01 2.5 1.00e+00 1.48e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40r 4.0251108e+03 1.08e+01 1.45e+02 -3.2 1.64e-01 2.9 9.05e-01 8.23e-01f 1 41r 4.0250958e+03 1.08e+01 4.09e+02 -2.5 4.93e-01 2.5 1.00e+00 1.74e-01f 1 42r 4.0250927e+03 1.08e+01 4.04e+02 -2.5 1.62e-01 2.9 1.00e+00 4.04e-02f 1 43r 4.0249846e+03 1.08e+01 2.59e+02 -3.0 4.79e-01 2.4 7.15e-01 4.06e-01f 1 44r 4.0249588e+03 1.08e+01 1.47e+02 -3.3 1.80e-01 2.8 1.00e+00 4.39e-01f 1 45r 4.0248868e+03 1.07e+01 6.20e+02 -3.8 5.45e-01 2.4 6.51e-01 5.67e-01f 1 46r 4.0248858e+03 1.07e+01 7.01e+02 -3.0 2.27e+01 1.9 5.24e-02 5.81e-03f 1 47r 4.0248223e+03 1.07e+01 5.92e+02 -3.2 6.21e-01 2.3 1.00e+00 3.45e-01f 1 48r 4.0248220e+03 1.07e+01 5.91e+02 -3.1 2.83e+00 1.8 2.67e-01 7.49e-04f 1 49r 4.0248023e+03 1.07e+01 5.30e+02 -3.5 7.03e-01 2.3 1.00e+00 1.01e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50r 4.0247633e+03 1.07e+01 3.47e+02 -3.3 3.06e+00 1.8 5.06e-01 1.04e-01f 1 51r 4.0247585e+03 1.07e+01 3.37e+02 -3.4 7.99e-01 2.2 1.00e+00 2.83e-02f 1 52r 4.0247092e+03 1.07e+01 1.58e+02 -3.4 3.46e+00 1.7 4.98e-01 1.08e-01f 1 53r 4.0247079e+03 1.07e+01 1.59e+02 -3.4 9.07e-01 2.2 1.00e+00 6.99e-03f 1 54r 4.0246797e+03 1.06e+01 5.73e+02 -3.3 2.80e+00 1.7 1.00e+00 5.55e-02f 1 55r 4.0237906e+03 1.02e+01 3.26e+02 -3.9 9.24e+00 1.2 2.74e-01 5.02e-01f 1 56r 4.0237221e+03 1.00e+01 1.97e+03 -3.4 1.31e+02 0.7 3.26e-02 2.80e-02f 1 57r 4.0236931e+03 9.99e+00 1.93e+03 -3.6 1.17e+01 1.2 9.81e-01 1.56e-02f 1 58r 4.0236910e+03 9.99e+00 1.93e+03 -3.4 4.95e+01 0.7 7.35e-02 5.11e-04f 1 59r 4.0234843e+03 9.85e+00 1.72e+03 -3.5 1.34e+01 1.1 1.00e+00 1.08e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60r 4.0234799e+03 9.85e+00 1.72e+03 -3.4 5.51e+01 0.6 2.15e-02 9.04e-04f 1 61r 4.0234757e+03 9.84e+00 1.72e+03 -3.4 1.19e+01 1.1 7.54e-04 1.95e-03f 1 62r 4.0234728e+03 9.84e+00 1.71e+03 -3.4 4.26e+00 1.5 3.00e-05 3.51e-03f 1 63r 4.0232044e+03 9.65e+00 6.73e+02 -3.4 1.59e+00 1.9 2.45e-01 8.68e-01f 1 64r 4.0231698e+03 9.63e+00 4.52e+02 -3.5 4.78e+00 1.4 2.97e-01 3.76e-02f 1 65r 4.0224913e+03 9.10e+00 3.48e+02 -3.6 1.50e+01 1.0 6.54e-01 2.80e-01f 1 66r 4.0224853e+03 9.10e+00 3.45e+02 -3.6 5.57e+00 1.4 1.49e-01 7.42e-03f 1 67r 4.0224851e+03 9.10e+00 3.45e+02 -3.5 1.42e+01 0.9 2.27e-03 6.63e-05f 1 68r 4.0224831e+03 9.09e+00 3.45e+02 -3.5 4.95e+00 1.3 1.64e-01 1.87e-03f 1 69r 4.0220494e+03 8.75e+00 3.11e+02 -3.6 1.62e+01 0.9 3.85e-03 1.35e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 70r 4.0220427e+03 8.75e+00 3.09e+02 -3.5 5.71e+00 1.3 1.66e-01 6.40e-03f 1 71r 4.0214574e+03 9.72e+00 2.76e+02 -3.5 1.90e+01 0.8 4.55e-03 1.65e-01f 1 72r 4.0214567e+03 9.72e+00 2.76e+02 -3.5 3.88e+02 0.3 2.01e-04 1.72e-04f 1 73r 4.0214566e+03 9.72e+00 2.76e+02 -3.5 2.25e+01 0.7 2.00e-01 1.38e-05f 1 74r 4.0214349e+03 9.58e+00 3.44e+02 -3.6 7.50e+00 1.2 2.04e-01 1.49e-02f 1 75r 4.0205868e+03 1.70e+01 2.44e+02 -3.7 2.59e+01 0.7 1.41e-04 2.07e-01f 1 76r 4.0205797e+03 1.63e+01 2.34e+02 -3.6 1.09e+00 2.0 5.63e-02 4.07e-02f 1 77r 4.0205796e+03 1.63e+01 2.34e+02 -3.5 3.21e+00 1.5 1.45e-03 1.53e-04f 1 78r 4.0205796e+03 1.63e+01 2.78e+02 -3.5 1.01e+00 2.0 1.54e-01 1.73e-05h 1 79r 4.0205319e+03 1.52e+01 2.18e+02 -3.6 3.00e+00 1.5 2.80e-03 6.83e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 80r 4.0205318e+03 1.52e+01 2.18e+02 -3.5 1.16e+01 1.0 5.60e-03 2.68e-05f 1 81r 4.0202699e+03 1.01e+01 4.72e+02 -3.6 3.39e+00 1.4 1.42e-02 3.33e-01f 1 82r 4.0201532e+03 9.62e+00 3.31e+02 -3.6 1.07e+01 1.0 1.23e-01 5.13e-02f 1 83r 4.0197481e+03 7.25e+00 9.01e+02 -3.7 3.86e+00 1.4 1.38e-03 4.94e-01f 1 84r 4.0189120e+03 3.08e+01 1.11e+03 -3.7 1.24e+01 0.9 2.07e-03 4.00e-01f 1 85r 4.0185934e+03 3.08e+01 2.06e+03 -4.0 4.58e+00 1.3 2.70e-01 3.92e-01f 1 86r 4.0185141e+03 2.28e+01 2.49e+03 -3.9 1.71e+00 1.8 3.71e-03 3.77e-01f 1 87r 4.0185138e+03 2.28e+01 2.49e+03 -3.7 1.11e+01 1.3 2.81e-03 4.87e-04f 1 88r 4.0185138e+03 2.28e+01 2.49e+03 -3.7 1.93e+00 1.7 6.52e-02 2.89e-05f 1 89r 4.0181991e+03 1.60e+01 1.83e+03 -3.7 5.92e+00 1.2 8.96e-04 3.15e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 90r 4.0181966e+03 1.60e+01 1.83e+03 -3.7 1.94e+01 0.8 2.34e-02 1.01e-03f 1 91r 4.0181960e+03 1.60e+01 1.83e+03 -3.7 7.63e+01 0.3 6.09e-02 1.93e-04f 1 92r 4.0182737e+03 1.56e+01 1.78e+03 -3.7 2.21e+01 0.7 5.98e-03 2.41e-02f 1 93r 4.0189738e+03 1.55e+01 1.77e+03 -3.7 9.15e+01 0.2 8.24e-03 5.58e-03f 1 94r 4.0202496e+03 1.53e+01 1.73e+03 -3.7 2.55e+01 0.7 4.65e-05 2.32e-02f 1 95r 4.0202538e+03 1.53e+01 1.73e+03 -3.8 1.05e+00 2.0 2.67e-01 1.68e-03f 1 96r 4.0202568e+03 1.52e+01 1.73e+03 -3.7 3.18e+00 1.5 1.30e-02 3.73e-04f 1 97r 4.0285686e+03 1.02e+01 1.30e+03 -3.7 9.92e+00 1.0 7.94e-02 3.53e-01f 1 98r 4.0286833e+03 1.01e+01 1.30e+03 -3.7 3.46e+01 0.6 9.28e-04 1.20e-03f 1 99r 4.0289755e+03 1.01e+01 1.30e+03 -3.7 1.77e+02 0.1 2.46e-05 3.46e-04f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 100r 4.0262635e+03 9.94e+00 1.27e+03 -3.7 4.00e+01 0.5 7.54e-03 1.93e-02f 1 101r 4.0263989e+03 9.94e+00 1.27e+03 -3.7 3.29e+02 0.0 6.65e-03 3.68e-05f 1 102r 4.0263919e+03 9.94e+00 1.27e+03 -3.7 2.63e+01 0.5 1.03e-01 3.71e-05f 1 103r 4.0150216e+03 7.90e+00 1.00e+03 -3.8 9.68e+00 0.9 3.59e-02 2.12e-01f 1 104r 4.0138275e+03 7.85e+00 9.95e+02 -3.7 3.02e+01 0.4 3.74e-04 6.14e-03f 1 105r 4.0138270e+03 7.85e+00 9.95e+02 -3.7 1.10e+01 0.8 1.52e-01 3.80e-04f 1 106r 3.9974893e+03 6.83e+00 7.41e+02 -3.8 3.42e+01 0.4 1.40e-03 1.46e-01f 1 107r 3.9974541e+03 6.80e+00 7.38e+02 -3.7 1.27e+01 0.8 4.74e-04 3.94e-03f 1 108r 3.9974530e+03 6.80e+00 7.38e+02 -3.7 8.40e+01 0.3 9.51e-05 2.79e-05f 1 109r 4.0037843e+03 5.60e+00 5.86e+02 -3.7 1.43e+01 0.7 8.41e-02 1.85e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 110r 4.0065946e+03 5.03e+00 5.28e+02 -3.9 5.34e+00 1.2 9.53e-02 1.02e-01f 1 111r 4.0180581e+03 4.49e+00 5.85e+02 -3.8 2.23e+01 0.7 6.71e-04 1.10e-01f 1 112r 4.0181731e+03 4.48e+00 5.83e+02 -3.7 7.29e+00 1.1 5.32e-03 2.98e-03f 1 113r 4.0181750e+03 4.48e+00 5.83e+02 -3.8 2.26e+00 1.5 1.29e-01 1.26e-04f 1 114r 4.0259244e+03 3.68e+00 3.79e+02 -3.8 8.84e+00 1.1 4.61e-03 1.81e-01f 1 115r 4.0260070e+03 3.66e+00 3.77e+02 -3.8 2.67e+00 1.5 9.25e-02 5.03e-03f 1 116r 4.0260081e+03 3.66e+00 3.77e+02 -3.7 7.73e+00 1.0 6.99e-04 2.33e-05f 1 117r 4.0269306e+03 3.12e+00 3.17e+02 -3.7 2.86e+00 1.4 1.56e-05 1.65e-01f 1 118r 4.0269397e+03 3.12e+00 3.17e+02 -3.8 8.70e+00 1.0 1.08e-01 1.05e-03f 1 119r 4.0286419e+03 2.72e+00 4.20e+02 -3.9 3.23e+00 1.4 3.45e-01 6.50e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 120r 4.0286668e+03 2.71e+00 4.15e+02 -3.8 9.91e+00 0.9 6.35e-03 2.12e-03f 1 121r 4.0286670e+03 2.71e+00 1.92e+02 -3.8 3.54e+00 1.3 2.72e-01 5.89e-05f 1 122r 4.0281882e+03 2.69e+00 1.83e+02 -3.8 9.53e+00 0.9 2.65e-02 1.11e-02f 1 123r 4.0152494e+03 2.08e+00 7.37e+02 -3.8 3.46e+00 1.3 6.95e-02 7.78e-01f 1 124r 4.0137641e+03 2.00e+00 7.43e+02 -3.8 1.10e+01 0.8 1.02e-03 2.93e-02f 1 125r 4.0137501e+03 2.00e+00 6.02e+02 -3.8 3.96e+00 1.2 1.48e-01 8.53e-04f 1 126r 4.0244692e+03 1.85e+00 6.07e+02 -3.8 1.22e+01 0.7 7.12e-03 5.43e-02f 1 127r 4.0245986e+03 1.85e+00 5.53e+02 -3.9 4.40e+00 1.2 6.72e-02 1.91e-03f 1 128r 4.0276304e+03 1.80e+00 5.55e+02 -3.8 1.38e+01 0.7 7.57e-04 1.33e-02f 1 129r 4.0486565e+03 1.56e+00 5.26e+02 -3.8 4.95e+00 1.1 9.51e-02 2.11e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 130r 4.0742750e+03 1.34e+00 4.92e+02 -3.9 1.58e+01 0.6 6.72e-02 7.49e-02f 1 131r 4.0745374e+03 1.34e+00 4.80e+02 -3.8 5.64e+00 1.1 1.81e-02 2.19e-03f 1 132r 4.0747189e+03 1.34e+00 4.80e+02 -3.8 2.20e+01 0.6 3.14e-05 2.73e-04f 1 133r 4.0921010e+03 1.24e+00 3.79e+02 -3.8 6.25e+00 1.0 1.79e-01 7.92e-02f 1 134 3.8108161e+03 1.66e+01 9.95e+01 0.8 1.42e+03 - 8.25e-04 1.93e-02f 1 135 3.7538014e+03 1.65e+01 1.01e+02 0.8 1.24e+03 - 3.28e-02 5.09e-03f 1 136 2.7419613e+03 1.31e+01 8.92e+01 0.8 9.80e+01 - 1.04e-01 1.12e-01f 1 137 1.9562600e+03 9.36e+00 7.43e+01 0.6 7.00e+01 - 1.70e-01 1.57e-01f 1 138 1.5497553e+03 6.30e+00 6.76e+01 0.7 6.44e+01 - 6.32e-02 1.53e-01f 1 139 1.3253359e+03 4.49e+00 5.48e+01 0.5 3.64e+01 - 2.01e-01 1.42e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 140 7.2864869e+02 4.32e+00 5.93e+01 0.7 6.21e+01 - 2.72e-01 1.07e-01f 1 141 5.4479712e+02 2.38e+00 3.52e+01 -0.3 2.07e+01 - 5.16e-01 2.30e-01f 1 142 3.1481872e+02 6.99e+00 4.60e+03 0.1 1.77e+02 - 6.83e-02 1.00e+00f 1 143 3.2492536e+02 2.66e-15 1.25e+03 0.3 1.68e+01 -0.5 1.74e-01 3.39e-01f 1 144 3.0724873e+02 2.66e-15 1.55e+03 0.3 6.28e+00 -1.0 6.52e-01 7.40e-01f 1 145 4.5599542e+01 2.66e-15 2.22e+01 -0.6 2.99e+00 -1.4 5.11e-01 9.81e-01f 1 146 1.0138694e+01 2.66e-15 4.63e+00 -5.6 2.36e+00 - 9.81e-01 7.64e-01f 1 147 1.2618533e-01 2.66e-15 1.28e-01 -5.4 4.23e-02 -1.9 9.24e-01 9.88e-01f 1 148 1.2790120e-03 2.00e-15 1.35e-03 -11.0 4.68e-04 -2.4 9.89e-01 9.90e-01h 1 149 1.4760276e-06 1.78e-15 1.84e-06 -11.0 4.64e-06 -2.9 9.99e-01 9.99e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 150 -2.5520000e-07 2.22e-15 6.24e-12 -11.0 1.37e-08 -3.3 1.00e+00 1.00e+00h 1 Number of Iterations....: 150 (scaled) (unscaled) Objective...............: -8.5066668079623655e-08 -2.5520000423887099e-07 Dual infeasibility......: 6.2449664100898911e-12 1.3241515263654747e-11 Constraint violation....: 2.2204460492503131e-15 2.2204460492503131e-15 Complementarity.........: 1.2591481385871491e-11 3.7774444157614473e-11 Overall NLP error.......: 1.2591481385871491e-11 3.7774444157614473e-11 Number of objective function evaluations = 153 Number of objective gradient evaluations = 30 Number of equality constraint evaluations = 153 Number of inequality constraint evaluations = 153 Number of equality constraint Jacobian evaluations = 151 Number of inequality constraint Jacobian evaluations = 151 Number of Lagrangian Hessian evaluations = 150 Total CPU secs in IPOPT (w/o function evaluations) = 0.379 Total CPU secs in NLP function evaluations = 0.097 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2.552e-07 150 0.475928 build initial OA NLP0014I 2 INFEAS 14.466679 199 0.200969 OA decomposition NLP0014I 3 INFEAS 18.756637 157 0.159976 OA decomposition NLP0014I 4 OPT 8278.463 103 0.091986 OA decomposition OA0003I New best feasible of 8278.463 found after 13.61793 sec and NLP0014I 5 OPT 8092.5 87 0.081987 OA decomposition OA0003I New best feasible of 8092.5 found after 18.299218 sec and OA0008I OA converged in 18.300218 seconds found solution of value 8092.5 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 50571 branch-and-bound nodes in total Cbc0012I Integer solution of 8092.5 found by nonlinear programm after 3 iterations and 0 nodes (18.30 seconds) Cbc0031I 3 added rows had average density of 3 Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 12 row cuts average 3.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 8092.499998493802, took 3 iterations and 0 nodes (18.30 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 12 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 8092.5. Best solution: 8.092500e+03 (0 nodes, 18.424 seconds) Best possible: 8.092500e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0305h.gms(1043) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0305h.gms Stop 09/08/12 19:59:14 elapsed 0:00:19.092 @04 1347127154 ----------------------------- Sa 8. Sep 19:59:14 CEST 2012 ----------------------------- =ready= Linux opt217 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/CLay/gms/clay0305m.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job clay0305m.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- clay0305m.gms(395) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- clay0305m.gms(393) 3 Mb --- Generating MIQCP model m --- clay0305m.gms(395) 5 Mb --- 156 rows 86 columns 496 non-zeroes --- 540 nl-code 120 nl-non-zeroes --- 55 discrete-columns --- clay0305m.gms(395) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 55 Number of nonzeros in inequality constraint Jacobian.: 420 Number of nonzeros in Lagrangian Hessian.............: 10 Total number of variables............................: 85 variables with only lower bounds: 20 variables with lower and upper bounds: 65 variables with only upper bounds: 0 Total number of equality constraints.................: 15 Total number of inequality constraints...............: 140 inequality constraints with only lower bounds: 40 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 100 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5700000e+01 5.70e+01 3.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5223371e+03 1.86e+00 3.02e+01 1.3 2.91e+01 - 7.06e-02 7.59e-02f 1 2 1.6613119e+03 7.99e-01 2.66e+01 1.2 4.04e+01 - 1.17e-01 1.08e-01f 1 3 1.8547899e+03 5.87e-01 5.18e+01 1.1 5.57e+01 - 3.68e-01 2.66e-01f 1 4 5.3975051e+02 2.98e-01 1.09e+02 0.7 1.62e+01 - 3.78e-01 6.53e-01f 1 5 1.4788592e+03 6.02e-02 2.98e+01 1.0 3.52e+01 - 7.39e-01 7.05e-01f 1 6 2.3931776e+02 2.22e-16 7.28e+00 0.3 9.16e+00 - 8.68e-01 1.00e+00f 1 7 3.1767476e+00 2.22e-16 1.39e-01 -5.3 1.87e+00 - 9.81e-01 9.77e-01f 1 8 3.1953772e-02 2.22e-16 1.44e-03 -10.7 3.88e-02 - 9.89e-01 9.90e-01h 1 9 5.8713977e-05 2.22e-16 2.66e-06 -11.0 3.94e-04 - 9.98e-01 9.98e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.5520021e-07 2.22e-16 4.98e-10 -11.0 1.61e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 10 (scaled) (unscaled) Objective...............: -8.5066736342040770e-08 -2.5520020902612231e-07 Dual infeasibility......: 4.9764992127165897e-10 1.4929497638149769e-09 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 1.9311964809457313e-11 5.7935894428371944e-11 Overall NLP error.......: 4.9764992127165897e-10 1.4929497638149769e-09 Number of objective function evaluations = 11 Number of objective gradient evaluations = 11 Number of equality constraint evaluations = 11 Number of inequality constraint evaluations = 11 Number of equality constraint Jacobian evaluations = 11 Number of inequality constraint Jacobian evaluations = 11 Number of Lagrangian Hessian evaluations = 10 Total CPU secs in IPOPT (w/o function evaluations) = 0.005 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2.5520021e-07 10 0.009999 build initial OA NLP0014I 2 INFEAS 7.6266027 217 0.097985 OA decomposition NLP0014I 3 INFEAS 21.317542 107 0.054991 OA decomposition NLP0014I 4 OPT 8278.4705 36 0.015998 OA decomposition OA0003I New best feasible of 8278.4705 found after 3.978395 sec and NLP0014I 5 OPT 8278.4705 39 0.016997 OA decomposition NLP0014I 6 OPT 8278.4705 38 0.014998 OA decomposition NLP0014I 7 OPT 8278.4705 35 0.015998 OA decomposition NLP0014I 8 OPT 8092.5 20 0.009999 OA decomposition OA0003I New best feasible of 8092.5 found after 9.970484 sec and OA0008I OA converged in 9.970484 seconds found solution of value 8092.5 (lower bound 1e+50 ). OA0010I Performed 7 iterations, explored 39590 branch-and-bound nodes in total Cbc0012I Integer solution of 8092.5 found by nonlinear programm after 3 iterations and 0 nodes (9.97 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 0 to 0 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 16 row cuts average 3.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 8092.499988918783, took 3 iterations and 0 nodes (9.97 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 16 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 8092.5. Best solution: 8.092500e+03 (0 nodes, 10.058 seconds) Best possible: 8.092500e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- clay0305m.gms(395) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job clay0305m.gms Stop 09/08/12 19:59:05 elapsed 0:00:10.177 @04 1347127145 ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- =ready= Linux opt218 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/FLay/gms/FLay03H.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job FLay03H.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- FLay03H.gms(374) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- FLay03H.gms(372) 3 Mb --- Generating MINLP model m --- FLay03H.gms(374) 5 Mb --- 145 rows 123 columns 387 non-zeroes --- 15 nl-code 3 nl-non-zeroes --- 12 discrete-columns --- FLay03H.gms(374) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 132 Number of nonzeros in inequality constraint Jacobian.: 252 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 122 variables with only lower bounds: 96 variables with lower and upper bounds: 26 variables with only upper bounds: 0 Total number of equality constraints.................: 27 Total number of inequality constraints...............: 117 inequality constraints with only lower bounds: 6 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 111 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.0000000e-02 5.84e+01 9.84e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.7919700e+00 4.95e+01 9.01e+01 0.3 1.21e+01 - 1.82e-03 1.69e-01f 1 2 7.5218154e+01 1.80e+01 4.91e+01 0.5 2.06e+01 - 8.22e-02 1.00e+00f 1 3 7.6853639e+01 5.84e+00 3.60e+01 0.5 1.38e+01 0.0 3.05e-01 1.00e+00f 1 4 8.7244462e+01 1.78e-15 3.03e+01 0.5 1.07e+01 0.4 5.96e-01 6.59e-01f 1 5 9.0742702e+01 2.66e-15 7.35e+00 -1.0 8.30e+00 -0.1 6.82e-01 1.00e+00h 1 6 6.7067706e+01 1.33e-15 1.18e+00 -0.7 9.16e+00 - 4.90e-01 9.18e-01f 1 7 5.3774582e+01 2.31e-01 5.21e-01 -1.1 7.96e+00 - 5.58e-01 5.62e-01f 1 8 3.7790742e+01 4.90e-01 1.57e-01 -1.4 7.13e+00 - 7.20e-01 7.95e-01f 1 9 3.1763304e+01 1.24e-01 2.87e-02 -2.9 2.39e+00 - 8.35e-01 7.40e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.1079719e+01 4.17e-02 3.08e-01 -4.1 4.77e-01 - 9.73e-01 5.52e-01f 1 11 3.0989616e+01 5.44e-03 1.23e-01 -6.1 1.01e-01 - 9.83e-01 7.90e-01h 1 12 3.0983857e+01 1.37e-04 3.17e-03 -9.9 1.64e-02 - 9.87e-01 9.76e-01h 1 13 3.0983867e+01 4.72e-07 1.10e-05 -11.0 3.17e-04 - 9.97e-01 9.97e-01h 1 14 3.0983867e+01 8.12e-10 5.83e-07 -11.0 2.70e-02 - 1.00e+00 9.98e-01h 1 15 3.0983867e+01 8.10e-10 1.78e+00 -11.0 2.58e-01 - 1.00e+00 3.01e-03h 7 16 3.0983867e+01 8.07e-10 1.54e+00 -11.0 2.58e-01 - 1.00e+00 3.42e-03h 8 17 3.0983867e+01 2.22e-15 4.47e-12 -11.0 2.57e-01 - 1.00e+00 1.00e+00H 1 Number of Iterations....: 17 (scaled) (unscaled) Objective...............: 3.0983866768708104e+01 3.0983866768708104e+01 Dual infeasibility......: 4.4692109274680277e-12 4.4692109274680277e-12 Constraint violation....: 2.2204460492503131e-15 2.2204460492503131e-15 Complementarity.........: 1.5342013207424933e-11 1.5342013207424933e-11 Overall NLP error.......: 1.5342013207424933e-11 1.5342013207424933e-11 Number of objective function evaluations = 36 Number of objective gradient evaluations = 18 Number of equality constraint evaluations = 36 Number of inequality constraint evaluations = 36 Number of equality constraint Jacobian evaluations = 18 Number of inequality constraint Jacobian evaluations = 18 Number of Lagrangian Hessian evaluations = 17 Total CPU secs in IPOPT (w/o function evaluations) = 0.015 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 30.983867 17 0.016998 build initial OA NLP0014I 2 OPT 48.989795 22 0.018997 OA decomposition OA0003I New best feasible of 48.989795 found after 0.057991 sec and NLP0014I 3 OPT 48.989795 22 0.018997 OA decomposition NLP0014I 4 OPT 48.989795 21 0.016997 OA decomposition NLP0014I 5 OPT 48.989795 23 0.017997 OA decomposition NLP0014I 6 OPT 48.989795 21 0.016997 OA decomposition NLP0014I 7 OPT 48.989795 20 0.007999 OA decomposition NLP0014I 8 OPT 48.989795 20 0.007999 OA decomposition NLP0014I 9 OPT 48.989795 19 0.006999 OA decomposition OA0008I OA converged in 0.802878 seconds found solution of value 48.989795 (lower bound 1e+50 ). OA0010I Performed 8 iterations, explored 747 branch-and-bound nodes in total Cbc0012I Integer solution of 48.989795 found by nonlinear programm after 6 iterations and 0 nodes (0.80 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from 30.983866 to 30.983866 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 48.98979485156662, took 6 iterations and 0 nodes (0.80 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 48.9898. Best solution: 4.898979e+01 (0 nodes, 0.818 seconds) Best possible: 4.898979e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- FLay03H.gms(374) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job FLay03H.gms Stop 09/08/12 19:58:56 elapsed 0:00:00.942 @04 1347127136 ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- =ready= Linux opt219 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/FLay/gms/FLay03M.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job FLay03M.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- FLay03M.gms(114) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- FLay03M.gms(112) 3 Mb --- Generating MINLP model m --- FLay03M.gms(114) 5 Mb --- 25 rows 27 columns 87 non-zeroes --- 15 nl-code 3 nl-non-zeroes --- 12 discrete-columns --- FLay03M.gms(114) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 12 Number of nonzeros in inequality constraint Jacobian.: 72 Number of nonzeros in Lagrangian Hessian.............: 3 Total number of variables............................: 26 variables with only lower bounds: 0 variables with lower and upper bounds: 26 variables with only upper bounds: 0 Total number of equality constraints.................: 3 Total number of inequality constraints...............: 21 inequality constraints with only lower bounds: 6 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 15 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.0000000e-02 5.84e+01 1.18e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0845551e+02 2.18e+01 1.50e+03 1.3 3.92e+01 - 5.01e-04 7.57e-01f 1 2 1.0557727e+02 8.91e+00 6.67e+02 1.1 5.36e+00 2.0 1.00e+00 1.00e+00f 1 3 1.0217519e+02 6.59e+00 1.87e+02 -0.2 2.05e+01 - 6.54e-01 7.18e-01h 1 4 6.5258187e+01 0.00e+00 1.46e+00 0.3 1.80e+01 - 9.17e-01 1.00e+00f 1 5 3.7833003e+01 2.22e-16 3.33e+00 -0.1 1.75e+01 - 2.89e-01 8.59e-01f 1 6 3.1740800e+01 4.28e-01 1.53e-01 -1.9 4.08e+00 - 8.05e-01 5.67e-01f 1 7 3.0492649e+01 2.84e-01 4.05e-01 -2.5 1.32e+00 - 8.74e-01 5.49e-01f 1 8 3.0764244e+01 1.12e-01 2.13e-01 -3.9 4.84e-01 - 8.45e-01 6.61e-01h 1 9 3.0978579e+01 2.67e-03 9.46e-03 -5.3 1.27e-01 - 9.10e-01 9.95e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.0983752e+01 5.72e-05 1.21e-04 -11.0 1.41e-02 - 9.88e-01 9.85e-01h 1 11 3.0983867e+01 3.22e-09 1.87e-08 -11.0 2.15e-04 - 1.00e+00 1.00e+00h 1 12 3.0983867e+01 0.00e+00 9.89e-13 -11.0 2.34e-02 - 1.00e+00 1.00e+00H 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 3.0983866768709337e+01 3.0983866768709337e+01 Dual infeasibility......: 9.8927427173170512e-13 9.8927427173170512e-13 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.1288533332126876e-11 1.1288533332126876e-11 Overall NLP error.......: 1.1288533332126876e-11 1.1288533332126876e-11 Number of objective function evaluations = 14 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 Number of equality constraint Jacobian evaluations = 13 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 12 Total CPU secs in IPOPT (w/o function evaluations) = 0.007 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 30.983867 12 0.008999 build initial OA NLP0014I 2 OPT 48.989795 13 0.007998 OA decomposition OA0003I New best feasible of 48.989795 found after 0.021996 sec and NLP0014I 3 OPT 48.989795 13 0.005999 OA decomposition NLP0014I 4 OPT 48.989795 14 0.007999 OA decomposition NLP0014I 5 OPT 48.989795 13 0.004999 OA decomposition NLP0014I 6 OPT 48.989795 12 0.007999 OA decomposition NLP0014I 7 OPT 48.989795 12 0.006999 OA decomposition NLP0014I 8 OPT 48.989795 11 0.004999 OA decomposition NLP0014I 9 OPT 48.989795 11 0.005999 OA decomposition OA0008I OA converged in 0.276958 seconds found solution of value 48.989795 (lower bound 1e+50 ). OA0010I Performed 8 iterations, explored 683 branch-and-bound nodes in total Cbc0012I Integer solution of 48.989795 found by nonlinear programm after 8 iterations and 0 nodes (0.27 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from 30.983866 to 30.983866 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 48.98979481995887, took 8 iterations and 0 nodes (0.27 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 48.9898. Best solution: 4.898979e+01 (0 nodes, 0.288 seconds) Best possible: 4.898979e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- FLay03M.gms(114) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job FLay03M.gms Stop 09/08/12 19:58:56 elapsed 0:00:00.399 @04 1347127136 ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- =ready= Linux opt220 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/FLay/gms/FLay04H.gms =========== ----------------------------- Sa 8. Sep 19:58:55 CEST 2012 ----------------------------- @03 1347127135 --- Job FLay04H.gms Start 09/08/12 19:58:55 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- FLay04H.gms(683) 2 Mb --- Starting execution: elapsed 0:00:00.012 --- FLay04H.gms(681) 3 Mb --- Generating MINLP model m --- FLay04H.gms(683) 5 Mb --- 283 rows 235 columns 755 non-zeroes --- 20 nl-code 4 nl-non-zeroes --- 24 discrete-columns --- FLay04H.gms(683) 3 Mb --- Executing BONMIN: elapsed 0:00:00.015 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 264 Number of nonzeros in inequality constraint Jacobian.: 488 Number of nonzeros in Lagrangian Hessian.............: 4 Total number of variables............................: 234 variables with only lower bounds: 192 variables with lower and upper bounds: 42 variables with only upper bounds: 0 Total number of equality constraints.................: 54 Total number of inequality constraints...............: 228 inequality constraints with only lower bounds: 8 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 220 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.0000000e-02 1.68e+01 8.01e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.2889374e+01 5.04e+00 8.35e+02 0.4 2.31e+01 - 1.18e-03 1.00e+00f 1 2 4.4609953e+01 2.91e+00 4.50e+02 -0.2 2.84e+00 2.0 6.53e-01 5.14e-01h 1 3 4.6636297e+01 1.56e+00 1.79e+02 -0.8 2.19e+00 - 6.77e-01 6.02e-01h 1 4 4.2359847e+01 2.22e-15 1.11e+00 -1.8 1.97e+00 - 8.27e-01 1.00e+00f 1 5 3.3688290e+01 7.49e-02 2.76e-01 -2.0 3.02e+00 - 6.51e-01 8.66e-01f 1 6 3.1589496e+01 4.22e-02 1.89e-01 -3.3 1.34e+00 - 8.85e-01 5.39e-01f 1 7 3.1059792e+01 2.03e-02 3.05e-01 -4.7 5.66e-01 - 9.32e-01 5.84e-01f 1 8 3.0981461e+01 4.93e-03 6.00e-02 -6.4 3.29e-01 - 9.38e-01 8.52e-01h 1 9 3.0983616e+01 2.00e-04 1.72e-03 -8.9 4.31e-02 - 9.70e-01 9.71e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.0983866e+01 5.07e-07 4.22e-06 -11.0 7.09e-04 - 9.98e-01 9.98e-01h 1 11 3.0983867e+01 1.95e-09 2.91e-06 -11.0 5.49e-03 - 1.00e+00 9.96e-01h 1 12 3.0983867e+01 1.95e-09 1.60e+00 -11.0 4.56e-01 - 1.00e+00 2.91e-05h 14 13 3.0983867e+01 1.95e-09 1.33e+00 -11.0 4.63e-01 - 1.00e+00 1.27e-05h 17 14 3.0983867e+01 1.33e-15 4.26e-11 -11.0 4.73e-01 - 1.00e+00 1.00e+00H 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 3.0983866768715899e+01 3.0983866768715899e+01 Dual infeasibility......: 4.2553233317930885e-11 4.2553233317930885e-11 Constraint violation....: 1.3322676295501878e-15 1.3322676295501878e-15 Complementarity.........: 1.0459762359814815e-11 1.0459762359814815e-11 Overall NLP error.......: 4.2553233317930885e-11 4.2553233317930885e-11 Number of objective function evaluations = 50 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 50 Number of inequality constraint evaluations = 50 Number of equality constraint Jacobian evaluations = 15 Number of inequality constraint Jacobian evaluations = 15 Number of Lagrangian Hessian evaluations = 14 Total CPU secs in IPOPT (w/o function evaluations) = 0.024 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 30.983867 14 0.028995 build initial OA NLP0014I 2 OPT 54.416667 25 0.012998 OA decomposition OA0003I New best feasible of 54.416667 found after 0.85587 sec and NLP0014I 3 OPT 54.416667 24 0.012998 OA decomposition NLP0014I 4 OPT 54.416667 21 0.009998 OA decomposition NLP0014I 5 OPT 54.416667 22 0.012998 OA decomposition NLP0014I 6 OPT 54.416667 23 0.012998 OA decomposition NLP0014I 7 OPT 54.416667 25 0.013998 OA decomposition NLP0014I 8 OPT 54.405882 23 0.012998 OA decomposition OA0003I New best feasible of 54.405882 found after 5.277198 sec and NLP0014I 9 OPT 54.405882 18 0.010998 OA decomposition NLP0014I 10 OPT 54.405882 20 0.010999 OA decomposition NLP0014I 11 OPT 54.405882 20 0.009998 OA decomposition NLP0014I 12 OPT 54.416667 24 0.013998 OA decomposition NLP0014I 13 OPT 54.416667 24 0.011998 OA decomposition NLP0014I 14 OPT 54.416667 23 0.012998 OA decomposition NLP0014I 15 OPT 54.416667 22 0.012998 OA decomposition NLP0014I 16 OPT 54.416667 26 0.014998 OA decomposition NLP0014I 17 OPT 54.416667 24 0.012998 OA decomposition NLP0014I 18 OPT 54.416667 28 0.015997 OA decomposition NLP0014I 19 OPT 54.416667 27 0.014997 OA decomposition NLP0014I 20 OPT 54.416667 26 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 54.416667 23 0.011998 OA decomposition NLP0014I 22 OPT 54.405882 23 0.012998 OA decomposition NLP0014I 23 OPT 54.416667 25 0.013998 OA decomposition NLP0014I 24 OPT 54.416667 24 0.013998 OA decomposition NLP0014I 25 OPT 54.405882 21 0.011998 OA decomposition OA0008I OA converged in 24.238316 seconds found solution of value 54.405882 (lower bound 1e+50 ). OA0010I Performed 24 iterations, explored 44205 branch-and-bound nodes in total Cbc0012I Integer solution of 54.405882 found by nonlinear programm after 9 iterations and 0 nodes (24.24 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from 30.983866 to 30.983866 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 30 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 54.40588203140436, took 9 iterations and 0 nodes (24.24 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 30 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 54.4059. Best solution: 5.440588e+01 (0 nodes, 24.363 seconds) Best possible: 5.440588e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- FLay04H.gms(683) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job FLay04H.gms Stop 09/08/12 19:59:20 elapsed 0:00:24.501 @04 1347127160 ----------------------------- Sa 8. Sep 19:59:20 CEST 2012 ----------------------------- =ready= Linux opt221 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/FLay/gms/FLay04M.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job FLay04M.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- FLay04M.gms(159) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- FLay04M.gms(157) 3 Mb --- Generating MINLP model m --- FLay04M.gms(159) 5 Mb --- 43 rows 43 columns 155 non-zeroes --- 20 nl-code 4 nl-non-zeroes --- 24 discrete-columns --- FLay04M.gms(159) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 24 Number of nonzeros in inequality constraint Jacobian.: 128 Number of nonzeros in Lagrangian Hessian.............: 4 Total number of variables............................: 42 variables with only lower bounds: 0 variables with lower and upper bounds: 42 variables with only upper bounds: 0 Total number of equality constraints.................: 6 Total number of inequality constraints...............: 36 inequality constraints with only lower bounds: 8 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 28 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.0000000e-02 1.68e+01 1.38e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.1471496e+02 1.11e-16 2.75e+03 1.4 5.41e+01 - 3.80e-04 1.00e+00f 1 2 2.1541947e+02 0.00e+00 2.49e+03 1.3 1.58e+01 2.0 1.00e+00 8.01e-02h 1 3 2.5481781e+02 2.22e-16 4.97e+00 1.3 2.19e+01 - 1.00e+00 1.00e+00f 1 4 1.4885761e+02 2.22e-16 2.01e+01 0.2 2.70e+01 - 5.95e-01 1.00e+00f 1 5 5.3486869e+01 2.22e-16 5.06e+00 -0.8 2.49e+01 - 7.78e-01 9.60e-01f 1 6 3.7828314e+01 9.14e-02 8.96e-01 -0.2 6.39e+00 - 7.84e-01 1.00e+00f 1 7 3.1809975e+01 3.52e-02 4.19e-02 -1.9 2.49e+00 - 7.57e-01 6.07e-01f 1 8 3.1021421e+01 5.27e-03 4.36e-01 -3.2 5.03e-01 - 9.53e-01 4.64e-01f 1 9 3.0981268e+01 1.74e-03 1.94e-01 -5.6 9.71e-02 - 9.69e-01 7.63e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.0983785e+01 4.71e-05 5.62e-03 -9.2 1.60e-02 - 9.84e-01 9.73e-01h 1 11 3.0983866e+01 2.83e-07 3.33e-05 -11.0 3.93e-04 - 9.94e-01 9.94e-01h 1 12 3.0983867e+01 1.11e-16 6.05e-11 -11.0 2.59e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 3.0983866768708978e+01 3.0983866768708978e+01 Dual infeasibility......: 6.0512898207528124e-11 6.0512898207528124e-11 Constraint violation....: 1.1102230246251565e-16 1.1102230246251565e-16 Complementarity.........: 3.2242103580603574e-11 3.2242103580603574e-11 Overall NLP error.......: 6.0512898207528124e-11 6.0512898207528124e-11 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 13 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 13 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 12 Total CPU secs in IPOPT (w/o function evaluations) = 0.005 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 30.983867 12 0.006999 build initial OA NLP0014I 2 OPT 54.405882 13 0.005999 OA decomposition OA0003I New best feasible of 54.405882 found after 0.189971 sec and NLP0014I 3 OPT 54.405882 14 0.007998 OA decomposition NLP0014I 4 OPT 54.405882 12 0.006999 OA decomposition NLP0014I 5 OPT 54.405882 12 0.003999 OA decomposition NLP0014I 6 OPT 54.416667 15 0.002999 OA decomposition NLP0014I 7 OPT 54.416667 15 0.004 OA decomposition NLP0014I 8 OPT 54.405882 14 0.004 OA decomposition NLP0014I 9 OPT 54.405882 14 0.004 OA decomposition NLP0014I 10 OPT 54.405882 12 0.004 OA decomposition NLP0014I 11 OPT 54.405882 12 0.003 OA decomposition NLP0014I 12 OPT 54.405882 13 0.002999 OA decomposition NLP0014I 13 OPT 54.405882 12 0.003999 OA decomposition NLP0014I 14 OPT 54.405882 13 0.003 OA decomposition NLP0014I 15 OPT 54.405882 14 0.002999 OA decomposition NLP0014I 16 OPT 54.405882 14 0.004999 OA decomposition NLP0014I 17 OPT 54.405882 14 0.003999 OA decomposition NLP0014I 18 OPT 54.405882 13 0.003999 OA decomposition NLP0014I 19 OPT 54.405882 14 0.004 OA decomposition NLP0014I 20 OPT 54.405882 14 0.005 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 54.405882 13 0.003999 OA decomposition NLP0014I 22 OPT 54.416667 15 0.004999 OA decomposition NLP0014I 23 OPT 54.416667 18 0.004999 OA decomposition OA0008I OA converged in 6.035082 seconds found solution of value 54.405882 (lower bound 1e+50 ). OA0010I Performed 22 iterations, explored 36716 branch-and-bound nodes in total Cbc0012I Integer solution of 54.405882 found by nonlinear programm after 18 iterations and 0 nodes (6.03 seconds) Cbc0031I 4 added rows had average density of 2 Cbc0013I At root node, 4 cuts changed objective from 30.983866 to 30.983866 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 40 row cuts average 2.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 54.4058819788203, took 18 iterations and 0 nodes (6.03 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 40 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 54.4059. Best solution: 5.440588e+01 (0 nodes, 6.095 seconds) Best possible: 5.440588e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- FLay04M.gms(159) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job FLay04M.gms Stop 09/08/12 19:59:02 elapsed 0:00:06.205 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt207 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/FLay/gms/FLay05H.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job FLay05H.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- FLay05H.gms(1092) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- FLay05H.gms(1090) 3 Mb --- Generating MINLP model m --- FLay05H.gms(1092) 5 Mb --- 466 rows 383 columns 1,243 non-zeroes --- 25 nl-code 5 nl-non-zeroes --- 40 discrete-columns --- FLay05H.gms(1092) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 440 Number of nonzeros in inequality constraint Jacobian.: 800 Number of nonzeros in Lagrangian Hessian.............: 5 Total number of variables............................: 382 variables with only lower bounds: 320 variables with lower and upper bounds: 62 variables with only upper bounds: 0 Total number of equality constraints.................: 90 Total number of inequality constraints...............: 375 inequality constraints with only lower bounds: 10 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 365 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.0000000e-02 7.32e+01 9.87e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.6096733e+01 3.41e+01 5.69e+02 0.1 1.43e+01 - 1.74e-03 1.00e+00f 1 2 3.1050841e+01 2.76e+01 4.68e+02 0.6 6.72e+01 0.0 2.35e-02 1.78e-01f 1 3 3.2122295e+01 2.43e+01 4.16e+02 0.6 5.75e+00 1.3 7.82e-01 1.20e-01f 1 4 4.1070032e+01 1.03e+01 1.02e+02 0.1 9.99e+00 0.9 4.63e-01 1.00e+00f 1 5 4.5030406e+01 4.83e+00 2.81e+01 -0.6 7.10e+00 0.4 6.13e-01 7.67e-01h 1 6 4.5981013e+01 3.91e+00 1.82e+01 -1.1 3.34e+00 - 6.77e-01 3.49e-01h 1 7 4.8048714e+01 6.45e-03 6.43e-01 -1.3 3.37e+00 - 7.38e-01 1.00e+00h 1 8 4.0645137e+01 2.76e-01 1.96e-01 -2.3 3.59e+00 - 7.26e-01 7.91e-01f 1 9 3.6036549e+01 1.05e-01 4.48e-02 -2.9 1.92e+00 - 9.02e-01 7.41e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.4811996e+01 1.70e-02 2.42e-01 -4.2 7.12e-01 - 9.77e-01 6.04e-01f 1 11 3.4654731e+01 1.34e-03 1.04e-01 -6.7 1.01e-01 - 9.79e-01 7.93e-01h 1 12 3.4641174e+01 2.96e-05 2.44e-03 -10.8 1.56e-02 - 9.87e-01 9.78e-01h 1 13 3.4641017e+01 7.75e-08 6.40e-06 -11.0 4.77e-04 - 9.98e-01 9.97e-01h 1 14 3.4641016e+01 1.87e-10 8.61e-07 -11.0 1.42e-01 - 1.00e+00 9.98e-01h 1 15 3.4641016e+01 1.55e-10 1.44e+00 -11.0 3.43e-01 - 1.00e+00 1.68e-01h 2 16 3.4641016e+01 1.21e-10 7.60e-01 -11.0 2.98e-01 - 1.00e+00 2.15e-01h 2 17 3.4641016e+01 1.33e-15 3.31e-11 -11.0 2.66e-01 - 1.00e+00 1.00e+00H 1 Number of Iterations....: 17 (scaled) (unscaled) Objective...............: 3.4641016150423951e+01 3.4641016150423951e+01 Dual infeasibility......: 3.3135709357077119e-11 3.3135709357077119e-11 Constraint violation....: 1.3322676295501878e-15 1.3322676295501878e-15 Complementarity.........: 1.4949205135531182e-11 1.4949205135531182e-11 Overall NLP error.......: 3.3135709357077119e-11 3.3135709357077119e-11 Number of objective function evaluations = 25 Number of objective gradient evaluations = 18 Number of equality constraint evaluations = 25 Number of inequality constraint evaluations = 25 Number of equality constraint Jacobian evaluations = 18 Number of inequality constraint Jacobian evaluations = 18 Number of Lagrangian Hessian evaluations = 17 Total CPU secs in IPOPT (w/o function evaluations) = 0.019 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 34.641016 17 0.020996 build initial OA NLP0014I 2 OPT 64.498062 28 0.019997 OA decomposition OA0003I New best feasible of 64.498062 found after 1.348795 sec and NLP0014I 3 OPT 64.498062 28 0.020997 OA decomposition NLP0014I 4 OPT 64.498062 28 0.019997 OA decomposition NLP0014I 5 OPT 64.498062 26 0.020997 OA decomposition NLP0014I 6 OPT 64.498062 26 0.019997 OA decomposition NLP0014I 7 OPT 64.498062 27 0.020996 OA decomposition NLP0014I 8 OPT 64.498062 22 0.016997 OA decomposition OA0012I After 109.29539.1f seconds, 8 iterations upper bound 64.4974170g, lower bound 63.7929940g NLP0014I 9 OPT 64.498062 25 0.018997 OA decomposition NLP0014I 10 OPT 64.498062 27 0.020997 OA decomposition NLP0014I 11 OPT 64.498062 30 0.022997 OA decomposition NLP0014I 12 OPT 64.498062 29 0.021996 OA decomposition NLP0014I 13 OPT 64.498062 27 0.019997 OA decomposition OA0012I After 216.72305.1f seconds, 13 iterations upper bound 64.4974170g, lower bound 64.2299080g NLP0014I 14 OPT 64.498062 29 0.021997 OA decomposition NLP0014I 15 OPT 64.498062 29 0.021997 OA decomposition NLP0014I 16 OPT 64.498062 29 0.020997 OA decomposition NLP0014I 17 OPT 64.498062 25 0.018997 OA decomposition NLP0014I 18 OPT 64.498062 27 0.019997 OA decomposition OA0012I After 333.12736.1f seconds, 18 iterations upper bound 64.4974170g, lower bound 64.4036940g NLP0014I 19 OPT 64.498062 24 0.017997 OA decomposition NLP0014I 20 OPT 64.498062 28 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 64.498062 26 0.018997 OA decomposition NLP0014I 22 OPT 64.498062 26 0.015998 OA decomposition OA0012I After 436.7676.1f seconds, 22 iterations upper bound 64.4974170g, lower bound 64.4356880g NLP0014I 23 OPT 64.498062 29 0.021997 OA decomposition NLP0014I 24 OPT 64.498062 30 0.021997 OA decomposition NLP0014I 25 OPT 64.498062 25 0.017998 OA decomposition NLP0014I 26 OPT 64.498062 26 0.019997 OA decomposition OA0012I After 542.17758.1f seconds, 26 iterations upper bound 64.4974170g, lower bound 64.451880g NLP0014I 27 OPT 64.498062 24 0.017997 OA decomposition NLP0014I 28 OPT 64.498062 28 0.020997 OA decomposition NLP0014I 29 OPT 64.498062 25 0.018997 OA decomposition NLP0014I 30 OPT 64.498062 27 0.019997 OA decomposition OA0012I After 648.96434.1f seconds, 30 iterations upper bound 64.4974170g, lower bound 64.4645120g NLP0014I 31 OPT 64.498062 23 0.016998 OA decomposition NLP0014I 32 OPT 64.498062 30 0.021997 OA decomposition NLP0014I 33 OPT 64.498062 24 0.016998 OA decomposition NLP0014I 34 OPT 64.498062 27 0.019997 OA decomposition OA0012I After 757.30087.1f seconds, 34 iterations upper bound 64.4974170g, lower bound 64.4699450g NLP0014I 35 OPT 64.498062 28 0.021997 OA decomposition NLP0014I 36 OPT 64.498062 22 0.015998 OA decomposition NLP0014I 37 OPT 64.498062 26 0.019997 OA decomposition NLP0014I 38 OPT 64.498062 26 0.019997 OA decomposition OA0012I After 865.34945.1f seconds, 38 iterations upper bound 64.4974170g, lower bound 64.4791180g NLP0014I 39 OPT 64.498062 24 0.017997 OA decomposition NLP0014I 40 OPT 64.498062 25 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 64.498062 25 0.016998 OA decomposition NLP0014I 42 OPT 64.498062 22 0.015998 OA decomposition OA0012I After 979.52209.1f seconds, 42 iterations upper bound 64.4974170g, lower bound 64.4835640g NLP0014I 43 OPT 64.498062 28 0.021997 OA decomposition NLP0014I 44 OPT 64.498062 27 0.020996 OA decomposition NLP0014I 45 OPT 64.498062 24 0.017998 OA decomposition NLP0014I 46 OPT 64.498062 25 0.016998 OA decomposition OA0012I After 1096.1904.1f seconds, 46 iterations upper bound 64.4974170g, lower bound 64.4856060g NLP0014I 47 OPT 64.498062 29 0.018997 OA decomposition NLP0014I 48 OPT 64.498062 22 0.016997 OA decomposition NLP0014I 49 OPT 64.498062 24 0.017997 OA decomposition NLP0014I 50 OPT 64.498062 25 0.018997 OA decomposition OA0012I After 1218.2028.1f seconds, 50 iterations upper bound 64.4974170g, lower bound 64.4863040g NLP0014I 51 OPT 64.498062 27 0.020997 OA decomposition NLP0014I 52 OPT 64.498062 27 0.018998 OA decomposition NLP0014I 53 OPT 64.498062 28 0.020997 OA decomposition NLP0014I 54 OPT 64.498062 26 0.019997 OA decomposition OA0012I After 1340.2143.1f seconds, 54 iterations upper bound 64.4974170g, lower bound 64.4883790g NLP0014I 55 OPT 64.498062 27 0.019996 OA decomposition NLP0014I 56 OPT 64.498062 26 0.018997 OA decomposition NLP0014I 57 OPT 64.498062 27 0.019997 OA decomposition NLP0014I 58 OPT 64.498062 23 0.015997 OA decomposition OA0012I After 1464.0944.1f seconds, 58 iterations upper bound 64.4974170g, lower bound 64.4892380g NLP0014I 59 OPT 64.498062 29 0.021997 OA decomposition NLP0014I 60 OPT 64.498062 29 0.021997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 64.498062 26 0.018997 OA decomposition NLP0014I 62 OPT 64.498062 31 0.021997 OA decomposition OA0012I After 1587.3137.1f seconds, 62 iterations upper bound 64.4974170g, lower bound 64.4898270g NLP0014I 63 OPT 64.498062 30 0.022996 OA decomposition NLP0014I 64 OPT 64.498062 27 0.018997 OA decomposition NLP0014I 65 OPT 64.498062 24 0.018998 OA decomposition NLP0014I 66 OPT 64.498062 27 0.019997 OA decomposition OA0012I After 1715.8042.1f seconds, 66 iterations upper bound 64.4974170g, lower bound 64.4910690g NLP0014I 67 OPT 64.498062 26 0.017997 OA decomposition NLP0014I 68 OPT 64.498062 26 0.018997 OA decomposition NLP0014I 69 OPT 64.498062 25 0.016998 OA decomposition NLP0014I 70 OPT 64.498062 28 0.021997 OA decomposition OA0012I After 1847.5921.1f seconds, 70 iterations upper bound 64.4974170g, lower bound 64.492060g NLP0014I 71 OPT 64.498062 29 0.021996 OA decomposition NLP0014I 72 OPT 64.498062 27 0.020997 OA decomposition NLP0014I 73 OPT 64.498062 20 0.014997 OA decomposition NLP0014I 74 OPT 64.498062 29 0.020997 OA decomposition OA0012I After 1977.1854.1f seconds, 74 iterations upper bound 64.4974170g, lower bound 64.4926380g NLP0014I 75 OPT 64.498062 25 0.015998 OA decomposition NLP0014I 76 OPT 64.498062 28 0.021997 OA decomposition NLP0014I 77 OPT 64.498062 29 0.022997 OA decomposition NLP0014I 78 OPT 64.498062 26 0.019997 OA decomposition OA0012I After 2109.6043.1f seconds, 78 iterations upper bound 64.4974170g, lower bound 64.4930130g NLP0014I 79 OPT 64.498062 26 0.019997 OA decomposition NLP0014I 80 OPT 64.498062 28 0.021997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT 64.498062 27 0.020997 OA decomposition OA0012I After 2212.1757.1f seconds, 81 iterations upper bound 64.4974170g, lower bound 64.4939080g NLP0014I 82 OPT 64.498062 25 0.017997 OA decomposition NLP0014I 83 OPT 64.498062 29 0.022997 OA decomposition NLP0014I 84 OPT 64.498062 24 0.017997 OA decomposition NLP0014I 85 OPT 64.498062 27 0.018997 OA decomposition OA0012I After 2347.4701.1f seconds, 85 iterations upper bound 64.4974170g, lower bound 64.4943670g NLP0014I 86 OPT 64.498062 25 0.018997 OA decomposition NLP0014I 87 OPT 64.498062 25 0.017997 OA decomposition NLP0014I 88 OPT 64.498062 25 0.018997 OA decomposition OA0012I After 2449.8716.1f seconds, 88 iterations upper bound 64.4974170g, lower bound 64.4945130g NLP0014I 89 OPT 64.498062 28 0.021997 OA decomposition NLP0014I 90 OPT 64.498062 25 0.018997 OA decomposition NLP0014I 91 OPT 64.498062 26 0.019997 OA decomposition OA0012I After 2555.6925.1f seconds, 91 iterations upper bound 64.4974170g, lower bound 64.4948620g NLP0014I 92 OPT 64.498062 27 0.020997 OA decomposition NLP0014I 93 OPT 64.498062 26 0.019997 OA decomposition NLP0014I 94 OPT 64.498062 24 0.017997 OA decomposition OA0012I After 2660.3486.1f seconds, 94 iterations upper bound 64.4974170g, lower bound 64.4950210g NLP0014I 95 OPT 64.498062 24 0.017997 OA decomposition NLP0014I 96 OPT 64.498062 25 0.017997 OA decomposition NLP0014I 97 OPT 64.498062 27 0.020997 OA decomposition OA0012I After 2763.5509.1f seconds, 97 iterations upper bound 64.4974170g, lower bound 64.4952710g NLP0014I 98 OPT 64.498062 31 0.023996 OA decomposition NLP0014I 99 OPT 64.498062 28 0.021996 OA decomposition NLP0014I 100 OPT 64.498062 27 0.016997 OA decomposition OA0012I After 2869.1888.1f seconds, 100 iterations upper bound 64.4974170g, lower bound 64.4955710g NLP0012I Num Status Obj It time Location NLP0014I 101 OPT 64.498062 25 0.019997 OA decomposition NLP0014I 102 OPT 64.498062 24 0.015997 OA decomposition NLP0014I 103 OPT 64.498062 25 0.018998 OA decomposition OA0012I After 2974.7818.1f seconds, 103 iterations upper bound 64.4974170g, lower bound 64.4957210g NLP0014I 104 OPT 64.498062 25 0.017998 OA decomposition NLP0014I 105 OPT 64.498062 24 0.017998 OA decomposition NLP0014I 106 OPT 64.498062 26 0.018997 OA decomposition OA0012I After 3083.6422.1f seconds, 106 iterations upper bound 64.4974170g, lower bound 64.4958190g NLP0014I 107 OPT 64.498062 25 0.017997 OA decomposition NLP0014I 108 OPT 64.498062 29 0.021997 OA decomposition NLP0014I 109 OPT 64.498062 27 0.020997 OA decomposition OA0012I After 3194.0024.1f seconds, 109 iterations upper bound 64.4974170g, lower bound 64.4959810g NLP0014I 110 OPT 64.498062 26 0.017997 OA decomposition NLP0014I 111 OPT 64.498062 27 0.018997 OA decomposition NLP0014I 112 OPT 64.498062 26 0.018997 OA decomposition OA0012I After 3303.5798.1f seconds, 112 iterations upper bound 64.4974170g, lower bound 64.4961350g NLP0014I 113 OPT 64.498062 25 0.014997 OA decomposition NLP0014I 114 OPT 64.498062 28 0.020997 OA decomposition NLP0014I 115 OPT 64.498062 28 0.020997 OA decomposition OA0012I After 3418.8393.1f seconds, 115 iterations upper bound 64.4974170g, lower bound 64.4962740g NLP0014I 116 OPT 64.498062 29 0.020996 OA decomposition NLP0014I 117 OPT 64.498062 26 0.019997 OA decomposition NLP0014I 118 OPT 64.498062 29 0.021997 OA decomposition OA0012I After 3533.9308.1f seconds, 118 iterations upper bound 64.4974170g, lower bound 64.4963220g NLP0014I 119 OPT 64.498062 30 0.021997 OA decomposition NLP0014I 120 OPT 64.498062 26 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 121 OPT 64.498062 25 0.018997 OA decomposition OA0012I After 3647.5945.1f seconds, 121 iterations upper bound 64.4974170g, lower bound 64.4963770g NLP0014I 122 OPT 64.498062 29 0.020997 OA decomposition NLP0014I 123 OPT 64.498062 25 0.017997 OA decomposition NLP0014I 124 OPT 64.498062 28 0.020996 OA decomposition OA0012I After 3764.3137.1f seconds, 124 iterations upper bound 64.4974170g, lower bound 64.4963990g NLP0014I 125 OPT 64.498062 25 0.018997 OA decomposition NLP0014I 126 OPT 64.498062 27 0.020997 OA decomposition NLP0014I 127 OPT 64.498062 25 0.018998 OA decomposition OA0012I After 3879.8182.1f seconds, 127 iterations upper bound 64.4974170g, lower bound 64.4965590g NLP0014I 128 OPT 64.498062 24 0.017997 OA decomposition NLP0014I 129 OPT 64.498062 28 0.019997 OA decomposition NLP0014I 130 OPT 64.498062 25 0.017997 OA decomposition OA0012I After 3999.076.1f seconds, 130 iterations upper bound 64.4974170g, lower bound 64.4967010g NLP0014I 131 OPT 64.498062 28 0.018997 OA decomposition NLP0014I 132 OPT 64.498062 25 0.019997 OA decomposition NLP0014I 133 OPT 64.498062 27 0.019997 OA decomposition OA0012I After 4112.6068.1f seconds, 133 iterations upper bound 64.4974170g, lower bound 64.4967720g NLP0014I 134 OPT 64.498062 26 0.018997 OA decomposition NLP0014I 135 OPT 64.498062 28 0.021997 OA decomposition NLP0014I 136 OPT 64.498062 27 0.019997 OA decomposition OA0012I After 4232.2866.1f seconds, 136 iterations upper bound 64.4974170g, lower bound 64.4968180g NLP0014I 137 OPT 64.498062 27 0.018997 OA decomposition NLP0014I 138 OPT 64.498062 26 0.018997 OA decomposition NLP0014I 139 OPT 64.498062 24 0.017997 OA decomposition OA0012I After 4361.7409.1f seconds, 139 iterations upper bound 64.4974170g, lower bound 64.4968680g NLP0014I 140 OPT 64.498062 26 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 141 OPT 64.498062 27 0.020997 OA decomposition NLP0014I 142 OPT 64.498062 25 0.019997 OA decomposition OA0012I After 4484.3333.1f seconds, 142 iterations upper bound 64.4974170g, lower bound 64.4969490g NLP0014I 143 OPT 64.498062 27 0.020997 OA decomposition NLP0014I 144 OPT 64.498062 28 0.019997 OA decomposition NLP0014I 145 OPT 64.498062 27 0.018997 OA decomposition OA0012I After 4605.5748.1f seconds, 145 iterations upper bound 64.4974170g, lower bound 64.4970460g NLP0014I 146 OPT 64.498062 31 0.022997 OA decomposition NLP0014I 147 OPT 64.498062 25 0.018997 OA decomposition NLP0014I 148 OPT 64.498062 28 0.021997 OA decomposition OA0012I After 4724.4858.1f seconds, 148 iterations upper bound 64.4974170g, lower bound 64.4971060g NLP0014I 149 OPT 64.498062 27 0.019997 OA decomposition NLP0014I 150 OPT 64.498062 26 0.018997 OA decomposition NLP0014I 151 OPT 64.498062 29 0.021997 OA decomposition OA0012I After 4851.1785.1f seconds, 151 iterations upper bound 64.4974170g, lower bound 64.4971240g NLP0014I 152 OPT 64.498062 28 0.020997 OA decomposition NLP0014I 153 OPT 64.498062 33 0.023997 OA decomposition NLP0014I 154 OPT 64.498062 26 0.016998 OA decomposition OA0012I After 4969.3405.1f seconds, 154 iterations upper bound 64.4974170g, lower bound 64.4971780g NLP0014I 155 OPT 64.498062 23 0.017998 OA decomposition NLP0014I 156 OPT 64.498062 27 0.020997 OA decomposition NLP0014I 157 OPT 64.498062 24 0.017998 OA decomposition OA0012I After 5091.8319.1f seconds, 157 iterations upper bound 64.4974170g, lower bound 64.4972550g NLP0014I 158 OPT 64.498062 27 0.018997 OA decomposition NLP0014I 159 OPT 64.498062 25 0.019997 OA decomposition NLP0014I 160 OPT 64.498062 27 0.020997 OA decomposition OA0012I After 5216.7199.1f seconds, 160 iterations upper bound 64.4974170g, lower bound 64.4973010g NLP0012I Num Status Obj It time Location NLP0014I 161 OPT 64.498062 26 0.020997 OA decomposition NLP0014I 162 OPT 64.498062 30 0.022997 OA decomposition NLP0014I 163 OPT 64.498062 23 0.015998 OA decomposition OA0012I After 5357.8065.1f seconds, 163 iterations upper bound 64.4974170g, lower bound 64.4973430g NLP0014I 164 OPT 64.498062 23 0.017997 OA decomposition NLP0014I 165 OPT 64.498062 28 0.021997 OA decomposition NLP0014I 166 OPT 64.498062 28 0.019997 OA decomposition OA0012I After 5486.132.1f seconds, 166 iterations upper bound 64.4974170g, lower bound 64.4973610g NLP0014I 167 OPT 64.498062 28 0.020997 OA decomposition NLP0014I 168 OPT 64.498062 29 0.021996 OA decomposition NLP0014I 169 OPT 64.498062 26 0.018997 OA decomposition OA0012I After 5625.4188.1f seconds, 169 iterations upper bound 64.4974170g, lower bound 64.4973930g NLP0014I 170 OPT 64.498062 23 0.016997 OA decomposition NLP0014I 171 OPT 64.498062 28 0.019997 OA decomposition NLP0014I 172 OPT 64.498062 28 0.020996 OA decomposition OA0008I OA converged in 5771.6356 seconds found solution of value 64.498062 (lower bound 1e+50 ). OA0010I Performed 171 iterations, explored 12402154 branch-and-bound nodes in total Cbc0012I Integer solution of 64.498062 found by nonlinear programm after 44 iterations and 0 nodes (5771.64 seconds) Cbc0031I 5 added rows had average density of 2 Cbc0013I At root node, 5 cuts changed objective from 34.641016 to 34.641016 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 329 row cuts average 2.0 elements, 0 column cuts (5 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 64.49806197912139, took 44 iterations and 0 nodes (5771.64 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 329 cuts of which 5 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 64.4981. Best solution: 6.449806e+01 (0 nodes, 5798.65 seconds) Best possible: 6.449806e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- FLay05H.gms(1092) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job FLay05H.gms Stop 09/08/12 21:35:35 elapsed 1:36:38.895 @04 1347132935 ----------------------------- Sa 8. Sep 21:35:35 CEST 2012 ----------------------------- =ready= Linux opt222 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/FLay/gms/FLay05M.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job FLay05M.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- FLay05M.gms(214) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- FLay05M.gms(212) 3 Mb --- Generating MINLP model m --- FLay05M.gms(214) 5 Mb --- 66 rows 63 columns 243 non-zeroes --- 25 nl-code 5 nl-non-zeroes --- 40 discrete-columns --- FLay05M.gms(214) 3 Mb --- Executing BONMIN: elapsed 0:00:00.011 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 40 Number of nonzeros in inequality constraint Jacobian.: 200 Number of nonzeros in Lagrangian Hessian.............: 5 Total number of variables............................: 62 variables with only lower bounds: 0 variables with lower and upper bounds: 62 variables with only upper bounds: 0 Total number of equality constraints.................: 10 Total number of inequality constraints...............: 55 inequality constraints with only lower bounds: 10 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 45 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.0000000e-02 7.32e+01 1.42e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0614620e+02 3.46e+01 1.66e+03 1.3 4.93e+01 - 3.59e-04 6.03e-01f 1 2 9.7220039e+01 2.05e+01 1.08e+03 1.2 1.14e+01 2.0 1.00e+00 8.30e-01f 1 3 9.5753140e+01 1.94e+01 6.27e+02 0.3 3.08e+01 - 5.36e-01 4.20e-01h 1 4 9.8249816e+01 8.31e+00 3.04e+02 0.9 3.60e+01 - 1.48e-01 6.26e-01f 1 5 9.9447836e+01 5.09e-01 6.98e+01 0.7 2.09e+00 1.5 7.82e-01 1.00e+00f 1 6 8.8055048e+01 0.00e+00 1.14e+01 -0.1 4.70e+00 - 5.39e-01 1.00e+00f 1 7 5.5224606e+01 2.22e-16 4.06e+00 -0.2 1.24e+01 - 6.51e-01 1.00e+00f 1 8 3.5839304e+01 1.84e+00 1.37e+00 -0.9 9.34e+00 - 6.86e-01 9.07e-01f 1 9 3.4633920e+01 1.54e+00 5.65e-01 -2.1 2.77e+00 - 8.47e-01 2.91e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.3544521e+01 8.08e-01 3.48e-01 -2.8 2.20e+00 - 7.84e-01 6.12e-01h 1 11 3.4174030e+01 2.38e-01 7.88e-02 -3.0 1.01e+00 - 6.67e-01 7.70e-01h 1 12 3.4615699e+01 1.30e-02 7.54e-03 -3.7 1.72e-01 - 9.77e-01 9.51e-01h 1 13 3.4640708e+01 1.58e-04 6.70e-05 -10.1 2.12e-02 - 9.84e-01 9.88e-01h 1 14 3.4641016e+01 2.76e-08 9.30e-09 -11.0 2.42e-04 - 1.00e+00 1.00e+00h 1 15 3.4641016e+01 2.22e-16 1.80e-12 -11.0 3.41e-02 - 1.00e+00 1.00e+00H 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: 3.4641016150427546e+01 3.4641016150427546e+01 Dual infeasibility......: 1.8038613622883859e-12 1.8038613622883859e-12 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 1.4931492827033047e-11 1.4931492827033047e-11 Overall NLP error.......: 1.4931492827033047e-11 1.4931492827033047e-11 Number of objective function evaluations = 17 Number of objective gradient evaluations = 16 Number of equality constraint evaluations = 17 Number of inequality constraint evaluations = 17 Number of equality constraint Jacobian evaluations = 16 Number of inequality constraint Jacobian evaluations = 16 Number of Lagrangian Hessian evaluations = 15 Total CPU secs in IPOPT (w/o function evaluations) = 0.013 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 34.641016 15 0.012998 build initial OA NLP0014I 2 OPT 64.498062 16 0.008999 OA decomposition OA0003I New best feasible of 64.498062 found after 0.299955 sec and NLP0014I 3 OPT 64.498062 18 0.010998 OA decomposition NLP0014I 4 OPT 64.498062 21 0.006999 OA decomposition NLP0014I 5 OPT 64.498062 13 0.004 OA decomposition NLP0014I 6 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 7 OPT 64.498062 15 0.003999 OA decomposition NLP0014I 8 OPT 64.498062 14 0.004 OA decomposition NLP0014I 9 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 10 OPT 64.498062 16 0.003999 OA decomposition NLP0014I 11 OPT 64.498062 16 0.004999 OA decomposition NLP0014I 12 OPT 64.498062 18 0.003999 OA decomposition NLP0014I 13 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 14 OPT 64.498062 19 0.005999 OA decomposition NLP0014I 15 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 16 OPT 64.498062 15 0.005 OA decomposition OA0012I After 107.8756.1f seconds, 16 iterations upper bound 64.4974170g, lower bound 64.3487260g NLP0014I 17 OPT 64.498062 16 0.003999 OA decomposition NLP0014I 18 OPT 64.498062 22 0.006999 OA decomposition NLP0014I 19 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 20 OPT 64.498062 15 0.004999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 64.498062 16 0.005999 OA decomposition NLP0014I 22 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 23 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 24 OPT 64.498062 17 0.006 OA decomposition NLP0014I 25 OPT 64.498062 16 0.005999 OA decomposition NLP0014I 26 OPT 64.498062 18 0.004999 OA decomposition OA0012I After 214.22643.1f seconds, 26 iterations upper bound 64.4974170g, lower bound 64.4443780g NLP0014I 27 OPT 64.498062 14 0.004999 OA decomposition NLP0014I 28 OPT 64.498062 18 0.004999 OA decomposition NLP0014I 29 OPT 64.498062 14 0.004999 OA decomposition NLP0014I 30 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 31 OPT 64.498062 13 0.004 OA decomposition NLP0014I 32 OPT 64.498062 14 0.004999 OA decomposition NLP0014I 33 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 34 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 35 OPT 64.498062 13 0.003999 OA decomposition OA0012I After 322.44398.1f seconds, 35 iterations upper bound 64.4974170g, lower bound 64.467370g NLP0014I 36 OPT 64.498062 15 0.005 OA decomposition NLP0014I 37 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 38 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 39 OPT 64.498062 15 0.005999 OA decomposition NLP0014I 40 OPT 64.498062 16 0.006 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 42 OPT 64.498062 20 0.005 OA decomposition NLP0014I 43 OPT 64.498062 16 0.005999 OA decomposition NLP0014I 44 OPT 64.498062 14 0.005 OA decomposition OA0012I After 432.77321.1f seconds, 44 iterations upper bound 64.4974170g, lower bound 64.4805930g NLP0014I 45 OPT 64.498062 15 0.003999 OA decomposition NLP0014I 46 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 47 OPT 64.498062 19 0.006999 OA decomposition NLP0014I 48 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 49 OPT 64.498062 19 0.005999 OA decomposition NLP0014I 50 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 51 OPT 64.498062 16 0.005 OA decomposition NLP0014I 52 OPT 64.498062 15 0.004999 OA decomposition OA0012I After 537.70226.1f seconds, 52 iterations upper bound 64.4974170g, lower bound 64.4877010g NLP0014I 53 OPT 64.498062 15 0.004 OA decomposition NLP0014I 54 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 55 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 56 OPT 64.498062 16 0.004999 OA decomposition NLP0014I 57 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 58 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 59 OPT 64.498062 12 0.005 OA decomposition NLP0014I 60 OPT 64.498062 16 0.004999 OA decomposition OA0012I After 649.42427.1f seconds, 60 iterations upper bound 64.4974170g, lower bound 64.4895720g NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 62 OPT 64.498062 18 0.004999 OA decomposition NLP0014I 63 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 64 OPT 64.498062 19 0.004999 OA decomposition NLP0014I 65 OPT 64.498062 15 0.003999 OA decomposition NLP0014I 66 OPT 64.498062 14 0.004999 OA decomposition NLP0014I 67 OPT 64.498062 13 0.004 OA decomposition OA0012I After 751.60874.1f seconds, 67 iterations upper bound 64.4974170g, lower bound 64.4912180g NLP0014I 68 OPT 64.498062 16 0.004999 OA decomposition NLP0014I 69 OPT 64.498062 14 0.003999 OA decomposition NLP0014I 70 OPT 64.498062 16 0.004999 OA decomposition NLP0014I 71 OPT 64.498062 14 0.004999 OA decomposition NLP0014I 72 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 73 OPT 64.498062 17 0.005 OA decomposition NLP0014I 74 OPT 64.498062 18 0.003999 OA decomposition OA0012I After 860.20023.1f seconds, 74 iterations upper bound 64.4974170g, lower bound 64.4918040g NLP0014I 75 OPT 64.498062 15 0.005999 OA decomposition NLP0014I 76 OPT 64.498062 19 0.005999 OA decomposition NLP0014I 77 OPT 64.498062 16 0.005999 OA decomposition NLP0014I 78 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 79 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 80 OPT 64.498062 18 0.005999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT 64.498062 16 0.004999 OA decomposition OA0012I After 971.63029.1f seconds, 81 iterations upper bound 64.4974170g, lower bound 64.4927220g NLP0014I 82 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 83 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 84 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 85 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 86 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 87 OPT 64.498062 17 0.005 OA decomposition OA0012I After 1078.0281.1f seconds, 87 iterations upper bound 64.4974170g, lower bound 64.4934680g NLP0014I 88 OPT 64.498062 19 0.006999 OA decomposition NLP0014I 89 OPT 64.498062 16 0.005 OA decomposition NLP0014I 90 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 91 OPT 64.498062 19 0.005 OA decomposition NLP0014I 92 OPT 64.498062 19 0.005999 OA decomposition NLP0014I 93 OPT 64.498062 16 0.005999 OA decomposition OA0012I After 1184.5779.1f seconds, 93 iterations upper bound 64.4974170g, lower bound 64.4946990g NLP0014I 94 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 95 OPT 64.498062 18 0.004999 OA decomposition NLP0014I 96 OPT 64.498062 18 0.004999 OA decomposition NLP0014I 97 OPT 64.498062 19 0.006999 OA decomposition NLP0014I 98 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 99 OPT 64.498062 15 0.005999 OA decomposition OA0012I After 1294.6522.1f seconds, 99 iterations upper bound 64.4974170g, lower bound 64.4952170g NLP0014I 100 OPT 64.498062 17 0.005 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 102 OPT 64.498062 15 0.003999 OA decomposition NLP0014I 103 OPT 64.498062 18 0.004999 OA decomposition NLP0014I 104 OPT 64.498062 15 0.005999 OA decomposition NLP0014I 105 OPT 64.498062 16 0.005999 OA decomposition OA0012I After 1411.1935.1f seconds, 105 iterations upper bound 64.4974170g, lower bound 64.4958980g NLP0014I 106 OPT 64.498062 15 0.003 OA decomposition NLP0014I 107 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 108 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 109 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 110 OPT 64.498062 15 0.005 OA decomposition OA0012I After 1511.6322.1f seconds, 110 iterations upper bound 64.4974170g, lower bound 64.4959430g NLP0014I 111 OPT 64.498062 22 0.007999 OA decomposition NLP0014I 112 OPT 64.498062 15 0.005999 OA decomposition NLP0014I 113 OPT 64.498062 16 0.005999 OA decomposition NLP0014I 114 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 115 OPT 64.498062 19 0.005999 OA decomposition NLP0014I 116 OPT 64.498062 16 0.003999 OA decomposition OA0012I After 1625.9738.1f seconds, 116 iterations upper bound 64.4974170g, lower bound 64.4961210g NLP0014I 117 OPT 64.498062 18 0.004999 OA decomposition NLP0014I 118 OPT 64.498062 19 0.005 OA decomposition NLP0014I 119 OPT 64.498062 19 0.006999 OA decomposition NLP0014I 120 OPT 64.498062 18 0.004999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 121 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 122 OPT 64.498062 17 0.004999 OA decomposition OA0012I After 1746.4755.1f seconds, 122 iterations upper bound 64.4974170g, lower bound 64.4962570g NLP0014I 123 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 124 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 125 OPT 64.498062 20 0.005999 OA decomposition NLP0014I 126 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 127 OPT 64.498062 16 0.005999 OA decomposition OA0012I After 1853.5022.1f seconds, 127 iterations upper bound 64.4974170g, lower bound 64.4963960g NLP0014I 128 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 129 OPT 64.498062 20 0.005999 OA decomposition NLP0014I 130 OPT 64.498062 21 0.006998 OA decomposition NLP0014I 131 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 132 OPT 64.498062 15 0.003999 OA decomposition OA0012I After 1963.2645.1f seconds, 132 iterations upper bound 64.4974170g, lower bound 64.4965340g NLP0014I 133 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 134 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 135 OPT 64.498062 15 0.004 OA decomposition NLP0014I 136 OPT 64.498062 22 0.006998 OA decomposition NLP0014I 137 OPT 64.498062 16 0.004999 OA decomposition OA0012I After 2072.374.1f seconds, 137 iterations upper bound 64.4974170g, lower bound 64.4966430g NLP0014I 138 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 139 OPT 64.498062 16 0.004999 OA decomposition NLP0014I 140 OPT 64.498062 18 0.006 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 141 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 142 OPT 64.498062 18 0.005999 OA decomposition OA0012I After 2192.3577.1f seconds, 142 iterations upper bound 64.4974170g, lower bound 64.4967630g NLP0014I 143 OPT 64.498062 19 0.006 OA decomposition NLP0014I 144 OPT 64.498062 19 0.005999 OA decomposition NLP0014I 145 OPT 64.498062 18 0.005 OA decomposition NLP0014I 146 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 147 OPT 64.498062 17 0.005 OA decomposition OA0012I After 2308.975.1f seconds, 147 iterations upper bound 64.4974170g, lower bound 64.4968640g NLP0014I 148 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 149 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 150 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 151 OPT 64.498062 18 0.006 OA decomposition OA0012I After 2410.4286.1f seconds, 151 iterations upper bound 64.4974170g, lower bound 64.4969990g NLP0014I 152 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 153 OPT 64.498062 20 0.005999 OA decomposition NLP0014I 154 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 155 OPT 64.498062 15 0.005999 OA decomposition NLP0014I 156 OPT 64.498062 17 0.005999 OA decomposition OA0012I After 2535.1786.1f seconds, 156 iterations upper bound 64.4974170g, lower bound 64.4970690g NLP0014I 157 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 158 OPT 64.498062 20 0.005999 OA decomposition NLP0014I 159 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 160 OPT 64.498062 24 0.006999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 161 OPT 64.498062 16 0.004999 OA decomposition OA0012I After 2654.3635.1f seconds, 161 iterations upper bound 64.4974170g, lower bound 64.4971360g NLP0014I 162 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 163 OPT 64.498062 18 0.005 OA decomposition NLP0014I 164 OPT 64.498062 13 0.004 OA decomposition NLP0014I 165 OPT 64.498062 16 0.005999 OA decomposition NLP0014I 166 OPT 64.498062 18 0.004 OA decomposition OA0012I After 2773.2214.1f seconds, 166 iterations upper bound 64.4974170g, lower bound 64.4971930g NLP0014I 167 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 168 OPT 64.498062 17 0.005999 OA decomposition NLP0014I 169 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 170 OPT 64.498062 18 0.006 OA decomposition OA0012I After 2874.1411.1f seconds, 170 iterations upper bound 64.4974170g, lower bound 64.497250g NLP0014I 171 OPT 64.498062 17 0.004999 OA decomposition NLP0014I 172 OPT 64.498062 12 0.003 OA decomposition NLP0014I 173 OPT 64.498062 18 0.003999 OA decomposition NLP0014I 174 OPT 64.498062 14 0.004999 OA decomposition OA0012I After 2978.0463.1f seconds, 174 iterations upper bound 64.4974170g, lower bound 64.4973320g NLP0014I 175 OPT 64.498062 16 0.005 OA decomposition NLP0014I 176 OPT 64.498062 16 0.005999 OA decomposition NLP0014I 177 OPT 64.498062 15 0.004999 OA decomposition NLP0014I 178 OPT 64.498062 23 0.007999 OA decomposition OA0012I After 3079.8248.1f seconds, 178 iterations upper bound 64.4974170g, lower bound 64.4973810g NLP0014I 179 OPT 64.498062 18 0.005999 OA decomposition NLP0014I 180 OPT 64.498062 17 0.003999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 181 OPT 64.498062 18 0.004999 OA decomposition NLP0014I 182 OPT 64.498062 17 0.005999 OA decomposition OA0008I OA converged in 3163.3331 seconds found solution of value 64.498062 (lower bound 1e+50 ). OA0010I Performed 181 iterations, explored 10548098 branch-and-bound nodes in total Cbc0012I Integer solution of 64.498062 found by nonlinear programm after 37 iterations and 0 nodes (3163.33 seconds) Cbc0031I 5 added rows had average density of 2 Cbc0013I At root node, 5 cuts changed objective from 34.641016 to 34.641016 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 342 row cuts average 2.0 elements, 0 column cuts (5 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 64.49806191488335, took 37 iterations and 0 nodes (3163.33 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 342 cuts of which 5 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 64.4981. Best solution: 6.449806e+01 (0 nodes, 3181.56 seconds) Best possible: 6.449806e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- FLay05M.gms(214) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job FLay05M.gms Stop 09/08/12 20:51:58 elapsed 0:53:01.850 @04 1347130318 ----------------------------- Sa 8. Sep 20:51:58 CEST 2012 ----------------------------- =ready= Linux opt209 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/FLay/gms/FLay06H.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job FLay06H.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- FLay06H.gms(1600) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- FLay06H.gms(1598) 3 Mb --- Generating MINLP model m --- FLay06H.gms(1600) 5 Mb --- 694 rows 567 columns 1,851 non-zeroes --- 30 nl-code 6 nl-non-zeroes --- 60 discrete-columns --- FLay06H.gms(1600) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 660 Number of nonzeros in inequality constraint Jacobian.: 1188 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 566 variables with only lower bounds: 480 variables with lower and upper bounds: 86 variables with only upper bounds: 0 Total number of equality constraints.................: 135 Total number of inequality constraints...............: 558 inequality constraints with only lower bounds: 12 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 546 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.0000000e-02 7.32e+01 9.87e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.5227875e+01 3.43e+01 5.64e+02 0.1 1.79e+01 - 1.75e-03 1.00e+00f 1 2 2.8522559e+01 1.60e+01 3.72e+02 0.2 1.86e+00 2.0 7.66e-01 1.00e+00f 1 3 2.9949429e+01 1.50e+01 3.27e+02 -0.3 8.47e+00 - 3.95e-01 1.17e-01f 1 4 5.1988788e+01 2.99e+00 5.01e+01 -0.1 1.16e+01 - 2.66e-01 8.19e-01f 1 5 5.6793042e+01 3.11e-15 5.00e+00 -0.8 2.06e+00 - 8.95e-01 1.00e+00h 1 6 5.3810896e+01 1.58e-03 3.65e+00 -2.2 3.92e+00 - 7.42e-01 2.91e-01f 1 7 3.8850093e+01 6.86e-01 1.11e+00 -2.4 5.50e+00 - 8.20e-01 9.83e-01f 1 8 3.5078921e+01 5.29e-01 5.43e-01 -3.2 3.41e+00 - 7.74e-01 5.47e-01f 1 9 3.4390400e+01 3.12e-01 3.33e-01 -4.3 1.55e+00 - 8.60e-01 5.33e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.4438674e+01 1.12e-01 6.00e-02 -5.0 7.60e-01 - 8.23e-01 8.24e-01h 1 11 3.4619788e+01 1.09e-02 6.57e-03 -5.7 1.97e-01 - 9.53e-01 9.40e-01h 1 12 3.4640621e+01 2.01e-04 1.27e-04 -10.9 1.38e-02 - 9.82e-01 9.83e-01h 1 13 3.4641016e+01 1.35e-07 1.26e-07 -11.0 2.77e-04 - 1.00e+00 9.99e-01h 1 14 3.4641016e+01 1.35e-07 1.47e-01 -11.0 3.51e-01 - 1.00e+00 1.67e-03h 9 15 3.4641016e+01 1.35e-07 3.91e-01 -11.0 5.96e-01 - 1.00e+00 1.06e-03h 10 16 3.4641016e+01 1.35e-07 6.62e-01 -11.0 5.45e-01 - 1.00e+00 6.77e-04h 11 17 3.4641016e+01 1.35e-07 8.62e-01 -11.0 5.43e-01 - 1.00e+00 8.28e-04h 11 18 3.4641016e+01 1.35e-07 9.72e-01 -11.0 5.42e-01 - 1.00e+00 8.55e-04h 11 19 3.4641016e+01 1.34e-07 1.02e+00 -11.0 5.42e-01 - 1.00e+00 8.61e-04h 11 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 3.4641016e+01 1.34e-07 1.05e+00 -11.0 5.41e-01 - 1.00e+00 8.67e-04h 11 21 3.4641016e+01 1.34e-07 1.05e+00 -11.0 5.41e-01 - 1.00e+00 8.74e-04h 11 22 3.4641016e+01 1.34e-07 1.06e+00 -11.0 5.40e-01 - 1.00e+00 8.80e-04h 11 23 3.4641016e+01 1.34e-07 1.06e+00 -11.0 5.40e-01 - 1.00e+00 8.86e-04h 11 24 3.4641016e+01 1.34e-07 1.06e+00 -11.0 5.39e-01 - 1.00e+00 8.92e-04h 11 25 3.4641016e+01 1.07e-08 8.47e-02 -11.0 5.39e-01 - 1.00e+00 9.20e-01w 1 26 3.4641016e+01 2.22e-15 1.61e-10 -11.0 2.06e-01 - 1.00e+00 1.00e+00w 1 Number of Iterations....: 26 (scaled) (unscaled) Objective...............: 3.4641016150474300e+01 3.4641016150474300e+01 Dual infeasibility......: 1.6087007389097616e-10 1.6087007389097616e-10 Constraint violation....: 2.2204460492503131e-15 2.2204460492503131e-15 Complementarity.........: 2.8271769385002553e-11 2.8271769385002553e-11 Overall NLP error.......: 1.6087007389097616e-10 1.6087007389097616e-10 Number of objective function evaluations = 156 Number of objective gradient evaluations = 27 Number of equality constraint evaluations = 156 Number of inequality constraint evaluations = 156 Number of equality constraint Jacobian evaluations = 27 Number of inequality constraint Jacobian evaluations = 27 Number of Lagrangian Hessian evaluations = 26 Total CPU secs in IPOPT (w/o function evaluations) = 0.051 Total CPU secs in NLP function evaluations = 0.009 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 34.641016 26 0.059991 build initial OA NLP0014I 2 OPT 66.932802 31 0.030995 OA decomposition OA0003I New best feasible of 66.932802 found after 17.239379 sec and NLP0014I 3 OPT 66.932802 27 0.026996 OA decomposition OA0012I After 183.44711.1f seconds, 3 iterations upper bound 66.9321330g, lower bound 61.5025150g NLP0014I 4 OPT 66.932802 29 0.026996 OA decomposition OA0012I After 845.47347.1f seconds, 4 iterations upper bound 66.9321330g, lower bound 63.0539480g NLP0014I 5 OPT 66.932802 29 0.028996 OA decomposition OA0012I After 1828.2621.1f seconds, 5 iterations upper bound 66.9321330g, lower bound 63.9717180g NLP0014I 6 OPT 66.932802 32 0.029995 OA decomposition OA0012I After 3389.5577.1f seconds, 6 iterations upper bound 66.9321330g, lower bound 64.8404560g NLP0014I 7 OPT 66.932802 30 0.028995 OA decomposition OA0012I After 5897.9534.1f seconds, 7 iterations upper bound 66.9321330g, lower bound 66.0136910g NLP0014I 8 OPT 66.932802 31 0.030995 OA decomposition OA0012I After 7200.1304.1f seconds, 8 iterations upper bound 66.9321330g, lower bound 66.0136910g NLP0014I 9 OPT 66.932802 32 0.031995 OA decomposition OA0009I OA interupted after 7200.1634 seconds found solution of value 66.932802 (lower bound 66.013691 ). OA0010I Performed 8 iterations, explored 8043056 branch-and-bound nodes in total Cbc0031I 24 added rows had average density of 2 Cbc0013I At root node, 24 cuts changed objective from 34.641016 to 34.641016 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 24 row cuts average 2.0 elements, 0 column cuts (24 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 34.641016), took 16 iterations and 0 nodes (7200.17 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 24 cuts of which 24 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 3.464102e+01 (only reliable for convex models) --- Restarting execution --- FLay06H.gms(1600) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job FLay06H.gms Stop 09/08/12 21:59:24 elapsed 2:00:28.604 @04 1347134364 ----------------------------- Sa 8. Sep 21:59:24 CEST 2012 ----------------------------- =ready= Linux opt223 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/FLay/gms/FLay06M.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job FLay06M.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- FLay06M.gms(280) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- FLay06M.gms(278) 3 Mb --- Generating MINLP model m --- FLay06M.gms(280) 5 Mb --- 94 rows 87 columns 351 non-zeroes --- 30 nl-code 6 nl-non-zeroes --- 60 discrete-columns --- FLay06M.gms(280) 3 Mb --- Executing BONMIN: elapsed 0:00:00.011 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 60 Number of nonzeros in inequality constraint Jacobian.: 288 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 86 variables with only lower bounds: 0 variables with lower and upper bounds: 86 variables with only upper bounds: 0 Total number of equality constraints.................: 15 Total number of inequality constraints...............: 78 inequality constraints with only lower bounds: 12 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 66 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.0000000e-02 7.32e+01 1.49e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0558737e+02 3.46e+01 1.71e+03 1.3 4.89e+01 - 3.52e-04 6.07e-01f 1 2 9.6780787e+01 2.08e+01 1.06e+03 1.2 1.18e+01 2.0 1.00e+00 8.06e-01f 1 3 9.6954505e+01 1.97e+01 1.03e+03 0.7 1.10e+01 1.5 3.30e-01 4.03e-02h 1 4 9.4882389e+01 1.91e+01 6.14e+02 -0.5 3.07e+01 - 7.16e-01 4.02e-01h 1 5 9.2117018e+01 1.63e+01 5.08e+02 0.4 1.06e+01 - 1.70e-01 1.71e-01f 1 6 8.9735582e+01 9.06e+00 2.79e+02 0.5 2.10e+01 - 1.26e-01 4.44e-01f 1 7 8.6340438e+01 4.69e+00 1.21e+02 0.4 7.52e+00 - 1.03e-01 5.59e-01f 1 8 6.8239222e+01 1.11e-16 2.78e+00 -0.1 7.16e+00 - 8.06e-01 1.00e+00f 1 9 4.3018900e+01 3.97e-01 9.03e-01 -0.6 1.14e+01 - 8.28e-01 7.49e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.4292661e+01 7.08e-01 4.56e-01 -1.8 4.83e+00 - 8.85e-01 6.16e-01f 1 11 3.3832519e+01 6.32e-01 8.64e-01 -3.1 1.76e+00 - 8.45e-01 2.71e-01h 1 12 3.3999328e+01 3.28e-01 1.81e-01 -3.3 1.27e+00 - 6.53e-01 7.47e-01h 1 13 3.4545115e+01 4.81e-02 2.44e-02 -4.4 2.54e-01 - 8.37e-01 8.72e-01h 1 14 3.4638033e+01 1.50e-03 7.32e-04 -7.7 5.08e-02 - 9.61e-01 9.69e-01h 1 15 3.4641010e+01 3.27e-06 1.49e-06 -11.0 2.28e-03 - 9.98e-01 9.98e-01h 1 16 3.4641016e+01 2.22e-16 2.69e-12 -11.0 1.55e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 16 (scaled) (unscaled) Objective...............: 3.4641016150426594e+01 3.4641016150426594e+01 Dual infeasibility......: 2.6907915673060036e-12 2.6907915673060036e-12 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 1.2120960478384397e-11 1.2120960478384397e-11 Overall NLP error.......: 1.2120960478384397e-11 1.2120960478384397e-11 Number of objective function evaluations = 17 Number of objective gradient evaluations = 17 Number of equality constraint evaluations = 17 Number of inequality constraint evaluations = 17 Number of equality constraint Jacobian evaluations = 17 Number of inequality constraint Jacobian evaluations = 17 Number of Lagrangian Hessian evaluations = 16 Total CPU secs in IPOPT (w/o function evaluations) = 0.015 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 34.641016 16 0.015998 build initial OA NLP0014I 2 OPT 66.932802 19 0.005999 OA decomposition OA0003I New best feasible of 66.932802 found after 5.577153 sec and NLP0014I 3 OPT 66.932802 21 0.005999 OA decomposition NLP0014I 4 OPT 66.932802 18 0.005999 OA decomposition NLP0014I 5 OPT 66.932802 18 0.005999 OA decomposition OA0012I After 213.07861.1f seconds, 5 iterations upper bound 66.9321330g, lower bound 64.779810g NLP0014I 6 OPT 66.932802 18 0.005999 OA decomposition OA0012I After 480.78491.1f seconds, 6 iterations upper bound 66.9321330g, lower bound 65.6758750g NLP0014I 7 OPT 66.932802 20 0.006999 OA decomposition OA0012I After 757.83779.1f seconds, 7 iterations upper bound 66.9321330g, lower bound 65.9802050g NLP0014I 8 OPT 66.932802 21 0.006999 OA decomposition OA0012I After 1040.7258.1f seconds, 8 iterations upper bound 66.9321330g, lower bound 66.0910g NLP0014I 9 OPT 66.932802 16 0.004999 OA decomposition OA0012I After 1443.8375.1f seconds, 9 iterations upper bound 66.9321330g, lower bound 66.2859810g NLP0014I 10 OPT 66.932802 16 0.004999 OA decomposition OA0012I After 1852.4704.1f seconds, 10 iterations upper bound 66.9321330g, lower bound 66.4398820g NLP0014I 11 OPT 66.932802 20 0.006999 OA decomposition OA0012I After 2199.5166.1f seconds, 11 iterations upper bound 66.9321330g, lower bound 66.484920g NLP0014I 12 OPT 66.932802 21 0.007999 OA decomposition OA0012I After 2565.307.1f seconds, 12 iterations upper bound 66.9321330g, lower bound 66.5416180g NLP0014I 13 OPT 66.932802 20 0.005999 OA decomposition OA0012I After 2984.5073.1f seconds, 13 iterations upper bound 66.9321330g, lower bound 66.6165170g NLP0014I 14 OPT 66.932802 18 0.005999 OA decomposition OA0012I After 3366.7812.1f seconds, 14 iterations upper bound 66.9321330g, lower bound 66.6600950g NLP0014I 15 OPT 66.932802 17 0.006999 OA decomposition OA0012I After 3765.2596.1f seconds, 15 iterations upper bound 66.9321330g, lower bound 66.7241720g NLP0014I 16 OPT 66.932802 21 0.006999 OA decomposition OA0012I After 4280.1223.1f seconds, 16 iterations upper bound 66.9321330g, lower bound 66.7511280g NLP0014I 17 OPT 66.932802 18 0.005999 OA decomposition OA0012I After 4732.3596.1f seconds, 17 iterations upper bound 66.9321330g, lower bound 66.7530180g NLP0014I 18 OPT 66.932802 18 0.006999 OA decomposition OA0012I After 5143.3751.1f seconds, 18 iterations upper bound 66.9321330g, lower bound 66.7628850g NLP0014I 19 OPT 66.932802 20 0.006999 OA decomposition OA0012I After 5582.7583.1f seconds, 19 iterations upper bound 66.9321330g, lower bound 66.8050080g NLP0014I 20 OPT 66.932802 22 0.007999 OA decomposition OA0012I After 6062.2354.1f seconds, 20 iterations upper bound 66.9321330g, lower bound 66.8069710g NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 66.932802 17 0.005 OA decomposition OA0012I After 6520.3628.1f seconds, 21 iterations upper bound 66.9321330g, lower bound 66.8212350g NLP0014I 22 OPT 66.932802 18 0.006999 OA decomposition OA0012I After 6996.3714.1f seconds, 22 iterations upper bound 66.9321330g, lower bound 66.8337590g NLP0014I 23 OPT 66.932802 18 0.003 OA decomposition OA0012I After 7200.1364.1f seconds, 23 iterations upper bound 66.9321330g, lower bound 66.8337590g NLP0014I 24 OPT 66.932802 14 0.004999 OA decomposition OA0009I OA interupted after 7200.1424 seconds found solution of value 66.932802 (lower bound 66.833759 ). OA0010I Performed 23 iterations, explored 41104014 branch-and-bound nodes in total Cbc0031I 56 added rows had average density of 2 Cbc0013I At root node, 56 cuts changed objective from 34.641016 to 34.641016 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 56 row cuts average 2.0 elements, 0 column cuts (56 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 34.641016), took 21 iterations and 0 nodes (7200.14 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 56 cuts of which 56 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 3.464102e+01 (only reliable for convex models) --- Restarting execution --- FLay06M.gms(280) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job FLay06M.gms Stop 09/08/12 21:59:58 elapsed 2:01:01.975 @04 1347134398 ----------------------------- Sa 8. Sep 21:59:58 CEST 2012 ----------------------------- =ready= Linux opt219 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0810H.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job RSyn0810H.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0810H.gms(1107) 2 Mb --- Starting execution: elapsed 0:00:00.012 --- RSyn0810H.gms(1105) 3 Mb --- Generating MINLP model m --- RSyn0810H.gms(1107) 5 Mb --- 484 rows 344 columns 1,182 non-zeroes --- 100 nl-code 18 nl-non-zeroes --- 42 discrete-columns --- RSyn0810H.gms(1107) 3 Mb --- Executing BONMIN: elapsed 0:00:00.016 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 608 Number of nonzeros in inequality constraint Jacobian.: 520 Number of nonzeros in Lagrangian Hessian.............: 24 Total number of variables............................: 343 variables with only lower bounds: 299 variables with lower and upper bounds: 44 variables with only upper bounds: 0 Total number of equality constraints.................: 230 Total number of inequality constraints...............: 253 inequality constraints with only lower bounds: 16 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 237 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.2230000e+01 9.80e-01 1.33e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.8128368e+01 9.78e-01 1.30e+01 0.8 3.68e+02 - 7.31e-04 2.12e-03f 1 2 -2.1660459e+01 9.74e-01 1.37e+01 0.8 5.11e+02 - 2.92e-03 4.04e-03f 1 3 -2.6898262e+01 9.68e-01 1.27e+01 0.8 5.78e+02 - 8.36e-03 6.50e-03f 1 4 -8.1171238e+01 8.44e-01 1.68e+02 0.8 5.77e+02 - 1.43e-02 1.28e-01f 1 5 -1.1871059e+02 7.29e-01 1.17e+02 0.8 4.61e+02 - 2.87e-01 1.36e-01f 1 6 -2.5879873e+02 3.78e-01 5.97e+01 0.6 4.04e+02 - 3.32e-01 4.81e-01f 1 7 -4.5690023e+02 1.67e-01 3.55e+01 0.4 2.61e+02 - 6.40e-01 5.59e-01f 1 8 -9.0989467e+02 4.72e-02 1.67e+01 0.1 1.64e+02 - 6.82e-01 7.17e-01f 1 9 -1.2388554e+03 1.65e-02 1.50e+01 -0.9 4.87e+01 - 6.14e-01 6.51e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.4694008e+03 4.02e-03 1.61e+02 -0.7 1.11e+02 - 6.29e-01 7.56e-01f 1 11 -1.5898668e+03 1.62e-03 3.20e+01 -1.4 2.70e+01 - 6.29e-01 5.97e-01f 1 12 -1.6904215e+03 5.29e-04 1.02e+02 -1.7 2.30e+01 - 6.00e-01 6.74e-01f 1 13 -1.7423522e+03 7.53e-05 6.13e+02 -1.6 2.99e+01 - 7.20e-01 8.58e-01f 1 14 -1.7638863e+03 3.15e-05 1.23e+02 -2.5 1.86e+01 - 6.11e-01 5.81e-01f 1 15 -1.7772439e+03 8.42e-06 3.18e+03 -2.5 1.05e+01 - 3.93e-01 7.33e-01f 1 16 -1.7805611e+03 5.00e-06 1.16e+03 -3.1 5.48e+00 - 7.03e-01 4.06e-01f 1 17 -1.7829154e+03 2.59e-06 6.37e+03 -3.2 3.54e+00 - 9.12e-01 4.82e-01f 1 18 -1.7841908e+03 1.52e-06 8.35e+03 -3.7 1.19e+00 - 1.00e+00 4.12e-01f 1 19 -1.7860971e+03 1.21e-07 6.52e+02 -5.1 6.78e-01 - 8.83e-01 9.21e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.7862371e+03 2.43e-08 4.23e+02 -6.5 7.07e-02 - 9.95e-01 7.98e-01f 1 21 -1.7862491e+03 1.52e-08 2.85e+03 -5.6 1.56e+00 - 1.00e+00 3.76e-01f 1 22 -1.7862689e+03 2.06e-09 4.14e+02 -7.6 8.91e-03 - 8.66e-01 8.64e-01f 1 23 -1.7862718e+03 3.30e-07 6.87e+02 -8.7 2.45e-03 - 8.72e-01 9.11e-01h 1 24 -1.7862720e+03 1.11e-07 1.46e+03 -8.9 1.12e-02 - 1.00e+00 7.32e-01h 1 25 -1.7862721e+03 1.59e-08 2.36e+02 -10.1 2.58e-02 - 9.99e-01 8.51e-01h 1 26 -1.7862721e+03 1.28e-09 1.99e+01 -11.0 4.77e-02 - 8.82e-01 9.15e-01h 1 27 -1.7862721e+03 7.88e-13 9.01e-01 -9.5 6.39e-06 -4.0 1.00e+00 9.67e-01h 1 28 -1.7862721e+03 7.11e-15 4.46e-05 -9.5 1.57e-01 - 1.00e+00 1.00e+00f 1 29 -1.7862721e+03 1.07e-14 1.56e+00 -11.0 9.33e-03 - 9.57e-01 7.27e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -1.7862721e+03 1.94e-13 1.76e+02 -10.4 1.06e-06 -4.5 6.66e-02 1.00e+00h 1 31 -1.7862721e+03 7.11e-15 9.50e-07 -10.4 3.42e-01 - 1.00e+00 1.00e+00h 1 32 -1.7862721e+03 7.14e-12 2.67e-01 -11.0 2.22e-07 -5.0 1.00e+00 8.93e-01h 1 33 -1.7862721e+03 7.11e-15 4.03e-06 -11.0 1.35e-01 - 1.00e+00 1.00e+00h 1 34 -1.7862721e+03 7.11e-15 2.01e-09 -11.0 7.95e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 34 (scaled) (unscaled) Objective...............: -3.5725441774466526e+02 -1.7862720887233263e+03 Dual infeasibility......: 2.0125237309986943e-09 1.0062618654993472e-08 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.1188901139610574e-11 5.5944505698052865e-11 Overall NLP error.......: 2.0125237309986943e-09 1.0062618654993472e-08 Number of objective function evaluations = 35 Number of objective gradient evaluations = 35 Number of equality constraint evaluations = 35 Number of inequality constraint evaluations = 35 Number of equality constraint Jacobian evaluations = 35 Number of inequality constraint Jacobian evaluations = 35 Number of Lagrangian Hessian evaluations = 34 Total CPU secs in IPOPT (w/o function evaluations) = 0.057 Total CPU secs in NLP function evaluations = 0.008 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1786.2721 34 0.06499 build initial OA NLP0014I 2 OPT -1721.4478 67 0.106984 OA decomposition OA0003I New best feasible of -1721.4478 found after 0.159976 sec and OA0008I OA converged in 0.160976 seconds found solution of value -1721.4478 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 2 branch-and-bound nodes in total Cbc0012I Integer solution of -1721.4478 found by nonlinear programm after 4 iterations and 0 nodes (0.15 seconds) Cbc0031I 4 added rows had average density of 2.25 Cbc0013I At root node, 4 cuts changed objective from -1786.2722 to -1786.2721 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 4 row cuts average 2.2 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1721.447793109243, took 4 iterations and 0 nodes (0.15 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 4 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1721.45. Best solution: 1.721448e+03 (0 nodes, 0.171 seconds) Best possible: 1.721448e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0810H.gms(1107) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0810H.gms Stop 09/08/12 19:58:56 elapsed 0:00:00.344 @04 1347127136 ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0810M02H.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job RSyn0810M02H.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0810M02H.gms(2654) 2 Mb --- Starting execution: elapsed 0:00:00.012 --- RSyn0810M02H.gms(2652) 3 Mb --- Generating MINLP model m --- RSyn0810M02H.gms(2654) 6 Mb --- 1,189 rows 791 columns 2,875 non-zeroes --- 200 nl-code 36 nl-non-zeroes --- 168 discrete-columns --- RSyn0810M02H.gms(2654) 3 Mb --- Executing BONMIN: elapsed 0:00:00.016 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1320 Number of nonzeros in inequality constraint Jacobian.: 1446 Number of nonzeros in Lagrangian Hessian.............: 48 Total number of variables............................: 790 variables with only lower bounds: 598 variables with lower and upper bounds: 172 variables with only upper bounds: 0 Total number of equality constraints.................: 496 Total number of inequality constraints...............: 692 inequality constraints with only lower bounds: 32 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 660 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -2.4830000e+01 1.39e+00 2.59e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.5404886e+01 1.39e+00 2.60e+01 0.7 7.13e+02 - 8.97e-04 2.35e-03f 1 2 -3.6171963e+01 1.38e+00 2.62e+01 0.7 1.08e+03 - 3.25e-03 3.68e-03f 1 3 -2.8556714e+01 1.34e+00 3.16e+01 0.7 1.25e+03 - 8.97e-03 1.79e-02f 1 4 5.3583138e+00 1.24e+00 5.22e+01 0.7 1.30e+03 - 2.24e-02 4.87e-02f 1 5 4.2806364e+01 1.06e+00 2.05e+02 0.7 1.17e+03 - 3.95e-02 1.07e-01f 1 6 6.3942293e+01 9.01e-01 1.84e+02 0.6 9.78e+02 - 2.71e-01 1.18e-01f 1 7 7.9698503e+01 3.18e-01 6.88e+01 0.6 8.73e+02 - 4.72e-01 5.57e-01f 1 8 -5.2280321e+01 1.20e-01 2.42e+02 0.4 4.76e+02 - 9.07e-01 6.23e-01f 1 9 -6.7312887e+02 2.15e-02 7.32e+01 -0.3 2.56e+02 - 5.38e-01 8.21e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.0160095e+03 1.06e-02 1.16e+02 -0.5 3.99e+02 - 5.98e-01 5.09e-01f 1 11 -1.2640973e+03 8.82e-03 2.18e+02 -0.9 2.04e+02 - 6.01e-01 4.57e-01f 1 12 -1.3483209e+03 6.59e-03 7.17e+02 -1.1 2.25e+02 - 6.97e-01 2.48e-01f 1 13 -1.5525989e+03 3.41e-03 3.26e+02 -1.6 2.11e+02 - 6.26e-01 5.81e-01f 1 14 -1.7152535e+03 1.10e-03 1.23e+02 -2.0 1.06e+02 - 4.32e-01 7.66e-01f 1 15 -1.7540290e+03 4.63e-04 7.50e+01 -2.2 2.70e+01 - 6.14e-01 5.24e-01f 1 16 -1.7803763e+03 2.99e-04 2.08e+02 -2.4 2.70e+01 - 6.54e-01 5.64e-01f 1 17 -1.8005810e+03 1.99e-04 4.41e+00 -2.9 1.93e+01 - 6.89e-01 7.28e-01f 1 18 -1.8072129e+03 6.49e-05 1.48e+02 -3.3 7.89e+00 - 6.40e-01 7.14e-01f 1 19 -1.8090266e+03 2.98e-05 9.31e+01 -3.7 3.05e+00 - 5.73e-01 5.16e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.8103599e+03 3.24e-06 1.23e+02 -3.7 1.16e+00 - 8.10e-01 7.93e-01f 1 21 -1.8108821e+03 1.08e-06 4.43e+02 -4.8 4.59e-01 - 8.02e-01 6.19e-01f 1 22 -1.8111906e+03 1.01e-07 1.22e+02 -5.5 2.21e-01 - 9.89e-01 8.69e-01f 1 23 -1.8112364e+03 1.55e-08 4.96e+02 -7.6 3.41e-02 - 9.74e-01 8.44e-01f 1 24 -1.8112383e+03 6.54e-09 7.83e+00 -6.1 3.44e+00 - 1.00e+00 2.95e-01h 1 25 -1.8112380e+03 1.38e-09 4.38e+03 -5.5 1.60e+00 - 1.00e+00 6.36e-01h 1 26 -1.8112393e+03 1.42e-14 1.74e-01 -5.7 4.25e-01 - 1.00e+00 1.00e+00h 1 27 -1.8112423e+03 7.11e-15 9.79e+03 -8.0 2.27e-03 - 9.96e-01 5.57e-01f 1 28 -1.8112443e+03 1.25e-08 1.44e+03 -7.8 1.10e-01 - 9.09e-01 8.53e-01f 1 29 -1.8112445e+03 4.68e-09 5.60e+02 -8.6 3.46e-03 - 8.62e-01 6.36e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -1.8112447e+03 5.43e-09 3.81e-01 -8.4 1.88e-02 - 1.00e+00 1.00e+00h 1 31 -1.8112447e+03 4.51e-11 4.22e+03 -9.1 7.28e-04 - 1.17e-01 1.00e+00h 1 32 -1.8112447e+03 1.21e-10 8.60e-04 -8.7 1.49e-03 - 1.00e+00 1.00e+00h 1 33 -1.8112447e+03 1.96e-10 1.70e+00 -10.7 1.22e-05 - 7.58e-01 8.42e-01h 1 34 -1.8112447e+03 6.73e-07 1.06e-05 -9.4 7.61e-04 - 1.00e+00 1.00e+00h 1 35 -1.8112447e+03 1.31e-07 4.76e-01 -11.0 1.16e-05 - 1.00e+00 8.05e-01h 1 36 -1.8112447e+03 6.20e-11 5.32e-01 -10.5 9.28e-04 - 8.35e-01 1.00e+00h 1 37 -1.8112447e+03 5.60e-11 9.03e-02 -10.5 3.09e-08 -4.0 9.65e-01 1.00e+00h 1 38 -1.8112447e+03 9.01e-10 1.85e+01 -10.8 2.86e-04 - 1.43e-01 5.35e-01h 1 39 -1.8112447e+03 3.71e-10 1.05e+01 -10.6 3.21e-04 - 4.01e-02 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -1.8112447e+03 2.37e-10 3.18e+00 -10.6 1.02e-04 - 5.00e-01 1.00e+00h 1 41 -1.8112447e+03 5.10e-11 2.31e-10 -10.6 5.29e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 41 (scaled) (unscaled) Objective...............: -4.4722090911672916e+02 -1.8112446819227532e+03 Dual infeasibility......: 2.3144552940834728e-10 9.3735439410380637e-10 Constraint violation....: 5.1046451325502719e-11 5.1046451325502719e-11 Complementarity.........: 2.6878364811247619e-11 1.0885737748555287e-10 Overall NLP error.......: 2.3144552940834728e-10 9.3735439410380637e-10 Number of objective function evaluations = 42 Number of objective gradient evaluations = 42 Number of equality constraint evaluations = 42 Number of inequality constraint evaluations = 42 Number of equality constraint Jacobian evaluations = 42 Number of inequality constraint Jacobian evaluations = 42 Number of Lagrangian Hessian evaluations = 41 Total CPU secs in IPOPT (w/o function evaluations) = 0.085 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1811.2447 41 0.089986 build initial OA NLP0014I 2 OPT -1630.0038 63 0.167974 OA decomposition OA0003I New best feasible of -1630.0038 found after 0.306953 sec and NLP0014I 3 OPT -1727.9806 45 0.122982 OA decomposition OA0003I New best feasible of -1727.9806 found after 0.555916 sec and NLP0014I 4 OPT -1741.3877 77 0.139979 OA decomposition OA0003I New best feasible of -1741.3877 found after 0.817876 sec and OA0008I OA converged in 0.879866 seconds found solution of value -1741.3877 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 51 branch-and-bound nodes in total Cbc0012I Integer solution of -1741.3877 found by nonlinear programm after 16 iterations and 0 nodes (0.86 seconds) Cbc0031I 7 added rows had average density of 2.8571429 Cbc0013I At root node, 7 cuts changed objective from -1811.2451 to -1811.2449 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 15 row cuts average 2.9 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1741.387687424154, took 16 iterations and 0 nodes (0.86 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 15 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1741.39. Best solution: 1.741388e+03 (0 nodes, 0.902 seconds) Best possible: 1.741388e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0810M02H.gms(2654) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0810M02H.gms Stop 09/08/12 19:58:57 elapsed 0:00:01.072 @04 1347127137 ----------------------------- Sa 8. Sep 19:58:57 CEST 2012 ----------------------------- =ready= Linux opt208 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0810M02M.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job RSyn0810M02M.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0810M02M.gms(1916) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- RSyn0810M02M.gms(1914) 3 Mb --- Generating MINLP model m --- RSyn0810M02M.gms(1916) 5 Mb --- 867 rows 411 columns 2,189 non-zeroes --- 80 nl-code 12 nl-non-zeroes --- 168 discrete-columns --- RSyn0810M02M.gms(1916) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 450 Number of nonzeros in inequality constraint Jacobian.: 1630 Number of nonzeros in Lagrangian Hessian.............: 12 Total number of variables............................: 410 variables with only lower bounds: 218 variables with lower and upper bounds: 172 variables with only upper bounds: 0 Total number of equality constraints.................: 164 Total number of inequality constraints...............: 702 inequality constraints with only lower bounds: 206 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 496 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -2.4830000e+01 1.39e+00 3.71e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -6.0950278e+01 1.38e+00 3.68e+01 1.3 1.73e+03 - 5.86e-04 8.98e-04f 1 2 -8.5157649e+01 1.38e+00 3.71e+01 1.3 2.67e+03 - 1.41e-03 9.96e-04f 1 3 -1.3843278e+02 1.35e+00 3.69e+01 1.3 2.81e+03 - 2.78e-03 2.91e-03f 1 4 -2.7316429e+02 1.27e+00 3.51e+01 1.3 2.81e+03 - 8.04e-03 1.06e-02f 1 5 -4.6027932e+02 1.04e+00 3.46e+01 1.3 2.62e+03 - 3.27e-02 3.07e-02f 1 6 -9.5615722e+02 8.67e-01 3.21e+01 1.2 2.25e+03 - 8.19e-02 7.32e-02f 1 7 -1.2806099e+03 7.87e-01 2.89e+01 1.2 1.65e+03 - 9.67e-02 9.22e-02f 1 8 -1.5350432e+03 5.70e-01 9.35e+01 1.1 1.28e+03 - 2.14e-01 2.76e-01f 1 9 -2.0720170e+03 3.66e-01 2.95e+01 1.0 9.13e+02 - 3.96e-01 3.58e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.8897202e+03 2.28e-02 1.39e+03 0.9 6.61e+02 - 2.68e-01 9.38e-01h 1 11 -3.9250983e+03 7.91e-03 4.71e+02 -0.1 1.08e+02 - 6.57e-01 6.54e-01f 1 12 -4.6476780e+03 5.03e-03 9.09e+02 -0.0 7.63e+02 - 4.68e-01 3.64e-01f 1 13 -5.4149335e+03 3.25e-03 4.01e+03 -0.2 1.05e+03 - 6.39e-01 3.54e-01f 1 14 -6.1566397e+03 1.39e-03 1.80e+03 -0.3 8.30e+02 - 5.76e-01 5.71e-01f 1 15 -6.4632980e+03 7.90e-04 2.80e+03 -0.9 2.83e+02 - 6.42e-01 4.33e-01f 1 16 -6.6133388e+03 4.92e-04 3.66e+03 -1.1 1.63e+02 - 5.86e-01 3.78e-01f 1 17 -6.7676454e+03 2.14e-04 3.60e+03 -1.4 9.29e+01 - 7.96e-01 5.65e-01f 1 18 -6.8344148e+03 1.14e-04 2.60e+03 -1.8 2.28e+01 - 5.55e-01 4.65e-01f 1 19 -6.8846769e+03 4.41e-05 1.05e+03 -1.9 2.10e+01 - 6.20e-01 6.14e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -6.9051248e+03 3.57e-05 2.43e+03 -2.3 2.49e+01 - 6.66e-01 5.06e-01f 1 21 -6.9242752e+03 1.28e-04 9.34e+02 -2.8 2.72e+01 - 7.47e-01 7.15e-01f 1 22 -6.9302138e+03 1.02e-05 2.56e+03 -2.7 1.10e+01 - 8.84e-01 8.10e-01f 1 23 -6.9313847e+03 6.38e-06 9.24e+03 -3.6 4.98e+00 - 7.05e-01 3.31e-01f 1 24 -6.9327677e+03 4.77e-06 6.90e+03 -3.9 3.64e+00 - 7.42e-01 5.52e-01f 1 25 -6.9333416e+03 2.30e-06 1.22e+04 -4.1 3.93e+00 - 1.00e+00 4.99e-01f 1 26 -6.9337352e+03 1.38e-06 3.61e+03 -5.2 1.84e+00 - 8.65e-01 6.28e-01f 1 27 -6.9337835e+03 9.56e-07 6.73e+03 -4.8 1.27e+00 - 9.98e-01 2.35e-01f 1 28 -6.9339047e+03 3.06e-07 1.89e+03 -5.8 1.08e-01 - 8.88e-01 7.23e-01f 1 29 -6.9339491e+03 3.15e-08 3.47e+02 -8.0 1.67e-02 - 9.21e-01 9.31e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -6.9339523e+03 2.01e-08 1.88e+02 -10.0 1.16e-03 - 9.88e-01 9.85e-01h 1 31 -6.9339524e+03 6.98e-10 1.89e+00 -11.0 1.77e-05 -4.0 9.90e-01 9.65e-01h 1 32 -6.9339524e+03 6.97e-10 1.91e+04 -6.8 3.27e+03 - 8.42e-04 1.06e-03f 1 33 -6.9339524e+03 3.71e-10 1.83e+04 -8.9 1.99e+01 - 3.91e-02 4.68e-01h 1 34 -6.9339524e+03 3.60e-09 1.83e+04 -8.9 4.13e+01 - 5.29e-03 3.26e-03f 1 35 -6.9339524e+03 2.76e-09 2.25e+05 -8.9 3.94e+01 - 7.36e-03 2.34e-01f 1 36 -6.9339524e+03 2.87e-09 2.25e+05 -8.9 1.50e+01 - 1.44e-04 1.44e-04f 1 37 -6.9339524e+03 5.50e-09 2.25e+05 -8.9 1.50e+01 - 5.19e-05 3.14e-04f 1 38 -6.9339524e+03 4.62e-09 1.90e+05 -8.9 1.49e+01 - 2.49e-01 1.55e-01f 3 39 -6.9339524e+03 7.81e-09 1.90e+05 -8.9 7.15e-01 - 1.15e-05 3.00e-04h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -6.9339524e+03 9.16e-09 1.90e+05 -8.9 7.18e-01 - 7.22e-05 1.22e-04f 1 41 -6.9339524e+03 8.93e-09 1.85e+05 -8.9 7.18e-01 - 1.00e+00 2.44e-02f 6 42 -6.9339524e+03 1.12e-08 1.85e+05 -8.9 2.55e-01 - 7.71e-05 2.06e-04h 1 43 -6.9339524e+03 1.63e-08 1.85e+05 -8.9 2.55e-01 - 4.38e-05 4.67e-04f 1 44 -6.9339524e+03 6.60e-08 4.78e+05 -8.9 2.56e-01 - 3.87e-04 2.88e-03f 1 45 -6.9339524e+03 6.50e-08 4.75e+05 -8.9 2.52e-01 - 1.00e+00 1.41e-02f 4 46 -6.9339524e+03 6.33e-08 4.75e+05 -8.9 2.51e-01 - 9.60e-05 8.24e-04h 1 47 -6.9339524e+03 6.30e-08 4.71e+05 -8.9 2.50e-01 - 8.22e-03 5.39e-03f 8 48 -6.9339524e+03 6.19e-08 4.64e+05 -8.9 2.48e-01 - 1.00e+00 1.65e-02h 1 49 -6.9339524e+03 6.11e-08 4.63e+05 -8.9 2.47e-01 - 2.88e-04 1.28e-02f 7 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 -6.9339524e+03 6.10e-08 4.71e+05 -8.9 2.42e-01 - 1.00e+00 2.87e-04h 1 51 -6.9339524e+03 4.91e-09 5.85e+04 -8.9 2.43e-01 - 1.00e+00 8.75e-01h 1 52 -6.9339524e+03 4.65e-09 5.27e+04 -8.9 2.96e-02 - 1.00e+00 3.27e-02f 5 53 -6.9339524e+03 7.96e-10 1.11e+04 -8.9 2.84e-02 - 1.00e+00 7.87e-01h 1 54 -6.9339524e+03 5.53e-10 1.02e+04 -8.9 6.26e-03 - 5.95e-01 8.01e-02f 4 55 -6.9339524e+03 3.64e-10 6.69e+03 -8.9 5.79e-03 - 1.00e+00 3.43e-01h 1 56 -6.9339524e+03 3.10e-10 5.91e+03 -8.9 3.83e-03 - 1.00e+00 1.17e-01f 4 57 -6.9339524e+03 4.77e-10 4.19e-09 -8.9 3.32e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 57 (scaled) (unscaled) Objective...............: -1.7120870089277878e+03 -6.9339523861575408e+03 Dual infeasibility......: 4.1937439869142034e-09 1.6984663147002523e-08 Constraint violation....: 4.7701220751150686e-10 4.7701220751150686e-10 Complementarity.........: 1.3007204799073491e-09 5.2679179436247642e-09 Overall NLP error.......: 4.1937439869142034e-09 1.6984663147002523e-08 Number of objective function evaluations = 91 Number of objective gradient evaluations = 58 Number of equality constraint evaluations = 91 Number of inequality constraint evaluations = 91 Number of equality constraint Jacobian evaluations = 58 Number of inequality constraint Jacobian evaluations = 58 Number of Lagrangian Hessian evaluations = 57 Total CPU secs in IPOPT (w/o function evaluations) = 0.091 Total CPU secs in NLP function evaluations = 0.010 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -6933.9524 57 0.100985 build initial OA NLP0014I 2 OPT -1729.1105 35 0.031995 OA decomposition OA0003I New best feasible of -1729.1105 found after 1.335796 sec and NLP0014I 3 OPT -1518.6501 38 0.033995 OA decomposition NLP0014I 4 OPT -1732.9767 40 0.035994 OA decomposition OA0003I New best feasible of -1732.9767 found after 4.049384 sec and NLP0014I 5 OPT -1741.3869 44 0.039994 OA decomposition OA0003I New best feasible of -1741.3869 found after 5.72113 sec and OA0008I OA converged in 5.72113 seconds found solution of value -1741.3869 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 11170 branch-and-bound nodes in total Cbc0012I Integer solution of -1741.3869 found by nonlinear programm after 2 iterations and 0 nodes (5.72 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from -6933.9526 to -6933.9526 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 6 row cuts average 3.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1741.386860826264, took 2 iterations and 0 nodes (5.72 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 6 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1741.39. Best solution: 1.741387e+03 (0 nodes, 5.76 seconds) Best possible: 1.741387e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0810M02M.gms(1916) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0810M02M.gms Stop 09/08/12 19:59:02 elapsed 0:00:05.934 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt224 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0810M03H.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job RSyn0810M03H.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0810M03H.gms(4303) 3 Mb --- Starting execution: elapsed 0:00:00.033 --- RSyn0810M03H.gms(4301) 3 Mb --- Generating MINLP model m --- RSyn0810M03H.gms(4303) 6 Mb --- 1,936 rows 1,186 columns 4,669 non-zeroes --- 300 nl-code 54 nl-non-zeroes --- 252 discrete-columns --- RSyn0810M03H.gms(4303) 4 Mb --- Executing BONMIN: elapsed 0:00:00.046 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1980 Number of nonzeros in inequality constraint Jacobian.: 2526 Number of nonzeros in Lagrangian Hessian.............: 72 Total number of variables............................: 1185 variables with only lower bounds: 897 variables with lower and upper bounds: 258 variables with only upper bounds: 0 Total number of equality constraints.................: 744 Total number of inequality constraints...............: 1191 inequality constraints with only lower bounds: 48 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1143 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.8270000e+01 9.80e-01 2.63e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -5.3790772e+01 9.78e-01 2.59e+01 0.7 6.35e+02 - 9.99e-04 2.53e-03f 1 2 -5.6556746e+01 9.74e-01 2.58e+01 0.7 9.48e+02 - 3.52e-03 3.53e-03f 1 3 -5.2884841e+01 9.62e-01 2.59e+01 0.7 1.09e+03 - 9.80e-03 1.28e-02f 1 4 -2.8562275e+01 9.19e-01 5.58e+01 0.7 1.09e+03 - 1.76e-02 4.48e-02f 1 5 -2.2341173e+00 8.28e-01 2.86e+02 0.7 1.03e+03 - 2.86e-02 9.88e-02f 1 6 6.6634754e+00 7.49e-01 2.04e+02 0.6 8.82e+02 - 2.36e-01 9.55e-02f 1 7 -1.0644449e+01 4.25e-01 1.65e+02 0.6 8.27e+02 - 5.40e-01 4.32e-01f 1 8 -3.2238525e+02 1.12e-01 9.00e+01 0.3 4.56e+02 - 5.47e-01 7.36e-01f 1 9 -9.4198479e+02 2.57e-02 7.78e+01 -0.5 1.21e+02 - 5.57e-01 7.72e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.5406999e+03 1.10e-02 1.48e+02 -0.6 2.27e+02 - 5.17e-01 6.52e-01f 1 11 -1.8640235e+03 1.15e-02 3.59e+00 -0.7 2.85e+02 - 5.42e-01 5.12e-01f 1 12 -2.1102485e+03 7.99e-03 4.97e+02 -0.9 2.28e+02 - 6.51e-01 4.60e-01f 1 13 -2.3125539e+03 4.36e-03 7.41e+02 -1.2 2.15e+02 - 6.63e-01 4.68e-01f 1 14 -2.5936579e+03 1.26e-03 6.12e+02 -1.3 1.66e+02 - 8.15e-01 9.63e-01h 1 15 -2.6482759e+03 8.92e-04 8.14e+03 -1.9 5.43e+01 - 6.80e-01 3.74e-01f 1 16 -2.6808306e+03 6.68e-04 2.25e+04 -2.0 2.72e+01 - 8.05e-01 2.93e-01f 1 17 -2.7299786e+03 4.18e-04 1.61e+04 -2.2 4.70e+01 - 7.24e-01 5.47e-01f 1 18 -2.7698134e+03 4.90e-04 3.76e+03 -2.7 2.81e+01 - 6.01e-01 6.73e-01f 1 19 -2.7798269e+03 3.57e-04 1.30e+04 -3.0 2.22e+01 - 7.72e-01 4.13e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.7904102e+03 2.18e-04 4.82e+03 -3.5 1.78e+01 - 6.28e-01 6.29e-01f 1 21 -2.7938312e+03 1.11e-04 8.18e+03 -3.7 7.51e+00 - 7.55e-01 5.14e-01f 1 22 -2.7960978e+03 3.14e-05 1.61e+04 -3.7 2.41e+00 - 1.00e+00 7.32e-01f 1 23 -2.7968073e+03 1.67e-05 7.13e+03 -4.8 7.13e-01 - 9.23e-01 4.73e-01f 1 24 -2.7975852e+03 1.88e-06 9.32e+02 -6.1 2.91e-01 - 9.60e-01 9.12e-01f 1 25 -2.7975885e+03 1.09e-06 3.14e+04 -4.8 5.61e+00 - 1.00e+00 3.57e-01h 1 26 -2.7974745e+03 5.28e-07 8.20e+05 -2.7 1.30e+02 - 7.25e-02 1.59e-02f 1 27 -2.7973041e+03 2.73e-11 1.08e+00 -4.0 5.58e-01 - 1.00e+00 1.00e+00f 1 28 -2.7975388e+03 9.41e-11 2.97e+05 -6.5 1.82e-01 - 9.62e-01 6.56e-01f 1 29 -2.7975930e+03 3.16e-11 1.10e+05 -5.0 8.77e-01 - 1.00e+00 6.64e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -2.7976532e+03 1.29e-10 2.72e+04 -8.2 3.40e-02 - 9.68e-01 8.57e-01f 1 31 -2.7976553e+03 6.48e-10 2.27e+04 -6.5 2.25e-01 - 1.00e+00 2.50e-01f 1 32 -2.7976560e+03 5.81e-10 9.31e+00 -6.4 2.78e-01 - 1.00e+00 1.16e-01f 1 33 -2.7976613e+03 3.98e-08 2.67e+00 -8.3 4.11e-03 - 1.00e+00 7.70e-01f 1 34 -2.7976614e+03 3.60e-08 5.00e+05 -6.8 6.29e+00 - 4.11e-03 8.65e-02h 1 35 -2.7976620e+03 1.96e-08 2.73e+05 -7.5 2.01e+00 - 1.50e-01 4.53e-01h 1 36 -2.7976627e+03 4.44e-09 5.67e+04 -9.0 6.40e-02 - 5.07e-01 7.93e-01h 1 37 -2.7976628e+03 4.76e-10 5.76e+03 -9.6 2.56e-02 - 7.57e-01 8.98e-01h 1 38 -2.7976629e+03 4.25e-11 5.44e+02 -9.9 4.19e-02 - 5.64e-01 9.06e-01h 1 39 -2.7976629e+03 7.11e-15 1.17e+00 -9.2 4.18e-01 - 9.69e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -2.7976629e+03 1.42e-14 2.21e-06 -9.2 1.43e-02 - 1.00e+00 1.00e+00h 1 41 -2.7976629e+03 7.11e-15 1.14e+00 -10.7 8.98e-06 - 7.32e-01 6.38e-01h 1 42 -2.7976629e+03 4.15e-12 1.68e-05 -9.8 1.49e-05 - 1.00e+00 1.00e+00f 1 43 -2.7976629e+03 1.23e-12 4.78e-01 -10.9 4.48e-06 - 6.11e-01 6.83e-01h 1 44 -2.7976629e+03 1.16e-10 1.77e-06 -10.3 2.69e-05 - 1.00e+00 1.00e+00h 1 45 -2.7976629e+03 8.63e-11 8.86e-01 -11.0 1.21e-04 - 7.76e-01 5.03e-01h 1 46 -2.7976629e+03 3.35e-11 4.68e-01 -10.7 1.23e-04 - 1.00e+00 8.38e-01h 1 47 -2.7976629e+03 1.67e-11 4.77e-01 -10.7 4.24e-05 - 1.00e+00 2.50e-01f 3 48 -2.7976629e+03 4.29e-11 1.11e-08 -10.7 5.06e-05 - 1.00e+00 1.00e+00h 1 49 -2.7976629e+03 9.57e-12 4.26e-01 -11.0 1.52e-04 - 1.00e+00 7.29e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 -2.7976629e+03 1.15e-14 2.54e-08 -11.0 2.75e-04 - 1.00e+00 1.00e+00f 1 51 -2.7976629e+03 8.88e-15 3.91e-14 -11.0 3.54e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 51 (scaled) (unscaled) Objective...............: -6.5061926880596752e+02 -2.7976628558656603e+03 Dual infeasibility......: 3.9079850466805510e-14 1.6804335700726368e-13 Constraint violation....: 8.8817841970012523e-15 8.8817841970012523e-15 Complementarity.........: 1.0693168294795888e-11 4.5980623667622316e-11 Overall NLP error.......: 1.0693168294795888e-11 4.5980623667622316e-11 Number of objective function evaluations = 54 Number of objective gradient evaluations = 52 Number of equality constraint evaluations = 54 Number of inequality constraint evaluations = 54 Number of equality constraint Jacobian evaluations = 52 Number of inequality constraint Jacobian evaluations = 52 Number of Lagrangian Hessian evaluations = 51 Total CPU secs in IPOPT (w/o function evaluations) = 0.325 Total CPU secs in NLP function evaluations = 0.036 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2797.6629 51 0.360945 build initial OA NLP0014I 2 OPT -2557.9023 45 0.178973 OA decomposition OA0003I New best feasible of -2557.9023 found after 0.491925 sec and NLP0014I 3 OPT -2697.7589 45 0.093986 OA decomposition OA0003I New best feasible of -2697.7589 found after 0.886865 sec and NLP0014I 4 OPT -2722.4494 45 0.081988 OA decomposition OA0003I New best feasible of -2722.4494 found after 1.103832 sec and OA0008I OA converged in 1.237811 seconds found solution of value -2722.4494 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 133 branch-and-bound nodes in total Cbc0012I Integer solution of -2722.4494 found by nonlinear programm after 28 iterations and 0 nodes (1.19 seconds) Cbc0031I 8 added rows had average density of 2.875 Cbc0013I At root node, 8 cuts changed objective from -2797.6634 to -2797.6632 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 20 row cuts average 2.9 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2722.449378690085, took 28 iterations and 0 nodes (1.19 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 20 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2722.45. Best solution: 2.722449e+03 (0 nodes, 1.259 seconds) Best possible: 2.722449e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0810M03H.gms(4303) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0810M03H.gms Stop 09/08/12 19:58:58 elapsed 0:00:01.789 @04 1347127138 ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- =ready= Linux opt225 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0810M03M.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job RSyn0810M03M.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0810M03M.gms(3182) 2 Mb --- Starting execution: elapsed 0:00:00.026 --- RSyn0810M03M.gms(3180) 3 Mb --- Generating MINLP model m --- RSyn0810M03M.gms(3182) 6 Mb --- 1,453 rows 616 columns 3,638 non-zeroes --- 120 nl-code 18 nl-non-zeroes --- 252 discrete-columns --- RSyn0810M03M.gms(3182) 3 Mb --- Executing BONMIN: elapsed 0:00:00.036 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 675 Number of nonzeros in inequality constraint Jacobian.: 2800 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 615 variables with only lower bounds: 327 variables with lower and upper bounds: 258 variables with only upper bounds: 0 Total number of equality constraints.................: 246 Total number of inequality constraints...............: 1206 inequality constraints with only lower bounds: 309 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 897 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.8270000e+01 9.80e-01 3.79e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -8.6709492e+01 9.79e-01 3.77e+01 1.1 1.19e+03 - 8.38e-04 1.13e-03f 1 2 -1.2238116e+02 9.78e-01 3.80e+01 1.1 1.85e+03 - 1.91e-03 1.22e-03f 1 3 -2.0316104e+02 9.74e-01 3.78e+01 1.1 1.93e+03 - 3.42e-03 3.63e-03f 1 4 -4.4465605e+02 9.61e-01 3.61e+01 1.1 1.95e+03 - 1.07e-02 1.34e-02f 1 5 -1.0268159e+03 9.09e-01 1.19e+02 1.1 1.82e+03 - 3.83e-02 5.47e-02f 1 6 -1.6831083e+03 8.47e-01 1.05e+02 1.1 1.45e+03 - 8.93e-02 6.76e-02f 1 7 -2.0816036e+03 7.57e-01 7.42e+01 1.0 1.15e+03 - 8.12e-02 1.06e-01f 1 8 -2.5591909e+03 5.82e-01 5.06e+01 0.9 8.30e+02 - 2.19e-01 2.31e-01f 1 9 -3.2880137e+03 4.08e-01 2.43e+02 0.9 6.58e+02 - 5.06e-01 2.98e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.9817401e+03 2.31e-01 3.63e+01 0.7 5.76e+02 - 3.56e-01 4.34e-01f 1 11 -4.6308002e+03 6.12e-02 6.99e+02 0.7 5.41e+02 - 4.00e-01 7.35e-01f 1 12 -5.9791849e+03 1.89e-02 2.61e+02 -0.3 4.83e+01 - 6.34e-01 6.91e-01f 1 13 -6.9937851e+03 5.82e-03 4.73e+02 -0.3 1.05e+02 - 5.55e-01 6.92e-01f 1 14 -7.4542135e+03 2.64e-03 9.64e+02 -0.5 9.57e+01 - 7.87e-01 5.46e-01f 1 15 -7.8892335e+03 9.50e-04 1.76e+02 -1.2 1.13e+02 - 5.75e-01 6.40e-01f 1 16 -8.0926060e+03 3.68e-04 2.06e+02 -1.5 1.09e+02 - 6.59e-01 6.13e-01f 1 17 -8.1673023e+03 1.84e-04 3.24e+03 -1.4 8.03e+01 - 7.89e-01 4.99e-01f 1 18 -8.2365865e+03 7.91e-05 2.73e+03 -1.8 5.09e+01 - 7.30e-01 5.71e-01f 1 19 -8.2714351e+03 2.78e-05 4.66e+03 -1.8 1.54e+01 - 3.46e-01 6.48e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -8.2914915e+03 1.38e-05 4.25e+02 -2.3 1.86e+01 - 6.04e-01 5.04e-01f 1 21 -8.3089263e+03 5.14e-06 1.96e+02 -2.7 3.01e+01 - 6.25e-01 6.27e-01f 1 22 -8.3195340e+03 9.86e-06 1.04e+02 -3.2 3.03e+01 - 6.93e-01 6.79e-01f 1 23 -8.3217770e+03 2.82e-06 4.53e+03 -3.4 1.26e+01 - 5.77e-01 3.73e-01f 1 24 -8.3227804e+03 6.68e-07 4.80e+04 -3.1 6.37e+00 - 1.00e+00 3.54e-01f 1 25 -8.3249380e+03 1.47e-07 1.29e+03 -3.5 6.02e+00 - 4.79e-01 7.80e-01f 1 26 -8.3253499e+03 9.49e-08 7.69e+03 -4.3 2.34e+00 - 7.67e-01 3.55e-01f 1 27 -8.3257138e+03 4.78e-08 1.58e+04 -4.4 1.40e+00 - 1.00e+00 4.96e-01f 1 28 -8.3259338e+03 2.34e-08 3.99e+03 -5.3 5.24e-01 - 9.55e-01 5.11e-01f 1 29 -8.3260060e+03 1.49e-08 2.08e-01 -5.1 6.09e-01 - 1.00e+00 3.66e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -8.3261100e+03 3.81e-09 8.87e-02 -6.5 8.51e-02 - 9.63e-01 7.53e-01f 1 31 -8.3261432e+03 2.22e-10 1.04e-02 -9.6 1.99e-02 - 9.83e-01 9.61e-01f 1 32 -8.3261444e+03 6.52e-11 7.98e+06 -7.2 1.82e+00 - 2.24e-02 1.00e+00f 1 33 -8.3261444e+03 1.60e-07 7.97e+06 -6.0 1.47e+02 - 2.99e-06 8.05e-03f 1 34 -8.3261444e+03 1.85e-07 7.97e+06 -6.6 4.81e+01 - 2.98e-05 1.41e-05f 1 35 -8.3261445e+03 1.87e-07 7.95e+06 -6.6 4.80e+01 - 2.04e-03 3.57e-03f 1 36 -8.3261445e+03 1.34e-08 5.69e+05 -9.0 1.84e-01 - 9.94e-01 9.28e-01h 1 37 -8.3261445e+03 4.03e-09 1.72e+05 -10.9 2.23e-02 - 9.94e-01 6.98e-01h 1 38 -8.3261445e+03 9.82e-09 1.65e+05 -8.7 2.14e+02 - 6.87e-01 4.11e-02H 1 39 -8.3261445e+03 3.10e-08 1.07e+05 -8.7 9.86e+00 - 4.90e-02 3.53e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -8.3261445e+03 3.10e-08 1.07e+05 -8.7 4.71e+00 - 5.50e-05 2.52e-04f 1 41 -8.3261445e+03 3.09e-08 1.06e+05 -8.7 4.71e+00 - 1.36e-03 6.29e-03f 5 42 -8.3261445e+03 8.28e-09 5.50e+03 -8.7 4.67e+00 - 4.46e-01 9.48e-01h 1 43 -8.3261445e+03 7.85e-09 5.23e+03 -8.7 1.35e+00 - 1.00e+00 5.38e-02f 2 44 -8.3261445e+03 7.70e-09 5.21e+03 -8.7 1.06e+00 - 1.49e-03 1.96e-02h 1 45 -8.3261445e+03 7.85e-09 5.18e+03 -8.7 1.04e+00 - 3.44e-02 5.94e-03f 4 46 -8.3261445e+03 7.54e-09 4.53e+03 -8.7 1.03e+00 - 1.05e-02 1.26e-01h 1 47 -8.3261445e+03 7.37e-09 4.39e+03 -8.7 9.01e-01 - 1.00e+00 3.12e-02f 6 48 -8.3261445e+03 8.18e-10 1.95e+01 -8.7 8.73e-01 - 6.26e-01 1.00e+00h 1 49 -8.3261445e+03 5.73e-10 2.17e-10 -8.7 5.34e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 49 (scaled) (unscaled) Objective...............: -1.9363126752796131e+03 -8.3261445037023368e+03 Dual infeasibility......: 2.1735803334217102e-10 9.3463954337133528e-10 Constraint violation....: 5.7318749746571029e-10 5.7318749746571029e-10 Complementarity.........: 5.0409365141748010e-09 2.1676027010951643e-08 Overall NLP error.......: 5.0409365141748010e-09 2.1676027010951643e-08 Number of objective function evaluations = 65 Number of objective gradient evaluations = 50 Number of equality constraint evaluations = 65 Number of inequality constraint evaluations = 65 Number of equality constraint Jacobian evaluations = 50 Number of inequality constraint Jacobian evaluations = 50 Number of Lagrangian Hessian evaluations = 49 Total CPU secs in IPOPT (w/o function evaluations) = 0.260 Total CPU secs in NLP function evaluations = 0.022 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -8326.1445 49 0.281957 build initial OA NLP0014I 2 OPT -2698.8803 40 0.051992 OA decomposition OA0003I New best feasible of -2698.8803 found after 2.373639 sec and NLP0014I 3 OPT -2407.4893 38 0.050993 OA decomposition NLP0014I 4 OPT -2722.448 39 0.049993 OA decomposition OA0003I New best feasible of -2722.448 found after 8.830658 sec and OA0008I OA converged in 12.025172 seconds found solution of value -2722.448 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 11510 branch-and-bound nodes in total Cbc0012I Integer solution of -2722.448 found by nonlinear programm after 4 iterations and 0 nodes (12.01 seconds) Cbc0031I 3 added rows had average density of 3 Cbc0013I At root node, 3 cuts changed objective from -8326.1448 to -8326.1448 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 12 row cuts average 3.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2722.448010135402, took 4 iterations and 0 nodes (12.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 12 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2722.45. Best solution: 2.722448e+03 (0 nodes, 12.094 seconds) Best possible: 2.722448e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0810M03M.gms(3182) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0810M03M.gms Stop 09/08/12 19:59:09 elapsed 0:00:12.530 @04 1347127149 ----------------------------- Sa 8. Sep 19:59:09 CEST 2012 ----------------------------- =ready= Linux opt226 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0810M04H.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job RSyn0810M04H.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0810M04H.gms(6167) 3 Mb --- Starting execution: elapsed 0:00:00.044 --- RSyn0810M04H.gms(6165) 3 Mb --- Generating MINLP model m --- RSyn0810M04H.gms(6167) 6 Mb --- 2,785 rows 1,581 columns 6,701 non-zeroes --- 400 nl-code 72 nl-non-zeroes --- 336 discrete-columns --- RSyn0810M04H.gms(6167) 4 Mb --- Executing BONMIN: elapsed 0:00:00.062 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2640 Number of nonzeros in inequality constraint Jacobian.: 3844 Number of nonzeros in Lagrangian Hessian.............: 96 Total number of variables............................: 1580 variables with only lower bounds: 1196 variables with lower and upper bounds: 344 variables with only upper bounds: 0 Total number of equality constraints.................: 992 Total number of inequality constraints...............: 1792 inequality constraints with only lower bounds: 64 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1728 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -5.4459999e+01 9.80e-01 2.62e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -7.5595616e+01 9.78e-01 2.58e+01 0.7 5.27e+02 - 1.06e-03 2.48e-03f 1 2 -8.4633117e+01 9.75e-01 2.59e+01 0.7 7.81e+02 - 3.66e-03 3.04e-03f 1 3 -1.0440072e+02 9.62e-01 2.62e+01 0.7 9.00e+02 - 8.44e-03 1.31e-02f 1 4 -1.2762835e+02 9.39e-01 2.85e+01 0.7 9.17e+02 - 1.79e-02 2.36e-02f 1 5 -1.8718559e+02 8.91e-01 2.41e+01 0.6 8.89e+02 - 5.91e-02 5.13e-02f 1 6 -4.1335318e+02 7.23e-01 3.29e+01 0.7 9.36e+02 - 1.43e-01 1.89e-01f 1 7 -7.8995329e+02 5.04e-01 2.54e+01 0.5 6.28e+02 - 3.04e-01 3.04e-01f 1 8 -1.3717040e+03 3.00e-01 4.05e+02 0.6 6.80e+02 - 9.45e-01 4.04e-01f 1 9 -2.5222712e+03 6.85e-02 6.73e+01 -0.2 3.05e+02 - 4.22e-01 7.72e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.6674710e+03 3.29e-02 1.20e+02 -0.4 2.07e+02 - 5.43e-01 7.16e-01f 1 11 -4.5945612e+03 5.08e-02 1.59e+02 -0.5 2.00e+02 - 5.96e-01 6.70e-01f 1 12 -5.2873309e+03 3.49e-02 5.12e+01 -0.9 1.87e+02 - 5.64e-01 5.52e-01f 1 13 -5.7337342e+03 2.27e-02 6.45e+02 -1.0 2.08e+02 - 7.30e-01 5.27e-01f 1 14 -6.1039866e+03 1.49e-02 2.12e+03 -1.1 1.68e+02 - 9.80e-01 6.34e-01f 1 15 -6.2328178e+03 1.07e-02 3.21e+03 -1.5 1.01e+02 - 6.14e-01 3.32e-01f 1 16 -6.4035361e+03 6.82e-03 2.87e+03 -1.8 7.54e+01 - 8.01e-01 5.09e-01f 1 17 -6.4556620e+03 5.01e-03 3.25e+03 -1.9 3.48e+01 - 4.50e-01 2.81e-01f 1 18 -6.4990423e+03 3.51e-03 5.96e+03 -2.0 3.12e+01 - 7.62e-01 3.19e-01f 1 19 -6.5791191e+03 1.65e-03 1.92e+03 -2.1 2.10e+01 - 8.65e-01 7.95e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -6.5964222e+03 9.81e-04 4.70e+03 -2.4 1.76e+01 - 5.75e-01 4.16e-01f 1 21 -6.6186162e+03 3.68e-04 1.71e+03 -2.7 2.51e+01 - 6.42e-01 6.41e-01f 1 22 -6.6282698e+03 1.75e-04 9.82e+03 -3.0 3.33e+01 - 8.49e-01 5.03e-01f 1 23 -6.6333664e+03 1.04e-04 1.39e+04 -3.4 2.28e+01 - 7.88e-01 3.94e-01f 1 24 -6.6389222e+03 3.31e-05 1.01e+04 -3.6 1.01e+01 - 8.96e-01 6.54e-01f 1 25 -6.6420292e+03 4.81e-06 4.85e+02 -4.0 2.36e+00 - 7.51e-01 8.16e-01f 1 26 -6.6426600e+03 2.22e-06 2.05e+03 -5.1 7.61e-01 - 8.51e-01 5.23e-01f 1 27 -6.6431531e+03 4.43e-07 1.84e+03 -6.0 4.04e-01 - 8.44e-01 7.94e-01f 1 28 -6.6432341e+03 1.65e-07 2.25e+04 -6.4 9.02e-02 - 9.74e-01 6.19e-01f 1 29 -6.6431734e+03 2.73e-09 9.52e-01 -4.7 6.38e-02 -4.0 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -6.6432395e+03 1.11e-09 1.59e+04 -6.8 7.29e-02 - 9.75e-01 5.93e-01f 1 31 -6.6432622e+03 8.14e-09 2.04e+04 -6.1 5.10e-01 - 1.00e+00 5.52e-01f 1 32 -6.6432782e+03 9.40e-08 1.12e+04 -7.0 4.18e-02 - 9.02e-01 7.19e-01f 1 33 -6.6432785e+03 8.62e-08 6.38e+00 -6.4 4.33e-01 - 1.00e+00 7.14e-02h 1 34 -6.6432841e+03 4.48e-08 9.63e-01 -9.1 4.47e-03 - 9.32e-01 8.73e-01f 1 35 -6.6432832e+03 2.67e-10 3.45e+06 -6.5 1.52e+00 - 3.36e-03 1.00e+00f 1 36 -6.6432834e+03 2.45e-10 2.33e+06 -6.7 9.14e+00 - 1.00e+00 3.25e-01h 1 37 -6.6432838e+03 7.80e-08 2.33e+06 -6.7 1.60e+00 - 8.54e-04 1.00e+00f 1 38 -6.6432901e+03 1.71e-04 1.52e+06 -6.7 8.26e-02 - 9.08e-05 3.47e-01f 1 39 -6.6432853e+03 1.36e-05 1.21e+05 -8.3 2.87e-02 - 8.56e-01 9.21e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -6.6432850e+03 9.66e-07 8.60e+03 -9.0 2.27e-03 - 9.86e-01 9.29e-01h 1 41 -6.6432848e+03 1.40e-08 5.86e+07 -7.5 6.16e-04 - 6.67e-04 9.86e-01h 1 42 -6.6432848e+03 2.73e-09 1.14e+07 -7.7 7.22e-03 - 1.00e+00 8.05e-01h 1 43 -6.6432848e+03 5.91e-08 1.14e+07 -7.7 5.25e-03 - 1.67e-05 1.53e-02f 5 44 -6.6432848e+03 4.51e-08 8.73e+06 -7.7 5.17e-03 - 1.00e+00 2.37e-01h 1 45 -6.6432848e+03 1.01e-08 1.95e+06 -7.7 3.94e-03 - 1.00e+00 7.77e-01f 1 46 -6.6432848e+03 8.41e-09 1.31e+06 -7.7 8.79e-04 - 1.00e+00 3.26e-01f 2 47 -6.6432848e+03 2.62e-08 6.99e-06 -7.7 5.93e-04 - 1.00e+00 1.00e+00h 1 48 -6.6432849e+03 2.36e-09 1.48e+01 -10.3 7.89e-05 - 8.36e-01 9.10e-01h 1 49 -6.6432849e+03 2.32e-10 8.88e+00 -8.7 1.50e-06 - 4.17e-01 9.52e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 -6.6432849e+03 1.71e-10 8.47e+00 -8.7 1.66e-06 - 1.00e+00 2.62e-01f 2 51 -6.6432849e+03 2.84e-14 3.45e-03 -8.7 2.66e-06 - 1.00e+00 1.00e+00h 1 52 -6.6432849e+03 2.84e-14 4.35e+00 -10.3 8.59e-06 - 7.97e-01 5.96e-01h 1 53 -6.6432849e+03 2.84e-14 6.15e-04 -9.3 7.03e-06 - 1.00e+00 1.00e+00h 1 54 -6.6432850e+03 2.84e-14 2.79e-01 -10.1 1.43e-05 - 5.77e-01 5.87e-01h 1 55 -6.6432850e+03 2.84e-14 1.12e-05 -9.7 2.64e-05 - 1.00e+00 1.00e+00h 1 56 -6.6432850e+03 2.84e-14 3.56e+00 -10.5 1.49e-05 - 4.76e-01 7.35e-01h 1 57 -6.6432850e+03 2.84e-14 2.74e-06 -10.1 3.12e-05 - 1.00e+00 1.00e+00f 1 58 -6.6432850e+03 2.84e-14 2.86e-01 -11.0 6.48e-05 - 7.25e-01 6.94e-01h 1 59 -6.6432850e+03 2.84e-14 1.07e-02 -10.6 1.65e-04 - 9.94e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 -6.6432850e+03 2.84e-14 2.83e-11 -10.6 1.22e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 60 (scaled) (unscaled) Objective...............: -1.5449499888463099e+03 -6.6432849520391328e+03 Dual infeasibility......: 2.8280489061671688e-11 1.2160610296518825e-10 Constraint violation....: 2.8421709430404007e-14 2.8421709430404007e-14 Complementarity.........: 3.3549576857291419e-11 1.4426318048635310e-10 Overall NLP error.......: 3.3549576857291419e-11 1.4426318048635310e-10 Number of objective function evaluations = 69 Number of objective gradient evaluations = 61 Number of equality constraint evaluations = 69 Number of inequality constraint evaluations = 69 Number of equality constraint Jacobian evaluations = 61 Number of inequality constraint Jacobian evaluations = 61 Number of Lagrangian Hessian evaluations = 60 Total CPU secs in IPOPT (w/o function evaluations) = 0.559 Total CPU secs in NLP function evaluations = 0.071 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -6643.285 60 0.629905 build initial OA NLP0014I 2 OPT -6496.3344 44 0.107983 OA decomposition OA0003I New best feasible of -6496.3344 found after 0.419936 sec and NLP0014I 3 OPT -6580.9054 30 0.074989 OA decomposition OA0003I New best feasible of -6580.9054 found after 0.638903 sec and NLP0014I 4 OPT -6581.9372 35 0.087986 OA decomposition OA0003I New best feasible of -6581.9372 found after 0.858869 sec and OA0008I OA converged in 0.860869 seconds found solution of value -6581.9372 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 28 branch-and-bound nodes in total Cbc0012I Integer solution of -6581.9372 found by nonlinear programm after 16 iterations and 0 nodes (0.80 seconds) Cbc0031I 7 added rows had average density of 2.7142857 Cbc0013I At root node, 7 cuts changed objective from -6643.2857 to -6643.2857 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 18 row cuts average 2.6 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -6581.937186410292, took 16 iterations and 0 nodes (0.81 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 18 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 6581.94. Best solution: 6.581937e+03 (0 nodes, 0.877 seconds) Best possible: 6.581937e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0810M04H.gms(6167) 3 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0810M04H.gms Stop 09/08/12 19:58:58 elapsed 0:00:01.695 @04 1347127138 ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- =ready= Linux opt219 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0810M04M.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job RSyn0810M04M.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0810M04M.gms(4661) 3 Mb --- Starting execution: elapsed 0:00:00.031 --- RSyn0810M04M.gms(4659) 3 Mb --- Generating MINLP model m --- RSyn0810M04M.gms(4661) 6 Mb --- 2,141 rows 821 columns 5,323 non-zeroes --- 160 nl-code 24 nl-non-zeroes --- 336 discrete-columns --- RSyn0810M04M.gms(4661) 4 Mb --- Executing BONMIN: elapsed 0:00:00.045 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 900 Number of nonzeros in inequality constraint Jacobian.: 4206 Number of nonzeros in Lagrangian Hessian.............: 24 Total number of variables............................: 820 variables with only lower bounds: 436 variables with lower and upper bounds: 344 variables with only upper bounds: 0 Total number of equality constraints.................: 328 Total number of inequality constraints...............: 1812 inequality constraints with only lower bounds: 412 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1400 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -5.4459999e+01 9.80e-01 3.75e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.1169940e+02 9.79e-01 3.74e+01 1.1 9.36e+02 - 9.21e-04 1.05e-03f 1 2 -1.7370083e+02 9.78e-01 3.76e+01 1.1 1.45e+03 - 1.96e-03 1.39e-03f 1 3 -3.1323196e+02 9.74e-01 3.71e+01 1.1 1.52e+03 - 3.47e-03 4.03e-03f 1 4 -5.3952810e+02 9.66e-01 5.23e+01 1.1 1.54e+03 - 1.26e-02 7.73e-03f 1 5 -1.2621787e+03 9.32e-01 3.51e+01 1.1 1.48e+03 - 2.51e-02 3.58e-02f 1 6 -2.3531945e+03 8.74e-01 6.11e+01 1.0 1.29e+03 - 9.30e-02 6.14e-02f 1 7 -2.8054750e+03 8.35e-01 5.77e+01 1.0 1.11e+03 - 5.54e-02 4.50e-02f 1 8 -3.5967383e+03 7.22e-01 4.97e+01 1.0 1.06e+03 - 1.27e-01 1.36e-01f 1 9 -4.7135224e+03 5.38e-01 6.44e+01 0.9 7.08e+02 - 2.97e-01 2.55e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -5.7569756e+03 4.07e-01 7.14e+02 0.9 7.13e+02 - 7.40e-01 2.43e-01f 1 11 -7.5430041e+03 2.19e-01 1.81e+02 0.7 8.49e+02 - 2.74e-01 4.61e-01f 1 12 -8.4645456e+03 1.06e-01 4.80e+01 0.6 6.51e+02 - 4.98e-01 5.19e-01f 1 13 -9.8220046e+03 4.35e-02 9.99e+01 0.1 1.14e+02 - 6.51e-01 5.89e-01f 1 14 -1.1427820e+04 1.56e-02 2.24e+01 -0.2 4.77e+01 - 6.31e-01 6.41e-01f 1 15 -1.2608187e+04 6.33e-03 8.93e+01 -0.8 3.74e+01 - 6.67e-01 5.94e-01f 1 16 -1.3344312e+04 2.42e-03 3.36e+01 -1.1 9.03e+01 - 6.17e-01 6.17e-01f 1 17 -1.3646643e+04 1.11e-03 8.57e+02 -1.2 8.41e+01 - 9.08e-01 5.43e-01f 1 18 -1.3784126e+04 6.62e-04 8.71e+02 -1.8 4.39e+01 - 6.68e-01 4.02e-01f 1 19 -1.3832198e+04 4.77e-04 2.15e+03 -1.5 1.93e+01 - 6.43e-01 2.80e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.3923773e+04 1.53e-04 9.65e+02 -1.7 1.34e+01 - 2.65e-01 6.79e-01f 1 21 -1.3959449e+04 8.46e-05 6.45e+01 -2.2 1.23e+01 - 5.68e-01 4.48e-01f 1 22 -1.3986305e+04 4.05e-05 5.83e+02 -2.3 2.43e+01 - 6.35e-01 5.21e-01f 1 23 -1.4011252e+04 8.22e-06 6.33e+02 -2.5 2.30e+01 - 8.66e-01 7.97e-01f 1 24 -1.4022584e+04 2.44e-06 8.68e+02 -3.4 4.34e+01 - 4.95e-01 7.03e-01f 1 25 -1.4024639e+04 1.61e-06 3.85e+03 -3.7 1.92e+01 - 9.22e-01 3.41e-01f 1 26 -1.4027339e+04 6.70e-07 2.13e+03 -4.5 1.49e+01 - 9.02e-01 5.84e-01f 1 27 -1.4028212e+04 3.48e-07 4.99e+03 -4.3 5.84e+00 - 1.00e+00 4.81e-01f 1 28 -1.4028557e+04 2.34e-07 5.74e+03 -4.8 2.80e+00 - 1.00e+00 3.28e-01f 1 29 -1.4029055e+04 7.57e-08 1.96e+03 -5.2 1.27e+00 - 9.16e-01 6.76e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -1.4029174e+04 1.66e-08 8.54e+03 -4.5 5.16e+00 - 1.00e+00 7.92e-01f 1 31 -1.4029252e+04 6.84e-09 8.48e+03 -6.9 1.04e-01 - 9.73e-01 5.88e-01f 1 32 -1.4029300e+04 1.92e-09 3.62e+03 -7.4 8.43e-02 - 9.59e-01 8.72e-01f 1 33 -1.4029306e+04 3.57e-10 2.96e+01 -8.8 4.42e-02 - 9.92e-01 8.44e-01f 1 34 -1.4029306e+04 2.73e-10 4.93e+05 -7.8 2.04e+01 - 8.67e-03 2.35e-01h 1 35 -1.4029307e+04 4.87e-12 5.23e+04 -9.3 4.87e-01 - 2.39e-01 9.82e-01h 1 36 -1.4029307e+04 2.60e-09 5.23e+04 -7.5 2.73e+01 - 8.31e-04 5.26e-02f 1 In iteration 36, 1 Slack too small, adjusting variable bound 37 -1.4029307e+04 4.39e-09 5.22e+04 -7.8 1.98e+00 - 1.67e-03 3.59e-03h 1 In iteration 37, 1 Slack too small, adjusting variable bound 38 -1.4029307e+04 4.58e-09 5.21e+04 -7.8 1.89e+00 - 1.55e-03 3.81e-04h 1 39 -1.4029307e+04 2.08e-08 3.11e+04 -7.8 1.86e+00 - 2.52e-01 4.09e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -1.4029307e+04 1.31e-08 1.97e+04 -7.8 1.65e+00 - 2.16e-01 3.77e-01f 1 41 -1.4029307e+04 8.90e-09 1.25e+04 -7.8 1.42e-01 - 8.17e-01 3.19e-01f 2 42 -1.4029307e+04 1.02e-09 1.63e+03 -7.8 2.50e-02 - 6.26e-01 8.84e-01h 1 43 -1.4029307e+04 7.76e-10 9.30e+02 -7.8 5.30e-04 - 1.00e+00 2.41e-01f 2 44 -1.4029307e+04 9.58e-13 9.92e-11 -7.8 3.83e-04 - 1.00e+00 1.00e+00h 1 45 -1.4029307e+04 9.67e-13 1.92e+01 -9.8 4.27e-05 - 7.75e-01 8.86e-01f 1 46 -1.4029307e+04 1.75e-09 1.87e+01 -8.6 1.76e-06 - 3.34e-02 1.38e-02f 1 In iteration 46, 1 Slack too small, adjusting variable bound 47 -1.4029307e+04 5.66e-10 6.47e+00 -8.6 1.70e-06 - 1.00e+00 6.82e-01f 1 48 -1.4029307e+04 3.03e-10 8.36e-11 -8.6 5.42e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 48 (scaled) (unscaled) Objective...............: -3.2626294979412464e+03 -1.4029306841147360e+04 Dual infeasibility......: 8.3646867210518394e-11 3.5968152900522906e-10 Constraint violation....: 3.0255498106868117e-10 3.0255498106868117e-10 Complementarity.........: 6.8229204115561635e-09 2.9338557769691504e-08 Overall NLP error.......: 6.8229204115561635e-09 2.9338557769691504e-08 Number of objective function evaluations = 51 Number of objective gradient evaluations = 49 Number of equality constraint evaluations = 51 Number of inequality constraint evaluations = 51 Number of equality constraint Jacobian evaluations = 49 Number of inequality constraint Jacobian evaluations = 49 Number of Lagrangian Hessian evaluations = 48 Total CPU secs in IPOPT (w/o function evaluations) = 0.373 Total CPU secs in NLP function evaluations = 0.039 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -14029.307 48 0.411937 build initial OA NLP0014I 2 OPT -6580.9026 45 0.078988 OA decomposition OA0003I New best feasible of -6580.9026 found after 1.651749 sec and NLP0014I 3 OPT -5998.3276 50 0.088986 OA decomposition NLP0014I 4 OPT -6574.4772 52 0.089986 OA decomposition NLP0014I 5 OPT -6581.9344 52 0.088986 OA decomposition OA0003I New best feasible of -6581.9344 found after 7.469864 sec and OA0008I OA converged in 7.470864 seconds found solution of value -6581.9344 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 7364 branch-and-bound nodes in total Cbc0012I Integer solution of -6581.9344 found by nonlinear programm after 2 iterations and 0 nodes (7.45 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -14029.307 to -14029.307 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 5 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -6581.934413729629, took 2 iterations and 0 nodes (7.45 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 5 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 6581.93. Best solution: 6.581934e+03 (0 nodes, 7.524 seconds) Best possible: 6.581934e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0810M04M.gms(4661) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0810M04M.gms Stop 09/08/12 19:59:04 elapsed 0:00:08.092 @04 1347127144 ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0810M.gms =========== ----------------------------- Sa 8. Sep 19:58:56 CEST 2012 ----------------------------- @03 1347127136 --- Job RSyn0810M.gms Start 09/08/12 19:58:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0810M.gms(723) 2 Mb --- Starting execution: elapsed 0:00:00.013 --- RSyn0810M.gms(721) 3 Mb --- Generating MINLP model m --- RSyn0810M.gms(723) 5 Mb --- 313 rows 186 columns 817 non-zeroes --- 40 nl-code 6 nl-non-zeroes --- 74 discrete-columns --- RSyn0810M.gms(723) 3 Mb --- Executing BONMIN: elapsed 0:00:00.016 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 193 Number of nonzeros in inequality constraint Jacobian.: 570 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 185 variables with only lower bounds: 109 variables with lower and upper bounds: 76 variables with only upper bounds: 0 Total number of equality constraints.................: 74 Total number of inequality constraints...............: 238 inequality constraints with only lower bounds: 93 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 145 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.2230000e+01 9.80e-01 3.57e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.6224367e+01 9.79e-01 3.56e+01 1.3 7.61e+02 - 5.71e-04 7.14e-04f 1 2 -3.5816882e+01 9.78e-01 3.57e+01 1.3 1.09e+03 - 1.27e-03 8.58e-04f 1 3 -4.8187739e+01 9.75e-01 3.53e+01 1.3 1.18e+03 - 2.30e-03 3.08e-03f 1 4 -6.1527770e+01 9.68e-01 3.59e+01 1.3 1.20e+03 - 9.65e-03 7.14e-03f 1 5 -3.5857828e+02 8.04e-01 8.22e+02 1.3 1.14e+03 - 2.29e-02 1.70e-01f 1 6 -4.7666754e+02 7.58e-01 7.99e+02 1.1 5.48e+02 - 3.45e-01 5.75e-02f 1 7 -9.5195216e+02 5.87e-01 6.47e+02 1.0 4.64e+02 - 3.15e-01 2.25e-01f 1 8 -1.2680484e+03 3.54e-01 3.34e+02 0.9 3.98e+02 - 2.67e-01 3.98e-01f 1 9 -1.7165510e+03 6.37e-02 4.01e+02 0.6 2.08e+02 - 4.73e-01 8.20e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.1362056e+03 1.82e-02 1.92e+02 -0.0 6.51e+01 - 6.59e-01 7.14e-01f 1 11 -2.4022392e+03 7.50e-03 3.86e+02 -0.2 5.61e+01 - 4.95e-01 5.88e-01f 1 12 -2.6811467e+03 7.56e-04 6.09e+02 -0.3 7.33e+01 - 8.03e-01 8.99e-01f 1 13 -2.8596658e+03 1.99e-04 5.70e+02 -1.4 3.23e+01 - 6.63e-01 7.37e-01f 1 14 -2.9093174e+03 1.00e-04 1.82e+03 -1.7 1.98e+01 - 7.20e-01 4.98e-01f 1 15 -2.9412284e+03 4.02e-03 1.97e+03 -2.1 2.35e+01 - 7.90e-01 6.37e-01f 1 16 -2.9548405e+03 3.72e-03 1.01e+03 -2.8 2.93e+01 - 6.70e-01 6.11e-01f 1 17 -2.9600682e+03 2.11e-03 8.97e+02 -3.6 1.16e+01 - 8.58e-01 5.77e-01f 1 18 -2.9617163e+03 1.11e-03 1.03e+03 -3.9 4.57e+00 - 8.38e-01 5.14e-01f 1 19 -2.9629593e+03 2.61e-04 2.03e+02 -5.3 2.17e+00 - 8.79e-01 8.07e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.9631015e+03 1.17e-04 1.72e+02 -5.4 1.18e+00 - 9.91e-01 5.54e-01f 1 21 -2.9631919e+03 1.91e-05 6.89e+01 -6.7 4.76e-01 - 9.21e-01 8.38e-01h 1 22 -2.9632092e+03 4.33e-07 4.42e+01 -10.6 1.60e-02 - 9.71e-01 9.78e-01h 1 23 -2.9632096e+03 4.50e-09 3.50e+00 -11.0 7.17e-03 - 9.90e-01 9.90e-01h 1 24 -2.9632096e+03 2.10e-10 8.53e+01 -11.0 6.59e-01 - 9.88e-01 9.53e-01h 1 In iteration 24, 1 Slack too small, adjusting variable bound 25 -2.9632096e+03 6.87e-11 3.86e+01 -10.1 7.77e+01 - 8.48e-01 6.22e-01h 1 26 -2.9632096e+03 3.55e-15 2.85e-14 -10.1 4.30e+01 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 26 (scaled) (unscaled) Objective...............: -5.9264191223491332e+02 -2.9632095611745663e+03 Dual infeasibility......: 2.8470708075607385e-14 1.4235354037803693e-13 Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-15 Complementarity.........: 1.5235170922266554e-10 7.6175854611332761e-10 Overall NLP error.......: 1.5235170922266554e-10 7.6175854611332761e-10 Number of objective function evaluations = 27 Number of objective gradient evaluations = 27 Number of equality constraint evaluations = 27 Number of inequality constraint evaluations = 27 Number of equality constraint Jacobian evaluations = 27 Number of inequality constraint Jacobian evaluations = 27 Number of Lagrangian Hessian evaluations = 26 Total CPU secs in IPOPT (w/o function evaluations) = 0.034 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2963.2096 26 0.036994 build initial OA NLP0014I 2 OPT -1708.4477 27 0.031995 OA decomposition OA0003I New best feasible of -1708.4477 found after 0.249962 sec and NLP0014I 3 OPT -1721.4477 27 0.030996 OA decomposition OA0003I New best feasible of -1721.4477 found after 0.449932 sec and OA0008I OA converged in 0.450931 seconds found solution of value -1721.4477 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 786 branch-and-bound nodes in total Cbc0012I Integer solution of -1721.4477 found by nonlinear programm after 2 iterations and 0 nodes (0.45 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -2963.2096 to -2963.2096 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1721.447712122533, took 2 iterations and 0 nodes (0.45 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 3 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1721.45. Best solution: 1.721448e+03 (0 nodes, 0.461 seconds) Best possible: 1.721448e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0810M.gms(723) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0810M.gms Stop 09/08/12 19:58:57 elapsed 0:00:00.611 @04 1347127137 ----------------------------- Sa 8. Sep 19:58:57 CEST 2012 ----------------------------- =ready= Linux opt218 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0820H.gms =========== ----------------------------- Sa 8. Sep 19:58:57 CEST 2012 ----------------------------- @03 1347127137 --- Job RSyn0820H.gms Start 09/08/12 19:58:57 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0820H.gms(1380) 2 Mb --- Starting execution: elapsed 0:00:00.014 --- RSyn0820H.gms(1378) 3 Mb --- Generating MINLP model m --- RSyn0820H.gms(1380) 5 Mb --- 605 rows 418 columns 1,457 non-zeroes --- 235 nl-code 42 nl-non-zeroes --- 52 discrete-columns --- RSyn0820H.gms(1380) 3 Mb --- Executing BONMIN: elapsed 0:00:00.018 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 719 Number of nonzeros in inequality constraint Jacobian.: 672 Number of nonzeros in Lagrangian Hessian.............: 54 Total number of variables............................: 417 variables with only lower bounds: 361 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 282 Total number of inequality constraints...............: 322 inequality constraints with only lower bounds: 33 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 289 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.3740000e+01 9.80e-01 2.58e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.0367634e+01 9.78e-01 2.53e+01 0.7 6.70e+02 - 8.47e-04 2.32e-03f 1 2 -4.3987835e+01 9.75e-01 2.52e+01 0.7 1.00e+03 - 3.34e-03 3.12e-03f 1 3 -4.7355697e+01 9.70e-01 2.62e+01 0.7 1.13e+03 - 8.81e-03 5.31e-03f 1 4 -4.3011820e+01 9.35e-01 5.26e+01 0.7 1.16e+03 - 9.11e-03 3.53e-02f 1 5 -2.2247629e+01 8.59e-01 2.31e+01 0.7 1.04e+03 - 1.12e-01 8.18e-02f 1 6 1.2826564e+01 6.79e-01 4.63e+01 0.6 8.85e+02 - 1.40e-01 2.09e-01f 1 7 4.5525728e+01 3.67e-01 3.67e+01 0.4 6.21e+02 - 4.30e-01 4.59e-01f 1 8 3.2867185e+01 1.82e-01 2.25e+02 0.4 5.35e+02 - 8.50e-01 5.03e-01f 1 9 -1.8068148e+02 1.40e-02 4.48e+01 -0.6 1.32e+02 - 5.16e-01 9.23e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.6643786e+02 6.46e-03 9.36e+01 -0.6 1.62e+02 - 5.96e-01 5.39e-01f 1 11 -7.1228048e+02 2.01e-03 2.70e+02 -0.9 2.43e+02 - 5.30e-01 6.89e-01f 1 12 -9.0233197e+02 8.90e-04 6.36e+01 -1.1 2.30e+02 - 6.03e-01 5.57e-01f 1 13 -1.0354235e+03 2.72e-04 8.37e+02 -1.2 1.57e+02 - 8.20e-01 6.94e-01f 1 14 -1.0785427e+03 1.88e-04 4.67e+03 -1.6 5.62e+01 - 7.86e-01 3.10e-01f 1 15 -1.1861848e+03 2.47e-03 1.00e+03 -2.1 3.96e+01 - 7.77e-01 7.81e-01f 1 16 -1.2039483e+03 1.34e-03 5.47e+03 -2.4 1.78e+01 - 9.21e-01 4.52e-01f 1 17 -1.2242896e+03 6.43e-04 1.40e+03 -3.0 1.32e+01 - 6.65e-01 7.08e-01f 1 18 -1.2282763e+03 3.48e-04 4.87e+03 -3.3 3.78e+00 - 9.20e-01 4.28e-01f 1 19 -1.2335606e+03 4.76e-05 1.11e+03 -3.7 1.40e+00 - 9.62e-01 8.65e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.2347113e+03 5.94e-06 7.80e+01 -7.2 3.14e-01 - 9.26e-01 9.41e-01f 1 21 -1.2347602e+03 1.81e-06 3.07e+03 -6.7 2.34e-02 - 9.94e-01 7.03e-01f 1 22 -1.2347711e+03 7.64e-07 7.22e+03 -6.1 6.65e-01 - 1.00e+00 5.76e-01h 1 23 -1.2347797e+03 4.55e-07 1.07e+03 -7.8 5.42e-03 - 8.97e-01 8.82e-01h 1 24 -1.2347808e+03 5.67e-09 1.83e+02 -10.0 7.94e-04 - 9.60e-01 9.42e-01h 1 25 -1.2347808e+03 5.79e-08 1.55e+02 -10.6 1.09e-03 - 9.92e-01 8.80e-01h 1 26 -1.2347808e+03 4.68e-08 1.41e+02 -8.6 5.21e+00 - 1.00e+00 1.80e-01h 1 27 -1.2347808e+03 1.99e-08 4.19e-02 -8.6 8.08e-01 - 1.00e+00 1.00e+00f 1 28 -1.2347808e+03 3.56e-09 3.44e+00 -11.0 1.16e-04 - 9.71e-01 8.24e-01h 1 29 -1.2347808e+03 7.11e-15 3.33e-04 -9.7 5.43e-07 -4.0 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -1.2347808e+03 7.11e-15 3.68e+00 -11.0 1.51e-03 - 9.76e-01 3.62e-01h 1 31 -1.2347808e+03 7.11e-15 3.97e-05 -10.4 8.16e-02 - 1.00e+00 1.00e+00h 1 32 -1.2347808e+03 7.11e-15 7.80e-01 -11.0 2.17e-08 -4.5 1.00e+00 7.37e-01h 1 33 -1.2347808e+03 7.11e-15 1.15e-05 -11.0 5.72e-02 - 1.00e+00 1.00e+00h 1 34 -1.2347808e+03 7.11e-15 2.38e-06 -11.0 2.16e-03 - 1.00e+00 1.00e+00h 1 35 -1.2347808e+03 7.11e-15 1.21e-07 -11.0 4.63e-04 - 1.00e+00 1.00e+00h 1 36 -1.2347808e+03 7.11e-15 2.67e-10 -11.0 1.05e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 36 (scaled) (unscaled) Objective...............: -1.7639726336137994e+02 -1.2347808435296597e+03 Dual infeasibility......: 2.6714867817911880e-10 1.8700407472538316e-09 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.0000273157236312e-11 7.0001912100654189e-11 Overall NLP error.......: 2.6714867817911880e-10 1.8700407472538316e-09 Number of objective function evaluations = 37 Number of objective gradient evaluations = 37 Number of equality constraint evaluations = 37 Number of inequality constraint evaluations = 37 Number of equality constraint Jacobian evaluations = 37 Number of inequality constraint Jacobian evaluations = 37 Number of Lagrangian Hessian evaluations = 36 Total CPU secs in IPOPT (w/o function evaluations) = 0.065 Total CPU secs in NLP function evaluations = 0.013 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1234.7808 36 0.077988 build initial OA NLP0014I 2 OPT -964.2434 54 0.097985 OA decomposition OA0003I New best feasible of -964.2434 found after 0.178973 sec and NLP0014I 3 OPT -1024.0389 115 0.164975 OA decomposition OA0003I New best feasible of -1024.0389 found after 0.429935 sec and NLP0014I 4 OPT -1150.3011 35 0.027996 OA decomposition OA0003I New best feasible of -1150.3011 found after 0.490926 sec and OA0008I OA converged in 0.490926 seconds found solution of value -1150.3011 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 55 branch-and-bound nodes in total Cbc0012I Integer solution of -1150.3011 found by nonlinear programm after 9 iterations and 0 nodes (0.48 seconds) Cbc0031I 4 added rows had average density of 2.5 Cbc0013I At root node, 4 cuts changed objective from -1234.7813 to -1234.7813 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 13 row cuts average 2.8 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1150.301073895251, took 9 iterations and 0 nodes (0.49 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 13 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1150.3. Best solution: 1.150301e+03 (0 nodes, 0.51 seconds) Best possible: 1.150301e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0820H.gms(1380) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0820H.gms Stop 09/08/12 19:58:58 elapsed 0:00:00.700 @04 1347127138 ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0820M02H.gms =========== ----------------------------- Sa 8. Sep 19:58:57 CEST 2012 ----------------------------- @03 1347127137 --- Job RSyn0820M02H.gms Start 09/08/12 19:58:57 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0820M02H.gms(3357) 3 Mb --- Starting execution: elapsed 0:00:00.024 --- RSyn0820M02H.gms(3355) 3 Mb --- Generating MINLP model m --- RSyn0820M02H.gms(3357) 6 Mb --- 1,501 rows 979 columns 3,581 non-zeroes --- 470 nl-code 84 nl-non-zeroes --- 208 discrete-columns --- RSyn0820M02H.gms(3357) 3 Mb --- Executing BONMIN: elapsed 0:00:00.035 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1582 Number of nonzeros in inequality constraint Jacobian.: 1860 Number of nonzeros in Lagrangian Hessian.............: 108 Total number of variables............................: 978 variables with only lower bounds: 722 variables with lower and upper bounds: 216 variables with only upper bounds: 0 Total number of equality constraints.................: 620 Total number of inequality constraints...............: 880 inequality constraints with only lower bounds: 66 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 814 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -2.9550000e+01 1.39e+00 2.52e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.2813578e+01 1.39e+00 2.50e+01 0.7 6.11e+02 - 1.02e-03 2.18e-03f 1 2 -3.1692656e+01 1.39e+00 2.49e+01 0.7 9.27e+02 - 3.62e-03 2.91e-03f 1 3 -2.4663730e+01 1.37e+00 2.60e+01 0.7 1.11e+03 - 6.44e-03 9.57e-03f 1 4 1.5016538e+01 1.32e+00 3.52e+01 0.7 1.15e+03 - 1.09e-02 2.62e-02f 1 5 9.2361912e+01 1.22e+00 3.31e+01 0.7 1.20e+03 - 5.71e-02 5.71e-02f 1 6 2.6599269e+02 9.56e-01 3.72e+01 0.6 1.04e+03 - 1.80e-01 1.83e-01f 1 7 4.5009751e+02 5.77e-01 3.28e+01 0.5 7.86e+02 - 3.53e-01 3.40e-01f 1 8 5.9939670e+02 2.89e-01 4.08e+02 0.5 7.39e+02 - 9.88e-01 3.95e-01f 1 9 4.4364367e+02 3.25e-02 1.52e+02 0.0 4.17e+02 - 4.13e-01 8.87e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.1392260e+01 1.05e-02 1.41e+02 -0.6 1.61e+02 - 5.59e-01 6.77e-01f 1 11 -3.1447256e+02 4.87e-03 1.14e+02 -0.5 3.45e+02 - 5.99e-01 5.37e-01f 1 12 -4.0228581e+02 4.00e-03 1.32e+03 -0.9 1.69e+02 - 6.95e-01 1.79e-01f 1 13 -5.6857466e+02 2.72e-03 1.69e+03 -1.2 2.27e+02 - 8.04e-01 3.19e-01f 1 14 -8.9083217e+02 2.72e-03 4.94e+02 -1.4 2.11e+02 - 7.88e-01 7.46e-01f 1 15 -1.0426343e+03 2.00e-03 1.94e+02 -2.1 7.02e+01 - 4.56e-01 7.41e-01f 1 16 -1.0827529e+03 1.18e-03 2.83e+02 -2.3 2.72e+01 - 6.35e-01 4.84e-01f 1 17 -1.1247455e+03 4.05e-04 6.05e+02 -2.4 2.32e+01 - 9.33e-01 7.99e-01f 1 18 -1.1383579e+03 1.84e-04 4.09e+02 -3.1 1.19e+01 - 6.82e-01 6.35e-01f 1 19 -1.1453504e+03 6.53e-05 1.10e+02 -3.8 6.14e+00 - 6.02e-01 7.00e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.1475020e+03 1.71e-06 4.97e+01 -3.5 1.42e+00 - 8.92e-01 8.88e-01f 1 21 -1.1485092e+03 6.66e-07 2.31e+02 -4.8 6.43e-01 - 7.47e-01 7.02e-01f 1 22 -1.1489366e+03 1.34e-07 8.94e+01 -6.6 2.30e-01 - 8.75e-01 8.90e-01f 1 23 -1.1489319e+03 1.42e-14 1.35e-01 -4.8 2.97e-01 - 1.00e+00 1.00e+00h 1 24 -1.1489832e+03 7.11e-15 1.17e+04 -8.5 2.30e-02 - 9.90e-01 8.82e-01f 1 25 -1.1489882e+03 7.49e-08 6.01e-01 -6.3 2.17e-01 - 1.00e+00 1.00e+00f 1 26 -1.1489895e+03 2.48e-08 1.90e+03 -8.2 2.11e-03 - 5.62e-01 7.55e-01h 1 27 -1.1489898e+03 6.94e-09 3.33e+02 -8.6 1.85e-03 - 8.37e-01 8.24e-01h 1 28 -1.1489899e+03 3.08e-09 1.35e+02 -9.2 2.59e-03 - 9.63e-01 5.74e-01h 1 29 -1.1489899e+03 9.81e-10 4.04e+01 -9.0 6.60e-02 - 1.00e+00 7.05e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -1.1489899e+03 1.61e-09 4.82e-03 -8.8 1.90e-01 - 1.00e+00 1.00e+00h 1 31 -1.1489899e+03 4.50e-10 9.72e-01 -10.4 1.89e-03 - 7.58e-01 7.01e-01h 1 32 -1.1489899e+03 8.09e-10 3.56e-04 -9.4 7.64e-02 - 1.00e+00 1.00e+00h 1 33 -1.1489899e+03 1.97e-10 6.26e-01 -11.0 2.78e-04 - 1.00e+00 7.57e-01h 1 34 -1.1489899e+03 4.22e-10 3.97e+00 -10.3 5.26e-02 - 2.40e-01 3.83e-01h 1 35 -1.1489899e+03 4.83e-10 9.64e+00 -10.3 2.33e-02 - 2.04e-01 5.26e-01f 1 36 -1.1489899e+03 1.65e-09 1.16e+00 -10.3 5.78e-03 - 8.33e-01 1.00e+00f 1 37 -1.1489899e+03 1.94e-09 7.60e-07 -10.3 3.01e-03 - 1.00e+00 1.00e+00h 1 38 -1.1489899e+03 1.52e-09 1.02e+00 -11.0 6.53e-05 - 8.06e-01 4.86e-01h 1 39 -1.1489899e+03 1.49e-09 2.18e+00 -10.8 2.19e-04 - 1.00e+00 1.50e-02h 7 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -1.1489899e+03 2.20e-09 1.16e-05 -10.8 2.11e-04 - 1.00e+00 1.00e+00H 1 41 -1.1489899e+03 7.89e-09 4.59e-06 -11.0 1.23e-04 - 1.00e+00 1.00e+00h 1 42 -1.1489899e+03 1.38e-11 5.52e-08 -11.0 2.09e-04 - 1.00e+00 1.00e+00h 1 43 -1.1489899e+03 2.25e-12 6.63e-09 -11.0 7.75e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 43 (scaled) (unscaled) Objective...............: -2.8370121596229257e+02 -1.1489899246472849e+03 Dual infeasibility......: 6.6293414160978337e-09 2.6848832735196226e-08 Constraint violation....: 2.2546409184087679e-12 2.2546409184087679e-12 Complementarity.........: 1.3466597070681906e-11 5.4539718136261726e-11 Overall NLP error.......: 6.6293414160978337e-09 2.6848832735196226e-08 Number of objective function evaluations = 52 Number of objective gradient evaluations = 44 Number of equality constraint evaluations = 52 Number of inequality constraint evaluations = 52 Number of equality constraint Jacobian evaluations = 44 Number of inequality constraint Jacobian evaluations = 44 Number of Lagrangian Hessian evaluations = 43 Total CPU secs in IPOPT (w/o function evaluations) = 0.231 Total CPU secs in NLP function evaluations = 0.026 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1148.9899 43 0.256961 build initial OA NLP0014I 2 OPT -1084.8029 79 0.268959 OA decomposition OA0003I New best feasible of -1084.8029 found after 0.467929 sec and NLP0014I 3 OPT -1089.2829 97 0.304954 OA decomposition OA0003I New best feasible of -1089.2829 found after 0.906863 sec and NLP0014I 4 OPT -1092.0916 99 0.149977 OA decomposition OA0003I New best feasible of -1092.0916 found after 1.131828 sec and OA0008I OA converged in 1.132828 seconds found solution of value -1092.0916 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 57 branch-and-bound nodes in total Cbc0012I Integer solution of -1092.0916 found by nonlinear programm after 13 iterations and 0 nodes (1.10 seconds) Cbc0031I 10 added rows had average density of 2.3 Cbc0013I At root node, 10 cuts changed objective from -1148.9904 to -1148.9903 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 15 row cuts average 2.3 elements, 0 column cuts (10 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1092.091588897599, took 13 iterations and 0 nodes (1.11 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 15 cuts of which 10 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1092.09. Best solution: 1.092092e+03 (0 nodes, 1.153 seconds) Best possible: 1.092092e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0820M02H.gms(3357) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0820M02H.gms Stop 09/08/12 19:58:59 elapsed 0:00:01.548 @04 1347127139 ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- =ready= Linux opt212 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0820M02M.gms =========== ----------------------------- Sa 8. Sep 19:58:57 CEST 2012 ----------------------------- @03 1347127137 --- Job RSyn0820M02M.gms Start 09/08/12 19:58:57 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0820M02M.gms(2372) 2 Mb --- Starting execution: elapsed 0:00:00.020 --- RSyn0820M02M.gms(2370) 3 Mb --- Generating MINLP model m --- RSyn0820M02M.gms(2372) 6 Mb --- 1,075 rows 511 columns 2,703 non-zeroes --- 190 nl-code 28 nl-non-zeroes --- 208 discrete-columns --- RSyn0820M02M.gms(2372) 3 Mb --- Executing BONMIN: elapsed 0:00:00.028 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 480 Number of nonzeros in inequality constraint Jacobian.: 2084 Number of nonzeros in Lagrangian Hessian.............: 28 Total number of variables............................: 510 variables with only lower bounds: 254 variables with lower and upper bounds: 216 variables with only upper bounds: 0 Total number of equality constraints.................: 172 Total number of inequality constraints...............: 902 inequality constraints with only lower bounds: 268 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 634 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -2.9550000e+01 1.39e+00 3.59e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -6.7704234e+01 1.38e+00 3.59e+01 1.2 1.38e+03 - 7.30e-04 1.16e-03f 1 2 -9.3300375e+01 1.38e+00 3.58e+01 1.2 2.17e+03 - 1.68e-03 8.45e-04f 1 3 -1.4411176e+02 1.37e+00 3.57e+01 1.2 2.30e+03 - 2.78e-03 1.71e-03f 1 4 -2.3170185e+02 1.36e+00 8.58e+01 1.2 2.33e+03 - 6.82e-03 3.43e-03f 1 5 -4.4140044e+02 1.28e+00 3.64e+01 1.2 2.26e+03 - 1.28e-02 1.53e-02f 1 6 -9.8882713e+02 9.19e-01 3.73e+02 1.2 2.06e+03 - 4.07e-02 7.71e-02f 1 7 -1.5044715e+03 8.20e-01 3.24e+02 1.1 1.55e+03 - 9.78e-02 7.29e-02f 1 8 -1.6870634e+03 6.96e-01 1.85e+02 1.1 1.35e+03 - 6.87e-02 1.51e-01f 1 9 -1.5022426e+03 5.39e-01 1.32e+02 1.0 9.34e+02 - 2.39e-01 2.26e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.6259707e+03 1.95e-01 3.92e+02 1.1 1.06e+03 - 4.77e-01 6.39e-01f 1 11 -2.1133116e+03 6.66e-02 1.06e+03 0.7 3.87e+02 - 3.11e-01 6.58e-01h 1 12 -3.6032614e+03 1.22e-02 4.67e+02 -0.1 1.18e+02 - 5.80e-01 8.17e-01f 1 13 -4.6976496e+03 5.91e-03 2.81e+02 -0.1 7.56e+02 - 5.06e-01 5.15e-01f 1 14 -5.3356203e+03 3.99e-03 2.03e+03 -0.4 9.44e+02 - 6.32e-01 3.25e-01f 1 15 -6.0425208e+03 2.05e-03 2.41e+03 -0.5 8.32e+02 - 6.53e-01 4.87e-01f 1 16 -6.4500030e+03 1.09e-03 1.91e+03 -1.0 3.97e+02 - 5.95e-01 4.69e-01f 1 17 -6.6062984e+03 6.88e-04 2.43e+03 -1.3 1.54e+02 - 6.29e-01 3.67e-01f 1 18 -6.7901330e+03 2.48e-04 2.87e+02 -1.6 7.47e+01 - 4.86e-01 6.40e-01f 1 19 -6.8490954e+03 1.26e-04 1.08e+03 -1.9 1.58e+01 - 6.89e-01 4.93e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -6.9042703e+03 4.01e-05 2.44e+01 -2.4 2.33e+01 - 5.65e-01 6.81e-01f 1 21 -6.9242018e+03 1.50e-05 4.16e+02 -2.4 2.51e+01 - 5.83e-01 6.26e-01f 1 22 -6.9281156e+03 1.13e-05 4.28e+03 -2.7 1.93e+01 - 6.31e-01 2.47e-01f 1 23 -6.9333908e+03 6.56e-06 9.75e+03 -2.8 1.67e+01 - 9.69e-01 4.19e-01f 1 24 -6.9395034e+03 1.60e-06 2.38e+03 -3.1 1.12e+01 - 7.55e-01 7.56e-01f 1 25 -6.9405432e+03 1.03e-06 5.04e+03 -3.8 3.72e+00 - 7.01e-01 3.55e-01f 1 26 -6.9414484e+03 5.51e-07 6.34e+03 -3.9 4.18e+00 - 8.13e-01 4.67e-01f 1 27 -6.9420663e+03 2.54e-07 4.34e+03 -4.6 3.15e+00 - 1.00e+00 5.40e-01f 1 28 -6.9423530e+03 1.16e-07 2.01e+03 -5.1 1.22e+00 - 9.42e-01 5.42e-01f 1 29 -6.9424597e+03 5.84e-08 2.65e+02 -4.7 1.38e+00 - 8.68e-01 4.98e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -6.9425527e+03 1.67e-08 2.92e+01 -6.3 3.74e-02 - 8.90e-01 7.14e-01f 1 31 -6.9425857e+03 2.08e-09 4.99e-01 -8.0 1.18e-02 - 9.82e-01 8.79e-01h 1 32 -6.9425902e+03 2.83e-10 2.10e+05 -8.8 1.82e-03 - 2.74e-01 9.90e-01h 1 33 -6.9425901e+03 1.86e-04 2.09e+05 -4.9 9.03e+00 - 1.56e-02 6.03e-03f 1 34 -6.9425900e+03 1.89e-13 3.10e+07 -6.6 4.13e-02 - 9.07e-03 1.00e+00h 1 35 -6.9425900e+03 7.11e-15 4.21e-09 -6.6 1.00e-03 - 1.00e+00 1.00e+00h 1 36 -6.9425903e+03 2.46e-14 3.44e+00 -9.0 1.80e-04 - 1.00e+00 9.98e-01h 1 37 -6.9425903e+03 4.08e-10 1.90e+00 -10.0 1.17e-05 - 6.70e-01 6.04e-01h 1 38 -6.9425903e+03 1.66e-11 3.54e-10 -9.5 4.56e-07 -4.0 1.00e+00 1.00e+00H 1 Number of Iterations....: 38 (scaled) (unscaled) Objective...............: -1.7142198216269949e+03 -6.9425902775893292e+03 Dual infeasibility......: 3.5404178635809092e-10 1.4338692347502681e-09 Constraint violation....: 1.6576415187807921e-11 1.6576415187807921e-11 Complementarity.........: 7.1123304536454558e-10 2.8804938337264099e-09 Overall NLP error.......: 7.1123304536454558e-10 2.8804938337264099e-09 Number of objective function evaluations = 43 Number of objective gradient evaluations = 39 Number of equality constraint evaluations = 43 Number of inequality constraint evaluations = 43 Number of equality constraint Jacobian evaluations = 39 Number of inequality constraint Jacobian evaluations = 39 Number of Lagrangian Hessian evaluations = 38 Total CPU secs in IPOPT (w/o function evaluations) = 0.132 Total CPU secs in NLP function evaluations = 0.019 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -6942.5903 38 0.150977 build initial OA NLP0014I 2 OPT -1046.8307 40 0.041994 OA decomposition OA0003I New best feasible of -1046.8307 found after 1.539766 sec and NLP0014I 3 OPT -923.74228 39 0.042993 OA decomposition NLP0014I 4 OPT -1092.0911 36 0.038994 OA decomposition OA0003I New best feasible of -1092.0911 found after 4.655292 sec and OA0008I OA converged in 6.331037 seconds found solution of value -1092.0911 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 11461 branch-and-bound nodes in total Cbc0012I Integer solution of -1092.0911 found by nonlinear programm after 3 iterations and 0 nodes (6.32 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -6942.5905 to -6942.5905 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 8 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1092.091105926915, took 3 iterations and 0 nodes (6.32 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 8 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1092.09. Best solution: 1.092091e+03 (0 nodes, 6.37 seconds) Best possible: 1.092091e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0820M02M.gms(2372) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0820M02M.gms Stop 09/08/12 19:59:04 elapsed 0:00:06.642 @04 1347127144 ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- =ready= Linux opt213 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0820M03H.gms =========== ----------------------------- Sa 8. Sep 19:58:57 CEST 2012 ----------------------------- @03 1347127137 --- Job RSyn0820M03H.gms Start 09/08/12 19:58:57 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0820M03H.gms(5461) 3 Mb --- Starting execution: elapsed 0:00:00.037 --- RSyn0820M03H.gms(5459) 3 Mb --- Generating MINLP model m --- RSyn0820M03H.gms(5461) 6 Mb --- 2,449 rows 1,468 columns 5,833 non-zeroes --- 705 nl-code 126 nl-non-zeroes --- 312 discrete-columns --- RSyn0820M03H.gms(5461) 4 Mb --- Executing BONMIN: elapsed 0:00:00.053 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2373 Number of nonzeros in inequality constraint Jacobian.: 3252 Number of nonzeros in Lagrangian Hessian.............: 162 Total number of variables............................: 1467 variables with only lower bounds: 1083 variables with lower and upper bounds: 324 variables with only upper bounds: 0 Total number of equality constraints.................: 930 Total number of inequality constraints...............: 1518 inequality constraints with only lower bounds: 99 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1419 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.6970000e+01 9.80e-01 2.56e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -5.2402789e+01 9.78e-01 2.52e+01 0.6 5.45e+02 - 1.14e-03 2.21e-03f 1 2 -5.2803639e+01 9.75e-01 2.54e+01 0.6 8.15e+02 - 3.85e-03 2.93e-03f 1 3 -4.8654735e+01 9.67e-01 2.52e+01 0.6 9.67e+02 - 6.87e-03 8.40e-03f 1 4 -2.2439607e+01 9.49e-01 2.75e+01 0.6 9.76e+02 - 1.24e-02 1.80e-02f 1 5 3.5787861e+01 9.10e-01 5.27e+01 0.6 1.00e+03 - 6.50e-02 4.10e-02f 1 6 2.5374929e+02 7.33e-01 5.73e+01 0.6 9.81e+02 - 7.80e-02 1.95e-01f 1 7 3.6581781e+02 5.83e-01 9.26e+01 0.4 6.64e+02 - 3.46e-01 2.04e-01f 1 8 5.9643962e+02 3.04e-01 1.79e+02 0.5 7.36e+02 - 7.28e-01 4.79e-01f 1 9 3.8814239e+02 4.91e-02 1.41e+02 -0.0 2.77e+02 - 3.94e-01 8.38e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.1192491e+02 1.55e-02 9.26e+01 -0.7 9.41e+01 - 5.77e-01 6.83e-01f 1 11 -7.4586445e+02 9.54e-03 2.63e+02 -0.5 2.35e+02 - 5.36e-01 6.56e-01f 1 12 -1.0952646e+03 5.79e-03 1.04e+02 -0.8 2.27e+02 - 5.44e-01 4.66e-01f 1 13 -1.3282099e+03 2.68e-03 1.22e+03 -1.0 2.12e+02 - 7.33e-01 3.96e-01f 1 14 -1.5162440e+03 1.30e-03 1.57e+03 -1.3 2.17e+02 - 6.23e-01 3.71e-01f 1 15 -1.7991188e+03 1.76e-03 7.68e+02 -1.4 1.83e+02 - 8.08e-01 7.13e-01f 1 16 -1.9268246e+03 9.79e-04 5.19e+02 -2.1 8.63e+01 - 6.09e-01 5.44e-01f 1 17 -2.0008433e+03 4.65e-04 1.38e+02 -2.2 2.49e+01 - 5.36e-01 5.57e-01f 1 18 -2.0454930e+03 2.96e-04 4.48e+02 -2.4 3.43e+01 - 5.17e-01 5.95e-01f 1 19 -2.0725322e+03 3.03e-04 9.35e+02 -2.6 2.60e+01 - 7.55e-01 6.46e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.0847471e+03 2.73e-04 2.22e+03 -3.2 2.03e+01 - 7.05e-01 4.67e-01f 1 21 -2.0948234e+03 2.26e-04 1.00e+03 -3.7 1.46e+01 - 6.35e-01 6.06e-01f 1 22 -2.0990412e+03 7.68e-05 2.17e+03 -3.5 2.80e+00 - 8.33e-01 7.15e-01f 1 23 -2.1001820e+03 4.79e-05 6.10e+03 -4.3 1.34e+00 - 9.15e-01 3.71e-01f 1 24 -2.1020033e+03 1.34e-05 1.14e+03 -4.9 1.25e+00 - 9.70e-01 8.48e-01f 1 25 -2.1023647e+03 2.28e-06 2.04e+01 -8.0 3.67e-01 - 9.44e-01 9.35e-01f 1 26 -2.1023797e+03 8.79e-07 1.35e+04 -7.1 4.25e-02 - 1.00e+00 6.18e-01f 1 27 -2.1023875e+03 5.70e-08 3.89e-01 -6.5 1.04e+00 - 1.00e+00 1.00e+00h 1 28 -2.1023886e+03 2.30e-08 1.30e+03 -8.8 4.12e-03 - 9.25e-01 6.69e-01h 1 29 -2.1023891e+03 5.30e-09 1.04e+02 -9.5 9.85e-03 - 7.39e-01 8.78e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -2.1023892e+03 1.78e-09 5.00e+01 -9.7 2.27e-02 - 8.21e-01 6.70e-01h 1 31 -2.1023892e+03 1.67e-09 6.66e+01 -6.6 1.52e+02 - 4.97e-03 1.12e-02f 1 32 -2.1023892e+03 2.32e-11 1.99e-02 -8.4 1.26e+00 - 1.00e+00 1.00e+00h 1 33 -2.1023892e+03 4.63e-11 5.11e+00 -10.4 3.51e-03 - 8.33e-01 6.98e-01h 1 34 -2.1023892e+03 3.82e-11 1.14e-03 -9.2 3.46e-01 - 1.00e+00 1.00e+00h 1 35 -2.1023892e+03 2.62e-10 2.61e+00 -10.6 4.69e-04 - 7.62e-01 5.66e-01h 1 36 -2.1023892e+03 5.41e-10 2.45e-04 -9.7 1.22e-02 - 1.00e+00 1.00e+00h 1 37 -2.1023892e+03 1.50e-10 5.90e-01 -11.0 5.18e-07 -4.0 1.00e+00 7.23e-01h 1 38 -2.1023892e+03 1.12e-10 1.13e+01 -10.6 8.78e-04 - 5.03e-02 2.52e-01h 1 39 -2.1023892e+03 6.34e-11 2.58e+01 -10.6 3.46e-04 - 7.83e-02 4.34e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -2.1023892e+03 2.05e-11 1.00e+01 -10.6 2.28e-04 - 6.26e-01 6.77e-01f 1 41 -2.1023892e+03 3.92e-11 1.91e+00 -10.6 3.47e-04 - 8.93e-01 1.00e+00f 1 42 -2.1023892e+03 8.58e-13 3.59e-01 -10.6 2.15e-04 - 9.72e-01 1.00e+00h 1 43 -2.1023892e+03 7.75e-14 1.79e-09 -10.6 1.01e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 43 (scaled) (unscaled) Objective...............: -4.8892771973218407e+02 -2.1023891948483915e+03 Dual infeasibility......: 1.7864446588689020e-09 7.6817120331362777e-09 Constraint violation....: 7.7493567118835927e-14 7.7493567118835927e-14 Complementarity.........: 2.7352156496220485e-11 1.1761427293374808e-10 Overall NLP error.......: 1.7864446588689020e-09 7.6817120331362777e-09 Number of objective function evaluations = 44 Number of objective gradient evaluations = 44 Number of equality constraint evaluations = 44 Number of inequality constraint evaluations = 44 Number of equality constraint Jacobian evaluations = 44 Number of inequality constraint Jacobian evaluations = 44 Number of Lagrangian Hessian evaluations = 43 Total CPU secs in IPOPT (w/o function evaluations) = 0.314 Total CPU secs in NLP function evaluations = 0.040 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2102.3892 43 0.353946 build initial OA NLP0014I 2 OPT -1851.9388 69 0.158976 OA decomposition OA0003I New best feasible of -1851.9388 found after 0.45993 sec and NLP0014I 3 OPT -2028.8127 49 0.112983 OA decomposition OA0003I New best feasible of -2028.8127 found after 0.749886 sec and OA0008I OA converged in 0.923859 seconds found solution of value -2028.8127 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 113 branch-and-bound nodes in total Cbc0012I Integer solution of -2028.8127 found by nonlinear programm after 18 iterations and 0 nodes (0.87 seconds) Cbc0031I 13 added rows had average density of 2.3076923 Cbc0013I At root node, 13 cuts changed objective from -2102.3899 to -2102.3898 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 20 row cuts average 2.2 elements, 0 column cuts (13 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2028.812744361798, took 18 iterations and 0 nodes (0.87 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 20 cuts of which 13 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2028.81. Best solution: 2.028813e+03 (0 nodes, 0.941 seconds) Best possible: 2.028813e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0820M03H.gms(5461) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0820M03H.gms Stop 09/08/12 19:58:59 elapsed 0:00:01.456 @04 1347127139 ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0820M03M.gms =========== ----------------------------- Sa 8. Sep 19:58:57 CEST 2012 ----------------------------- @03 1347127137 --- Job RSyn0820M03M.gms Start 09/08/12 19:58:57 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0820M03M.gms(3961) 3 Mb --- Starting execution: elapsed 0:00:00.028 --- RSyn0820M03M.gms(3959) 3 Mb --- Generating MINLP model m --- RSyn0820M03M.gms(3961) 6 Mb --- 1,810 rows 766 columns 4,514 non-zeroes --- 285 nl-code 42 nl-non-zeroes --- 312 discrete-columns --- RSyn0820M03M.gms(3961) 3 Mb --- Executing BONMIN: elapsed 0:00:00.039 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 720 Number of nonzeros in inequality constraint Jacobian.: 3586 Number of nonzeros in Lagrangian Hessian.............: 42 Total number of variables............................: 765 variables with only lower bounds: 381 variables with lower and upper bounds: 324 variables with only upper bounds: 0 Total number of equality constraints.................: 258 Total number of inequality constraints...............: 1551 inequality constraints with only lower bounds: 402 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1149 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.6970000e+01 9.80e-01 3.43e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.0017957e+02 9.79e-01 3.40e+01 1.0 9.56e+02 - 1.04e-03 1.47e-03f 1 2 -1.3445852e+02 9.78e-01 3.44e+01 1.0 1.50e+03 - 2.29e-03 9.91e-04f 1 3 -2.1387631e+02 9.75e-01 3.46e+01 1.0 1.59e+03 - 3.37e-03 2.26e-03f 1 4 -3.4480439e+02 9.72e-01 1.09e+02 1.0 1.62e+03 - 9.40e-03 3.94e-03f 1 5 -7.3413554e+02 9.54e-01 5.87e+01 1.0 1.57e+03 - 1.47e-02 1.78e-02f 1 6 -1.8171268e+03 8.72e-01 3.21e+02 1.0 1.45e+03 - 4.86e-02 8.66e-02f 1 7 -2.4970117e+03 8.12e-01 2.50e+02 0.9 1.02e+03 - 1.42e-01 6.79e-02f 1 8 -2.9082464e+03 6.88e-01 1.09e+02 0.9 9.90e+02 - 7.82e-02 1.53e-01f 1 9 -3.0402053e+03 5.17e-01 8.31e+01 0.8 6.59e+02 - 2.45e-01 2.48e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.1463538e+03 3.10e-01 9.53e+02 0.9 8.52e+02 - 9.74e-01 4.00e-01f 1 11 -3.5177228e+03 1.34e-01 2.43e+02 0.7 7.86e+02 - 3.84e-01 5.67e-01f 1 12 -4.5113230e+03 4.06e-02 4.72e+02 0.4 2.00e+02 - 4.40e-01 6.98e-01h 1 13 -5.7558819e+03 1.62e-02 2.51e+02 -0.2 6.03e+01 - 5.60e-01 6.01e-01f 1 14 -6.9207858e+03 6.20e-03 1.45e+02 -0.2 8.48e+01 - 6.82e-01 6.17e-01f 1 15 -7.8011740e+03 2.59e-03 2.04e+02 -0.9 7.28e+01 - 6.51e-01 5.83e-01f 1 16 -8.3209132e+03 8.95e-04 2.81e+01 -1.1 1.04e+02 - 6.39e-01 6.54e-01f 1 17 -8.4946458e+03 4.93e-04 7.32e+02 -1.5 1.04e+02 - 6.50e-01 4.49e-01f 1 18 -8.6244015e+03 2.36e-04 1.49e+03 -1.5 9.88e+01 - 6.90e-01 5.22e-01f 1 19 -8.7178681e+03 9.28e-05 9.28e+02 -1.8 5.66e+01 - 6.53e-01 6.06e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -8.7349657e+03 7.00e-05 4.96e+03 -1.8 1.41e+01 - 5.28e-01 2.46e-01f 1 21 -8.7912174e+03 2.48e-04 1.17e+03 -2.1 2.07e+01 - 5.62e-01 7.84e-01f 1 22 -8.8081620e+03 1.62e-04 6.50e+02 -2.7 2.79e+01 - 6.05e-01 5.10e-01f 1 23 -8.8140854e+03 9.37e-05 1.12e+04 -2.8 2.91e+01 - 8.04e-01 3.10e-01f 1 24 -8.8254909e+03 1.29e-04 3.23e+03 -3.1 2.66e+01 - 7.45e-01 7.32e-01f 1 25 -8.8274305e+03 8.35e-05 9.51e+03 -3.5 9.02e+00 - 7.03e-01 3.31e-01f 1 26 -8.8291550e+03 3.05e-05 1.65e+04 -3.5 5.96e+00 - 8.20e-01 4.93e-01f 1 27 -8.8306994e+03 1.43e-05 7.61e+03 -4.1 4.13e+00 - 7.21e-01 6.24e-01f 1 28 -8.8312092e+03 7.51e-06 5.36e+03 -4.7 1.73e+00 - 8.31e-01 4.70e-01f 1 29 -8.8314322e+03 4.36e-06 2.99e+03 -5.0 6.12e-01 - 1.00e+00 3.88e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -8.8315622e+03 2.35e-06 5.05e-01 -5.0 6.96e-01 - 1.00e+00 3.76e-01f 1 31 -8.8317336e+03 7.31e-07 5.94e+03 -6.1 1.07e-01 - 9.59e-01 7.31e-01f 1 32 -8.8317947e+03 6.15e-08 1.80e+03 -8.4 2.78e-02 - 9.73e-01 9.46e-01h 1 33 -8.8317982e+03 7.27e-10 3.19e+01 -10.3 1.57e-03 - 9.90e-01 9.89e-01h 1 34 -8.8317982e+03 3.67e-10 3.34e+02 -11.0 1.02e-02 - 9.85e-01 9.20e-01h 1 35 -8.8317982e+03 1.84e-10 3.26e+02 -9.2 1.48e+01 - 7.85e-01 1.80e-01h 1 36 -8.8317982e+03 3.77e-09 1.69e-09 -9.2 2.87e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 36 (scaled) (unscaled) Objective...............: -2.0539065603218482e+03 -8.8317982093839473e+03 Dual infeasibility......: 1.6895809856904291e-09 7.2651982384688445e-09 Constraint violation....: 3.7685576881330007e-09 3.7685576881330007e-09 Complementarity.........: 2.0029889896737432e-09 8.6128526555970954e-09 Overall NLP error.......: 3.7685576881330007e-09 8.6128526555970954e-09 Number of objective function evaluations = 37 Number of objective gradient evaluations = 37 Number of equality constraint evaluations = 37 Number of inequality constraint evaluations = 37 Number of equality constraint Jacobian evaluations = 37 Number of inequality constraint Jacobian evaluations = 37 Number of Lagrangian Hessian evaluations = 36 Total CPU secs in IPOPT (w/o function evaluations) = 0.179 Total CPU secs in NLP function evaluations = 0.039 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -8831.7982 36 0.217967 build initial OA NLP0014I 2 OPT -1956.9479 32 0.051992 OA decomposition OA0003I New best feasible of -1956.9479 found after 3.632447 sec and NLP0014I 3 OPT -1778.2033 39 0.063991 OA decomposition NLP0014I 4 OPT -2028.8119 29 0.046993 OA decomposition OA0003I New best feasible of -2028.8119 found after 11.431262 sec and OA0008I OA converged in 18.296218 seconds found solution of value -2028.8119 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 16379 branch-and-bound nodes in total Cbc0012I Integer solution of -2028.8119 found by nonlinear programm after 7 iterations and 0 nodes (18.28 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from -8831.7986 to -8831.7986 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 18 row cuts average 3.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2028.81194561126, took 7 iterations and 0 nodes (18.28 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 18 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2028.81. Best solution: 2.028812e+03 (0 nodes, 18.38 seconds) Best possible: 2.028812e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0820M03M.gms(3961) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0820M03M.gms Stop 09/08/12 19:59:16 elapsed 0:00:18.741 @04 1347127156 ----------------------------- Sa 8. Sep 19:59:16 CEST 2012 ----------------------------- =ready= Linux opt228 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0820M04H.gms =========== ----------------------------- Sa 8. Sep 19:58:57 CEST 2012 ----------------------------- @03 1347127137 --- Job RSyn0820M04H.gms Start 09/08/12 19:58:57 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0820M04H.gms(7835) 3 Mb --- Starting execution: elapsed 0:00:00.054 --- RSyn0820M04H.gms(7833) 4 Mb --- Generating MINLP model m --- RSyn0820M04H.gms(7835) 7 Mb --- 3,529 rows 1,957 columns 8,393 non-zeroes --- 940 nl-code 168 nl-non-zeroes --- 416 discrete-columns --- RSyn0820M04H.gms(7835) 4 Mb --- Executing BONMIN: elapsed 0:00:00.076 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 3164 Number of nonzeros in inequality constraint Jacobian.: 4952 Number of nonzeros in Lagrangian Hessian.............: 216 Total number of variables............................: 1956 variables with only lower bounds: 1444 variables with lower and upper bounds: 432 variables with only upper bounds: 0 Total number of equality constraints.................: 1240 Total number of inequality constraints...............: 2288 inequality constraints with only lower bounds: 132 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2156 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -6.5389999e+01 1.39e+00 2.55e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -7.2998385e+01 1.39e+00 2.52e+01 0.6 5.04e+02 - 1.21e-03 2.25e-03f 1 2 -7.4999111e+01 1.39e+00 2.54e+01 0.6 7.51e+02 - 4.06e-03 3.00e-03f 1 3 -7.3087189e+01 1.38e+00 2.50e+01 0.6 8.96e+02 - 6.83e-03 7.63e-03f 1 4 -5.2341678e+01 1.35e+00 2.64e+01 0.6 9.25e+02 - 1.02e-02 1.46e-02f 1 5 8.4997402e-01 1.30e+00 7.02e+01 0.6 9.68e+02 - 5.67e-02 3.28e-02f 1 6 2.7804945e+02 1.00e+00 1.56e+02 0.6 9.42e+02 - 6.40e-02 2.14e-01f 1 7 3.7761113e+02 8.47e-01 1.61e+02 0.4 6.60e+02 - 3.42e-01 1.46e-01f 1 8 6.5818311e+02 3.00e-01 8.41e+01 0.4 6.70e+02 - 6.29e-01 5.84e-01f 1 9 3.7736931e+02 6.86e-02 1.12e+02 -0.0 2.69e+02 - 4.23e-01 7.34e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.7018629e+02 1.38e-02 1.34e+02 -0.6 1.40e+02 - 5.36e-01 7.99e-01h 1 11 -8.2020934e+02 7.97e-03 1.10e+01 -0.6 2.20e+02 - 4.61e-01 4.23e-01f 1 12 -1.1022290e+03 5.29e-03 5.67e+02 -0.7 2.80e+02 - 5.42e-01 3.35e-01f 1 13 -1.3823816e+03 3.19e-03 9.93e+02 -0.8 2.67e+02 - 6.20e-01 3.97e-01f 1 14 -1.8407940e+03 1.09e-03 2.08e+02 -1.3 2.26e+02 - 5.76e-01 6.59e-01f 1 15 -2.1460501e+03 8.72e-04 1.18e+02 -1.6 1.54e+02 - 6.42e-01 7.14e-01f 1 16 -2.2938973e+03 5.31e-04 2.34e+02 -1.9 9.12e+01 - 5.62e-01 6.07e-01f 1 17 -2.3870939e+03 3.42e-04 2.79e+01 -2.2 3.28e+01 - 6.53e-01 6.29e-01f 1 18 -2.4321910e+03 2.35e-04 1.21e+03 -2.4 1.88e+01 - 4.13e-01 5.58e-01f 1 19 -2.4613223e+03 1.76e-04 2.76e+03 -2.5 1.87e+01 - 4.87e-01 6.34e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.4777114e+03 1.11e-04 5.67e+03 -2.6 2.17e+01 - 4.51e-01 6.01e-01f 1 21 -2.4899607e+03 8.90e-05 1.11e+03 -3.2 3.44e+01 - 5.83e-01 5.00e-01f 1 22 -2.5002399e+03 5.14e-05 6.03e+02 -3.5 2.94e+01 - 6.11e-01 6.20e-01f 1 23 -2.5044330e+03 1.64e-05 6.90e+03 -3.6 6.95e+00 - 7.65e-01 6.12e-01f 1 24 -2.5058298e+03 1.09e-05 1.83e+04 -4.1 3.97e+00 - 8.14e-01 3.29e-01f 1 25 -2.5083218e+03 1.49e-05 6.09e+03 -4.6 1.51e+00 - 9.74e-01 7.74e-01f 1 26 -2.5083289e+03 1.12e-10 8.39e+02 -3.9 1.80e+00 - 1.00e+00 9.97e-01h 1 27 -2.5091137e+03 8.95e-07 3.26e+04 -6.9 4.33e-01 - 9.28e-01 8.39e-01f 1 28 -2.5092484e+03 2.04e-07 6.94e+03 -8.3 1.04e-01 - 9.79e-01 8.81e-01f 1 29 -2.5092519e+03 1.52e-07 2.55e+03 -6.4 3.36e+00 - 1.00e+00 2.44e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -2.5092581e+03 8.16e-08 3.30e+03 -7.1 1.01e-01 - 1.00e+00 4.58e-01f 1 31 -2.5092652e+03 4.36e-08 4.58e+02 -8.4 2.41e-02 - 9.37e-01 8.76e-01f 1 32 -2.5092660e+03 8.47e-09 9.09e+01 -9.3 2.94e-02 - 8.51e-01 8.09e-01h 1 33 -2.5092661e+03 1.01e-09 9.75e+00 -10.2 1.49e-02 - 4.26e-01 8.84e-01h 1 34 -2.5092661e+03 5.39e-10 5.48e+00 -9.5 1.28e-01 - 1.00e+00 4.60e-01h 1 35 -2.5092661e+03 1.36e-10 3.67e+00 -9.1 8.50e-01 - 5.54e-01 1.00e+00h 1 36 -2.5092661e+03 2.52e-11 1.09e-03 -9.1 6.36e-01 - 1.00e+00 1.00e+00h 1 37 -2.5092662e+03 1.52e-11 3.37e+00 -10.3 1.19e-02 - 7.55e-01 4.22e-01h 1 38 -2.5092662e+03 3.43e-10 2.95e-04 -9.6 1.72e-01 - 1.00e+00 1.00e+00h 1 39 -2.5092662e+03 2.28e-10 1.23e+00 -10.6 1.74e-03 - 6.32e-01 5.43e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -2.5092662e+03 3.50e-10 3.58e-05 -10.1 1.49e-02 - 1.00e+00 1.00e+00h 1 41 -2.5092662e+03 1.27e-10 3.68e-01 -11.0 2.86e-04 - 6.91e-01 6.37e-01h 1 42 -2.5092662e+03 8.66e-15 8.19e-06 -10.5 1.95e-03 - 1.00e+00 1.00e+00h 1 43 -2.5092662e+03 1.07e-14 1.46e+00 -11.0 1.35e-04 - 9.08e-01 3.11e-01h 1 44 -2.5092662e+03 8.88e-15 3.11e-01 -10.9 3.54e-04 - 1.00e+00 8.88e-01h 1 45 -2.5092662e+03 1.42e-14 4.30e-01 -10.9 6.63e-04 - 1.00e+00 1.25e-01f 4 46 -2.5092662e+03 1.42e-14 7.62e-08 -10.9 3.99e-04 - 1.00e+00 1.00e+00h 1 47 -2.5092662e+03 1.42e-14 4.78e-07 -11.0 4.78e-04 - 1.00e+00 1.00e+00h 1 48 -2.5092662e+03 1.07e-14 2.47e-09 -11.0 3.75e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 48 (scaled) (unscaled) Objective...............: -5.8355026858969495e+02 -2.5092661549356885e+03 Dual infeasibility......: 2.4690038902264178e-09 1.0616716727973596e-08 Constraint violation....: 1.0658141036401503e-14 1.0658141036401503e-14 Complementarity.........: 1.0252555081391711e-11 4.4085986849984356e-11 Overall NLP error.......: 2.4690038902264178e-09 1.0616716727973596e-08 Number of objective function evaluations = 56 Number of objective gradient evaluations = 49 Number of equality constraint evaluations = 56 Number of inequality constraint evaluations = 56 Number of equality constraint Jacobian evaluations = 49 Number of inequality constraint Jacobian evaluations = 49 Number of Lagrangian Hessian evaluations = 48 Total CPU secs in IPOPT (w/o function evaluations) = 0.518 Total CPU secs in NLP function evaluations = 0.071 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2509.2662 48 0.58891 build initial OA NLP0014I 2 OPT -2276.7114 76 0.234964 OA decomposition OA0003I New best feasible of -2276.7114 found after 0.680896 sec and NLP0014I 3 OPT -2431.6764 69 0.216967 OA decomposition OA0003I New best feasible of -2431.6764 found after 1.072837 sec and NLP0014I 4 OPT -2450.7732 66 0.199969 OA decomposition OA0003I New best feasible of -2450.7732 found after 1.468776 sec and NLP0014I 5 OPT -2142.5285 86 0.271959 OA decomposition OA0008I OA converged in 2.084683 seconds found solution of value -2450.7732 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 125 branch-and-bound nodes in total Cbc0012I Integer solution of -2450.7732 found by nonlinear programm after 41 iterations and 0 nodes (2.01 seconds) Cbc0031I 19 added rows had average density of 2.3684211 Cbc0013I At root node, 19 cuts changed objective from -2509.2672 to -2509.2669 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 37 row cuts average 2.3 elements, 0 column cuts (19 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2450.773220740664, took 41 iterations and 0 nodes (2.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 37 cuts of which 19 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2450.77. Best solution: 2.450773e+03 (0 nodes, 2.131 seconds) Best possible: 2.450773e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0820M04H.gms(7835) 3 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0820M04H.gms Stop 09/08/12 19:59:00 elapsed 0:00:02.921 @04 1347127140 ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- =ready= Linux opt229 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0820M04M.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0820M04M.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0820M04M.gms(5826) 3 Mb --- Starting execution: elapsed 0:00:00.041 --- RSyn0820M04M.gms(5824) 3 Mb --- Generating MINLP model m --- RSyn0820M04M.gms(5826) 6 Mb --- 2,677 rows 1,021 columns 6,631 non-zeroes --- 380 nl-code 56 nl-non-zeroes --- 416 discrete-columns --- RSyn0820M04M.gms(5826) 4 Mb --- Executing BONMIN: elapsed 0:00:00.058 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 960 Number of nonzeros in inequality constraint Jacobian.: 5394 Number of nonzeros in Lagrangian Hessian.............: 56 Total number of variables............................: 1020 variables with only lower bounds: 508 variables with lower and upper bounds: 432 variables with only upper bounds: 0 Total number of equality constraints.................: 344 Total number of inequality constraints...............: 2332 inequality constraints with only lower bounds: 536 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1796 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -6.5389999e+01 1.39e+00 3.42e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.2542190e+02 1.39e+00 3.41e+01 1.0 8.59e+02 - 1.15e-03 1.31e-03f 1 2 -1.8028179e+02 1.38e+00 3.44e+01 1.0 1.35e+03 - 2.31e-03 1.19e-03f 1 3 -2.7854311e+02 1.38e+00 3.47e+01 1.0 1.44e+03 - 3.39e-03 2.04e-03f 1 4 -4.4355733e+02 1.36e+00 1.37e+02 1.0 1.48e+03 - 9.86e-03 3.48e-03f 1 5 -9.1397362e+02 1.31e+00 9.87e+01 1.0 1.44e+03 - 1.25e-02 1.45e-02f 1 6 -2.2132003e+03 1.09e+00 2.47e+02 1.0 1.36e+03 - 4.24e-02 6.85e-02f 1 7 -3.2983141e+03 9.00e-01 1.50e+02 0.9 1.03e+03 - 1.49e-01 7.34e-02f 1 8 -3.8194171e+03 7.53e-01 1.62e+02 0.9 1.02e+03 - 4.24e-02 8.94e-02f 1 9 -4.2547329e+03 6.09e-01 2.38e+02 0.8 7.16e+02 - 1.47e-01 1.91e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.7119950e+03 3.86e-01 2.01e+02 0.8 5.96e+02 - 3.24e-01 3.66e-01f 1 11 -4.7476752e+03 2.57e-01 1.74e+02 0.8 7.16e+02 - 2.81e-01 3.35e-01f 1 12 -6.0611380e+03 8.99e-02 3.15e+02 0.5 3.12e+02 - 4.39e-01 6.50e-01h 1 13 -6.7316121e+03 5.31e-02 4.19e+02 0.4 3.61e+02 - 6.08e-01 4.09e-01h 1 14 -8.1843232e+03 2.24e-02 1.94e+02 0.1 2.74e+02 - 5.85e-01 5.78e-01f 1 15 -9.7353850e+03 8.36e-03 1.35e+02 -0.3 1.35e+02 - 5.33e-01 6.27e-01f 1 16 -1.0436359e+04 3.94e-03 6.23e+02 -0.5 1.06e+02 - 7.32e-01 5.28e-01f 1 17 -1.0981983e+04 1.75e-03 4.04e+02 -1.1 1.16e+02 - 6.18e-01 5.58e-01f 1 18 -1.1390044e+04 1.57e-03 9.39e+01 -1.4 1.35e+02 - 6.11e-01 7.03e-01f 1 19 -1.1475690e+04 1.02e-03 1.14e+03 -1.6 1.08e+02 - 5.72e-01 3.17e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.1618498e+04 6.10e-04 6.95e+02 -1.7 9.30e+01 - 4.48e-01 6.61e-01f 1 21 -1.1650819e+04 3.34e-04 1.66e+03 -1.9 2.82e+01 - 5.51e-01 3.36e-01f 1 22 -1.1723859e+04 1.22e-04 4.74e+03 -2.0 2.36e+01 - 6.42e-01 9.90e-01h 1 23 -1.1738279e+04 4.23e-05 3.82e+04 -2.6 2.01e+01 - 5.53e-01 4.23e-01f 1 24 -1.1744822e+04 2.84e-07 5.37e+05 -2.4 1.97e+01 - 1.00e+00 3.83e-01f 2 25 -1.1760754e+04 8.85e-06 7.64e+04 -3.0 4.44e+01 - 3.92e-01 6.91e-01f 1 26 -1.1766121e+04 3.75e-08 1.68e+05 -3.2 2.33e+01 - 8.21e-01 5.74e-01f 1 27 -1.1767549e+04 2.78e-08 2.85e+05 -3.5 1.41e+01 - 7.71e-01 2.58e-01f 1 28 -1.1769545e+04 1.47e-08 1.85e+05 -3.6 1.15e+01 - 7.15e-01 4.70e-01f 1 29 -1.1771274e+04 6.11e-09 5.14e+04 -4.2 7.83e+00 - 6.73e-01 5.85e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -1.1771902e+04 3.10e-09 1.02e+04 -4.4 3.21e+00 - 8.01e-01 5.04e-01f 1 31 -1.1772162e+04 2.11e-09 9.86e+05 -5.2 1.20e+00 - 9.87e-01 3.51e-01f 1 32 -1.1772170e+04 2.07e-09 8.86e+00 -4.5 2.62e+00 - 1.00e+00 2.16e-02h 1 33 -1.1772429e+04 1.71e-10 3.16e+07 -4.2 1.44e+00 - 3.04e-02 1.00e+00f 1 34 -1.1772476e+04 5.81e-11 1.09e+07 -4.4 1.06e+00 - 1.00e+00 6.60e-01h 1 35 -1.1772600e+04 1.67e-11 3.06e+06 -6.7 1.97e-01 - 8.86e-01 7.12e-01f 1 36 -1.1772636e+04 6.69e-09 1.61e+06 -5.6 8.50e-02 - 3.23e-02 8.65e-01h 1 37 -1.1772639e+04 3.90e-09 9.39e+05 -5.7 2.68e-02 - 2.12e-02 4.17e-01h 1 38 -1.1772642e+04 8.41e-07 9.85e+06 -5.9 1.72e-02 - 1.35e-03 4.48e-01f 1 39 -1.1772651e+04 8.21e-09 9.62e+04 -7.1 1.00e-02 - 1.00e+00 9.90e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -1.1772651e+04 1.45e-10 1.70e+03 -9.6 5.47e-04 - 9.71e-01 9.82e-01h 1 41 -1.1772651e+04 4.82e-10 1.41e+03 -9.0 9.74e-03 - 1.65e-01 1.00e+00h 1 42 -1.1772651e+04 1.20e-08 1.22e+03 -8.8 1.35e-02 - 5.88e-03 1.95e-01h 1 43 -1.1772651e+04 6.13e-10 1.25e+02 -8.8 1.17e-02 - 3.41e-01 9.81e-01f 1 44 -1.1772651e+04 6.08e-10 1.26e+02 -8.8 4.55e-03 - 1.75e-01 6.65e-03f 2 45 -1.1772651e+04 2.91e-11 1.55e-10 -8.8 4.73e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 45 (scaled) (unscaled) Objective...............: -2.7378258401523176e+03 -1.1772651112654967e+04 Dual infeasibility......: 1.5530830335887217e-10 6.6782570444315034e-10 Constraint violation....: 2.9070837193918091e-11 2.9070837193918091e-11 Complementarity.........: 3.3881654074648105e-09 1.4569111252098686e-08 Overall NLP error.......: 3.3881654074648105e-09 1.4569111252098686e-08 Number of objective function evaluations = 48 Number of objective gradient evaluations = 46 Number of equality constraint evaluations = 48 Number of inequality constraint evaluations = 48 Number of equality constraint Jacobian evaluations = 46 Number of inequality constraint Jacobian evaluations = 46 Number of Lagrangian Hessian evaluations = 45 Total CPU secs in IPOPT (w/o function evaluations) = 0.427 Total CPU secs in NLP function evaluations = 0.045 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -11772.651 45 0.471928 build initial OA NLP0014I 2 OPT -2395.9338 41 0.091986 OA decomposition OA0003I New best feasible of -2395.9338 found after 6.12207 sec and NLP0014I 3 OPT -2142.5297 40 0.086987 OA decomposition NLP0014I 4 OPT -2450.7722 40 0.087987 OA decomposition OA0003I New best feasible of -2450.7722 found after 18.870132 sec and OA0008I OA converged in 53.063934 seconds found solution of value -2450.7722 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 31129 branch-and-bound nodes in total Cbc0012I Integer solution of -2450.7722 found by nonlinear programm after 3 iterations and 0 nodes (53.03 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -11772.652 to -11772.652 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 8 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2450.772207275405, took 3 iterations and 0 nodes (53.04 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 8 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2450.77. Best solution: 2.450772e+03 (0 nodes, 53.251 seconds) Best possible: 2.450772e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0820M04M.gms(5826) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0820M04M.gms Stop 09/08/12 19:59:51 elapsed 0:00:53.903 @04 1347127191 ----------------------------- Sa 8. Sep 19:59:51 CEST 2012 ----------------------------- =ready= Linux opt230 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0820M.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0820M.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0820M.gms(853) 2 Mb --- Starting execution: elapsed 0:00:00.014 --- RSyn0820M.gms(851) 3 Mb --- Generating MINLP model m --- RSyn0820M.gms(853) 5 Mb --- 372 rows 216 columns 976 non-zeroes --- 95 nl-code 14 nl-non-zeroes --- 84 discrete-columns --- RSyn0820M.gms(853) 3 Mb --- Executing BONMIN: elapsed 0:00:00.018 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 208 Number of nonzeros in inequality constraint Jacobian.: 702 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 215 variables with only lower bounds: 127 variables with lower and upper bounds: 88 variables with only upper bounds: 0 Total number of equality constraints.................: 78 Total number of inequality constraints...............: 293 inequality constraints with only lower bounds: 114 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 179 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.3740000e+01 9.80e-01 3.46e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -5.9641579e+01 9.79e-01 3.43e+01 1.2 1.36e+03 - 6.77e-04 8.74e-04f 1 2 -7.0383056e+01 9.79e-01 3.49e+01 1.2 2.09e+03 - 1.44e-03 4.93e-04f 1 3 -9.3812032e+01 9.77e-01 3.47e+01 1.2 2.21e+03 - 1.88e-03 2.10e-03f 1 4 -1.0824420e+02 9.71e-01 6.04e+01 1.2 2.20e+03 - 8.06e-03 5.25e-03f 1 5 -1.9297969e+02 9.05e-01 6.53e+02 1.2 2.13e+03 - 1.57e-02 6.83e-02f 1 6 -3.4253184e+02 8.31e-01 4.18e+02 1.1 1.46e+03 - 1.70e-01 8.18e-02f 1 7 -8.3790768e+02 6.28e-01 4.13e+02 1.0 9.40e+02 - 3.00e-01 2.44e-01f 1 8 -1.4571668e+03 4.26e-01 3.63e+02 0.9 6.65e+02 - 5.41e-01 3.22e-01f 1 9 -1.7139524e+03 1.48e-01 3.92e+02 0.7 5.10e+02 - 2.61e-01 6.52e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.1671836e+03 1.72e-02 4.82e+02 0.2 1.69e+02 - 5.02e-01 8.84e-01f 1 11 -2.5976722e+03 6.03e-03 2.35e+02 -0.4 1.42e+02 - 6.21e-01 6.48e-01f 1 12 -2.8895330e+03 3.56e-03 1.37e+03 -0.2 2.99e+02 - 5.53e-01 4.10e-01f 1 13 -3.4580282e+03 9.08e-04 1.64e+02 -0.7 1.65e+02 - 6.55e-01 7.45e-01f 1 14 -3.6473603e+03 4.69e-04 9.54e+02 -1.2 1.93e+01 - 6.31e-01 4.83e-01f 1 15 -3.7529499e+03 2.50e-04 3.83e+03 -1.3 2.08e+01 - 8.19e-01 4.67e-01f 1 16 -3.8328792e+03 1.13e-04 2.61e+03 -2.0 2.49e+01 - 7.58e-01 5.49e-01f 1 17 -3.8636020e+03 5.77e-05 1.83e+03 -2.4 2.95e+01 - 6.32e-01 4.88e-01f 1 18 -3.8835994e+03 1.79e-04 1.08e+03 -3.1 2.20e+01 - 8.41e-01 6.03e-01f 1 19 -3.8892922e+03 1.01e-04 1.29e+03 -3.1 9.21e+00 - 6.68e-01 4.66e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -3.8947093e+03 3.96e-05 2.77e+02 -3.9 4.80e+00 - 7.70e-01 7.79e-01f 1 21 -3.8955796e+03 1.73e-05 3.00e+02 -4.8 9.53e-01 - 9.50e-01 5.69e-01f 1 22 -3.8960023e+03 6.11e-06 1.56e+02 -5.3 2.07e+00 - 1.00e+00 6.47e-01f 1 23 -3.8961891e+03 1.12e-06 6.11e+01 -6.4 9.30e-01 - 9.39e-01 8.20e-01f 1 24 -3.8962296e+03 2.42e-08 3.63e+00 -10.6 8.07e-03 - 9.79e-01 9.80e-01h 1 25 -3.8962304e+03 2.50e-10 9.17e+00 -11.0 9.04e-03 - 9.90e-01 9.90e-01h 1 26 -3.8962305e+03 9.68e-12 1.34e+02 -11.0 8.46e-01 - 9.90e-01 9.60e-01h 1 27 -3.8962305e+03 2.35e-12 8.94e+01 -9.9 1.24e+02 - 9.21e-01 4.92e-01h 1 28 -3.8962305e+03 3.65e-14 1.09e+01 -9.9 5.30e+01 - 9.75e-01 8.86e-01f 1 29 -3.8962305e+03 8.32e-15 2.02e-14 -9.9 2.30e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 29 (scaled) (unscaled) Objective...............: -5.5660435072660619e+02 -3.8962304550862436e+03 Dual infeasibility......: 2.0178230327229549e-14 1.4124761229060685e-13 Constraint violation....: 8.3244765288994410e-15 8.3244765288994410e-15 Complementarity.........: 1.7205934695331808e-10 1.2044154286732267e-09 Overall NLP error.......: 1.7205934695331808e-10 1.2044154286732267e-09 Number of objective function evaluations = 30 Number of objective gradient evaluations = 30 Number of equality constraint evaluations = 30 Number of inequality constraint evaluations = 30 Number of equality constraint Jacobian evaluations = 30 Number of inequality constraint Jacobian evaluations = 30 Number of Lagrangian Hessian evaluations = 29 Total CPU secs in IPOPT (w/o function evaluations) = 0.036 Total CPU secs in NLP function evaluations = 0.008 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -3896.2305 29 0.043993 build initial OA NLP0014I 2 OPT -1120.0124 35 0.044993 OA decomposition OA0003I New best feasible of -1120.0124 found after 0.175973 sec and NLP0014I 3 OPT -1150.3005 30 0.036994 OA decomposition OA0003I New best feasible of -1150.3005 found after 0.404938 sec and OA0008I OA converged in 0.567913 seconds found solution of value -1150.3005 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 791 branch-and-bound nodes in total Cbc0012I Integer solution of -1150.3005 found by nonlinear programm after 3 iterations and 0 nodes (0.57 seconds) Cbc0031I 3 added rows had average density of 3 Cbc0013I At root node, 3 cuts changed objective from -3896.2307 to -3896.2307 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 4 row cuts average 3.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1150.300530562762, took 3 iterations and 0 nodes (0.57 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 4 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1150.3. Best solution: 1.150301e+03 (0 nodes, 0.578 seconds) Best possible: 1.150301e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0820M.gms(853) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0820M.gms Stop 09/08/12 19:58:58 elapsed 0:00:00.740 @04 1347127138 ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- =ready= Linux opt231 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0840H.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0840H.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0840H.gms(1905) 2 Mb --- Starting execution: elapsed 0:00:00.021 --- RSyn0840H.gms(1903) 3 Mb --- Generating MINLP model m --- RSyn0840H.gms(1905) 5 Mb --- 838 rows 569 columns 1,994 non-zeroes --- 470 nl-code 84 nl-non-zeroes --- 72 discrete-columns --- RSyn0840H.gms(1905) 3 Mb --- Executing BONMIN: elapsed 0:00:00.027 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 944 Number of nonzeros in inequality constraint Jacobian.: 948 Number of nonzeros in Lagrangian Hessian.............: 108 Total number of variables............................: 568 variables with only lower bounds: 489 variables with lower and upper bounds: 79 variables with only upper bounds: 0 Total number of equality constraints.................: 388 Total number of inequality constraints...............: 449 inequality constraints with only lower bounds: 60 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 389 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.4450000e+01 1.39e+00 2.57e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.7007852e+01 1.39e+00 2.53e+01 0.7 5.65e+02 - 1.02e-03 2.24e-03f 1 2 -1.6734133e+01 1.39e+00 2.52e+01 0.7 8.46e+02 - 3.67e-03 3.29e-03f 1 3 -1.5126541e+01 1.38e+00 2.57e+01 0.7 9.87e+02 - 7.72e-03 5.42e-03f 1 4 -5.3033635e+00 1.34e+00 3.05e+01 0.7 1.01e+03 - 8.57e-03 2.27e-02f 1 5 1.9725695e+01 1.27e+00 5.31e+01 0.7 1.01e+03 - 2.74e-02 3.81e-02f 1 6 1.9701614e+02 8.46e-01 2.91e+02 0.6 8.88e+02 - 1.47e-01 3.04e-01f 1 7 2.6820117e+02 5.88e-01 2.00e+02 0.3 5.30e+02 - 3.89e-01 2.81e-01f 1 8 3.5725332e+02 2.24e-01 1.83e+02 0.4 5.64e+02 - 8.77e-01 5.31e-01f 1 9 2.8352169e+02 3.11e-02 1.48e+02 -0.3 2.53e+02 - 4.59e-01 8.54e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.5393309e+02 1.09e-02 1.29e+02 -0.6 2.34e+02 - 5.35e-01 6.50e-01h 1 11 2.9340632e+01 4.57e-03 1.13e+02 -0.7 2.30e+02 - 5.48e-01 5.80e-01f 1 12 -5.1501954e+01 2.76e-03 2.85e+02 -1.2 9.79e+01 - 6.56e-01 3.95e-01f 1 13 -1.9082420e+02 5.20e-02 6.15e+01 -1.2 6.73e+01 - 7.38e-01 7.95e-01f 1 14 -2.7197297e+02 5.03e-02 2.37e+02 -2.0 3.23e+01 - 5.49e-01 6.73e-01f 1 15 -3.2111013e+02 2.39e-02 2.23e+02 -2.6 2.23e+01 - 6.04e-01 7.19e-01f 1 16 -3.3407538e+02 1.13e-02 9.75e+02 -2.5 7.69e+00 - 7.16e-01 5.17e-01f 1 17 -3.4408425e+02 4.25e-03 4.61e+02 -3.0 6.50e+00 - 6.37e-01 6.16e-01f 1 18 -3.4784044e+02 2.09e-03 2.15e+03 -3.3 6.40e+00 - 8.77e-01 5.09e-01f 1 19 -3.5111584e+02 3.54e-04 2.20e+02 -3.4 5.35e+00 - 8.36e-01 8.50e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -3.5211885e+02 4.90e-05 1.35e+02 -4.0 1.72e+00 - 1.00e+00 9.90e-01f 1 21 -3.5226985e+02 1.75e-05 3.16e+03 -6.7 6.97e-01 - 9.48e-01 7.94e-01f 1 22 -3.5230718e+02 2.13e-06 8.32e+02 -8.9 1.86e-01 - 9.80e-01 9.39e-01f 1 23 -3.5230879e+02 7.53e-07 1.12e+03 -7.7 4.79e-02 - 1.00e+00 6.46e-01h 1 24 -3.5230928e+02 2.33e-07 2.98e+02 -7.4 4.14e-01 - 1.00e+00 6.85e-01h 1 25 -3.5230947e+02 2.51e-07 7.46e+01 -7.6 4.14e-02 - 1.00e+00 8.38e-01h 1 26 -3.5230948e+02 2.43e-07 1.83e+02 -7.9 1.82e-02 - 1.00e+00 3.30e-02h 1 27 -3.5230951e+02 1.59e-07 1.07e+02 -7.6 6.75e-02 - 3.16e-01 7.22e-01h 1 28 -3.5230953e+02 2.30e-08 8.98e+01 -8.6 2.21e-03 - 1.74e-01 8.55e-01h 1 29 -3.5230953e+02 7.65e-09 4.64e+01 -8.0 8.44e-03 - 1.99e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -3.5230953e+02 7.11e-15 2.08e+01 -8.0 3.50e-03 - 5.52e-01 1.00e+00h 1 31 -3.5230953e+02 7.11e-15 2.68e+00 -8.0 1.42e-03 - 8.71e-01 1.00e+00h 1 32 -3.5230953e+02 7.11e-15 1.53e-01 -8.0 3.08e-04 - 9.43e-01 1.00e+00h 1 33 -3.5230954e+02 7.11e-15 2.32e+01 -10.7 3.16e-05 - 9.81e-01 7.32e-01f 1 34 -3.5230954e+02 2.00e-14 1.14e-03 -9.0 1.06e-04 - 1.00e+00 1.00e+00h 1 35 -3.5230954e+02 1.12e-13 2.94e+00 -11.0 5.70e-06 - 9.59e-01 6.66e-01h 1 36 -3.5230954e+02 7.11e-15 3.36e-04 -9.8 3.84e-04 - 1.00e+00 1.00e+00h 1 37 -3.5230954e+02 7.11e-15 3.31e+00 -11.0 6.07e-06 - 8.89e-01 4.61e-01h 1 38 -3.5230954e+02 7.11e-15 4.79e-05 -10.4 2.60e-04 - 1.00e+00 1.00e+00h 1 39 -3.5230954e+02 7.11e-15 8.26e-01 -11.0 1.44e-04 - 7.62e-01 4.61e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -3.5230954e+02 7.11e-15 1.22e-05 -10.8 2.68e-04 - 1.00e+00 1.00e+00h 1 41 -3.5230954e+02 1.42e-14 5.07e-06 -11.0 3.19e-04 - 1.00e+00 1.00e+00h 1 42 -3.5230954e+02 7.11e-15 1.74e-07 -11.0 1.81e-04 - 1.00e+00 1.00e+00h 1 43 -3.5230954e+02 7.11e-15 2.23e-10 -11.0 4.07e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 43 (scaled) (unscaled) Objective...............: -1.0065986918740302e+02 -3.5230954215591061e+02 Dual infeasibility......: 2.2303092706010830e-10 7.8060824471037904e-10 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.0010030572310762e-11 3.5035107003087667e-11 Overall NLP error.......: 2.2303092706010830e-10 7.8060824471037904e-10 Number of objective function evaluations = 44 Number of objective gradient evaluations = 44 Number of equality constraint evaluations = 44 Number of inequality constraint evaluations = 44 Number of equality constraint Jacobian evaluations = 44 Number of inequality constraint Jacobian evaluations = 44 Number of Lagrangian Hessian evaluations = 43 Total CPU secs in IPOPT (w/o function evaluations) = 0.098 Total CPU secs in NLP function evaluations = 0.018 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -352.30954 43 0.115982 build initial OA NLP0014I 2 OPT -325.55456 50 0.114982 OA decomposition OA0003I New best feasible of -325.55456 found after 0.187971 sec and NLP0014I 3 OPT -325.13234 56 0.12998 OA decomposition OA0008I OA converged in 0.409938 seconds found solution of value -325.55456 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 12 branch-and-bound nodes in total Cbc0012I Integer solution of -325.55456 found by nonlinear programm after 16 iterations and 0 nodes (0.40 seconds) Cbc0031I 14 added rows had average density of 2.1428571 Cbc0013I At root node, 14 cuts changed objective from -352.30981 to -352.30976 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 23 row cuts average 2.3 elements, 0 column cuts (14 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -325.5545624424134, took 16 iterations and 0 nodes (0.40 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 23 cuts of which 14 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 325.555. Best solution: 3.255546e+02 (0 nodes, 0.425 seconds) Best possible: 3.255546e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0840H.gms(1905) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0840H.gms Stop 09/08/12 19:58:58 elapsed 0:00:00.673 @04 1347127138 ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- =ready= Linux opt232 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0840M02H.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0840M02H.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0840M02H.gms(4738) 3 Mb --- Starting execution: elapsed 0:00:00.036 --- RSyn0840M02H.gms(4736) 3 Mb --- Generating MINLP model m --- RSyn0840M02H.gms(4738) 6 Mb --- 2,107 rows 1,361 columns 4,947 non-zeroes --- 940 nl-code 168 nl-non-zeroes --- 288 discrete-columns --- RSyn0840M02H.gms(4738) 4 Mb --- Executing BONMIN: elapsed 0:00:00.050 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2112 Number of nonzeros in inequality constraint Jacobian.: 2632 Number of nonzeros in Lagrangian Hessian.............: 216 Total number of variables............................: 1360 variables with only lower bounds: 978 variables with lower and upper bounds: 302 variables with only upper bounds: 0 Total number of equality constraints.................: 872 Total number of inequality constraints...............: 1234 inequality constraints with only lower bounds: 120 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1114 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -5.8219999e+01 1.39e+00 2.56e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -6.8139062e+01 1.39e+00 2.56e+01 0.5 4.32e+02 - 1.42e-03 3.76e-03f 1 2 -6.8112150e+01 1.39e+00 2.52e+01 0.5 6.80e+02 - 5.35e-03 4.34e-03f 1 3 -6.5012616e+01 1.38e+00 2.55e+01 0.5 8.25e+02 - 1.01e-02 6.61e-03f 1 4 -1.7015763e+01 1.31e+00 9.39e+01 0.5 8.89e+02 - 1.05e-02 4.07e-02f 1 5 1.3385872e+02 1.18e+00 2.73e+02 0.5 8.89e+02 - 1.87e-02 8.69e-02f 1 6 2.1014252e+02 1.07e+00 2.33e+02 0.4 8.06e+02 - 1.52e-01 8.57e-02f 1 7 4.8835527e+02 6.80e-01 1.33e+02 0.3 7.11e+02 - 3.98e-01 3.28e-01f 1 8 8.0923809e+02 2.43e-01 5.77e+01 0.4 7.20e+02 - 5.43e-01 5.32e-01f 1 9 8.1976365e+02 7.37e-02 9.04e+01 -0.2 2.29e+02 - 4.30e-01 6.97e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.7578740e+02 1.65e-02 2.33e+02 -0.4 1.71e+02 - 3.60e-01 7.77e-01h 1 11 4.7088496e+02 7.62e-03 9.36e+01 -0.9 1.59e+02 - 5.54e-01 5.38e-01h 1 12 2.3911243e+02 4.50e-03 3.09e+02 -0.6 5.31e+02 - 5.35e-01 4.10e-01h 1 13 2.8423482e+01 2.53e-03 4.38e+02 -1.0 2.13e+02 - 5.68e-01 4.37e-01f 1 14 -1.0469590e+02 1.78e-03 8.93e+02 -1.4 1.40e+02 - 6.39e-01 2.99e-01f 1 15 -2.4331322e+02 1.96e-03 1.36e+03 -1.5 1.19e+02 - 7.52e-01 3.50e-01f 1 16 -5.5495718e+02 5.92e-02 5.77e+01 -1.9 8.69e+01 - 5.08e-01 8.06e-01f 1 17 -6.8327625e+02 2.07e-02 3.35e+02 -2.4 2.74e+01 - 5.80e-01 7.85e-01f 1 18 -7.2915755e+02 8.50e-03 1.98e+02 -2.7 2.51e+01 - 6.29e-01 6.48e-01f 1 19 -7.5608961e+02 3.78e-03 2.13e+02 -3.3 1.64e+01 - 5.84e-01 6.34e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.6637390e+02 1.76e-03 2.71e+02 -3.5 7.31e+00 - 5.36e-01 5.69e-01f 1 21 -7.7324060e+02 3.23e-04 2.50e+03 -3.5 3.40e+00 - 6.28e-01 8.40e-01f 1 22 -7.7532950e+02 1.31e-04 7.48e+02 -4.2 1.49e+00 - 6.14e-01 5.94e-01f 1 23 -7.7577197e+02 9.21e-05 1.24e+04 -4.3 2.53e-01 - 8.35e-01 2.84e-01f 1 24 -7.7695484e+02 1.69e-05 2.48e+03 -5.1 2.23e-01 - 9.67e-01 8.21e-01f 1 25 -7.7724941e+02 1.18e-06 4.73e+01 -8.0 6.81e-02 - 9.40e-01 9.31e-01f 1 26 -7.7727016e+02 3.12e-07 3.24e+00 -10.4 2.57e-02 - 9.77e-01 9.67e-01f 1 27 -7.7727038e+02 2.46e-07 7.76e+00 -8.1 9.91e-01 - 1.00e+00 3.48e-01h 1 28 -7.7727070e+02 5.71e-08 9.56e-01 -9.5 5.68e-03 -4.0 9.24e-01 8.06e-01h 1 29 -7.7727074e+02 8.25e-11 7.11e+06 -8.4 3.49e-01 - 5.13e-03 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -7.7727073e+02 9.06e-10 5.31e+06 -8.0 2.50e+00 - 1.00e+00 2.52e-01h 1 31 -7.7727070e+02 1.81e-11 7.09e-03 -8.0 3.66e-01 - 1.00e+00 1.00e+00f 1 32 -7.7727074e+02 8.29e-12 3.03e+01 -9.6 6.24e-04 - 8.79e-01 5.35e-01h 1 33 -7.7727076e+02 5.65e-11 1.43e-02 -8.7 4.01e-02 - 1.00e+00 1.00e+00h 1 34 -7.7727077e+02 9.29e-11 5.12e-01 -11.0 7.48e-05 - 8.52e-01 8.29e-01h 1 35 -7.7727077e+02 1.40e-09 5.57e-04 -9.5 1.39e-02 - 1.00e+00 1.00e+00h 1 36 -7.7727077e+02 3.44e-10 5.15e-01 -11.0 7.77e-05 - 1.00e+00 7.55e-01h 1 37 -7.7727077e+02 2.53e-10 1.08e+00 -10.4 8.56e-03 - 3.38e-01 3.90e-01h 1 38 -7.7727077e+02 2.29e-11 8.09e-05 -10.4 2.38e-03 - 1.00e+00 1.00e+00f 1 39 -7.7727077e+02 2.44e-11 6.35e-01 -11.0 2.95e-04 - 8.73e-01 5.24e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -7.7727077e+02 1.83e-11 1.85e-05 -10.8 1.07e-03 - 1.00e+00 1.00e+00h 1 41 -7.7727077e+02 1.54e-11 1.65e-02 -11.0 9.75e-05 - 1.00e+00 9.86e-01h 1 42 -7.7727077e+02 1.09e-10 3.26e+01 -11.0 4.13e-04 - 6.76e-02 1.17e-01h 1 43 -7.7727077e+02 6.96e-11 2.51e+01 -11.0 5.39e-05 - 2.29e-01 3.59e-01f 1 44 -7.7727077e+02 4.14e-11 1.22e+01 -11.0 5.57e-05 - 5.16e-01 1.00e+00f 1 45 -7.7727077e+02 1.00e-11 5.56e+00 -11.0 1.74e-04 - 5.44e-01 1.00e+00h 1 46 -7.7727077e+02 1.15e-11 5.07e-06 -11.0 1.19e-04 - 1.00e+00 1.00e+00h 1 47 -7.7727077e+02 1.28e-11 8.79e-01 -11.0 1.52e-04 - 7.22e-01 1.00e+00h 1 48 -7.7727077e+02 1.12e-11 1.08e-07 -11.0 1.32e-04 - 1.00e+00 1.00e+00H 1 49 -7.7727077e+02 1.71e-13 9.97e-08 -11.0 1.44e-04 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 -7.7727077e+02 1.67e-13 2.20e-01 -11.0 1.37e-04 - 1.00e+00 3.91e-03h 9 51 -7.7727077e+02 1.63e-13 7.91e-10 -11.0 1.36e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 51 (scaled) (unscaled) Objective...............: -1.2954512878434048e+02 -7.7727077270604286e+02 Dual infeasibility......: 7.9120507368024562e-10 4.7472304420814737e-09 Constraint violation....: 1.6342482922482304e-13 1.6342482922482304e-13 Complementarity.........: 1.0037970622926660e-11 6.0227823737559960e-11 Overall NLP error.......: 7.9120507368024562e-10 4.7472304420814737e-09 Number of objective function evaluations = 65 Number of objective gradient evaluations = 52 Number of equality constraint evaluations = 65 Number of inequality constraint evaluations = 65 Number of equality constraint Jacobian evaluations = 52 Number of inequality constraint Jacobian evaluations = 52 Number of Lagrangian Hessian evaluations = 51 Total CPU secs in IPOPT (w/o function evaluations) = 0.395 Total CPU secs in NLP function evaluations = 0.047 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -777.27077 51 0.441933 build initial OA NLP0014I 2 OPT -732.31192 54 0.241963 OA decomposition OA0003I New best feasible of -732.31192 found after 0.438933 sec and NLP0014I 3 OPT -734.29408 52 0.108984 OA decomposition OA0003I New best feasible of -734.29408 found after 0.6609 sec and NLP0014I 4 OPT -734.98372 65 0.133979 OA decomposition OA0003I New best feasible of -734.98372 found after 0.873867 sec and OA0008I OA converged in 0.951855 seconds found solution of value -734.98372 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 57 branch-and-bound nodes in total Cbc0012I Integer solution of -734.98372 found by nonlinear programm after 36 iterations and 0 nodes (0.91 seconds) Cbc0031I 25 added rows had average density of 2.2 Cbc0013I At root node, 25 cuts changed objective from -777.2718 to -777.27156 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 34 row cuts average 2.2 elements, 0 column cuts (25 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -734.9837150996821, took 36 iterations and 0 nodes (0.91 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 34 cuts of which 25 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 734.984. Best solution: 7.349837e+02 (0 nodes, 0.971 seconds) Best possible: 7.349837e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0840M02H.gms(4738) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0840M02H.gms Stop 09/08/12 19:58:59 elapsed 0:00:01.581 @04 1347127139 ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- =ready= Linux opt218 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0840M02M.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0840M02M.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0840M02M.gms(3267) 2 Mb --- Starting execution: elapsed 0:00:00.012 --- RSyn0840M02M.gms(3265) 3 Mb --- Generating MINLP model m --- RSyn0840M02M.gms(3267) 6 Mb --- 1,481 rows 721 columns 3,705 non-zeroes --- 380 nl-code 56 nl-non-zeroes --- 288 discrete-columns --- RSyn0840M02M.gms(3267) 3 Mb --- Executing BONMIN: elapsed 0:00:00.017 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 550 Number of nonzeros in inequality constraint Jacobian.: 2952 Number of nonzeros in Lagrangian Hessian.............: 56 Total number of variables............................: 720 variables with only lower bounds: 338 variables with lower and upper bounds: 302 variables with only upper bounds: 0 Total number of equality constraints.................: 194 Total number of inequality constraints...............: 1286 inequality constraints with only lower bounds: 380 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 906 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -5.8219999e+01 1.39e+00 3.38e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -9.4031672e+01 1.39e+00 3.39e+01 1.4 1.05e+04 - 4.65e-04 5.17e-04f 1 2 -1.1048092e+02 1.38e+00 3.40e+01 1.4 1.59e+04 - 9.29e-04 2.29e-04f 1 3 -1.7809693e+02 1.38e+00 3.40e+01 1.4 1.67e+04 - 1.01e-03 9.31e-04f 1 4 -3.3572642e+02 1.36e+00 1.13e+02 1.4 1.66e+04 - 4.07e-03 2.32e-03f 1 5 -1.0131307e+03 1.26e+00 1.49e+02 1.4 1.56e+04 - 7.09e-03 1.26e-02f 1 6 -1.4662128e+03 1.10e+00 5.15e+02 1.4 1.31e+04 - 4.37e-02 2.25e-02f 1 7 -1.4534299e+03 8.68e-01 6.20e+02 1.3 9.56e+03 - 1.01e-01 7.83e-02f 1 8 -1.3064133e+03 6.51e-01 3.88e+02 1.3 5.90e+03 - 2.72e-01 2.50e-01f 1 9 -1.2272284e+03 4.49e-01 5.82e+02 1.1 3.13e+03 - 2.18e-01 3.10e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.2614578e+03 1.42e-01 1.10e+03 1.0 1.99e+03 - 2.90e-01 6.83e-01h 1 11 -1.7692477e+03 1.25e-02 1.59e+03 0.6 6.57e+02 - 3.37e-01 9.12e-01h 1 12 -2.3393620e+03 4.88e-03 3.31e+02 -0.5 2.95e+01 - 7.18e-01 6.11e-01f 1 13 -3.2379533e+03 2.23e-03 5.48e+02 -0.2 1.12e+03 - 5.13e-01 5.44e-01f 1 14 -4.0603562e+03 1.38e-03 1.03e+03 -0.2 4.03e+03 - 4.30e-01 3.79e-01f 1 15 -4.9316023e+03 8.44e-04 1.18e+04 -0.4 4.99e+03 - 7.42e-01 3.89e-01f 1 16 -5.6013569e+03 5.23e-04 6.07e+03 -0.5 5.24e+03 - 3.49e-01 3.81e-01f 1 17 -5.9547123e+03 3.92e-04 1.81e+04 -0.7 3.85e+03 - 6.39e-01 2.49e-01f 1 18 -6.3428848e+03 2.58e-04 1.75e+04 -0.9 2.87e+03 - 5.39e-01 3.42e-01f 1 19 -6.5583081e+03 1.73e-04 2.24e+04 -1.1 5.55e+02 - 6.89e-01 3.29e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -6.8701207e+03 6.93e-05 6.82e+03 -1.5 2.01e+02 - 4.69e-01 6.00e-01f 1 21 -6.9683088e+03 3.90e-05 1.94e+04 -1.6 1.47e+02 - 8.76e-01 4.37e-01f 1 22 -7.0527382e+03 2.00e-05 1.27e+04 -2.1 1.39e+02 - 6.27e-01 4.87e-01f 1 23 -7.1176388e+03 8.26e-06 5.63e+03 -2.6 1.16e+02 - 6.19e-01 5.87e-01f 1 24 -7.1457527e+03 3.87e-06 6.43e+03 -2.8 7.54e+01 - 7.54e-01 5.32e-01f 1 25 -7.1596313e+03 1.54e-06 8.91e+03 -2.7 3.87e+01 - 7.34e-01 6.01e-01f 1 26 -7.1709459e+03 1.71e-05 8.50e+02 -3.5 2.77e+01 - 5.80e-01 7.53e-01f 1 27 -7.1737840e+03 7.90e-06 5.38e+03 -3.7 8.17e+00 - 5.40e-01 6.67e-01f 1 28 -7.1740248e+03 6.59e-06 1.68e+04 -4.1 3.24e+00 - 7.29e-01 1.39e-01f 1 29 -7.1748790e+03 3.95e-06 1.03e+04 -4.4 2.74e+00 - 7.32e-01 5.36e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -7.1753467e+03 1.80e-06 6.79e+03 -4.5 9.21e-01 - 9.14e-01 6.01e-01f 1 31 -7.1754636e+03 1.20e-06 3.05e-01 -5.0 6.86e-01 - 1.00e+00 3.19e-01h 1 32 -7.1756487e+03 5.41e-07 1.39e-01 -6.0 3.05e-01 - 9.09e-01 6.77e-01f 1 33 -7.1757236e+03 1.23e-07 5.52e-02 -7.4 9.99e-02 - 9.86e-01 8.28e-01h 1 34 -7.1757391e+03 5.54e-09 1.97e+06 -7.3 2.26e+00 - 1.28e-01 1.00e+00h 1 35 -7.1757378e+03 8.94e-13 1.49e+08 -6.4 3.71e+00 - 1.91e-03 1.00e+00f 1 36 -7.1757378e+03 2.26e-06 1.48e+08 -6.3 2.14e+01 - 2.18e-05 1.62e-01f 1 37 -7.1757378e+03 2.16e-06 1.41e+08 -6.3 2.15e+00 - 1.00e+00 4.69e-02f 1 38 -7.1757378e+03 1.08e-06 7.08e+07 -6.3 2.15e-01 - 1.00e+00 4.99e-01f 2 39 -7.1757377e+03 1.91e-09 8.86e+04 -6.3 1.07e-01 - 1.00e+00 9.99e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -7.1757377e+03 1.91e-09 8.89e+04 -6.3 1.34e-04 - 1.00e+00 3.80e-03f 2 41 -7.1757377e+03 1.56e-07 3.65e+04 -6.3 1.34e-04 - 1.81e-02 1.00e+00h 1 42 -7.1757377e+03 1.08e-07 2.51e+04 -6.3 1.31e-06 - 1.00e+00 3.11e-01h 2 43 -7.1757377e+03 6.65e-08 1.55e+04 -6.3 1.04e-06 - 1.00e+00 3.82e-01h 2 44 -7.1757377e+03 1.36e-09 3.08e+02 -6.3 5.97e-07 - 1.00e+00 9.80e-01h 1 45 -7.1757377e+03 1.29e-09 1.24e+03 -6.3 2.72e-07 - 1.00e+00 5.18e-02f 2 46 -7.1757377e+03 9.49e-10 5.46e-12 -6.3 2.70e-07 - 1.00e+00 1.00e+00h 1 47 -7.1757392e+03 5.01e-12 1.55e+01 -11.0 2.08e-03 - 9.98e-01 9.95e-01f 1 48 -7.1757392e+03 4.13e-11 6.95e+01 -10.0 8.82e-06 - 7.81e-01 6.52e-01h 1 49 -7.1757393e+03 6.49e-11 9.75e+00 -9.5 2.26e-06 - 9.24e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 -7.1757393e+03 1.63e-10 1.70e-10 -9.5 5.27e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 50 (scaled) (unscaled) Objective...............: -1.1959565416794687e+03 -7.1757392500768128e+03 Dual infeasibility......: 1.6991086315698567e-10 1.0194651789419140e-09 Constraint violation....: 1.6341078490356153e-10 1.6341078490356153e-10 Complementarity.........: 5.1291851985826193e-10 3.0775111191495716e-09 Overall NLP error.......: 5.1291851985826193e-10 3.0775111191495716e-09 Number of objective function evaluations = 56 Number of objective gradient evaluations = 51 Number of equality constraint evaluations = 56 Number of inequality constraint evaluations = 56 Number of equality constraint Jacobian evaluations = 51 Number of inequality constraint Jacobian evaluations = 51 Number of Lagrangian Hessian evaluations = 50 Total CPU secs in IPOPT (w/o function evaluations) = 0.105 Total CPU secs in NLP function evaluations = 0.010 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7175.7393 50 0.114983 build initial OA NLP0014I 2 OPT -721.9835 39 0.055992 OA decomposition OA0003I New best feasible of -721.9835 found after 1.018845 sec and NLP0014I 3 OPT -724.94489 33 0.044994 OA decomposition OA0003I New best feasible of -724.94489 found after 1.750734 sec and NLP0014I 4 OPT -734.65561 37 0.051992 OA decomposition OA0003I New best feasible of -734.65561 found after 2.517617 sec and NLP0014I 5 OPT -734.9835 38 0.056991 OA decomposition OA0003I New best feasible of -734.9835 found after 3.199513 sec and OA0008I OA converged in 3.200513 seconds found solution of value -734.9835 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 5126 branch-and-bound nodes in total Cbc0012I Integer solution of -734.9835 found by nonlinear programm after 3 iterations and 0 nodes (3.19 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -7175.7396 to -7175.7396 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 11 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -734.9835035778655, took 3 iterations and 0 nodes (3.19 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 11 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 734.984. Best solution: 7.349835e+02 (0 nodes, 3.232 seconds) Best possible: 7.349835e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0840M02M.gms(3267) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0840M02M.gms Stop 09/08/12 19:59:01 elapsed 0:00:03.427 @04 1347127141 ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- =ready= Linux opt224 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0840M03H.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0840M03H.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0840M03H.gms(7714) 3 Mb --- Starting execution: elapsed 0:00:00.048 --- RSyn0840M03H.gms(7712) 4 Mb --- Generating MINLP model m --- RSyn0840M03H.gms(7714) 7 Mb --- 3,448 rows 2,041 columns 8,092 non-zeroes --- 1,410 nl-code 252 nl-non-zeroes --- 432 discrete-columns --- RSyn0840M03H.gms(7714) 4 Mb --- Executing BONMIN: elapsed 0:00:00.070 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 3168 Number of nonzeros in inequality constraint Jacobian.: 4620 Number of nonzeros in Lagrangian Hessian.............: 324 Total number of variables............................: 2040 variables with only lower bounds: 1467 variables with lower and upper bounds: 453 variables with only upper bounds: 0 Total number of equality constraints.................: 1308 Total number of inequality constraints...............: 2139 inequality constraints with only lower bounds: 180 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1959 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -5.1099999e+01 9.80e-01 2.56e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -5.7106018e+01 9.77e-01 2.52e+01 0.5 3.85e+02 - 1.43e-03 2.88e-03f 1 2 -5.5991872e+01 9.74e-01 2.53e+01 0.5 5.79e+02 - 4.85e-03 3.76e-03f 1 3 -5.2471646e+01 9.69e-01 2.60e+01 0.5 6.95e+02 - 8.65e-03 4.38e-03f 1 4 -4.0018693e+01 9.54e-01 2.51e+01 0.5 7.19e+02 - 8.85e-03 1.54e-02f 1 5 -4.0557691e+00 9.20e-01 5.30e+01 0.5 7.62e+02 - 2.07e-02 3.60e-02f 1 6 6.7423733e+01 8.49e-01 1.18e+02 0.5 7.59e+02 - 3.25e-02 7.77e-02f 1 7 1.8302036e+02 6.89e-01 9.54e+01 0.5 7.23e+02 - 1.92e-01 1.88e-01f 1 8 2.4837227e+02 4.22e-01 6.73e+01 0.3 5.40e+02 - 3.65e-01 3.88e-01f 1 9 1.5058428e+02 2.19e-01 8.10e+01 0.2 4.88e+02 - 6.91e-01 4.80e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.2336558e+02 9.93e-02 1.77e+01 -0.1 5.02e+02 - 4.64e-01 5.47e-01f 1 11 -7.2544816e+02 5.10e-02 3.20e+01 -0.3 3.12e+02 - 5.44e-01 4.87e-01h 1 12 -1.4405401e+03 1.13e-02 1.35e+02 -0.6 2.03e+02 - 4.77e-01 7.79e-01h 1 13 -1.6429943e+03 7.84e-03 1.16e+02 -1.1 8.90e+01 - 5.97e-01 3.04e-01f 1 14 -1.9703621e+03 3.69e-03 2.60e+02 -1.1 8.88e+01 - 7.21e-01 5.30e-01f 1 15 -2.2670228e+03 1.84e-02 2.50e+02 -1.3 3.81e+01 - 6.97e-01 5.87e-01f 1 16 -2.4280945e+03 2.31e-02 7.29e+02 -1.5 1.46e+01 - 8.27e-01 4.96e-01f 1 17 -2.6046927e+03 3.44e-02 9.07e+01 -1.9 1.93e+01 - 6.12e-01 6.91e-01f 1 18 -2.6853608e+03 2.18e-02 2.17e+02 -2.3 2.49e+01 - 6.55e-01 5.67e-01f 1 19 -2.7499605e+03 1.29e-02 2.31e+02 -2.8 4.20e+01 - 4.70e-01 6.52e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.7676187e+03 8.72e-03 1.13e+03 -2.9 2.15e+01 - 7.85e-01 3.99e-01f 1 21 -2.7871995e+03 5.26e-03 6.91e+02 -3.3 1.76e+01 - 6.63e-01 5.75e-01f 1 22 -2.7962524e+03 2.55e-03 1.37e+03 -3.3 8.43e+00 - 8.10e-01 5.92e-01f 1 23 -2.7999659e+03 1.55e-03 2.02e+03 -3.8 4.61e+00 - 7.06e-01 4.16e-01f 1 24 -2.8034065e+03 5.62e-04 2.22e+03 -3.8 2.28e+00 - 8.80e-01 6.65e-01f 1 25 -2.8049486e+03 2.45e-04 1.93e+03 -4.3 1.24e+00 - 7.31e-01 5.78e-01f 1 26 -2.8061557e+03 6.15e-05 4.42e+02 -5.4 7.57e-01 - 8.91e-01 7.83e-01f 1 27 -2.8064149e+03 1.76e-05 7.43e+02 -6.2 1.73e-01 - 9.96e-01 7.19e-01f 1 28 -2.8065177e+03 5.63e-07 1.16e+02 -8.9 6.55e-02 - 9.82e-01 9.72e-01f 1 29 -2.8065202e+03 1.11e-07 2.12e+03 -9.6 2.12e-02 - 9.86e-01 8.64e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -2.8065203e+03 8.81e-08 2.37e+03 -8.4 9.47e-01 - 1.00e+00 2.65e-01h 1 31 -2.8065204e+03 5.44e-08 6.38e+03 -8.1 2.87e-01 - 2.74e-01 8.15e-01h 1 32 -2.8065205e+03 4.22e-08 4.97e+03 -8.5 4.21e-02 - 1.00e+00 2.20e-01h 1 33 -2.8065205e+03 1.59e-09 3.54e+01 -8.3 1.20e-01 - 1.00e+00 9.93e-01h 1 34 -2.8065205e+03 1.42e-09 1.13e+01 -9.3 5.01e-03 - 6.44e-01 5.54e-01f 1 35 -2.8065205e+03 7.11e-15 2.74e-03 -8.7 4.16e-02 - 1.00e+00 1.00e+00h 1 36 -2.8065205e+03 1.56e-10 4.13e+00 -10.4 1.22e-04 - 8.16e-01 6.45e-01h 1 37 -2.8065205e+03 1.12e-14 2.53e+00 -9.4 6.53e-03 - 8.87e-01 1.00e+00h 1 38 -2.8065205e+03 7.11e-15 2.02e-05 -9.4 5.46e-04 - 1.00e+00 1.00e+00h 1 39 -2.8065205e+03 1.67e-13 1.96e+00 -10.7 4.56e-06 - 7.08e-01 5.98e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -2.8065205e+03 1.56e-11 4.73e-05 -9.9 1.14e-05 - 1.00e+00 1.00e+00h 1 41 -2.8065205e+03 3.69e-11 8.57e-01 -11.0 2.87e-05 - 6.91e-01 6.09e-01h 1 42 -2.8065205e+03 2.31e-10 6.54e-01 -10.4 2.05e-05 - 8.56e-01 1.00e+00h 1 43 -2.8065205e+03 2.38e-12 3.98e-07 -10.4 1.85e-09 -4.0 1.00e+00 1.00e+00H 1 44 -2.8065205e+03 2.13e-11 7.92e-01 -11.0 2.04e-07 -4.5 1.00e+00 5.60e-01h 1 45 -2.8065205e+03 7.72e-12 2.10e+00 -10.9 1.80e-04 - 5.57e-01 6.37e-01h 1 46 -2.8065205e+03 2.24e-11 1.24e-05 -10.9 2.91e-04 - 1.00e+00 1.00e+00f 1 47 -2.8065205e+03 7.11e-15 1.15e-06 -11.0 2.57e-04 - 1.00e+00 1.00e+00h 1 48 -2.8065205e+03 7.11e-15 9.07e-09 -11.0 4.54e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 48 (scaled) (unscaled) Objective...............: -6.5267919680018144e+02 -2.8065205462407803e+03 Dual infeasibility......: 9.0733187629865597e-09 3.9015270680842207e-08 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.0064685376523296e-11 4.3278147119050174e-11 Overall NLP error.......: 9.0733187629865597e-09 3.9015270680842207e-08 Number of objective function evaluations = 50 Number of objective gradient evaluations = 49 Number of equality constraint evaluations = 50 Number of inequality constraint evaluations = 50 Number of equality constraint Jacobian evaluations = 49 Number of inequality constraint Jacobian evaluations = 49 Number of Lagrangian Hessian evaluations = 48 Total CPU secs in IPOPT (w/o function evaluations) = 0.475 Total CPU secs in NLP function evaluations = 0.077 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2806.5205 48 0.551916 build initial OA NLP0014I 2 OPT -2727.1737 58 0.181972 OA decomposition OA0003I New best feasible of -2727.1737 found after 0.424935 sec and NLP0014I 3 OPT -2741.9873 48 0.149977 OA decomposition OA0003I New best feasible of -2741.9873 found after 0.710892 sec and NLP0014I 4 OPT -2742.6459 47 0.144978 OA decomposition OA0003I New best feasible of -2742.6459 found after 0.992849 sec and OA0008I OA converged in 1.147826 seconds found solution of value -2742.6459 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 116 branch-and-bound nodes in total Cbc0012I Integer solution of -2742.6459 found by nonlinear programm after 45 iterations and 0 nodes (1.07 seconds) Cbc0031I 30 added rows had average density of 2.2 Cbc0013I At root node, 30 cuts changed objective from -2806.5216 to -2806.5214 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 49 row cuts average 2.3 elements, 0 column cuts (30 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2742.645885278822, took 45 iterations and 0 nodes (1.07 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 49 cuts of which 30 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2742.65. Best solution: 2.742646e+03 (0 nodes, 1.173 seconds) Best possible: 2.742646e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0840M03H.gms(7714) 3 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0840M03H.gms Stop 09/08/12 19:59:00 elapsed 0:00:01.926 @04 1347127140 ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- =ready= Linux opt226 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0840M03M.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0840M03M.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0840M03M.gms(5492) 3 Mb --- Starting execution: elapsed 0:00:00.036 --- RSyn0840M03M.gms(5490) 3 Mb --- Generating MINLP model m --- RSyn0840M03M.gms(5492) 6 Mb --- 2,509 rows 1,081 columns 6,227 non-zeroes --- 570 nl-code 84 nl-non-zeroes --- 432 discrete-columns --- RSyn0840M03M.gms(5492) 4 Mb --- Executing BONMIN: elapsed 0:00:00.052 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 825 Number of nonzeros in inequality constraint Jacobian.: 5098 Number of nonzeros in Lagrangian Hessian.............: 84 Total number of variables............................: 1080 variables with only lower bounds: 507 variables with lower and upper bounds: 453 variables with only upper bounds: 0 Total number of equality constraints.................: 291 Total number of inequality constraints...............: 2217 inequality constraints with only lower bounds: 570 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1647 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -5.1099999e+01 9.80e-01 3.43e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -8.8561162e+01 9.79e-01 3.42e+01 1.3 8.99e+03 - 4.43e-04 5.17e-04f 1 2 -1.2246533e+02 9.79e-01 3.45e+01 1.3 1.34e+04 - 8.40e-04 4.70e-04f 1 3 -1.7431722e+02 9.78e-01 3.50e+01 1.3 1.45e+04 - 1.83e-03 7.22e-04f 1 4 -2.9446327e+02 9.77e-01 1.34e+02 1.3 1.47e+04 - 3.78e-03 1.55e-03f 1 5 -7.4905143e+02 9.71e-01 3.50e+01 1.3 1.41e+04 - 3.05e-03 5.55e-03f 1 6 -1.9476694e+03 9.55e-01 3.95e+02 1.3 1.33e+04 - 2.45e-02 1.65e-02f 1 7 -2.6540547e+03 9.24e-01 8.54e+02 1.3 1.05e+04 - 5.43e-02 3.29e-02f 1 8 -2.3700662e+03 8.15e-01 1.04e+03 1.3 8.07e+03 - 1.72e-01 1.18e-01f 1 9 -2.3650238e+03 6.14e-01 4.95e+02 1.2 4.51e+03 - 2.90e-01 2.47e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.4707209e+03 2.97e-01 6.71e+02 1.1 2.93e+03 - 2.99e-01 5.15e-01f 1 11 -2.9354110e+03 1.56e-01 5.52e+02 0.7 1.04e+03 - 3.98e-01 4.76e-01h 1 12 -3.7775084e+03 2.51e-02 1.49e+03 0.7 1.51e+03 - 3.86e-01 8.39e-01h 1 13 -5.0737519e+03 7.66e-03 7.26e+02 -0.1 9.24e+02 - 6.08e-01 6.95e-01h 1 14 -6.0175442e+03 4.64e-03 4.29e+03 0.1 2.28e+03 - 6.71e-01 3.94e-01h 1 15 -6.9398534e+03 2.66e-03 7.39e+03 -0.1 1.23e+03 - 7.45e-01 4.26e-01f 1 16 -7.9048081e+03 1.43e-03 5.37e+03 -0.7 1.75e+02 - 6.40e-01 4.64e-01f 1 17 -8.7933735e+03 6.19e-04 1.88e+03 -0.9 2.49e+02 - 5.11e-01 5.66e-01f 1 18 -9.1772346e+03 3.15e-04 7.59e+03 -0.9 1.88e+02 - 8.27e-01 4.91e-01f 1 19 -9.5170965e+03 1.38e-04 5.12e+03 -1.2 2.76e+02 - 6.53e-01 5.63e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.6509323e+03 9.00e-05 8.99e+03 -1.5 2.28e+02 - 6.19e-01 3.46e-01f 1 21 -9.8269732e+03 3.17e-05 5.74e+03 -1.6 1.85e+02 - 3.57e-01 6.48e-01f 1 22 -9.8968675e+03 1.79e-05 1.10e+03 -1.9 1.26e+02 - 5.62e-01 4.37e-01f 1 23 -9.9793000e+03 1.77e-03 4.77e+02 -2.1 1.03e+02 - 7.79e-01 7.93e-01f 1 24 -9.9994049e+03 1.36e-03 1.98e+04 -2.5 7.83e+01 - 6.82e-01 4.21e-01f 1 25 -1.0019835e+04 2.40e-03 1.58e+04 -2.9 7.12e+01 - 6.95e-01 5.61e-01f 1 26 -1.0025616e+04 1.78e-03 4.69e+04 -3.1 3.90e+01 - 7.95e-01 3.22e-01f 1 27 -1.0034020e+04 1.81e-03 4.07e+04 -3.3 2.87e+01 - 9.68e-01 6.50e-01f 1 28 -1.0038250e+04 2.96e-03 1.20e+04 -4.1 1.38e+01 - 5.78e-01 6.62e-01f 1 29 -1.0039349e+04 3.36e-03 1.76e+04 -4.2 4.87e+00 - 1.00e+00 4.87e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -1.0039893e+04 1.78e-03 1.92e-01 -4.8 2.83e+00 - 1.00e+00 4.13e-01f 1 31 -1.0040320e+04 3.43e-04 1.22e-01 -4.5 1.69e+00 - 8.18e-01 6.09e-01h 1 32 -1.0040625e+04 9.71e-05 5.36e-02 -6.0 9.21e-01 - 6.73e-01 7.89e-01h 1 33 -1.0040661e+04 5.63e-05 1.73e-01 -6.2 2.49e-01 - 9.93e-01 4.40e-01h 1 34 -1.0040692e+04 1.95e-05 1.19e-01 -6.0 1.74e-01 - 1.00e+00 7.15e-01h 1 35 -1.0040704e+04 5.06e-06 1.00e-01 -6.3 8.09e-02 - 9.25e-01 8.01e-01h 1 36 -1.0040706e+04 2.15e-06 6.97e-02 -6.8 3.62e-02 - 7.38e-01 6.04e-01h 1 37 -1.0040708e+04 1.09e-06 2.36e-01 -8.2 2.51e-02 - 1.00e+00 5.35e-01h 1 38 -1.0040707e+04 1.04e-06 1.10e+05 -5.0 6.01e+00 - 7.82e-03 5.60e-03f 1 39 -1.0040708e+04 4.90e-08 1.72e+07 -6.9 4.28e-02 - 9.75e-03 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -1.0040708e+04 9.09e-14 4.07e-09 -6.8 2.72e-02 - 1.00e+00 1.00e+00h 1 41 -1.0040709e+04 6.07e-10 2.31e+02 -10.3 8.11e-03 - 9.72e-01 8.24e-01h 1 42 -1.0040709e+04 1.20e-08 8.18e+00 -9.2 4.56e-03 - 9.67e-01 9.65e-01h 1 43 -1.0040709e+04 7.32e-09 9.63e+00 -9.9 2.14e-03 - 7.11e-01 4.32e-01h 1 44 -1.0040709e+04 4.62e-09 1.10e+01 -9.4 1.32e-02 - 3.22e-01 3.94e-01h 1 45 -1.0040709e+04 7.64e-10 7.94e+00 -9.4 6.40e-03 - 7.02e-01 1.00e+00f 1 46 -1.0040709e+04 3.55e-15 2.88e-10 -9.4 8.27e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 46 (scaled) (unscaled) Objective...............: -2.3350485284059241e+03 -1.0040708672145474e+04 Dual infeasibility......: 2.8784738533845855e-10 1.2377437569553718e-09 Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-15 Complementarity.........: 9.7317028243775097e-10 4.1846322144823296e-09 Overall NLP error.......: 9.7317028243775097e-10 4.1846322144823296e-09 Number of objective function evaluations = 47 Number of objective gradient evaluations = 47 Number of equality constraint evaluations = 47 Number of inequality constraint evaluations = 47 Number of equality constraint Jacobian evaluations = 47 Number of inequality constraint Jacobian evaluations = 47 Number of Lagrangian Hessian evaluations = 46 Total CPU secs in IPOPT (w/o function evaluations) = 0.207 Total CPU secs in NLP function evaluations = 0.021 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -10040.709 46 0.227966 build initial OA NLP0014I 2 OPT -2701.8056 43 0.095986 OA decomposition OA0003I New best feasible of -2701.8056 found after 1.471777 sec and NLP0014I 3 OPT -2728.2372 39 0.084987 OA decomposition OA0003I New best feasible of -2728.2372 found after 2.538614 sec and NLP0014I 4 OPT -2737.6567 39 0.085987 OA decomposition OA0003I New best feasible of -2737.6567 found after 3.580456 sec and NLP0014I 5 OPT -2742.6457 42 0.092986 OA decomposition OA0003I New best feasible of -2742.6457 found after 4.621298 sec and NLP0014I 6 OPT -2741.9871 42 0.090986 OA decomposition OA0008I OA converged in 6.726978 seconds found solution of value -2742.6457 (lower bound 1e+50 ). OA0010I Performed 5 iterations, explored 6663 branch-and-bound nodes in total Cbc0012I Integer solution of -2742.6457 found by nonlinear programm after 11 iterations and 0 nodes (6.70 seconds) Cbc0031I 8 added rows had average density of 3 Cbc0013I At root node, 8 cuts changed objective from -10040.709 to -10040.709 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 27 row cuts average 3.0 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2742.645656656754, took 11 iterations and 0 nodes (6.70 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 27 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2742.65. Best solution: 2.742646e+03 (0 nodes, 6.772 seconds) Best possible: 2.742646e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0840M03M.gms(5492) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0840M03M.gms Stop 09/08/12 19:59:05 elapsed 0:00:07.163 @04 1347127145 ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- =ready= Linux opt215 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0840M04H.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0840M04H.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0840M04H.gms(11089) 4 Mb --- Starting execution: elapsed 0:00:00.034 --- RSyn0840M04H.gms(11087) 5 Mb --- Generating MINLP model m --- RSyn0840M04H.gms(11089) 8 Mb --- 4,981 rows 2,721 columns 11,685 non-zeroes --- 1,880 nl-code 336 nl-non-zeroes --- 576 discrete-columns --- RSyn0840M04H.gms(11089) 6 Mb --- Executing BONMIN: elapsed 0:00:00.048 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 4224 Number of nonzeros in inequality constraint Jacobian.: 7056 Number of nonzeros in Lagrangian Hessian.............: 432 Total number of variables............................: 2720 variables with only lower bounds: 1956 variables with lower and upper bounds: 604 variables with only upper bounds: 0 Total number of equality constraints.................: 1744 Total number of inequality constraints...............: 3236 inequality constraints with only lower bounds: 240 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2996 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.1676000e+02 1.39e+00 2.41e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.3563291e+02 1.39e+00 2.39e+01 0.4 3.70e+02 - 1.60e-03 3.70e-03f 1 2 -1.4118168e+02 1.39e+00 2.37e+01 0.4 5.73e+02 - 5.04e-03 3.93e-03f 1 3 -1.4281322e+02 1.38e+00 2.89e+01 0.4 7.00e+02 - 1.03e-02 4.16e-03f 1 4 -1.2842694e+02 1.35e+00 3.96e+01 0.4 7.71e+02 - 8.98e-03 2.19e-02f 1 5 -7.7206574e+01 1.31e+00 2.33e+01 0.4 7.90e+02 - 3.04e-02 2.63e-02f 1 6 3.0416123e+02 1.03e+00 3.51e+02 0.4 8.11e+02 - 3.57e-02 1.98e-01f 1 7 5.3543915e+02 7.98e-01 3.00e+02 0.3 5.77e+02 - 1.04e-01 2.09e-01f 1 8 8.0040593e+02 4.98e-01 2.12e+02 0.2 4.51e+02 - 4.94e-01 3.48e-01f 1 9 9.8029530e+02 1.48e-01 9.43e+01 0.0 4.40e+02 - 6.83e-01 6.13e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.9903980e+02 6.19e-02 5.03e+01 -0.2 6.38e+02 - 4.96e-01 5.82e-01h 1 11 2.0502425e+02 4.33e-02 7.54e+01 -0.4 6.27e+02 - 4.64e-01 3.01e-01h 1 12 -2.2687088e+02 2.66e-02 1.63e+02 -0.5 5.33e+02 - 5.41e-01 3.85e-01h 1 13 -7.1111018e+02 1.48e-02 9.38e+01 -0.8 3.32e+02 - 4.49e-01 4.43e-01h 1 14 -1.2166055e+03 7.69e-03 9.21e+01 -1.2 1.36e+02 - 5.90e-01 4.80e-01f 1 15 -1.4385628e+03 5.46e-03 3.79e+02 -1.3 1.18e+02 - 7.46e-01 2.90e-01f 1 16 -1.7366674e+03 5.84e-03 4.61e+02 -1.5 1.20e+02 - 8.20e-01 3.94e-01f 1 17 -2.2543545e+03 5.11e-02 4.46e+01 -2.1 1.00e+02 - 4.44e-01 7.47e-01f 1 18 -2.4289228e+03 2.51e-02 2.00e+01 -2.5 4.16e+01 - 6.63e-01 6.50e-01f 1 19 -2.5076908e+03 1.25e-02 4.71e+01 -2.7 2.19e+01 - 4.83e-01 5.67e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.5568132e+03 4.96e-03 6.00e+01 -2.8 2.68e+01 - 6.08e-01 6.44e-01f 1 21 -2.5822101e+03 2.49e-03 2.19e+01 -3.2 4.52e+01 - 5.36e-01 5.31e-01f 1 22 -2.6020793e+03 1.00e-03 2.20e+01 -3.6 3.17e+01 - 6.26e-01 6.37e-01f 1 23 -2.6087116e+03 4.59e-04 4.15e+02 -3.6 1.37e+01 - 6.74e-01 5.35e-01f 1 24 -2.6147092e+03 1.26e-04 9.47e+01 -4.0 9.39e+00 - 6.58e-01 7.28e-01f 1 25 -2.6155577e+03 8.80e-05 3.36e+03 -4.2 3.09e+00 - 8.00e-01 2.76e-01f 1 26 -2.6168441e+03 3.48e-05 3.52e+03 -4.2 1.22e+00 - 8.00e-01 5.46e-01f 1 27 -2.6180238e+03 1.32e-05 1.35e+03 -5.0 8.39e-01 - 5.81e-01 6.03e-01f 1 28 -2.6187529e+03 2.78e-06 4.33e+02 -5.9 3.82e-01 - 5.78e-01 7.81e-01f 1 29 -2.6186913e+03 4.27e-10 8.01e+01 -4.8 3.16e-01 - 1.00e+00 9.98e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -2.6189548e+03 7.97e-08 3.29e+03 -7.6 1.18e-01 - 8.51e-01 9.08e-01f 1 31 -2.6189808e+03 2.78e-08 1.50e+02 -9.8 2.04e-02 - 9.54e-01 9.55e-01f 1 32 -2.6189803e+03 1.82e-09 4.21e+06 -7.0 2.36e-01 - 1.19e-02 1.00e+00h 1 33 -2.6189801e+03 2.65e-10 2.10e+06 -6.9 8.17e-01 - 1.00e+00 5.02e-01h 1 34 -2.6189800e+03 6.58e-08 2.57e+03 -6.9 2.77e-01 - 3.07e-01 1.00e+00f 1 35 -2.6189800e+03 7.11e-15 1.49e-07 -6.9 4.80e-02 - 1.00e+00 1.00e+00h 1 36 -2.6189814e+03 1.42e-14 3.18e+02 -9.5 8.45e-04 - 9.90e-01 7.11e-01f 1 37 -2.6189815e+03 1.42e-14 1.93e+02 -7.9 1.08e-02 - 1.00e+00 8.47e-02f 1 38 -2.6189817e+03 1.98e-09 8.17e-02 -7.8 3.15e-04 - 1.00e+00 1.00e+00h 1 39 -2.6189819e+03 2.57e-09 6.34e+01 -9.6 1.22e-04 - 9.27e-01 5.37e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -2.6189820e+03 1.42e-09 1.54e+01 -9.5 5.62e-05 - 1.00e+00 7.93e-01h 1 41 -2.6189820e+03 3.42e-10 4.53e+00 -9.3 9.37e-05 - 1.00e+00 7.43e-01h 1 42 -2.6189820e+03 7.92e-11 1.74e-03 -9.3 7.57e-06 - 1.00e+00 1.00e+00h 1 43 -2.6189820e+03 1.08e-10 3.37e+00 -10.6 3.89e-06 - 7.67e-01 5.25e-01h 1 44 -2.6189820e+03 4.26e-14 4.04e-04 -9.8 1.03e-05 - 1.00e+00 1.00e+00h 1 45 -2.6189820e+03 6.33e-12 1.02e-02 -10.7 9.35e-06 - 5.83e-01 5.84e-01h 1 46 -2.6189820e+03 5.00e-12 1.34e+00 -11.0 3.48e-05 - 7.40e-01 5.55e-01h 1 47 -2.6189820e+03 6.82e-11 2.78e-01 -10.6 1.16e-04 - 1.00e+00 8.80e-01h 1 48 -2.6189820e+03 6.39e-11 4.71e-01 -10.6 1.42e-04 - 1.00e+00 6.25e-02f 5 49 -2.6189820e+03 6.37e-11 8.98e-01 -10.6 5.58e-05 - 1.00e+00 3.91e-03h 9 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 -2.6189820e+03 1.52e-12 1.52e-06 -10.6 1.33e-04 - 1.00e+00 1.00e+00H 1 51 -2.6189820e+03 5.01e-12 6.79e-01 -11.0 5.47e-05 - 9.45e-01 5.28e-01H 1 52 -2.6189820e+03 1.05e-09 5.36e-01 -11.0 1.05e-04 - 8.18e-01 6.25e-01h 1 53 -2.6189820e+03 9.18e-10 5.81e-01 -11.0 2.15e-04 - 1.00e+00 1.25e-01f 4 54 -2.6189820e+03 1.04e-09 2.63e-06 -11.0 1.60e-04 - 1.00e+00 1.00e+00h 1 55 -2.6189820e+03 3.74e-12 3.29e-07 -11.0 5.10e-04 - 1.00e+00 1.00e+00h 1 56 -2.6189820e+03 1.42e-12 5.86e-08 -11.0 3.71e-04 - 1.00e+00 1.00e+00h 1 57 -2.6189820e+03 5.42e-13 2.54e-08 -11.0 2.88e-04 - 1.00e+00 1.00e+00h 1 58 -2.6189820e+03 2.72e-13 1.10e-08 -11.0 3.33e-04 - 1.00e+00 1.00e+00h 1 59 -2.6189820e+03 1.80e-13 4.79e-09 -11.0 5.61e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 59 (scaled) (unscaled) Objective...............: -4.0921594348333804e+02 -2.6189820382933635e+03 Dual infeasibility......: 4.7886382706363584e-09 3.0647284932072694e-08 Constraint violation....: 1.8035274187832603e-13 1.8035274187832603e-13 Complementarity.........: 1.0001036733255755e-11 6.4006635092836829e-11 Overall NLP error.......: 4.7886382706363584e-09 3.0647284932072694e-08 Number of objective function evaluations = 82 Number of objective gradient evaluations = 60 Number of equality constraint evaluations = 82 Number of inequality constraint evaluations = 82 Number of equality constraint Jacobian evaluations = 60 Number of inequality constraint Jacobian evaluations = 60 Number of Lagrangian Hessian evaluations = 59 Total CPU secs in IPOPT (w/o function evaluations) = 0.729 Total CPU secs in NLP function evaluations = 0.106 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2618.982 59 0.834873 build initial OA NLP0014I 2 OPT -2544.0371 59 0.250962 OA decomposition OA0003I New best feasible of -2544.0371 found after 0.518921 sec and NLP0014I 3 OPT -2564.5 59 0.249962 OA decomposition OA0003I New best feasible of -2564.5 found after 1.05084 sec and OA0008I OA converged in 1.3158 seconds found solution of value -2564.5 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 113 branch-and-bound nodes in total Cbc0012I Integer solution of -2564.5 found by nonlinear programm after 86 iterations and 0 nodes (1.27 seconds) Cbc0031I 47 added rows had average density of 2.1914894 Cbc0013I At root node, 47 cuts changed objective from -2618.984 to -2618.9837 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 76 row cuts average 2.4 elements, 0 column cuts (47 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2564.499954348769, took 86 iterations and 0 nodes (1.28 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 76 cuts of which 47 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2564.5. Best solution: 2.564500e+03 (0 nodes, 1.345 seconds) Best possible: 2.564500e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0840M04H.gms(11089) 4 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0840M04H.gms Stop 09/08/12 19:59:01 elapsed 0:00:02.324 @04 1347127141 ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- =ready= Linux opt230 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0840M04M.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0840M04M.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0840M04M.gms(8131) 3 Mb --- Starting execution: elapsed 0:00:00.051 --- RSyn0840M04M.gms(8129) 4 Mb --- Generating MINLP model m --- RSyn0840M04M.gms(8131) 7 Mb --- 3,729 rows 1,441 columns 9,201 non-zeroes --- 760 nl-code 112 nl-non-zeroes --- 576 discrete-columns --- RSyn0840M04M.gms(8131) 4 Mb --- Executing BONMIN: elapsed 0:00:00.073 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1100 Number of nonzeros in inequality constraint Jacobian.: 7696 Number of nonzeros in Lagrangian Hessian.............: 112 Total number of variables............................: 1440 variables with only lower bounds: 676 variables with lower and upper bounds: 604 variables with only upper bounds: 0 Total number of equality constraints.................: 388 Total number of inequality constraints...............: 3340 inequality constraints with only lower bounds: 760 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2580 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.1676000e+02 1.39e+00 3.36e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.7687833e+02 1.39e+00 3.36e+01 1.3 8.42e+03 - 4.08e-04 5.04e-04f 1 2 -2.0472590e+02 1.39e+00 3.35e+01 1.3 1.24e+04 - 1.06e-03 2.15e-04f 1 3 -2.9741498e+02 1.38e+00 4.42e+01 1.3 1.40e+04 - 1.22e-03 6.81e-04f 1 4 -5.5415012e+02 1.37e+00 3.34e+01 1.3 1.37e+04 - 1.30e-03 1.92e-03f 1 5 -1.2638768e+03 1.33e+00 3.32e+01 1.3 1.35e+04 - 5.29e-03 5.55e-03f 1 6 -2.4731709e+03 1.25e+00 2.98e+02 1.3 1.23e+04 - 1.82e-02 1.25e-02f 1 7 -3.2115235e+03 1.08e+00 3.10e+03 1.3 1.03e+04 - 1.13e-01 2.88e-02f 1 8 -2.8433506e+03 7.56e-01 3.01e+03 1.3 7.31e+03 - 9.66e-02 1.88e-01f 1 9 -2.9391791e+03 6.10e-01 1.99e+03 1.1 3.41e+03 - 2.58e-01 1.94e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.0277228e+03 4.16e-01 1.31e+03 1.0 2.44e+03 - 3.29e-01 3.18e-01f 1 11 -3.4399613e+03 2.11e-01 8.65e+02 0.7 1.35e+03 - 4.24e-01 4.93e-01f 1 12 -3.7713140e+03 5.14e-02 5.57e+02 0.7 1.84e+03 - 5.43e-01 7.56e-01h 1 13 -4.7154154e+03 2.07e-02 7.16e+02 0.4 1.44e+03 - 7.89e-01 5.97e-01h 1 14 -6.6811045e+03 1.25e-02 1.65e+03 0.2 5.86e+03 - 5.69e-01 3.97e-01h 1 15 -8.7990752e+03 7.62e-03 8.08e+02 0.0 6.21e+03 - 3.66e-01 3.90e-01f 1 16 -1.0038693e+04 5.26e-03 1.54e+03 -0.2 3.86e+03 - 4.18e-01 3.10e-01f 1 17 -1.1472470e+04 3.03e-03 2.07e+03 -0.3 3.29e+03 - 5.44e-01 4.23e-01f 1 18 -1.2650319e+04 1.84e-03 2.45e+03 -0.8 2.33e+03 - 6.11e-01 3.93e-01f 1 19 -1.3723292e+04 9.12e-04 1.18e+03 -0.8 1.27e+03 - 5.02e-01 5.05e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.4286749e+04 5.02e-04 2.23e+03 -1.1 6.18e+02 - 6.14e-01 4.49e-01f 1 21 -1.4872347e+04 1.75e-04 1.55e+02 -1.2 4.04e+02 - 5.69e-01 6.52e-01f 1 22 -1.5073806e+04 1.01e-04 1.98e+03 -1.5 1.45e+02 - 5.45e-01 4.22e-01f 1 23 -1.5206342e+04 5.23e-05 2.74e+03 -1.5 1.20e+02 - 5.33e-01 4.82e-01f 1 24 -1.5301619e+04 3.19e-05 1.25e+04 -1.8 7.24e+01 - 7.37e-01 3.90e-01f 1 25 -1.5416399e+04 1.50e-05 5.93e+03 -2.1 6.89e+01 - 5.31e-01 5.29e-01f 1 26 -1.5508125e+04 4.58e-06 1.90e+03 -2.3 5.55e+01 - 6.99e-01 6.96e-01f 1 27 -1.5551546e+04 1.27e-06 6.91e+03 -2.5 4.46e+01 - 6.02e-01 7.22e-01f 1 28 -1.5564097e+04 6.59e-07 4.04e+04 -2.7 2.81e+01 - 7.82e-01 4.83e-01f 1 29 -1.5583386e+04 8.15e-08 4.90e+04 -3.0 3.31e+01 - 5.05e-01 8.76e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -1.5589206e+04 3.57e-08 1.76e+04 -3.7 1.99e+01 - 5.83e-01 5.62e-01f 1 31 -1.5593171e+04 1.19e-08 1.29e+04 -4.1 1.23e+01 - 5.67e-01 6.68e-01f 1 32 -1.5593379e+04 1.09e-08 1.09e+05 -4.7 5.17e+00 - 8.45e-01 8.36e-02f 1 33 -1.5594630e+04 4.53e-06 4.85e+04 -4.7 4.59e+00 - 5.33e-01 5.53e-01f 1 34 -1.5595124e+04 1.88e-06 8.09e+04 -4.8 1.88e+00 - 7.81e-01 4.80e-01f 1 35 -1.5595335e+04 5.73e-08 1.25e+05 -4.9 9.09e-01 - 1.00e+00 3.71e-01f 1 36 -1.5595512e+04 1.52e-07 1.32e+05 -5.8 5.52e-01 - 9.11e-01 4.03e-01f 1 37 -1.5595720e+04 5.26e-07 3.83e+04 -7.0 3.31e-01 - 9.67e-01 7.62e-01f 1 38 -1.5595767e+04 1.54e-07 1.13e+04 -7.3 2.72e-01 - 9.82e-01 7.34e-01h 1 39 -1.5595784e+04 7.25e-09 2.68e+02 -11.0 1.80e-02 - 9.79e-01 9.76e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -1.5595784e+04 9.72e-09 2.45e+01 -11.0 5.65e-03 - 7.76e-01 9.01e-01h 1 41 -1.5595785e+04 2.93e-09 6.94e+00 -10.3 1.20e-01 - 6.17e-01 7.16e-01h 1 42 -1.5595785e+04 2.48e-09 3.94e+00 -9.4 1.61e+00 - 1.00e+00 1.53e-01h 1 43 -1.5595785e+04 1.59e-09 6.33e+00 -9.4 2.91e-01 - 4.41e-01 3.76e-01f 1 44 -1.5595785e+04 3.64e-09 6.70e+00 -9.4 1.81e-01 - 1.51e-02 7.37e-03f 2 45 -1.5595785e+04 3.29e-09 3.04e+01 -9.4 1.80e-01 - 7.42e-01 8.33e-02h 1 46 -1.5595785e+04 2.18e-09 3.01e+01 -9.4 1.65e-01 - 1.93e-02 3.37e-03f 2 47 -1.5595785e+04 1.89e-09 4.86e+00 -9.4 1.65e-01 - 1.00e+00 1.31e-01h 1 48 -1.5595785e+04 1.29e-09 1.31e+01 -9.4 1.43e-01 - 1.87e-01 3.50e-01f 1 49 -1.5595785e+04 7.65e-10 1.19e+01 -9.4 9.30e-02 - 7.47e-01 4.07e-01f 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 -1.5595785e+04 8.66e-10 1.14e+01 -9.4 5.52e-02 - 2.73e-02 2.02e-02h 1 51 -1.5595785e+04 7.01e-09 1.08e+01 -9.4 5.41e-02 - 7.63e-02 3.96e-02F 1 52 -1.5595785e+04 6.57e-09 3.20e+00 -9.4 5.19e-02 - 1.00e+00 6.25e-02f 5 53 -1.5595785e+04 3.25e-09 1.74e+01 -9.4 4.87e-02 - 2.88e-01 5.24e-01h 1 54 -1.5595785e+04 1.35e-08 6.29e+01 -9.4 2.32e-02 - 2.14e-01 8.39e-01f 1 55 -1.5595785e+04 1.29e-08 5.28e+01 -9.4 3.74e-03 - 1.08e-01 3.96e-02f 4 56 -1.5595785e+04 1.05e-08 4.56e+01 -9.4 3.59e-03 - 2.99e-01 1.60e-01h 1 57 -1.5595785e+04 9.81e-09 4.35e+01 -9.4 3.02e-03 - 8.52e-01 6.25e-02f 5 58 -1.5595785e+04 8.08e-10 4.80e-10 -9.4 2.83e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 58 (scaled) (unscaled) Objective...............: -2.4368413326859245e+03 -1.5595784529189918e+04 Dual infeasibility......: 4.8016524090144230e-10 3.0730575417692309e-09 Constraint violation....: 8.0794755744318398e-10 8.0794755744318398e-10 Complementarity.........: 1.5915900411136077e-09 1.0186176263127088e-08 Overall NLP error.......: 1.5915900411136077e-09 1.0186176263127088e-08 Number of objective function evaluations = 74 Number of objective gradient evaluations = 59 Number of equality constraint evaluations = 74 Number of inequality constraint evaluations = 74 Number of equality constraint Jacobian evaluations = 59 Number of inequality constraint Jacobian evaluations = 59 Number of Lagrangian Hessian evaluations = 58 Total CPU secs in IPOPT (w/o function evaluations) = 0.590 Total CPU secs in NLP function evaluations = 0.080 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -15595.785 58 0.669899 build initial OA NLP0014I 2 OPT -2497.7262 52 0.155977 OA decomposition OA0003I New best feasible of -2497.7262 found after 4.286349 sec and NLP0014I 3 OPT -2538.2798 46 0.138979 OA decomposition OA0003I New best feasible of -2538.2798 found after 8.549701 sec and NLP0014I 4 OPT -2563.5008 46 0.138979 OA decomposition OA0003I New best feasible of -2563.5008 found after 13.491949 sec and NLP0014I 5 OPT -2564.4995 47 0.142979 OA decomposition OA0003I New best feasible of -2564.4995 found after 19.198082 sec and OA0008I OA converged in 24.378294 seconds found solution of value -2564.4995 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 11062 branch-and-bound nodes in total Cbc0012I Integer solution of -2564.4995 found by nonlinear programm after 1 iterations and 0 nodes (24.36 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from -15595.785 to -15595.785 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 23 row cuts average 3.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2564.499495246723, took 1 iterations and 0 nodes (24.36 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 23 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2564.5. Best solution: 2.564499e+03 (0 nodes, 24.47 seconds) Best possible: 2.564499e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0840M04M.gms(8131) 3 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0840M04M.gms Stop 09/08/12 19:59:24 elapsed 0:00:25.330 @04 1347127164 ----------------------------- Sa 8. Sep 19:59:24 CEST 2012 ----------------------------- =ready= Linux opt231 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/RSyn/gms/RSyn0840M.gms =========== ----------------------------- Sa 8. Sep 19:58:58 CEST 2012 ----------------------------- @03 1347127138 --- Job RSyn0840M.gms Start 09/08/12 19:58:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- RSyn0840M.gms(1105) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- RSyn0840M.gms(1103) 3 Mb --- Generating MINLP model m --- RSyn0840M.gms(1105) 5 Mb --- 485 rows 281 columns 1,291 non-zeroes --- 190 nl-code 28 nl-non-zeroes --- 104 discrete-columns --- RSyn0840M.gms(1105) 3 Mb --- Executing BONMIN: elapsed 0:00:00.015 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 243 Number of nonzeros in inequality constraint Jacobian.: 946 Number of nonzeros in Lagrangian Hessian.............: 28 Total number of variables............................: 280 variables with only lower bounds: 169 variables with lower and upper bounds: 111 variables with only upper bounds: 0 Total number of equality constraints.................: 89 Total number of inequality constraints...............: 395 inequality constraints with only lower bounds: 150 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 245 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.4450000e+01 1.39e+00 3.49e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.1556445e+01 1.39e+00 3.46e+01 1.1 1.06e+03 - 8.74e-04 1.21e-03f 1 2 -5.1187137e+01 1.38e+00 3.48e+01 1.1 1.63e+03 - 1.91e-03 1.42e-03f 1 3 -8.0406246e+01 1.37e+00 3.52e+01 1.1 1.77e+03 - 3.70e-03 2.05e-03f 1 4 -1.8562243e+02 1.34e+00 4.39e+01 1.1 1.82e+03 - 8.84e-03 6.57e-03f 1 5 -6.0137924e+02 1.25e+00 3.45e+01 1.1 1.72e+03 - 2.00e-02 2.34e-02f 1 6 -9.1357696e+02 1.13e+00 1.34e+02 1.1 1.53e+03 - 6.31e-02 3.02e-02f 1 7 -8.9938737e+02 8.09e-01 1.16e+02 1.1 1.32e+03 - 1.27e-01 1.18e-01f 1 8 -9.1178453e+02 5.81e-01 1.20e+02 0.9 8.29e+02 - 2.52e-01 2.83e-01f 1 9 -8.4087222e+02 2.57e-01 3.06e+02 0.9 6.74e+02 - 3.30e-01 5.57e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.2479999e+03 6.80e-02 3.38e+02 0.3 2.18e+02 - 4.29e-01 7.36e-01f 1 11 -1.5660155e+03 2.90e-02 7.66e+01 0.1 3.36e+02 - 6.08e-01 5.73e-01f 1 12 -1.8170066e+03 1.91e-02 2.87e+02 -0.0 4.50e+02 - 4.48e-01 3.42e-01f 1 13 -2.2070370e+03 6.88e-03 5.78e+02 -0.3 2.37e+02 - 8.06e-01 6.40e-01f 1 14 -2.4558055e+03 2.98e-03 4.77e+02 -0.8 2.32e+01 - 6.67e-01 5.67e-01f 1 15 -2.6159050e+03 1.13e-03 7.26e+02 -1.0 2.96e+01 - 7.68e-01 6.20e-01f 1 16 -2.7149043e+03 3.56e-04 7.58e+02 -1.3 2.60e+01 - 8.23e-01 6.86e-01f 1 17 -2.7360834e+03 2.31e-04 1.60e+03 -1.9 2.61e+01 - 7.02e-01 3.49e-01f 1 18 -2.7555854e+03 1.24e-04 1.61e+03 -2.3 2.22e+01 - 7.87e-01 4.65e-01f 1 19 -2.7704553e+03 3.93e-05 7.56e+02 -2.7 1.29e+01 - 8.53e-01 6.82e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.7764489e+03 7.77e-06 1.84e+02 -3.3 4.26e+00 - 5.03e-01 8.02e-01f 1 21 -2.7773827e+03 3.15e-06 5.21e+02 -3.5 2.40e+00 - 4.84e-01 5.94e-01f 1 22 -2.7779445e+03 4.35e-03 6.05e+01 -4.3 5.79e-01 - 8.40e-01 7.08e-01f 1 23 -2.7779819e+03 3.98e-03 6.00e+02 -5.1 4.52e-01 - 9.72e-01 1.59e-01h 1 24 -2.7781295e+03 1.05e-03 1.12e+02 -6.0 7.73e-01 - 9.97e-01 7.41e-01h 1 25 -2.7781709e+03 1.93e-04 1.28e+02 -6.9 1.24e+00 - 9.62e-01 8.17e-01h 1 26 -2.7781801e+03 3.20e-06 3.99e+00 -11.0 1.37e-03 - 9.82e-01 9.84e-01h 1 27 -2.7781802e+03 4.06e-08 4.67e+01 -11.0 3.56e-02 - 9.90e-01 9.87e-01h 1 28 -2.7781802e+03 8.36e-09 2.41e+02 -11.0 2.63e+00 - 9.87e-01 7.91e-01h 1 29 -2.7781802e+03 3.98e-09 1.45e+02 -9.8 1.12e+02 - 8.73e-01 4.27e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -2.7781802e+03 7.44e-14 1.21e+01 -9.8 4.56e+01 - 1.00e+00 9.18e-01f 1 31 -2.7781802e+03 7.11e-15 1.44e-13 -9.8 1.65e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 31 (scaled) (unscaled) Objective...............: -7.9376577628190410e+02 -2.7781802169866646e+03 Dual infeasibility......: 1.4435486854654999e-13 5.0524203991292496e-13 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.8175971786446871e-10 6.3615901252564053e-10 Overall NLP error.......: 1.8175971786446871e-10 6.3615901252564053e-10 Number of objective function evaluations = 32 Number of objective gradient evaluations = 32 Number of equality constraint evaluations = 32 Number of inequality constraint evaluations = 32 Number of equality constraint Jacobian evaluations = 32 Number of inequality constraint Jacobian evaluations = 32 Number of Lagrangian Hessian evaluations = 31 Total CPU secs in IPOPT (w/o function evaluations) = 0.049 Total CPU secs in NLP function evaluations = 0.007 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2778.1802 31 0.055991 build initial OA NLP0014I 2 OPT -325.55451 31 0.045993 OA decomposition OA0003I New best feasible of -325.55451 found after 0.284957 sec and NLP0014I 3 OPT -325.13228 31 0.047993 OA decomposition OA0008I OA converged in 0.79088 seconds found solution of value -325.55451 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 1135 branch-and-bound nodes in total Cbc0012I Integer solution of -325.55451 found by nonlinear programm after 1 iterations and 0 nodes (0.78 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from -2778.1803 to -2778.1803 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 4 row cuts average 3.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -325.554508748365, took 1 iterations and 0 nodes (0.78 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 4 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 325.555. Best solution: 3.255545e+02 (0 nodes, 0.803 seconds) Best possible: 3.255545e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- RSyn0840M.gms(1105) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job RSyn0840M.gms Stop 09/08/12 19:58:59 elapsed 0:00:00.964 @04 1347127139 ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay05H.gms =========== ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- @03 1347127139 --- Job SLay05H.gms Start 09/08/12 19:58:59 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay05H.gms(700) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- SLay05H.gms(698) 3 Mb --- Generating MIQCP model m --- SLay05H.gms(700) 5 Mb --- 291 rows 231 columns 831 non-zeroes --- 43 nl-code 10 nl-non-zeroes --- 40 discrete-columns --- SLay05H.gms(700) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 240 Number of nonzeros in inequality constraint Jacobian.: 560 Number of nonzeros in Lagrangian Hessian.............: 10 Total number of variables............................: 230 variables with only lower bounds: 180 variables with lower and upper bounds: 50 variables with only upper bounds: 0 Total number of equality constraints.................: 50 Total number of inequality constraints...............: 240 inequality constraints with only lower bounds: 40 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 200 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.9611101e+05 3.50e+00 1.84e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9139556e+05 3.06e+00 2.27e+01 -0.2 6.74e+00 - 7.27e-03 1.24e-01f 1 2 1.2236072e+05 1.53e+00 2.85e+01 -0.0 5.44e+00 - 2.13e-02 4.99e-01f 1 3 7.8144231e+04 1.01e+00 1.86e+01 -0.2 7.08e+00 - 2.14e-01 3.42e-01f 1 4 5.0385433e+04 6.46e-01 1.18e+01 -0.2 9.60e+00 - 2.08e-01 3.60e-01f 1 5 2.3561862e+04 1.78e-15 7.55e-01 -0.2 1.44e+01 - 3.81e-01 1.00e+00f 1 6 2.2054781e+04 2.22e-15 3.61e-01 -1.7 3.43e+00 - 7.32e-01 6.23e-01f 1 7 2.1463062e+04 2.22e-15 9.55e-02 -1.9 2.36e+00 - 7.05e-01 8.38e-01f 1 8 2.1353933e+04 3.33e-15 9.39e-03 -3.7 6.90e-01 - 8.86e-01 8.35e-01f 1 9 2.1329110e+04 2.66e-15 4.82e-03 -6.1 2.18e-01 - 9.61e-01 9.29e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.1325926e+04 1.78e-15 1.25e-03 -7.6 1.04e-01 - 9.81e-01 9.65e-01f 1 11 2.1325442e+04 2.66e-15 9.51e-06 -8.2 3.55e-02 - 9.97e-01 9.97e-01f 1 12 2.1325388e+04 3.55e-15 1.29e-07 -11.0 5.00e-03 - 1.00e+00 1.00e+00f 1 13 2.1325387e+04 1.78e-15 6.18e-15 -11.0 8.76e-01 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 2.1872191483927017e+02 2.1325386696828842e+04 Dual infeasibility......: 6.1806163266528566e-15 6.0261009184865352e-13 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 3.1363143826841638e-09 3.0579065231170598e-07 Overall NLP error.......: 3.1363143826841638e-09 3.0579065231170598e-07 Number of objective function evaluations = 14 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 Number of equality constraint Jacobian evaluations = 14 Number of inequality constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.018 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 21325.387 13 0.018997 build initial OA NLP0014I 2 OPT 22846.772 20 0.021997 OA decomposition OA0003I New best feasible of 22846.772 found after 0.090986 sec and NLP0014I 3 OPT 25650.759 22 0.026996 OA decomposition NLP0014I 4 OPT 22664.679 17 0.019997 OA decomposition OA0003I New best feasible of 22664.679 found after 0.365945 sec and NLP0014I 5 OPT 24364.375 18 0.008998 OA decomposition NLP0014I 6 OPT 27437.082 22 0.011999 OA decomposition NLP0014I 7 OPT 23290.001 21 0.010999 OA decomposition OA0008I OA converged in 0.739888 seconds found solution of value 22664.679 (lower bound 1e+50 ). OA0010I Performed 6 iterations, explored 687 branch-and-bound nodes in total Cbc0012I Integer solution of 22664.679 found by nonlinear programm after 6 iterations and 0 nodes (0.74 seconds) Cbc0031I 1 added rows had average density of 31 Cbc0013I At root node, 1 cuts changed objective from 21325.387 to 21325.387 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 31.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 22664.67865358726, took 6 iterations and 0 nodes (0.74 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 3 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 22664.7. Best solution: 2.266468e+04 (0 nodes, 0.756 seconds) Best possible: 2.266468e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay05H.gms(700) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay05H.gms Stop 09/08/12 19:59:00 elapsed 0:00:00.873 @04 1347127140 ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- =ready= Linux opt213 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay05M.gms =========== ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- @03 1347127139 --- Job SLay05M.gms Start 09/08/12 19:58:59 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay05M.gms(261) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- SLay05M.gms(259) 3 Mb --- Generating MIQCP model m --- SLay05M.gms(261) 5 Mb --- 91 rows 71 columns 311 non-zeroes --- 43 nl-code 10 nl-non-zeroes --- 40 discrete-columns --- SLay05M.gms(261) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 40 Number of nonzeros in inequality constraint Jacobian.: 240 Number of nonzeros in Lagrangian Hessian.............: 10 Total number of variables............................: 70 variables with only lower bounds: 20 variables with lower and upper bounds: 50 variables with only upper bounds: 0 Total number of equality constraints.................: 10 Total number of inequality constraints...............: 80 inequality constraints with only lower bounds: 40 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 40 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.9611101e+05 2.51e+00 4.74e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.0429450e+04 0.00e+00 6.02e+02 0.8 9.03e+00 - 1.56e-02 1.00e+00f 1 2 4.3366153e+04 0.00e+00 3.11e+02 0.0 1.29e+01 - 4.66e-01 4.84e-01f 1 3 2.8735362e+04 1.11e-16 1.32e+02 -0.2 1.13e+01 - 4.98e-01 5.73e-01f 1 4 2.2965491e+04 2.22e-16 3.69e+01 -1.0 6.53e+00 - 6.78e-01 7.20e-01f 1 5 2.1748173e+04 1.11e-16 1.27e+01 -2.4 2.57e+00 - 8.58e-01 6.77e-01f 1 6 2.1418956e+04 2.22e-16 3.09e+00 -3.5 1.02e+00 - 9.33e-01 7.70e-01f 1 7 2.1337684e+04 1.11e-16 3.07e-01 -4.7 4.13e-01 - 9.71e-01 9.03e-01f 1 8 2.1326921e+04 2.22e-16 7.41e-03 -5.5 1.86e-01 - 9.90e-01 9.76e-01f 1 9 2.1325632e+04 1.11e-16 6.57e-05 -6.2 3.57e-01 - 9.93e-01 9.95e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.1325404e+04 0.00e+00 5.17e-06 -8.2 3.11e-02 - 1.00e+00 1.00e+00f 1 11 2.1325387e+04 2.22e-16 5.78e-15 -11.0 4.25e-03 - 1.00e+00 1.00e+00f 1 12 2.1325387e+04 2.22e-16 3.91e-15 -11.0 2.91e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 2.1872191483374016e+02 2.1325386696289665e+04 Dual infeasibility......: 3.9066478386095886e-15 3.8089816426443488e-13 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 4.5816288105154210e-11 4.4670880902525354e-09 Overall NLP error.......: 4.5816288105154210e-11 4.4670880902525354e-09 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 13 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 13 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.004 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 21325.387 12 0.004999 build initial OA NLP0014I 2 OPT 25589.679 14 0.003999 OA decomposition OA0003I New best feasible of 25589.679 found after 0.009998 sec and NLP0014I 3 OPT 22664.679 10 0.002 OA decomposition OA0003I New best feasible of 22664.679 found after 0.019997 sec and NLP0014I 4 OPT 32813.632 15 0.004 OA decomposition NLP0014I 5 OPT 22846.772 10 0.004 OA decomposition NLP0014I 6 OPT 24164.502 11 0.003999 OA decomposition NLP0014I 7 OPT 26716.717 14 0.007999 OA decomposition NLP0014I 8 OPT 23290.001 12 0.006999 OA decomposition OA0008I OA converged in 0.183972 seconds found solution of value 22664.679 (lower bound 1e+50 ). OA0010I Performed 7 iterations, explored 285 branch-and-bound nodes in total Cbc0012I Integer solution of 22664.679 found by nonlinear programm after 0 iterations and 0 nodes (0.18 seconds) Cbc0013I At root node, 0 cuts changed objective from 21325.387 to 21325.387 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 22664.67865172278, took 0 iterations and 0 nodes (0.18 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 22664.7. Best solution: 2.266468e+04 (0 nodes, 0.195 seconds) Best possible: 2.266468e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay05M.gms(261) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay05M.gms Stop 09/08/12 19:58:59 elapsed 0:00:00.263 @04 1347127139 ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- =ready= Linux opt213 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay06H.gms =========== ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- @03 1347127139 --- Job SLay06H.gms Start 09/08/12 19:58:59 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay06H.gms(1024) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- SLay06H.gms(1022) 3 Mb --- Generating MIQCP model m --- SLay06H.gms(1024) 5 Mb --- 436 rows 343 columns 1,243 non-zeroes --- 51 nl-code 12 nl-non-zeroes --- 60 discrete-columns --- SLay06H.gms(1024) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 360 Number of nonzeros in inequality constraint Jacobian.: 840 Number of nonzeros in Lagrangian Hessian.............: 12 Total number of variables............................: 342 variables with only lower bounds: 270 variables with lower and upper bounds: 72 variables with only upper bounds: 0 Total number of equality constraints.................: 75 Total number of inequality constraints...............: 360 inequality constraints with only lower bounds: 60 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 300 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.2496259e+05 3.50e+00 1.46e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2273300e+05 3.24e+00 1.68e+01 -0.2 6.75e+00 - 7.69e-03 7.16e-02f 1 2 1.5962465e+05 1.37e+00 4.04e+01 -0.2 5.78e+00 - 1.72e-02 5.76e-01f 1 3 1.0594206e+05 9.17e-01 2.68e+01 -0.2 6.82e+00 - 2.17e-01 3.33e-01f 1 4 6.7960324e+04 5.73e-01 1.67e+01 -0.2 6.54e+00 - 2.44e-01 3.75e-01f 1 5 4.0480591e+04 2.27e-01 6.44e+00 -0.2 1.21e+01 - 2.82e-01 6.05e-01f 1 6 3.2008947e+04 4.19e-02 1.05e+00 -0.7 8.41e+00 - 4.63e-01 8.15e-01f 1 7 3.0891950e+04 1.28e-02 3.43e-01 -2.1 3.20e+00 - 8.00e-01 6.95e-01f 1 8 3.0544280e+04 1.94e-03 5.04e-02 -3.0 1.43e+00 - 8.12e-01 8.48e-01f 1 9 3.0482033e+04 1.77e-04 5.29e-03 -5.2 3.05e-01 - 9.41e-01 9.09e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.0474715e+04 7.84e-06 2.35e-03 -8.4 9.49e-02 - 9.84e-01 9.56e-01h 1 11 3.0474158e+04 4.13e-08 4.16e-06 -8.3 4.91e-02 - 9.94e-01 9.95e-01h 1 12 3.0474082e+04 2.66e-15 1.62e-13 -7.8 2.47e-01 - 1.00e+00 1.00e+00h 1 13 3.0474060e+04 2.44e-15 1.48e-14 -8.8 1.47e-01 - 1.00e+00 1.00e+00f 1 14 3.0474056e+04 2.66e-15 5.06e-15 -11.0 1.03e-02 - 1.00e+00 1.00e+00f 1 15 3.0474056e+04 2.66e-15 4.27e-15 -11.0 1.43e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: 3.1255441993939240e+02 3.0474055944090760e+04 Dual infeasibility......: 4.2671789174822718e-15 4.1604994445452150e-13 Constraint violation....: 2.6645352591003757e-15 2.6645352591003757e-15 Complementarity.........: 5.1597980493679560e-09 5.0308030981337571e-07 Overall NLP error.......: 5.1597980493679560e-09 5.0308030981337571e-07 Number of objective function evaluations = 16 Number of objective gradient evaluations = 16 Number of equality constraint evaluations = 16 Number of inequality constraint evaluations = 16 Number of equality constraint Jacobian evaluations = 16 Number of inequality constraint Jacobian evaluations = 16 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.023 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 30474.056 15 0.027996 build initial OA NLP0014I 2 OPT 32852.701 19 0.026996 OA decomposition OA0003I New best feasible of 32852.701 found after 0.204969 sec and NLP0014I 3 OPT 33177.969 19 0.028995 OA decomposition NLP0014I 4 OPT 33237.261 20 0.013998 OA decomposition NLP0014I 5 OPT 35844.216 20 0.013998 OA decomposition NLP0014I 6 OPT 34388.552 20 0.012998 OA decomposition NLP0014I 7 OPT 37523.598 27 0.017997 OA decomposition NLP0014I 8 OPT 33014.653 19 0.012998 OA decomposition NLP0014I 9 OPT 33168.463 20 0.012998 OA decomposition NLP0014I 10 OPT 32981.107 18 0.012998 OA decomposition NLP0014I 11 OPT 33005.323 19 0.013997 OA decomposition NLP0014I 12 OPT 32757.02 17 0.011998 OA decomposition OA0003I New best feasible of 32757.02 found after 2.669594 sec and NLP0014I 13 OPT 32929.667 18 0.012998 OA decomposition OA0008I OA converged in 3.235508 seconds found solution of value 32757.02 (lower bound 1e+50 ). OA0010I Performed 12 iterations, explored 5405 branch-and-bound nodes in total Cbc0012I Integer solution of 32757.02 found by nonlinear programm after 28 iterations and 0 nodes (3.23 seconds) Cbc0031I 2 added rows had average density of 43 Cbc0013I At root node, 2 cuts changed objective from 30474.056 to 30474.056 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 8 row cuts average 43.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 32757.02018044939, took 28 iterations and 0 nodes (3.23 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 8 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 32757. Best solution: 3.275702e+04 (0 nodes, 3.261 seconds) Best possible: 3.275702e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay06H.gms(1024) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay06H.gms Stop 09/08/12 19:59:03 elapsed 0:00:03.390 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt232 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay06M.gms =========== ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- @03 1347127139 --- Job SLay06M.gms Start 09/08/12 19:58:59 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay06M.gms(362) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- SLay06M.gms(360) 3 Mb --- Generating MIQCP model m --- SLay06M.gms(362) 5 Mb --- 136 rows 103 columns 463 non-zeroes --- 51 nl-code 12 nl-non-zeroes --- 60 discrete-columns --- SLay06M.gms(362) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 60 Number of nonzeros in inequality constraint Jacobian.: 360 Number of nonzeros in Lagrangian Hessian.............: 12 Total number of variables............................: 102 variables with only lower bounds: 30 variables with lower and upper bounds: 72 variables with only upper bounds: 0 Total number of equality constraints.................: 15 Total number of inequality constraints...............: 120 inequality constraints with only lower bounds: 60 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 60 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.2496259e+05 2.51e+00 4.23e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0373235e+05 1.11e-16 5.94e+02 0.8 9.06e+00 - 1.29e-02 1.00e+00f 1 2 5.8591072e+04 2.22e-16 3.05e+02 0.0 1.26e+01 - 4.99e-01 4.88e-01f 1 3 4.1114655e+04 1.11e-16 1.35e+02 -0.3 1.00e+01 - 5.03e-01 5.57e-01f 1 4 3.3784350e+04 2.22e-16 4.99e+01 -1.1 5.95e+00 - 7.03e-01 6.32e-01f 1 5 3.1337256e+04 0.00e+00 1.59e+01 -2.1 2.76e+00 - 8.07e-01 6.89e-01f 1 6 3.0698449e+04 2.22e-16 4.40e+00 -3.3 1.27e+00 - 9.06e-01 7.35e-01f 1 7 3.0508572e+04 1.11e-16 6.11e-01 -4.6 6.91e-01 - 9.50e-01 8.63e-01f 1 8 3.0477603e+04 2.22e-16 4.66e-02 -5.6 2.54e-01 - 9.73e-01 9.24e-01f 1 9 3.0474480e+04 2.22e-16 1.56e-03 -6.4 1.03e-01 - 9.92e-01 9.75e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.0474160e+04 2.22e-16 2.26e-05 -6.8 9.56e-01 - 1.00e+00 9.99e-01f 1 11 3.0474083e+04 2.22e-16 5.04e-13 -7.3 7.77e-01 - 1.00e+00 1.00e+00f 1 12 3.0474061e+04 2.22e-16 4.00e-14 -8.4 1.14e-01 - 1.00e+00 1.00e+00f 1 13 3.0474056e+04 2.22e-16 7.23e-15 -10.6 8.39e-03 - 1.00e+00 1.00e+00f 1 14 3.0474056e+04 2.22e-16 2.89e-15 -11.0 5.33e-01 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 3.1255441994045708e+02 3.0474055944194566e+04 Dual infeasibility......: 2.8937406380782175e-15 2.8213971221262621e-13 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 5.2109523025864573e-09 5.0806784950217958e-07 Overall NLP error.......: 5.2109523025864573e-09 5.0806784950217958e-07 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 15 Number of inequality constraint evaluations = 15 Number of equality constraint Jacobian evaluations = 15 Number of inequality constraint Jacobian evaluations = 15 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.013 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 30474.056 14 0.013998 build initial OA NLP0014I 2 OPT 33177.969 12 0.008998 OA decomposition OA0003I New best feasible of 33177.969 found after 0.029995 sec and NLP0014I 3 OPT 36975.941 16 0.009999 OA decomposition NLP0014I 4 OPT 32757.02 12 0.008998 OA decomposition OA0003I New best feasible of 32757.02 found after 0.101984 sec and NLP0014I 5 OPT 33237.261 13 0.009999 OA decomposition NLP0014I 6 OPT 34388.552 13 0.010998 OA decomposition NLP0014I 7 OPT 35798.545 14 0.008998 OA decomposition NLP0014I 8 OPT 37523.598 18 0.013998 OA decomposition NLP0014I 9 OPT 32929.667 12 0.009998 OA decomposition NLP0014I 10 OPT 32981.107 13 0.008999 OA decomposition OA0008I OA converged in 0.622905 seconds found solution of value 32757.02 (lower bound 1e+50 ). OA0010I Performed 9 iterations, explored 649 branch-and-bound nodes in total Cbc0012I Integer solution of 32757.02 found by nonlinear programm after 0 iterations and 0 nodes (0.62 seconds) Cbc0013I At root node, 0 cuts changed objective from 30474.056 to 30474.056 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 32757.02017797134, took 0 iterations and 0 nodes (0.62 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 32757. Best solution: 3.275702e+04 (0 nodes, 0.636 seconds) Best possible: 3.275702e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay06M.gms(362) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay06M.gms Stop 09/08/12 19:59:00 elapsed 0:00:00.748 @04 1347127140 ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- =ready= Linux opt231 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay07H.gms =========== ----------------------------- Sa 8. Sep 19:58:59 CEST 2012 ----------------------------- @03 1347127139 --- Job SLay07H.gms Start 09/08/12 19:59:00 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay07H.gms(1412) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- SLay07H.gms(1410) 3 Mb --- Generating MIQCP model m --- SLay07H.gms(1412) 5 Mb --- 610 rows 477 columns 1,737 non-zeroes --- 59 nl-code 14 nl-non-zeroes --- 84 discrete-columns --- SLay07H.gms(1412) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 504 Number of nonzeros in inequality constraint Jacobian.: 1176 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 476 variables with only lower bounds: 378 variables with lower and upper bounds: 98 variables with only upper bounds: 0 Total number of equality constraints.................: 105 Total number of inequality constraints...............: 504 inequality constraints with only lower bounds: 84 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 420 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.1736889e+05 4.00e+00 1.29e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.1472826e+05 3.77e+00 1.61e+01 -0.2 9.48e+00 - 6.14e-03 5.75e-02f 1 2 2.7365872e+05 1.11e-15 6.22e+01 -0.2 8.25e+00 - 1.74e-02 1.00e+00f 1 3 2.0046270e+05 1.78e-15 4.46e+01 0.1 9.82e+00 - 2.21e-01 2.82e-01f 1 4 8.1300443e+04 3.55e-15 2.94e+00 0.1 1.94e+01 - 1.68e-01 1.00e+00f 1 5 7.0244089e+04 3.55e-15 1.35e+00 -0.7 1.26e+01 - 5.79e-01 5.29e-01f 1 6 6.3808517e+04 3.55e-15 3.93e-01 -1.1 8.93e+00 - 6.81e-01 7.08e-01f 1 7 6.2370722e+04 2.66e-15 1.88e-01 -2.2 3.58e+00 - 7.58e-01 6.34e-01f 1 8 6.1891746e+04 3.55e-15 6.55e-02 -3.7 1.49e+00 - 8.85e-01 7.76e-01f 1 9 6.1779913e+04 3.55e-15 1.76e-02 -5.5 4.63e-01 - 9.45e-01 8.75e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.1759429e+04 2.89e-15 2.60e-03 -7.3 1.41e-01 - 9.74e-01 9.46e-01f 1 11 6.1757215e+04 5.33e-15 9.89e-05 -9.3 3.11e-02 - 9.94e-01 9.89e-01f 1 12 6.1757140e+04 2.66e-15 2.13e-07 -11.0 1.73e-03 - 1.00e+00 1.00e+00f 1 13 6.1757140e+04 4.44e-15 3.11e-15 -11.0 8.65e-01 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 5.9381865359286928e+02 6.1757139973658399e+04 Dual infeasibility......: 3.1082578968278200e-15 3.2325882127009328e-13 Constraint violation....: 4.4408920985006262e-15 4.4408920985006262e-15 Complementarity.........: 1.5018533430810303e-11 1.5619274768042714e-09 Overall NLP error.......: 1.5018533430810303e-11 1.5619274768042714e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 Number of equality constraint Jacobian evaluations = 14 Number of inequality constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.013 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 61757.14 13 0.012998 build initial OA NLP0014I 2 OPT 76175.668 31 0.025996 OA decomposition OA0003I New best feasible of 76175.668 found after 0.164975 sec and NLP0014I 3 OPT 68407.125 25 0.021996 OA decomposition OA0003I New best feasible of 68407.125 found after 0.302954 sec and NLP0014I 4 OPT 68500.948 25 0.021997 OA decomposition NLP0014I 5 OPT 65253.898 23 0.016998 OA decomposition OA0003I New best feasible of 65253.898 found after 1.076837 sec and NLP0014I 6 OPT 67535.792 30 0.023996 OA decomposition NLP0014I 7 OPT 65003.038 25 0.021996 OA decomposition OA0003I New best feasible of 65003.038 found after 1.854718 sec and NLP0014I 8 OPT 68095.448 26 0.021996 OA decomposition NLP0014I 9 OPT 66805.336 25 0.021997 OA decomposition NLP0014I 10 OPT 69876.129 30 0.023996 OA decomposition NLP0014I 11 OPT 64748.825 22 0.018998 OA decomposition OA0003I New best feasible of 64748.825 found after 4.235357 sec and NLP0014I 12 OPT 67224.877 23 0.019997 OA decomposition NLP0014I 13 OPT 69468.335 28 0.023996 OA decomposition NLP0014I 14 OPT 67177.086 26 0.020996 OA decomposition NLP0014I 15 OPT 67773.501 29 0.024996 OA decomposition NLP0014I 16 OPT 65446.181 24 0.019997 OA decomposition NLP0014I 17 OPT 64906.743 21 0.016997 OA decomposition NLP0014I 18 OPT 67852.129 36 0.033995 OA decomposition NLP0014I 19 OPT 65114.629 24 0.018998 OA decomposition NLP0014I 20 OPT 66703.048 23 0.019997 OA decomposition OA0008I OA converged in 10.008479 seconds found solution of value 64748.825 (lower bound 1e+50 ). OA0010I Performed 19 iterations, explored 14498 branch-and-bound nodes in total Cbc0012I Integer solution of 64748.825 found by nonlinear programm after 68 iterations and 0 nodes (10.01 seconds) Cbc0031I 7 added rows had average density of 57 Cbc0013I At root node, 7 cuts changed objective from 61757.14 to 61757.14 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 16 row cuts average 57.0 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 64748.82529054662, took 68 iterations and 0 nodes (10.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 16 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 64748.8. Best solution: 6.474883e+04 (0 nodes, 10.079 seconds) Best possible: 6.474883e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay07H.gms(1412) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay07H.gms Stop 09/08/12 19:59:10 elapsed 0:00:10.159 @04 1347127150 ----------------------------- Sa 8. Sep 19:59:10 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay07M.gms =========== ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- @03 1347127140 --- Job SLay07M.gms Start 09/08/12 19:59:00 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay07M.gms(489) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- SLay07M.gms(487) 3 Mb --- Generating MIQCP model m --- SLay07M.gms(489) 5 Mb --- 190 rows 141 columns 645 non-zeroes --- 59 nl-code 14 nl-non-zeroes --- 84 discrete-columns --- SLay07M.gms(489) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 84 Number of nonzeros in inequality constraint Jacobian.: 504 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 140 variables with only lower bounds: 42 variables with lower and upper bounds: 98 variables with only upper bounds: 0 Total number of equality constraints.................: 21 Total number of inequality constraints...............: 168 inequality constraints with only lower bounds: 84 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 84 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.1736889e+05 3.02e+00 4.31e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.1122132e+05 0.00e+00 8.11e+02 0.9 1.17e+01 - 1.03e-02 1.00e+00f 1 2 1.3174789e+05 2.22e-16 4.58e+02 0.4 1.90e+01 - 3.87e-01 4.35e-01f 1 3 8.8723754e+04 2.22e-16 1.96e+02 0.1 2.09e+01 - 4.41e-01 5.73e-01f 1 4 7.1119940e+04 1.11e-16 8.06e+01 -0.8 1.21e+01 - 7.12e-01 5.93e-01f 1 5 6.3877465e+04 2.22e-16 2.47e+01 -2.0 5.41e+00 - 8.58e-01 7.07e-01f 1 6 6.2351334e+04 2.22e-16 8.44e+00 -2.9 1.97e+00 - 8.84e-01 6.79e-01f 1 7 6.1896922e+04 1.11e-16 1.85e+00 -3.8 1.43e+00 - 9.48e-01 7.89e-01f 1 8 6.1782769e+04 2.22e-16 2.29e-01 -4.7 6.88e-01 - 9.54e-01 8.77e-01f 1 9 6.1760270e+04 2.22e-16 1.36e-02 -5.9 1.91e-01 - 9.81e-01 9.41e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.1757296e+04 2.22e-16 3.45e-04 -7.9 4.37e-02 - 9.91e-01 9.81e-01f 1 11 6.1757141e+04 2.22e-16 3.29e-06 -11.0 4.20e-03 - 9.99e-01 9.99e-01f 1 12 6.1757140e+04 2.22e-16 5.73e-15 -11.0 1.68e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.9381865359311064e+02 6.1757139973683501e+04 Dual infeasibility......: 5.7265378015962283e-15 5.9555993136600774e-13 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 7.5736373175538410e-10 7.8765828102559944e-08 Overall NLP error.......: 7.5736373175538410e-10 7.8765828102559944e-08 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 13 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 13 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.004 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 61757.14 12 0.004999 build initial OA NLP0014I 2 OPT 66955.054 17 0.006999 OA decomposition OA0003I New best feasible of 66955.054 found after 0.017997 sec and NLP0014I 3 OPT 64906.743 17 0.007998 OA decomposition OA0003I New best feasible of 64906.743 found after 0.049992 sec and NLP0014I 4 OPT 70986.544 18 0.014997 OA decomposition NLP0014I 5 OPT 65122.675 15 0.012998 OA decomposition NLP0014I 6 OPT 66703.048 17 0.015998 OA decomposition NLP0014I 7 OPT 74159.454 27 0.023997 OA decomposition NLP0014I 8 OPT 67789.071 19 0.005999 OA decomposition NLP0014I 9 OPT 69942.379 22 0.008998 OA decomposition NLP0014I 10 OPT 67443.235 17 0.006999 OA decomposition NLP0014I 11 OPT 65253.898 15 0.006999 OA decomposition NLP0014I 12 OPT 64815.726 15 0.004999 OA decomposition OA0003I New best feasible of 64815.726 found after 0.894864 sec and NLP0014I 13 OPT 64834.029 15 0.006999 OA decomposition NLP0014I 14 OPT 66622.759 17 0.006998 OA decomposition NLP0014I 15 OPT 64748.825 13 0.005999 OA decomposition OA0003I New best feasible of 64748.825 found after 1.091834 sec and OA0008I OA converged in 1.166823 seconds found solution of value 64748.825 (lower bound 1e+50 ). OA0010I Performed 14 iterations, explored 1678 branch-and-bound nodes in total Cbc0012I Integer solution of 64748.825 found by nonlinear programm after 0 iterations and 0 nodes (1.17 seconds) Cbc0013I At root node, 0 cuts changed objective from 61757.14 to 61757.14 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 64748.82528643748, took 0 iterations and 0 nodes (1.17 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 64748.8. Best solution: 6.474883e+04 (0 nodes, 1.187 seconds) Best possible: 6.474883e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay07M.gms(489) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay07M.gms Stop 09/08/12 19:59:01 elapsed 0:00:01.253 @04 1347127141 ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- =ready= Linux opt203 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay08H.gms =========== ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- @03 1347127140 --- Job SLay08H.gms Start 09/08/12 19:59:00 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay08H.gms(1864) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- SLay08H.gms(1862) 3 Mb --- Generating MIQCP model m --- SLay08H.gms(1864) 6 Mb --- 813 rows 633 columns 2,313 non-zeroes --- 67 nl-code 16 nl-non-zeroes --- 112 discrete-columns --- SLay08H.gms(1864) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 672 Number of nonzeros in inequality constraint Jacobian.: 1568 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 632 variables with only lower bounds: 504 variables with lower and upper bounds: 128 variables with only upper bounds: 0 Total number of equality constraints.................: 140 Total number of inequality constraints...............: 672 inequality constraints with only lower bounds: 112 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 560 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.3007781e+05 4.00e+00 1.04e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 6.2750470e+05 3.82e+00 1.14e+01 -0.2 9.49e+00 - 6.66e-03 4.62e-02f 1 2 4.6753558e+05 3.55e-01 5.75e+01 -0.2 8.46e+00 - 1.81e-02 9.07e-01f 1 3 1.6390057e+05 2.66e-15 6.41e+00 0.2 1.02e+01 - 1.94e-01 1.00e+00f 1 4 1.2428310e+05 3.55e-15 1.60e+00 -0.1 1.07e+01 - 3.33e-01 6.98e-01f 1 5 9.6744813e+04 4.44e-15 4.83e-01 -0.5 1.56e+01 - 4.63e-01 7.16e-01f 1 6 8.6765953e+04 3.55e-15 1.99e-01 -1.0 1.01e+01 - 5.51e-01 6.72e-01f 1 7 8.3141768e+04 4.44e-15 7.50e-02 -1.6 6.03e+00 - 7.02e-01 6.29e-01f 1 8 8.1402766e+04 4.44e-15 1.90e-02 -2.2 3.20e+00 - 6.92e-01 7.57e-01f 1 9 8.0913475e+04 3.55e-15 2.39e-02 -4.4 8.33e-01 - 9.22e-01 7.90e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 8.0783467e+04 6.22e-15 8.21e-03 -5.9 6.28e-01 - 9.50e-01 8.77e-01f 1 11 8.0758206e+04 3.55e-15 7.24e-04 -7.2 2.99e-01 - 9.65e-01 9.52e-01f 1 12 8.0755099e+04 3.55e-15 1.92e-05 -8.6 8.50e-02 - 9.91e-01 9.89e-01f 1 13 8.0754859e+04 2.89e-15 4.44e-07 -11.0 9.89e-03 - 1.00e+00 9.99e-01f 1 14 8.0754856e+04 3.55e-15 4.40e-15 -11.0 8.35e-01 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 4.5883440680617554e+02 8.0754855597886897e+04 Dual infeasibility......: 4.4023594816063449e-15 7.7481526876271671e-13 Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-15 Complementarity.........: 5.5109562181098355e-10 9.6992829438733105e-08 Overall NLP error.......: 5.5109562181098355e-10 9.6992829438733105e-08 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 15 Number of inequality constraint evaluations = 15 Number of equality constraint Jacobian evaluations = 15 Number of inequality constraint Jacobian evaluations = 15 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.013 Total CPU secs in NLP function evaluations = 0.004 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 80754.856 14 0.016997 build initial OA NLP0014I 2 OPT 113295.63 28 0.028996 OA decomposition OA0003I New best feasible of 113295.63 found after 0.835873 sec and NLP0014I 3 OPT 91804.37 36 0.036994 OA decomposition OA0003I New best feasible of 91804.37 found after 1.234812 sec and NLP0014I 4 OPT 91969.957 30 0.031995 OA decomposition NLP0014I 5 OPT 88135.422 29 0.029996 OA decomposition OA0003I New best feasible of 88135.422 found after 2.913557 sec and NLP0014I 6 OPT 86465.927 25 0.026996 OA decomposition OA0003I New best feasible of 86465.927 found after 3.809421 sec and NLP0014I 7 OPT 105007.76 33 0.034995 OA decomposition NLP0014I 8 OPT 90404.623 31 0.030995 OA decomposition NLP0014I 9 OPT 88046.083 29 0.029996 OA decomposition NLP0014I 10 OPT 93965.237 27 0.027996 OA decomposition NLP0014I 11 OPT 86724.623 29 0.029996 OA decomposition NLP0014I 12 OPT 86822.497 29 0.028996 OA decomposition NLP0014I 13 OPT 87872.333 26 0.025996 OA decomposition NLP0014I 14 OPT 85921.277 40 0.046992 OA decomposition OA0003I New best feasible of 85921.277 found after 16.420503 sec and NLP0014I 15 OPT 88247.323 30 0.031995 OA decomposition NLP0014I 16 OPT 85508.533 29 0.028995 OA decomposition OA0003I New best feasible of 85508.533 found after 18.801141 sec and NLP0014I 17 OPT 84960.212 27 0.026996 OA decomposition OA0003I New best feasible of 84960.212 found after 20.835832 sec and NLP0014I 18 OPT 88613.492 31 0.032995 OA decomposition NLP0014I 19 OPT 87444.615 32 0.030996 OA decomposition NLP0014I 20 OPT 87309.641 27 0.027995 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 86197.382 26 0.025996 OA decomposition NLP0014I 22 OPT 93053.627 33 0.032995 OA decomposition NLP0014I 23 OPT 88970.539 29 0.029995 OA decomposition NLP0014I 24 OPT 87625.733 29 0.029996 OA decomposition OA0008I OA converged in 34.787711 seconds found solution of value 84960.212 (lower bound 1e+50 ). OA0010I Performed 23 iterations, explored 36780 branch-and-bound nodes in total Cbc0012I Integer solution of 84960.212 found by nonlinear programm after 96 iterations and 0 nodes (34.79 seconds) Cbc0031I 4 added rows had average density of 73 Cbc0013I At root node, 4 cuts changed objective from 80754.856 to 80754.856 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 23 row cuts average 73.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 84960.21241678768, took 96 iterations and 0 nodes (34.79 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 23 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 84960.2. Best solution: 8.496021e+04 (0 nodes, 34.94 seconds) Best possible: 8.496021e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay08H.gms(1864) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay08H.gms Stop 09/08/12 19:59:35 elapsed 0:00:35.031 @04 1347127175 ----------------------------- Sa 8. Sep 19:59:35 CEST 2012 ----------------------------- =ready= Linux opt224 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay08M.gms =========== ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- @03 1347127140 --- Job SLay08M.gms Start 09/08/12 19:59:00 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay08M.gms(633) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- SLay08M.gms(631) 3 Mb --- Generating MIQCP model m --- SLay08M.gms(633) 5 Mb --- 253 rows 185 columns 857 non-zeroes --- 67 nl-code 16 nl-non-zeroes --- 112 discrete-columns --- SLay08M.gms(633) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 112 Number of nonzeros in inequality constraint Jacobian.: 672 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 184 variables with only lower bounds: 56 variables with lower and upper bounds: 128 variables with only upper bounds: 0 Total number of equality constraints.................: 28 Total number of inequality constraints...............: 224 inequality constraints with only lower bounds: 112 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 112 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.3007781e+05 3.02e+00 3.62e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.0722586e+05 1.11e-16 7.95e+02 0.9 1.18e+01 - 9.56e-03 1.00e+00f 1 2 1.6991481e+05 1.11e-16 3.02e+02 0.3 1.32e+01 - 4.10e-01 6.21e-01f 1 3 1.1471585e+05 2.22e-16 7.26e+01 -0.1 1.53e+01 - 5.23e-01 7.60e-01f 1 4 9.2706564e+04 2.22e-16 1.86e+01 -1.2 9.33e+00 - 7.72e-01 7.45e-01f 1 5 8.4643623e+04 2.22e-16 6.86e+00 -2.6 4.10e+00 - 9.02e-01 6.88e-01f 1 6 8.1821884e+04 1.11e-16 2.18e+00 -3.1 2.75e+00 - 9.02e-01 7.09e-01f 1 7 8.0984137e+04 2.22e-16 4.34e-01 -3.9 1.85e+00 - 9.66e-01 8.10e-01f 1 8 8.0798850e+04 2.22e-16 5.73e-02 -4.8 1.01e+00 - 9.49e-01 8.69e-01f 1 9 8.0760937e+04 2.22e-16 3.00e-03 -5.9 4.54e-01 - 9.92e-01 9.48e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 8.0755444e+04 2.22e-16 1.56e-04 -7.2 2.28e-01 - 9.99e-01 9.89e-01f 1 11 8.0754873e+04 2.22e-16 2.02e-06 -9.8 2.33e-02 - 1.00e+00 9.99e-01f 1 12 8.0754856e+04 2.22e-16 4.48e-15 -11.0 3.30e-01 - 1.00e+00 1.00e+00f 1 13 8.0754856e+04 2.22e-16 4.20e-15 -11.0 4.90e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 4.5883440680257098e+02 8.0754855597252492e+04 Dual infeasibility......: 4.2006485715112796e-15 7.3931414858598521e-13 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 1.1459972980346276e-11 2.0169552445409448e-09 Overall NLP error.......: 1.1459972980346276e-11 2.0169552445409448e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 Number of equality constraint Jacobian evaluations = 14 Number of inequality constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.017 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 80754.856 13 0.017997 build initial OA NLP0014I 2 OPT 98100.879 22 0.023997 OA decomposition OA0003I New best feasible of 98100.879 found after 0.06799 sec and NLP0014I 3 OPT 95680.071 23 0.023996 OA decomposition OA0003I New best feasible of 95680.071 found after 0.201969 sec and NLP0014I 4 OPT 90241.142 24 0.022996 OA decomposition OA0003I New best feasible of 90241.142 found after 0.359945 sec and NLP0014I 5 OPT 91861.342 23 0.021996 OA decomposition NLP0014I 6 OPT 86465.927 18 0.019997 OA decomposition OA0003I New best feasible of 86465.927 found after 0.745887 sec and NLP0014I 7 OPT 90716.985 28 0.016997 OA decomposition NLP0014I 8 OPT 88035.927 18 0.007999 OA decomposition NLP0014I 9 OPT 87598.087 18 0.008999 OA decomposition NLP0014I 10 OPT 86317.08 19 0.009999 OA decomposition OA0003I New best feasible of 86317.08 found after 1.568762 sec and NLP0014I 11 OPT 87192.825 18 0.008998 OA decomposition NLP0014I 12 OPT 86197.382 17 0.008999 OA decomposition OA0003I New best feasible of 86197.382 found after 1.923708 sec and NLP0014I 13 OPT 85508.533 18 0.007999 OA decomposition OA0003I New best feasible of 85508.533 found after 2.071685 sec and NLP0014I 14 OPT 94158.086 21 0.009998 OA decomposition NLP0014I 15 OPT 84960.212 15 0.007999 OA decomposition OA0003I New best feasible of 84960.212 found after 2.444629 sec and NLP0014I 16 OPT 87872.333 14 0.006998 OA decomposition NLP0014I 17 OPT 85933.51 17 0.007999 OA decomposition NLP0014I 18 OPT 86811.558 26 0.014998 OA decomposition NLP0014I 19 OPT 85902.921 28 0.014998 OA decomposition NLP0014I 20 OPT 88822.871 23 0.010999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 87622.362 18 0.008999 OA decomposition OA0008I OA converged in 3.889409 seconds found solution of value 84960.212 (lower bound 1e+50 ). OA0010I Performed 20 iterations, explored 9365 branch-and-bound nodes in total Cbc0012I Integer solution of 84960.212 found by nonlinear programm after 0 iterations and 0 nodes (3.89 seconds) Cbc0013I At root node, 0 cuts changed objective from 80754.856 to 80754.856 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 84960.21241054076, took 0 iterations and 0 nodes (3.89 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 84960.2. Best solution: 8.496021e+04 (0 nodes, 3.917 seconds) Best possible: 8.496021e+04 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay08M.gms(633) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay08M.gms Stop 09/08/12 19:59:04 elapsed 0:00:04.034 @04 1347127144 ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- =ready= Linux opt202 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay09H.gms =========== ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- @03 1347127140 --- Job SLay09H.gms Start 09/08/12 19:59:00 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay09H.gms(2383) 2 Mb --- Starting execution: elapsed 0:00:00.012 --- SLay09H.gms(2381) 3 Mb --- Generating MIQCP model m --- SLay09H.gms(2383) 6 Mb --- 1,045 rows 811 columns 2,971 non-zeroes --- 75 nl-code 18 nl-non-zeroes --- 144 discrete-columns --- SLay09H.gms(2383) 3 Mb --- Executing BONMIN: elapsed 0:00:00.016 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 864 Number of nonzeros in inequality constraint Jacobian.: 2016 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 810 variables with only lower bounds: 648 variables with lower and upper bounds: 162 variables with only upper bounds: 0 Total number of equality constraints.................: 180 Total number of inequality constraints...............: 864 inequality constraints with only lower bounds: 144 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 720 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.7948719e+05 4.00e+00 1.01e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.7667642e+05 3.84e+00 1.37e+01 -0.2 9.50e+00 - 6.78e-03 4.02e-02f 1 2 5.9729586e+05 2.62e-01 4.99e+01 -0.3 8.60e+00 - 2.18e-02 9.32e-01f 1 3 1.9596753e+05 2.66e-15 5.93e+00 0.2 1.14e+01 - 2.00e-01 1.00e+00f 1 4 1.6161559e+05 2.66e-15 2.77e+00 -0.2 9.36e+00 - 3.54e-01 5.12e-01f 1 5 1.1998241e+05 3.55e-15 5.69e-01 -0.4 1.51e+01 - 4.37e-01 8.63e-01f 1 6 1.1075144e+05 4.44e-15 2.36e-01 -1.0 9.45e+00 - 5.97e-01 5.81e-01f 1 7 1.0640741e+05 4.44e-15 1.17e-01 -1.6 6.47e+00 - 6.81e-01 5.61e-01f 1 8 1.0396686e+05 3.55e-15 3.87e-02 -1.9 3.79e+00 - 6.10e-01 7.61e-01f 1 9 1.0341742e+05 2.66e-15 5.80e-02 -3.8 1.06e+00 - 8.84e-01 6.61e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.0317715e+05 3.55e-15 3.71e-03 -4.3 7.31e-01 - 8.29e-01 8.64e-01f 1 11 1.0313311e+05 3.55e-15 1.91e-03 -5.6 3.94e-01 - 8.94e-01 9.30e-01f 1 12 1.0312684e+05 2.66e-15 2.47e-04 -7.2 1.92e-01 - 9.66e-01 9.77e-01f 1 13 1.0312616e+05 4.44e-15 2.71e-05 -7.9 9.50e-02 - 9.96e-01 1.00e+00f 1 14 1.0312606e+05 3.55e-15 1.38e-13 -7.9 8.18e-01 - 1.00e+00 1.00e+00f 1 15 1.0312603e+05 2.66e-15 3.09e-14 -8.5 2.87e-01 - 1.00e+00 1.00e+00f 1 16 1.0312603e+05 4.44e-15 6.48e-15 -9.2 2.09e-01 - 1.00e+00 1.00e+00f 1 17 1.0312603e+05 3.55e-15 7.37e-15 -10.2 8.96e-02 - 1.00e+00 1.00e+00f 1 18 1.0312603e+05 4.44e-15 5.56e-15 -11.0 1.15e-01 - 1.00e+00 1.00e+00h 1 19 1.0312603e+05 4.44e-15 4.35e-15 -11.0 6.35e-01 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 19 (scaled) (unscaled) Objective...............: 5.8594334773298363e+02 1.0312602920100512e+05 Dual infeasibility......: 4.3473317335847615e-15 7.6513038511091803e-13 Constraint violation....: 4.4408920985006262e-15 4.4408920985006262e-15 Complementarity.........: 3.5768699814956167e-10 6.2952911674322853e-08 Overall NLP error.......: 3.5768699814956167e-10 6.2952911674322853e-08 Number of objective function evaluations = 20 Number of objective gradient evaluations = 20 Number of equality constraint evaluations = 20 Number of inequality constraint evaluations = 20 Number of equality constraint Jacobian evaluations = 20 Number of inequality constraint Jacobian evaluations = 20 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.024 Total CPU secs in NLP function evaluations = 0.004 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 103126.03 19 0.027996 build initial OA NLP0014I 2 OPT 122794.91 39 0.046993 OA decomposition OA0003I New best feasible of 122794.91 found after 1.633751 sec and NLP0014I 3 OPT 116979.71 44 0.053992 OA decomposition OA0003I New best feasible of 116979.71 found after 2.637599 sec and NLP0014I 4 OPT 116030.55 39 0.046992 OA decomposition OA0003I New best feasible of 116030.55 found after 3.882409 sec and NLP0014I 5 OPT 110637.09 35 0.043993 OA decomposition OA0003I New best feasible of 110637.09 found after 6.132067 sec and NLP0014I 6 OPT 110968.25 35 0.041994 OA decomposition NLP0014I 7 OPT 109827.31 33 0.040994 OA decomposition OA0003I New best feasible of 109827.31 found after 15.140698 sec and NLP0014I 8 OPT 108591.1 32 0.037995 OA decomposition OA0003I New best feasible of 108591.1 found after 17.445348 sec and NLP0014I 9 OPT 114768.39 34 0.040994 OA decomposition NLP0014I 10 OPT 110383.15 28 0.035994 OA decomposition NLP0014I 11 OPT 109090.41 39 0.046993 OA decomposition NLP0014I 12 OPT 117008.87 30 0.037994 OA decomposition NLP0014I 13 OPT 114449.64 38 0.045993 OA decomposition NLP0014I 14 OPT 117414.24 41 0.050992 OA decomposition NLP0014I 15 OPT 109889.79 40 0.056991 OA decomposition NLP0014I 16 OPT 109513.19 38 0.046992 OA decomposition NLP0014I 17 OPT 114152.92 37 0.044993 OA decomposition NLP0014I 18 OPT 107805.75 31 0.039994 OA decomposition OA0003I New best feasible of 107805.75 found after 75.221564 sec and NLP0014I 19 OPT 111571.08 36 0.043994 OA decomposition NLP0014I 20 OPT 110555.39 35 0.041993 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 115548.86 40 0.047993 OA decomposition OA0012I After 102.52641.1f seconds, 21 iterations upper bound 107804.670g, lower bound 107010.610g NLP0014I 22 OPT 108645.31 36 0.044993 OA decomposition NLP0014I 23 OPT 114439.34 38 0.047993 OA decomposition NLP0014I 24 OPT 109210.37 29 0.035994 OA decomposition NLP0014I 25 OPT 114390.08 39 0.046993 OA decomposition NLP0014I 26 OPT 112347.09 33 0.037994 OA decomposition NLP0014I 27 OPT 119615.53 34 0.041993 OA decomposition NLP0014I 28 OPT 108454.86 31 0.038994 OA decomposition NLP0014I 29 OPT 110765.42 28 0.035995 OA decomposition OA0008I OA converged in 163.82609 seconds found solution of value 107805.75 (lower bound 1e+50 ). OA0010I Performed 28 iterations, explored 96888 branch-and-bound nodes in total Cbc0012I Integer solution of 107805.75 found by nonlinear programm after 142 iterations and 0 nodes (163.83 seconds) Cbc0031I 5 added rows had average density of 91 Cbc0013I At root node, 5 cuts changed objective from 103126.03 to 103126.03 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 25 row cuts average 91.0 elements, 0 column cuts (5 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 107805.7529289219, took 142 iterations and 0 nodes (163.83 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 25 cuts of which 5 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 107806. Best solution: 1.078058e+05 (0 nodes, 164.423 seconds) Best possible: 1.078058e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay09H.gms(2383) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay09H.gms Stop 09/08/12 20:01:45 elapsed 0:02:44.533 @04 1347127305 ----------------------------- Sa 8. Sep 20:01:45 CEST 2012 ----------------------------- =ready= Linux opt232 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay09M.gms =========== ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- @03 1347127140 --- Job SLay09M.gms Start 09/08/12 19:59:00 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay09M.gms(798) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- SLay09M.gms(796) 3 Mb --- Generating MIQCP model m --- SLay09M.gms(798) 5 Mb --- 325 rows 235 columns 1,099 non-zeroes --- 75 nl-code 18 nl-non-zeroes --- 144 discrete-columns --- SLay09M.gms(798) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 144 Number of nonzeros in inequality constraint Jacobian.: 864 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 234 variables with only lower bounds: 72 variables with lower and upper bounds: 162 variables with only upper bounds: 0 Total number of equality constraints.................: 36 Total number of inequality constraints...............: 288 inequality constraints with only lower bounds: 144 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 144 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.7948719e+05 3.02e+00 4.07e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.8949278e+05 1.11e-16 7.93e+02 0.9 1.20e+01 - 9.87e-03 1.00e+00f 1 2 2.0381610e+05 2.22e-16 2.69e+02 0.3 1.24e+01 - 3.97e-01 6.62e-01f 1 3 1.4935775e+05 2.22e-16 8.97e+01 -0.2 1.33e+01 - 5.53e-01 6.66e-01f 1 4 1.1886825e+05 1.11e-16 2.26e+01 -1.0 9.84e+00 - 7.42e-01 7.48e-01f 1 5 1.0861713e+05 2.22e-16 9.18e+00 -2.4 4.18e+00 - 8.83e-01 6.43e-01f 1 6 1.0437014e+05 2.22e-16 2.75e+00 -3.1 2.71e+00 - 9.01e-01 7.20e-01f 1 7 1.0369291e+05 2.22e-16 1.32e+00 -3.4 1.30e+00 - 9.44e-01 5.38e-01f 1 8 1.0322970e+05 2.22e-16 2.10e-01 -4.1 1.25e+00 - 7.42e-01 8.41e-01f 1 9 1.0314516e+05 2.22e-16 2.39e-02 -4.9 5.98e-01 - 8.79e-01 8.86e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.0312860e+05 2.22e-16 9.85e-04 -6.0 3.05e-01 - 9.81e-01 9.59e-01f 1 11 1.0312634e+05 2.22e-16 1.78e-12 -6.7 4.86e-01 - 1.00e+00 1.00e+00f 1 12 1.0312609e+05 2.22e-16 7.85e-13 -7.1 1.95e+00 - 1.00e+00 1.00e+00f 1 13 1.0312604e+05 2.22e-16 1.87e-13 -7.7 5.74e-01 - 1.00e+00 1.00e+00f 1 14 1.0312603e+05 2.22e-16 4.15e-14 -8.4 4.02e-01 - 1.00e+00 1.00e+00f 1 15 1.0312603e+05 2.22e-16 9.16e-15 -9.2 2.35e-01 - 1.00e+00 1.00e+00f 1 16 1.0312603e+05 2.22e-16 9.03e-15 -10.4 6.63e-02 - 1.00e+00 1.00e+00f 1 17 1.0312603e+05 2.22e-16 5.30e-15 -11.0 2.94e-01 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 17 (scaled) (unscaled) Objective...............: 5.8594334773301898e+02 1.0312602920101133e+05 Dual infeasibility......: 5.3017975788037918e-15 9.3311637386946735e-13 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 7.5368577915973696e-09 1.3264869713211371e-06 Overall NLP error.......: 7.5368577915973696e-09 1.3264869713211371e-06 Number of objective function evaluations = 18 Number of objective gradient evaluations = 18 Number of equality constraint evaluations = 18 Number of inequality constraint evaluations = 18 Number of equality constraint Jacobian evaluations = 18 Number of inequality constraint Jacobian evaluations = 18 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.023 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 103126.03 17 0.024996 build initial OA NLP0014I 2 OPT 112638.39 29 0.032995 OA decomposition OA0003I New best feasible of 112638.39 found after 0.103984 sec and NLP0014I 3 OPT 117734.37 26 0.029995 OA decomposition NLP0014I 4 OPT 112294.52 17 0.008999 OA decomposition OA0003I New best feasible of 112294.52 found after 0.59291 sec and NLP0014I 5 OPT 109827.31 21 0.010999 OA decomposition OA0003I New best feasible of 109827.31 found after 0.683896 sec and NLP0014I 6 OPT 108591.1 24 0.010998 OA decomposition OA0003I New best feasible of 108591.1 found after 0.806877 sec and NLP0014I 7 OPT 112915.6 25 0.011998 OA decomposition NLP0014I 8 OPT 110967.22 24 0.012998 OA decomposition NLP0014I 9 OPT 108870.75 20 0.009999 OA decomposition NLP0014I 10 OPT 114449.64 24 0.012998 OA decomposition NLP0014I 11 OPT 109084.31 31 0.019997 OA decomposition NLP0014I 12 OPT 116527.64 24 0.013998 OA decomposition NLP0014I 13 OPT 109889.79 28 0.017997 OA decomposition NLP0014I 14 OPT 109513.19 32 0.020996 OA decomposition NLP0014I 15 OPT 111571.08 24 0.012998 OA decomposition NLP0014I 16 OPT 110402.04 22 0.009998 OA decomposition NLP0014I 17 OPT 113865.99 23 0.011998 OA decomposition NLP0014I 18 OPT 108891.42 18 0.009999 OA decomposition NLP0014I 19 OPT 114982.38 26 0.011998 OA decomposition NLP0014I 20 OPT 108645.31 30 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 114439.34 22 0.010999 OA decomposition NLP0014I 22 OPT 107805.75 20 0.010998 OA decomposition OA0003I New best feasible of 107805.75 found after 14.53279 sec and NLP0014I 23 OPT 110916.29 23 0.012998 OA decomposition NLP0014I 24 OPT 112846.27 21 0.010999 OA decomposition NLP0014I 25 OPT 108454.86 19 0.010998 OA decomposition NLP0014I 26 OPT 110318.71 22 0.012998 OA decomposition OA0008I OA converged in 23.062494 seconds found solution of value 107805.75 (lower bound 1e+50 ). OA0010I Performed 25 iterations, explored 39710 branch-and-bound nodes in total Cbc0012I Integer solution of 107805.75 found by nonlinear programm after 23 iterations and 0 nodes (23.06 seconds) Cbc0031I 7 added rows had average density of 91 Cbc0013I At root node, 7 cuts changed objective from 103126.03 to 103126.03 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 24 row cuts average 91.0 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 107805.7529202515, took 23 iterations and 0 nodes (23.06 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 24 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 107806. Best solution: 1.078058e+05 (0 nodes, 23.211 seconds) Best possible: 1.078058e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay09M.gms(798) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay09M.gms Stop 09/08/12 19:59:24 elapsed 0:00:23.341 @04 1347127164 ----------------------------- Sa 8. Sep 19:59:24 CEST 2012 ----------------------------- =ready= Linux opt228 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay10H.gms =========== ----------------------------- Sa 8. Sep 19:59:00 CEST 2012 ----------------------------- @03 1347127140 --- Job SLay10H.gms Start 09/08/12 19:59:00 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay10H.gms(2966) 2 Mb --- Starting execution: elapsed 0:00:00.014 --- SLay10H.gms(2964) 3 Mb --- Generating MIQCP model m --- SLay10H.gms(2966) 6 Mb --- 1,306 rows 1,011 columns 3,711 non-zeroes --- 83 nl-code 20 nl-non-zeroes --- 180 discrete-columns --- SLay10H.gms(2966) 3 Mb --- Executing BONMIN: elapsed 0:00:00.018 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1080 Number of nonzeros in inequality constraint Jacobian.: 2520 Number of nonzeros in Lagrangian Hessian.............: 20 Total number of variables............................: 1010 variables with only lower bounds: 810 variables with lower and upper bounds: 200 variables with only upper bounds: 0 Total number of equality constraints.................: 225 Total number of inequality constraints...............: 1080 inequality constraints with only lower bounds: 180 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 900 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 8.1768694e+05 4.00e+00 8.92e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.1539213e+05 3.85e+00 1.19e+01 -0.3 9.51e+00 - 7.08e-03 3.64e-02f 1 2 6.2977718e+05 1.17e-15 4.30e+01 -0.4 8.66e+00 - 2.72e-02 1.00e+00f 1 3 2.0992994e+05 3.55e-15 4.94e+00 0.2 1.15e+01 - 2.29e-01 1.00e+00f 1 4 1.7458567e+05 3.55e-15 2.10e+00 -0.2 9.01e+00 - 3.60e-01 5.47e-01f 1 5 1.4153759e+05 3.55e-15 5.57e-01 -0.5 1.37e+01 - 4.31e-01 6.77e-01f 1 6 1.2861255e+05 4.44e-15 2.52e-01 -1.1 1.05e+01 - 5.94e-01 5.63e-01f 1 7 1.2262554e+05 4.44e-15 9.53e-02 -1.5 6.87e+00 - 6.14e-01 6.19e-01f 1 8 1.1975399e+05 5.33e-15 7.12e-02 -2.1 3.52e+00 - 6.67e-01 8.56e-01f 1 9 1.1929378e+05 3.55e-15 2.04e-02 -3.5 8.72e-01 - 8.60e-01 7.28e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.1912350e+05 3.55e-15 2.09e-03 -4.4 6.91e-01 - 8.54e-01 8.90e-01f 1 11 1.1909657e+05 2.66e-15 6.68e-04 -6.0 3.45e-01 - 9.41e-01 9.25e-01f 1 12 1.1909165e+05 3.55e-15 6.02e-04 -7.6 1.60e-01 - 9.82e-01 9.56e-01f 1 13 1.1909063e+05 4.44e-15 5.41e-04 -7.8 5.62e-02 - 1.00e+00 9.43e-01f 1 14 1.1909038e+05 4.44e-15 7.67e-05 -9.0 1.31e-01 - 1.00e+00 9.75e-01f 1 15 1.1909034e+05 3.55e-15 8.91e-15 -11.0 2.11e-02 - 1.00e+00 1.00e+00f 1 16 1.1909034e+05 3.55e-15 6.14e-15 -11.0 1.98e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 16 (scaled) (unscaled) Objective...............: 6.7664968325032635e+02 1.1909034425205743e+05 Dual infeasibility......: 6.1386234904531656e-15 1.0803977343197571e-12 Constraint violation....: 3.5527136788005009e-15 3.5527136788005009e-15 Complementarity.........: 6.7669866237792064e-11 1.1909896457851403e-08 Overall NLP error.......: 6.7669866237792064e-11 1.1909896457851403e-08 Number of objective function evaluations = 17 Number of objective gradient evaluations = 17 Number of equality constraint evaluations = 17 Number of inequality constraint evaluations = 17 Number of equality constraint Jacobian evaluations = 17 Number of inequality constraint Jacobian evaluations = 17 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.026 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 119090.34 16 0.030995 build initial OA NLP0014I 2 OPT 151116.27 48 0.068989 OA decomposition OA0003I New best feasible of 151116.27 found after 1.925707 sec and NLP0014I 3 OPT 191218.96 43 0.06399 OA decomposition NLP0014I 4 OPT 140921.34 42 0.06199 OA decomposition OA0003I New best feasible of 140921.34 found after 12.054167 sec and NLP0014I 5 OPT 135553.22 41 0.059991 OA decomposition OA0003I New best feasible of 135553.22 found after 17.046409 sec and NLP0014I 6 OPT 131264.47 39 0.055992 OA decomposition OA0003I New best feasible of 131264.47 found after 22.082643 sec and NLP0014I 7 OPT 146648.39 41 0.05999 OA decomposition NLP0014I 8 OPT 129920.05 42 0.060991 OA decomposition OA0003I New best feasible of 129920.05 found after 44.226277 sec and NLP0014I 9 OPT 143369.53 54 0.091986 OA decomposition NLP0014I 10 OPT 134259.91 50 0.082987 OA decomposition OA0012I After 104.86806.1f seconds, 10 iterations upper bound 129918.750g, lower bound 123878.290g NLP0014I 11 OPT 140450.21 41 0.069989 OA decomposition NLP0014I 12 OPT 133717.66 45 0.06699 OA decomposition NLP0014I 13 OPT 136678.31 55 0.087987 OA decomposition NLP0014I 14 OPT 141420.64 45 0.063991 OA decomposition OA0012I After 221.95226.1f seconds, 14 iterations upper bound 129918.750g, lower bound 124633.20g NLP0014I 15 OPT 137453.61 38 0.055991 OA decomposition OA0012I After 337.4477.1f seconds, 15 iterations upper bound 129918.750g, lower bound 124938.480g NLP0014I 16 OPT 145214.84 44 0.061991 OA decomposition NLP0014I 17 OPT 133128.1 40 0.056991 OA decomposition OA0012I After 456.25364.1f seconds, 17 iterations upper bound 129918.750g, lower bound 125432.080g NLP0014I 18 OPT 140872.64 41 0.072989 OA decomposition NLP0014I 19 OPT 129883.1 44 0.074989 OA decomposition OA0003I New best feasible of 129883.1 found after 513.7389 sec and OA0012I After 600.24075.1f seconds, 19 iterations upper bound 129881.80g, lower bound 125657.090g NLP0014I 20 OPT 138091.23 41 0.072988 OA decomposition OA0012I After 824.47366.1f seconds, 20 iterations upper bound 129881.80g, lower bound 125885.480g NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 144712.67 44 0.078988 OA decomposition OA0012I After 942.72468.1f seconds, 21 iterations upper bound 129881.80g, lower bound 125927.760g NLP0014I 22 OPT 133671.81 45 0.06499 OA decomposition OA0012I After 1188.0774.1f seconds, 22 iterations upper bound 129881.80g, lower bound 125967.070g NLP0014I 23 OPT 132578.14 42 0.058991 OA decomposition NLP0014I 24 OPT 130144.13 40 0.058991 OA decomposition OA0012I After 1365.7744.1f seconds, 24 iterations upper bound 129881.80g, lower bound 126111.270g NLP0014I 25 OPT 137079.93 43 0.06299 OA decomposition OA0012I After 1544.8591.1f seconds, 25 iterations upper bound 129881.80g, lower bound 126277.680g NLP0014I 26 OPT 139156.55 42 0.06199 OA decomposition OA0012I After 1704.3919.1f seconds, 26 iterations upper bound 129881.80g, lower bound 126277.930g NLP0014I 27 OPT 138986.03 44 0.076988 OA decomposition OA0012I After 1836.7678.1f seconds, 27 iterations upper bound 129881.80g, lower bound 126515.70g NLP0014I 28 OPT 133724.05 35 0.050992 OA decomposition OA0012I After 1958.9262.1f seconds, 28 iterations upper bound 129881.80g, lower bound 126668.590g NLP0014I 29 OPT 133685.28 44 0.060991 OA decomposition OA0012I After 2224.2759.1f seconds, 29 iterations upper bound 129881.80g, lower bound 126730.580g NLP0014I 30 OPT 130878.97 35 0.051992 OA decomposition OA0012I After 2328.0271.1f seconds, 30 iterations upper bound 129881.80g, lower bound 126895.410g NLP0014I 31 OPT 136894.94 44 0.062991 OA decomposition OA0012I After 2711.9057.1f seconds, 31 iterations upper bound 129881.80g, lower bound 126957.330g NLP0014I 32 OPT 146060.33 45 0.080987 OA decomposition OA0012I After 2903.2746.1f seconds, 32 iterations upper bound 129881.80g, lower bound 126972.720g NLP0014I 33 OPT 129813.66 38 0.056991 OA decomposition OA0003I New best feasible of 129813.66 found after 2903.3316 sec and OA0012I After 3045.707.1f seconds, 33 iterations upper bound 129812.370g, lower bound 126976.420g NLP0014I 34 OPT 134215.84 49 0.070989 OA decomposition NLP0014I 35 OPT 132280.2 42 0.060991 OA decomposition OA0012I After 3408.2389.1f seconds, 35 iterations upper bound 129812.370g, lower bound 127252.450g NLP0014I 36 OPT 134859.51 40 0.055991 OA decomposition NLP0014I 37 OPT 137108.22 46 0.06599 OA decomposition OA0012I After 3649.7662.1f seconds, 37 iterations upper bound 129812.370g, lower bound 127372.840g NLP0014I 38 OPT 133328.6 39 0.06699 OA decomposition OA0012I After 4056.5763.1f seconds, 38 iterations upper bound 129812.370g, lower bound 127630.960g NLP0014I 39 OPT 131755.1 41 0.05999 OA decomposition OA0012I After 4208.8942.1f seconds, 39 iterations upper bound 129812.370g, lower bound 127749.350g NLP0014I 40 OPT 131447.69 40 0.057991 OA decomposition OA0012I After 4569.0894.1f seconds, 40 iterations upper bound 129812.370g, lower bound 127882.060g NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 131874.3 43 0.06299 OA decomposition OA0012I After 4670.7069.1f seconds, 41 iterations upper bound 129812.370g, lower bound 128019.080g NLP0014I 42 OPT 130031.68 44 0.063991 OA decomposition OA0012I After 5137.678.1f seconds, 42 iterations upper bound 129812.370g, lower bound 128054.60g NLP0014I 43 OPT 135086.34 43 0.061991 OA decomposition OA0012I After 5526.7378.1f seconds, 43 iterations upper bound 129812.370g, lower bound 128055.810g NLP0014I 44 OPT 130291.31 42 0.059991 OA decomposition OA0012I After 6463.1864.1f seconds, 44 iterations upper bound 129812.370g, lower bound 128289.590g NLP0014I 45 OPT 151127.59 51 0.085987 OA decomposition OA0012I After 7122.7962.1f seconds, 45 iterations upper bound 129812.370g, lower bound 128307.360g NLP0014I 46 OPT 129941.79 49 0.06799 OA decomposition NLP0014I 47 OPT 132228.37 39 0.056992 OA decomposition OA0009I OA interupted after 7200.0674 seconds found solution of value 129813.66 (lower bound 128307.36 ). OA0010I Performed 46 iterations, explored 5976489 branch-and-bound nodes in total Cbc0031I 38 added rows had average density of 111 Cbc0013I At root node, 38 cuts changed objective from 119090.34 to 119090.34 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 38 row cuts average 111.0 elements, 0 column cuts (38 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 119090.34), took 210 iterations and 0 nodes (7200.08 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 38 cuts of which 38 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 1.190903e+05 (only reliable for convex models) --- Restarting execution --- SLay10H.gms(2966) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay10H.gms Stop 09/08/12 21:59:27 elapsed 2:00:26.338 @04 1347134367 ----------------------------- Sa 8. Sep 21:59:27 CEST 2012 ----------------------------- =ready= Linux opt215 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/SLay/gms/SLay10M.gms =========== ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- @03 1347127141 --- Job SLay10M.gms Start 09/08/12 19:59:01 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- SLay10M.gms(982) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- SLay10M.gms(980) 3 Mb --- Generating MIQCP model m --- SLay10M.gms(982) 5 Mb --- 406 rows 291 columns 1,371 non-zeroes --- 83 nl-code 20 nl-non-zeroes --- 180 discrete-columns --- SLay10M.gms(982) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 180 Number of nonzeros in inequality constraint Jacobian.: 1080 Number of nonzeros in Lagrangian Hessian.............: 20 Total number of variables............................: 290 variables with only lower bounds: 90 variables with lower and upper bounds: 200 variables with only upper bounds: 0 Total number of equality constraints.................: 45 Total number of inequality constraints...............: 360 inequality constraints with only lower bounds: 180 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 180 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 8.1768694e+05 3.02e+00 3.87e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.2303387e+05 1.11e-16 7.88e+02 0.9 1.20e+01 - 9.33e-03 1.00e+00f 1 2 2.3314018e+05 2.22e-16 2.59e+02 0.3 1.21e+01 - 4.08e-01 6.72e-01f 1 3 1.7438277e+05 2.22e-16 9.09e+01 -0.3 1.17e+01 - 5.81e-01 6.48e-01f 1 4 1.3966457e+05 2.22e-16 2.71e+01 -1.0 9.43e+00 - 7.50e-01 7.04e-01f 1 5 1.2559569e+05 2.22e-16 1.02e+01 -2.2 4.10e+00 - 8.61e-01 6.55e-01f 1 6 1.2067557e+05 1.11e-16 3.28e+00 -3.0 3.15e+00 - 8.92e-01 6.96e-01f 1 7 1.1976736e+05 2.22e-16 1.45e+00 -3.2 1.64e+00 - 8.35e-01 5.67e-01f 1 8 1.1923560e+05 1.11e-16 2.85e-01 -3.8 1.39e+00 - 7.44e-01 8.03e-01f 1 9 1.1911889e+05 2.22e-16 4.03e-02 -4.8 6.55e-01 - 9.42e-01 8.61e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.1909485e+05 2.22e-16 2.02e-03 -5.9 3.41e-01 - 9.72e-01 9.50e-01f 1 11 1.1909123e+05 2.22e-16 3.59e-04 -6.7 4.13e-01 - 1.00e+00 9.82e-01f 1 12 1.1909053e+05 2.22e-16 4.10e-04 -7.4 8.99e-01 - 1.00e+00 9.45e-01f 1 13 1.1909036e+05 2.22e-16 1.54e-05 -9.2 4.76e-02 - 1.00e+00 9.93e-01f 1 14 1.1909034e+05 2.22e-16 7.14e-15 -11.0 5.70e-02 - 1.00e+00 1.00e+00f 1 15 1.1909034e+05 2.22e-16 4.36e-15 -11.0 3.39e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: 6.7664968324978599e+02 1.1909034425196233e+05 Dual infeasibility......: 4.3622666509091279e-15 7.6775893056000651e-13 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 1.4547620907800441e-11 2.5603812797728778e-09 Overall NLP error.......: 1.4547620907800441e-11 2.5603812797728778e-09 Number of objective function evaluations = 16 Number of objective gradient evaluations = 16 Number of equality constraint evaluations = 16 Number of inequality constraint evaluations = 16 Number of equality constraint Jacobian evaluations = 16 Number of inequality constraint Jacobian evaluations = 16 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.022 Total CPU secs in NLP function evaluations = 0.004 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 119090.34 15 0.025996 build initial OA NLP0014I 2 OPT 160184.21 31 0.039994 OA decomposition OA0003I New best feasible of 160184.21 found after 0.101984 sec and NLP0014I 3 OPT 193819.35 33 0.041994 OA decomposition NLP0014I 4 OPT 135882.93 40 0.023997 OA decomposition OA0003I New best feasible of 135882.93 found after 0.736888 sec and NLP0014I 5 OPT 134987.51 34 0.022996 OA decomposition OA0003I New best feasible of 134987.51 found after 1.271806 sec and NLP0014I 6 OPT 141699.08 29 0.016997 OA decomposition NLP0014I 7 OPT 132228.37 25 0.014998 OA decomposition OA0003I New best feasible of 132228.37 found after 3.637447 sec and NLP0014I 8 OPT 138719.26 35 0.018997 OA decomposition NLP0014I 9 OPT 132238.67 27 0.014998 OA decomposition NLP0014I 10 OPT 130518.41 22 0.012999 OA decomposition OA0003I New best feasible of 130518.41 found after 6.092074 sec and NLP0014I 11 OPT 137092.3 40 0.026996 OA decomposition NLP0014I 12 OPT 136840.96 37 0.020997 OA decomposition NLP0014I 13 OPT 131301.11 29 0.017998 OA decomposition NLP0014I 14 OPT 141402.76 31 0.015998 OA decomposition NLP0014I 15 OPT 137337.73 32 0.019997 OA decomposition NLP0014I 16 OPT 131755.1 27 0.014998 OA decomposition NLP0014I 17 OPT 135204.32 32 0.019997 OA decomposition NLP0014I 18 OPT 133362.24 34 0.020997 OA decomposition NLP0014I 19 OPT 133340.61 25 0.015997 OA decomposition NLP0014I 20 OPT 133168.23 32 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 129579.88 26 0.014997 OA decomposition OA0003I New best feasible of 129579.88 found after 46.600915 sec and NLP0014I 22 OPT 130429.08 30 0.015998 OA decomposition NLP0014I 23 OPT 144435.45 36 0.024997 OA decomposition NLP0014I 24 OPT 134859.15 30 0.017998 OA decomposition NLP0014I 25 OPT 139601.93 41 0.027996 OA decomposition NLP0014I 26 OPT 130365.48 27 0.016997 OA decomposition NLP0014I 27 OPT 137006.48 29 0.015998 OA decomposition OA0012I After 103.59625.1f seconds, 27 iterations upper bound 129578.590g, lower bound 127355.440g NLP0014I 28 OPT 130144.13 30 0.016997 OA decomposition NLP0014I 29 OPT 132578.14 27 0.016998 OA decomposition NLP0014I 30 OPT 129883.53 36 0.026996 OA decomposition NLP0014I 31 OPT 130523.93 28 0.016997 OA decomposition NLP0014I 32 OPT 132294.95 33 0.017998 OA decomposition NLP0014I 33 OPT 135507.07 34 0.021997 OA decomposition NLP0014I 34 OPT 139894.74 29 0.016998 OA decomposition OA0012I After 210.34502.1f seconds, 34 iterations upper bound 129578.590g, lower bound 128056.170g NLP0014I 35 OPT 131184.46 31 0.017997 OA decomposition NLP0014I 36 OPT 130767.32 27 0.016997 OA decomposition NLP0014I 37 OPT 129890.72 31 0.018997 OA decomposition NLP0014I 38 OPT 130763.42 33 0.018997 OA decomposition NLP0014I 39 OPT 147503.48 38 0.019997 OA decomposition NLP0014I 40 OPT 129793.93 36 0.022996 OA decomposition OA0012I After 329.18196.1f seconds, 40 iterations upper bound 129578.590g, lower bound 128322.590g NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 130253.57 33 0.018997 OA decomposition NLP0014I 42 OPT 147831.43 46 0.032995 OA decomposition NLP0014I 43 OPT 148063.88 41 0.026996 OA decomposition NLP0014I 44 OPT 133806.92 37 0.026996 OA decomposition OA0012I After 446.46813.1f seconds, 44 iterations upper bound 129578.590g, lower bound 128449.40g NLP0014I 45 OPT 130211.08 31 0.017997 OA decomposition NLP0014I 46 OPT 139656.03 31 0.017998 OA decomposition NLP0014I 47 OPT 144050.55 33 0.019997 OA decomposition NLP0014I 48 OPT 129813.66 28 0.016998 OA decomposition OA0012I After 577.70417.1f seconds, 48 iterations upper bound 129578.590g, lower bound 128677.240g NLP0014I 49 OPT 133867.87 33 0.019997 OA decomposition NLP0014I 50 OPT 133717.66 33 0.019997 OA decomposition NLP0014I 51 OPT 130363.44 26 0.014998 OA decomposition NLP0014I 52 OPT 129877.66 28 0.014998 OA decomposition NLP0014I 53 OPT 138270.62 33 0.019997 OA decomposition OA0012I After 725.14076.1f seconds, 53 iterations upper bound 129578.590g, lower bound 129015.920g NLP0014I 54 OPT 133128.1 29 0.016998 OA decomposition NLP0014I 55 OPT 131797.74 35 0.025996 OA decomposition NLP0014I 56 OPT 133280.38 33 0.020996 OA decomposition OA0012I After 886.27526.1f seconds, 56 iterations upper bound 129578.590g, lower bound 129124.280g NLP0014I 57 OPT 130472.7 32 0.018997 OA decomposition NLP0014I 58 OPT 130234.53 33 0.018997 OA decomposition OA0012I After 987.43689.1f seconds, 58 iterations upper bound 129578.590g, lower bound 129127.970g NLP0014I 59 OPT 129809.87 31 0.017998 OA decomposition NLP0014I 60 OPT 130589.63 29 0.017997 OA decomposition OA0012I After 1095.4205.1f seconds, 60 iterations upper bound 129578.590g, lower bound 129263.980g NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 130116.71 28 0.015998 OA decomposition NLP0014I 62 OPT 132487.06 30 0.015998 OA decomposition NLP0014I 63 OPT 134173.74 32 0.019997 OA decomposition OA0012I After 1228.1883.1f seconds, 63 iterations upper bound 129578.590g, lower bound 129310.460g NLP0014I 64 OPT 130468.71 26 0.014998 OA decomposition NLP0014I 65 OPT 132932.01 30 0.017997 OA decomposition OA0012I After 1331.6596.1f seconds, 65 iterations upper bound 129578.590g, lower bound 129356.720g NLP0014I 66 OPT 129965.05 29 0.017998 OA decomposition OA0012I After 1461.6898.1f seconds, 66 iterations upper bound 129578.590g, lower bound 129356.920g NLP0014I 67 OPT 132146.41 30 0.016997 OA decomposition OA0012I After 1583.7012.1f seconds, 67 iterations upper bound 129578.590g, lower bound 129403.70g NLP0014I 68 OPT 129773.81 29 0.015998 OA decomposition NLP0014I 69 OPT 142817.6 38 0.020997 OA decomposition OA0012I After 1719.1327.1f seconds, 69 iterations upper bound 129578.590g, lower bound 129475.170g NLP0014I 70 OPT 130031.68 29 0.016997 OA decomposition NLP0014I 71 OPT 131394.36 38 0.022997 OA decomposition NLP0014I 72 OPT 130311.23 39 0.028996 OA decomposition OA0008I OA converged in 1856.4478 seconds found solution of value 129579.88 (lower bound 1e+50 ). OA0010I Performed 71 iterations, explored 3210184 branch-and-bound nodes in total Cbc0012I Integer solution of 129579.88 found by nonlinear programm after 1 iterations and 0 nodes (1856.44 seconds) Cbc0031I 1 added rows had average density of 111 Cbc0013I At root node, 1 cuts changed objective from 119090.34 to 119090.34 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 111.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 129579.8837270502, took 1 iterations and 0 nodes (1856.44 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 129580. Best solution: 1.295799e+05 (0 nodes, 1865 seconds) Best possible: 1.295799e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- SLay10M.gms(982) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job SLay10M.gms Stop 09/08/12 20:30:06 elapsed 0:31:05.194 @04 1347129006 ----------------------------- Sa 8. Sep 20:30:06 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn10H.gms =========== ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- @03 1347127141 --- Job Syn10H.gms Start 09/08/12 19:59:01 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn10H.gms(285) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- Syn10H.gms(283) 3 Mb --- Generating MINLP model m --- Syn10H.gms(285) 5 Mb --- 113 rows 78 columns 261 non-zeroes --- 100 nl-code 18 nl-non-zeroes --- 10 discrete-columns --- Syn10H.gms(285) 3 Mb --- Executing BONMIN: elapsed 0:00:00.007 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 116 Number of nonzeros in inequality constraint Jacobian.: 126 Number of nonzeros in Lagrangian Hessian.............: 24 Total number of variables............................: 77 variables with only lower bounds: 65 variables with lower and upper bounds: 12 variables with only upper bounds: 0 Total number of equality constraints.................: 54 Total number of inequality constraints...............: 58 inequality constraints with only lower bounds: 10 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 48 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.6460000e+01 9.80e-01 1.33e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.5470023e+01 9.57e-01 1.27e+01 -0.2 4.96e+00 - 1.29e-02 2.37e-02f 1 2 -5.5320481e+01 8.51e-01 1.62e+01 -0.2 4.77e+00 - 4.37e-02 1.11e-01f 1 3 -1.8823006e+02 5.20e-01 2.40e+01 -0.3 4.90e+00 - 1.17e-01 3.89e-01f 1 4 -4.2423327e+02 3.96e-01 2.29e+01 -0.4 5.30e+00 - 1.34e-01 2.38e-01f 1 5 -7.4410003e+02 2.91e-01 1.76e+01 -0.6 8.60e+00 - 2.48e-01 2.67e-01f 1 6 -8.7882177e+02 2.30e-01 3.63e+01 -0.6 7.61e+00 - 7.83e-01 2.10e-01f 1 7 -1.0720004e+03 1.16e-01 2.20e+01 -0.8 6.81e+00 - 5.47e-01 4.94e-01f 1 8 -1.1780786e+03 5.23e-02 1.23e+01 -1.8 1.80e+00 - 7.46e-01 5.50e-01f 1 9 -1.2576062e+03 5.15e-03 4.44e+00 -3.1 7.33e-01 - 7.65e-01 9.01e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.2662587e+03 7.31e-04 2.07e+01 -4.6 2.77e-01 - 9.19e-01 8.58e-01f 1 11 -1.2671177e+03 3.40e-04 8.75e+00 -4.2 5.02e-02 - 9.18e-01 5.35e-01f 1 12 -1.2676582e+03 2.80e-05 3.07e+00 -6.5 4.75e-02 - 9.18e-01 9.18e-01f 1 13 -1.2677024e+03 3.80e-06 1.21e+01 -7.0 4.19e-03 - 9.91e-01 8.64e-01h 1 14 -1.2677067e+03 1.45e-06 4.53e+00 -6.3 5.63e-04 - 1.00e+00 6.18e-01h 1 15 -1.2677089e+03 1.81e-07 2.77e+00 -7.2 2.22e-04 - 4.36e-01 8.75e-01h 1 16 -1.2677092e+03 3.11e-08 1.07e+00 -7.9 2.85e-05 - 9.91e-01 8.28e-01h 1 17 -1.2677093e+03 1.49e-09 1.89e-01 -8.1 4.98e-06 - 1.00e+00 1.00e+00h 1 18 -1.2677093e+03 2.55e-10 1.29e+01 -11.0 1.28e-07 - 9.88e-01 9.01e-01h 1 19 -1.2677093e+03 4.44e-16 1.09e-03 -9.1 1.54e-07 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.2677093e+03 1.78e-15 1.68e+00 -11.0 1.37e-08 - 9.83e-01 7.69e-01h 1 21 -1.2677093e+03 6.17e-17 2.22e+02 -10.1 3.17e-07 - 3.94e-02 1.00e+00h 1 22 -1.2677093e+03 4.44e-16 1.48e-04 -10.1 7.23e-07 - 1.00e+00 1.00e+00h 1 23 -1.2677093e+03 4.44e-16 9.37e-01 -11.0 6.07e-08 - 8.63e-01 7.48e-01h 1 24 -1.2677093e+03 1.78e-15 8.37e-06 -10.8 4.01e-07 - 1.00e+00 1.00e+00h 1 25 -1.2677093e+03 1.78e-15 1.29e-06 -11.0 2.78e-08 - 1.00e+00 1.00e+00h 1 26 -1.2677093e+03 4.44e-16 5.93e-09 -11.0 2.14e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 26 (scaled) (unscaled) Objective...............: -2.5354185585133791e+02 -1.2677092792566896e+03 Dual infeasibility......: 5.9277370234589455e-09 2.9638685117294727e-08 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Complementarity.........: 1.0048619905059311e-11 5.0243099525296555e-11 Overall NLP error.......: 5.9277370234589455e-09 2.9638685117294727e-08 Number of objective function evaluations = 27 Number of objective gradient evaluations = 27 Number of equality constraint evaluations = 27 Number of inequality constraint evaluations = 27 Number of equality constraint Jacobian evaluations = 27 Number of inequality constraint Jacobian evaluations = 27 Number of Lagrangian Hessian evaluations = 26 Total CPU secs in IPOPT (w/o function evaluations) = 0.009 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1267.7093 26 0.009998 build initial OA NLP0014I 2 OPT -1267.3536 33 0.009998 OA decomposition OA0003I New best feasible of -1267.3536 found after 0.013998 sec and OA0008I OA converged in 0.013998 seconds found solution of value -1267.3536 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -1267.3536 found by nonlinear programm after 3 iterations and 0 nodes (0.01 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1267.7094 to -1267.7093 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1267.353550162597, took 3 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 3 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1267.35. Best solution: 1.267354e+03 (0 nodes, 0.017 seconds) Best possible: 1.267354e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn10H.gms(285) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn10H.gms Stop 09/08/12 19:59:01 elapsed 0:00:00.087 @04 1347127141 ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn10M02H.gms =========== ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- @03 1347127141 --- Job Syn10M02H.gms Start 09/08/12 19:59:01 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn10M02H.gms(692) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- Syn10M02H.gms(690) 3 Mb --- Generating MINLP model m --- Syn10M02H.gms(692) 5 Mb --- 295 rows 195 columns 673 non-zeroes --- 200 nl-code 36 nl-non-zeroes --- 40 discrete-columns --- Syn10M02H.gms(692) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 272 Number of nonzeros in inequality constraint Jacobian.: 362 Number of nonzeros in Lagrangian Hessian.............: 48 Total number of variables............................: 194 variables with only lower bounds: 130 variables with lower and upper bounds: 44 variables with only upper bounds: 0 Total number of equality constraints.................: 128 Total number of inequality constraints...............: 166 inequality constraints with only lower bounds: 20 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 146 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.2960000e+01 9.80e-01 2.59e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -5.0197875e+01 9.71e-01 2.57e+01 0.2 1.97e+01 - 5.46e-03 8.93e-03f 1 2 -6.6569647e+01 9.53e-01 2.50e+01 0.2 1.96e+01 - 2.05e-02 1.93e-02f 1 3 -2.1158537e+02 7.77e-01 4.70e+01 0.2 2.07e+01 - 3.22e-02 1.84e-01f 1 4 -3.0303490e+02 6.98e-01 2.54e+01 0.1 1.79e+01 - 2.71e-01 1.02e-01f 1 5 -7.8377181e+02 3.41e-01 2.50e+01 -0.1 1.83e+01 - 3.39e-01 5.11e-01f 1 6 -1.3860264e+03 1.39e-01 3.41e+01 -0.3 1.23e+01 - 4.07e-01 5.91e-01f 1 7 -1.8705889e+03 1.14e-01 2.18e+01 -0.9 1.67e+01 - 5.39e-01 6.34e-01f 1 8 -2.0089625e+03 1.03e-01 1.03e+02 -0.9 1.90e+01 - 8.20e-01 3.12e-01f 1 9 -2.1596428e+03 9.09e-02 1.33e+02 -1.3 2.40e+01 - 8.28e-01 3.75e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.2091154e+03 7.11e-02 2.91e+02 -1.2 1.71e+01 - 1.00e+00 2.66e-01f 1 11 -2.3003525e+03 7.02e-03 1.19e+01 -1.7 5.78e+00 - 8.54e-01 9.83e-01f 1 12 -2.3083022e+03 2.07e-03 8.39e+01 -2.9 1.83e+00 - 6.62e-01 8.42e-01f 1 13 -2.3116992e+03 5.53e-04 6.61e+01 -3.9 1.96e+00 - 7.10e-01 9.36e-01f 1 14 -2.3120258e+03 2.03e-04 1.51e+01 -5.3 3.29e-01 - 9.08e-01 7.10e-01f 1 15 -2.3121176e+03 5.84e-05 2.39e+01 -6.0 7.94e-02 - 9.68e-01 7.50e-01f 1 16 -2.3121392e+03 1.35e-05 6.75e+01 -6.1 1.82e-02 - 9.97e-01 7.80e-01h 1 17 -2.3121448e+03 1.61e-06 1.96e+01 -7.6 4.42e-03 - 8.46e-01 8.84e-01h 1 18 -2.3121453e+03 6.20e-07 2.53e+02 -7.4 4.22e-04 - 9.21e-01 6.15e-01h 1 19 -2.3121455e+03 1.04e-07 1.46e+02 -8.5 1.53e-04 - 5.66e-01 8.32e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.3121455e+03 1.56e-08 4.00e+01 -9.7 2.11e-05 - 9.84e-01 8.50e-01h 1 21 -2.3121455e+03 7.11e-15 1.26e-02 -8.1 2.45e-06 - 1.00e+00 1.00e+00h 1 22 -2.3121455e+03 1.44e-11 1.01e+01 -11.0 1.19e-06 - 9.76e-01 8.35e-01h 1 23 -2.3121455e+03 9.65e-12 1.40e-03 -9.3 9.53e-08 - 1.00e+00 1.00e+00h 1 24 -2.3121455e+03 5.91e-12 3.36e+00 -11.0 7.85e-08 - 9.89e-01 5.36e-01h 1 25 -2.3121455e+03 9.56e-13 3.11e-04 -10.1 3.87e-08 - 1.00e+00 1.00e+00h 1 26 -2.3121455e+03 2.29e-13 4.31e-02 -11.0 1.71e-08 - 7.66e-01 7.44e-01h 1 27 -2.3121455e+03 7.11e-15 8.97e-06 -10.7 2.08e-09 - 1.00e+00 1.00e+00h 1 28 -2.3121455e+03 7.11e-15 3.14e-06 -11.0 2.64e-09 - 1.00e+00 1.00e+00h 1 29 -2.3121455e+03 1.78e-15 9.24e-08 -11.0 9.50e-11 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -2.3121455e+03 7.11e-15 8.37e-11 -11.0 8.03e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 30 (scaled) (unscaled) Objective...............: -5.7090012758478667e+02 -2.3121455167183863e+03 Dual infeasibility......: 8.3690221419630006e-11 3.3894539674950154e-10 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.0006332201835257e-11 4.0525645417432794e-11 Overall NLP error.......: 8.3690221419630006e-11 3.3894539674950154e-10 Number of objective function evaluations = 31 Number of objective gradient evaluations = 31 Number of equality constraint evaluations = 31 Number of inequality constraint evaluations = 31 Number of equality constraint Jacobian evaluations = 31 Number of inequality constraint Jacobian evaluations = 31 Number of Lagrangian Hessian evaluations = 30 Total CPU secs in IPOPT (w/o function evaluations) = 0.014 Total CPU secs in NLP function evaluations = 0.004 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2312.1455 30 0.017997 build initial OA NLP0014I 2 OPT -2310.301 41 0.018997 OA decomposition OA0003I New best feasible of -2310.301 found after 0.025996 sec and OA0008I OA converged in 0.028995 seconds found solution of value -2310.301 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -2310.301 found by nonlinear programm after 5 iterations and 0 nodes (0.03 seconds) Cbc0031I 5 added rows had average density of 2.8 Cbc0013I At root node, 5 cuts changed objective from -2312.1458 to -2312.1457 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 6 row cuts average 2.8 elements, 0 column cuts (5 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2310.301010698202, took 5 iterations and 0 nodes (0.03 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 6 cuts of which 5 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2310.3. Best solution: 2.310301e+03 (0 nodes, 0.034 seconds) Best possible: 2.310301e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn10M02H.gms(692) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn10M02H.gms Stop 09/08/12 19:59:01 elapsed 0:00:00.112 @04 1347127141 ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- =ready= Linux opt218 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn10M02M.gms =========== ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- @03 1347127141 --- Job Syn10M02M.gms Start 09/08/12 19:59:01 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn10M02M.gms(471) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- Syn10M02M.gms(469) 3 Mb --- Generating MINLP model m --- Syn10M02M.gms(471) 5 Mb --- 199 rows 111 columns 501 non-zeroes --- 80 nl-code 12 nl-non-zeroes --- 40 discrete-columns --- Syn10M02M.gms(471) 3 Mb --- Executing BONMIN: elapsed 0:00:00.007 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 44 Number of nonzeros in inequality constraint Jacobian.: 418 Number of nonzeros in Lagrangian Hessian.............: 12 Total number of variables............................: 110 variables with only lower bounds: 46 variables with lower and upper bounds: 44 variables with only upper bounds: 0 Total number of equality constraints.................: 14 Total number of inequality constraints...............: 184 inequality constraints with only lower bounds: 50 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 134 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.2960000e+01 9.80e-01 3.70e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.5567437e+02 9.44e-01 3.63e+01 -0.1 1.91e+01 - 1.42e-02 3.72e-02f 1 2 -4.0135773e+02 9.27e-01 3.57e+01 -0.1 1.84e+01 - 1.61e-02 1.72e-02f 1 3 -5.7934859e+02 9.15e-01 3.52e+01 -0.2 1.82e+01 - 3.09e-02 1.31e-02f 1 4 -1.1873318e+03 8.93e-01 3.43e+01 -0.2 3.76e+01 - 9.30e-03 2.45e-02f 1 5 -1.7533128e+03 8.70e-01 3.35e+01 -0.2 3.50e+01 - 2.30e-02 2.51e-02f 1 6 -2.0790605e+03 8.34e-01 3.21e+01 -0.2 1.67e+01 - 2.75e-02 4.13e-02f 1 7 -2.2419440e+03 8.13e-01 3.13e+01 -0.2 1.87e+01 - 2.82e-02 2.62e-02f 1 8 -2.3145057e+03 8.01e-01 3.08e+01 -0.2 1.69e+01 - 6.27e-02 1.38e-02f 1 9 -2.5318292e+03 7.50e-01 2.88e+01 -0.2 1.68e+01 - 3.18e-02 6.44e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.9242070e+03 6.49e-01 5.44e+01 -0.2 1.53e+01 - 4.28e-02 1.34e-01f 1 11 -3.2533040e+03 5.92e-01 5.54e+01 -0.2 2.63e+01 - 3.01e-02 8.86e-02f 1 12 -3.5899923e+03 5.32e-01 5.00e+01 -0.3 3.05e+01 - 1.47e-01 1.02e-01f 1 13 -3.7030328e+03 5.06e-01 1.11e+02 -0.4 1.58e+01 - 2.41e-01 4.82e-02f 1 14 -3.9667143e+03 3.98e-01 8.52e+01 -0.3 1.52e+01 - 7.53e-02 2.14e-01f 1 15 -3.9888321e+03 3.86e-01 8.26e+01 -0.3 1.01e+01 - 5.20e-02 2.94e-02f 1 16 -4.2199211e+03 2.47e-01 5.33e+01 -0.4 9.59e+00 - 1.59e-01 3.61e-01f 1 17 -4.5654436e+03 2.81e-01 2.92e+01 -0.9 6.09e+00 - 3.56e-01 7.24e-01f 1 18 -4.6588327e+03 1.91e-01 1.34e+01 -1.5 5.41e+00 - 5.97e-01 7.01e-01f 1 19 -4.7100663e+03 1.42e-01 8.79e+00 -2.1 6.55e+00 - 7.59e-01 9.79e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.7152871e+03 7.94e-02 3.50e+01 -3.0 6.53e+00 - 7.84e-01 6.40e-01f 1 21 -4.7178501e+03 3.56e-02 5.32e+00 -3.7 5.52e+00 - 7.73e-01 8.57e-01f 1 22 -4.7173725e+03 8.26e-03 5.97e-01 -4.9 2.92e+00 - 9.46e-01 9.31e-01h 1 23 -4.7170681e+03 6.39e-04 3.97e-02 -6.8 8.45e-01 - 9.82e-01 9.79e-01h 1 24 -4.7170388e+03 1.07e-05 1.33e-01 -10.8 7.24e-02 - 9.87e-01 9.88e-01h 1 25 -4.7170383e+03 1.42e-06 4.75e+01 -11.0 1.25e-03 - 9.90e-01 8.67e-01h 1 26 -4.7170383e+03 1.73e-08 2.05e+00 -9.2 1.67e-04 - 9.36e-01 9.88e-01h 1 27 -4.7170383e+03 8.26e-11 5.83e-09 -9.1 2.02e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 27 (scaled) (unscaled) Objective...............: -1.1647008072875813e+03 -4.7170382695147046e+03 Dual infeasibility......: 5.8349015992589668e-09 2.3631351476998813e-08 Constraint violation....: 8.2632567455220851e-11 8.2632567455220851e-11 Complementarity.........: 1.1107791583932690e-09 4.4986555914927399e-09 Overall NLP error.......: 5.8349015992589668e-09 2.3631351476998813e-08 Number of objective function evaluations = 28 Number of objective gradient evaluations = 28 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 28 Number of inequality constraint Jacobian evaluations = 28 Number of Lagrangian Hessian evaluations = 27 Total CPU secs in IPOPT (w/o function evaluations) = 0.014 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4717.0383 27 0.013998 build initial OA NLP0014I 2 OPT -2306.3721 11 0.004999 OA decomposition OA0003I New best feasible of -2306.3721 found after 0.009999 sec and NLP0014I 3 OPT -2310.3007 12 0.005 OA decomposition OA0003I New best feasible of -2310.3007 found after 0.018998 sec and OA0008I OA converged in 0.018998 seconds found solution of value -2310.3007 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -2310.3007 found by nonlinear programm after 1 iterations and 0 nodes (0.02 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from -4717.0385 to -4717.0385 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 2 row cuts average 3.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2310.300691562413, took 1 iterations and 0 nodes (0.02 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 2 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2310.3. Best solution: 2.310301e+03 (0 nodes, 0.022 seconds) Best possible: 2.310301e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn10M02M.gms(471) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn10M02M.gms Stop 09/08/12 19:59:01 elapsed 0:00:00.096 @04 1347127141 ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn10M03H.gms =========== ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- @03 1347127141 --- Job Syn10M03H.gms Start 09/08/12 19:59:01 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn10M03H.gms(1114) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- Syn10M03H.gms(1112) 3 Mb --- Generating MINLP model m --- Syn10M03H.gms(1114) 5 Mb --- 487 rows 292 columns 1,114 non-zeroes --- 300 nl-code 54 nl-non-zeroes --- 60 discrete-columns --- Syn10M03H.gms(1114) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 408 Number of nonzeros in inequality constraint Jacobian.: 648 Number of nonzeros in Lagrangian Hessian.............: 72 Total number of variables............................: 291 variables with only lower bounds: 195 variables with lower and upper bounds: 66 variables with only upper bounds: 0 Total number of equality constraints.................: 192 Total number of inequality constraints...............: 294 inequality constraints with only lower bounds: 30 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 264 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.8820000e+01 9.80e-01 2.63e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -7.4224845e+01 9.71e-01 2.58e+01 0.2 1.97e+01 - 5.36e-03 9.34e-03f 1 2 -9.7993351e+01 9.53e-01 2.55e+01 0.2 1.96e+01 - 2.05e-02 1.83e-02f 1 3 -3.1431586e+02 7.83e-01 4.28e+01 0.2 2.06e+01 - 3.81e-02 1.78e-01f 1 4 -4.5823803e+02 6.95e-01 2.42e+01 0.1 1.80e+01 - 2.57e-01 1.12e-01f 1 5 -1.1196834e+03 3.51e-01 2.16e+01 -0.1 1.77e+01 - 3.55e-01 4.95e-01f 1 6 -1.9586084e+03 1.41e-01 3.23e+01 -0.3 1.16e+01 - 4.07e-01 5.98e-01f 1 7 -2.7365494e+03 1.24e-01 2.73e+01 -0.8 1.59e+01 - 5.33e-01 7.11e-01f 1 8 -2.9330835e+03 1.10e-01 8.57e+01 -1.0 1.86e+01 - 7.12e-01 3.25e-01f 1 9 -3.1272373e+03 9.78e-02 1.49e+02 -1.2 2.30e+01 - 7.95e-01 3.65e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.2096249e+03 7.66e-02 2.63e+02 -1.2 1.93e+01 - 6.97e-01 2.91e-01f 1 11 -3.2726392e+03 4.00e-02 2.60e+02 -1.5 6.57e+00 - 1.00e+00 4.78e-01f 1 12 -3.3406512e+03 7.13e-03 3.54e+01 -2.8 3.28e+00 - 4.92e-01 8.33e-01f 1 13 -3.3535533e+03 1.52e-03 2.28e+01 -3.1 2.23e+00 - 5.82e-01 9.20e-01f 1 14 -3.3560866e+03 4.52e-04 1.80e+01 -4.1 1.70e+00 - 7.45e-01 9.10e-01f 1 15 -3.3564286e+03 1.45e-04 1.93e+00 -5.7 3.33e-01 - 9.24e-01 7.65e-01f 1 16 -3.3565025e+03 4.26e-05 3.98e+00 -6.3 8.91e-02 - 9.32e-01 7.36e-01f 1 17 -3.3565215e+03 1.05e-05 1.25e+01 -6.4 2.37e-02 - 9.90e-01 7.62e-01h 1 18 -3.3565272e+03 1.11e-06 3.58e+00 -7.6 3.07e-02 - 8.69e-01 8.98e-01h 1 19 -3.3565277e+03 3.01e-07 1.24e+02 -7.9 7.87e-02 - 9.79e-01 7.28e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -3.3565278e+03 5.69e-08 1.25e+02 -9.2 2.12e-02 - 9.95e-01 8.11e-01h 1 21 -3.3565279e+03 8.83e-09 4.61e+01 -10.0 5.79e-02 - 9.97e-01 8.45e-01h 1 22 -3.3565279e+03 7.43e-09 3.44e+01 -8.6 1.03e+01 - 4.89e-01 1.58e-01h 1 23 -3.3565279e+03 5.87e-09 2.52e+01 -8.6 2.44e+00 - 4.93e-01 2.09e-01f 3 24 -3.3565279e+03 4.93e-11 1.40e+00 -8.6 9.72e-01 - 6.24e-01 1.00e+00h 1 25 -3.3565279e+03 8.88e-16 3.18e-03 -8.6 2.68e-01 - 1.00e+00 1.00e+00h 1 26 -3.3565279e+03 1.13e-12 3.98e+00 -11.0 9.76e-05 - 9.38e-01 7.86e-01h 1 27 -3.3565279e+03 4.64e-12 6.82e-04 -9.6 3.78e-02 - 1.00e+00 1.00e+00h 1 28 -3.3565279e+03 2.70e-12 1.87e+00 -11.0 4.96e-04 - 8.01e-01 5.50e-01h 1 29 -3.3565279e+03 7.11e-15 5.34e-05 -10.2 1.36e-02 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -3.3565279e+03 1.78e-15 4.60e-02 -11.0 1.74e-04 - 8.17e-01 7.92e-01h 1 31 -3.3565279e+03 1.78e-15 6.53e-06 -10.8 8.07e-04 - 1.00e+00 1.00e+00h 1 32 -3.3565279e+03 8.88e-16 1.15e-06 -11.0 1.10e-04 - 1.00e+00 1.00e+00h 1 33 -3.3565279e+03 7.11e-15 1.18e-08 -11.0 6.99e-05 - 1.00e+00 1.00e+00h 1 34 -3.3565279e+03 8.88e-16 1.41e-12 -11.0 2.37e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 34 (scaled) (unscaled) Objective...............: -7.8058787746771895e+02 -3.3565278731111916e+03 Dual infeasibility......: 1.4149931226725698e-12 6.0844704274920501e-12 Constraint violation....: 8.8817841970012523e-16 8.8817841970012523e-16 Complementarity.........: 1.0000932325416531e-11 4.3004008999291081e-11 Overall NLP error.......: 1.0000932325416531e-11 4.3004008999291081e-11 Number of objective function evaluations = 37 Number of objective gradient evaluations = 35 Number of equality constraint evaluations = 37 Number of inequality constraint evaluations = 37 Number of equality constraint Jacobian evaluations = 35 Number of inequality constraint Jacobian evaluations = 35 Number of Lagrangian Hessian evaluations = 34 Total CPU secs in IPOPT (w/o function evaluations) = 0.048 Total CPU secs in NLP function evaluations = 0.013 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -3356.5279 34 0.060991 build initial OA NLP0014I 2 OPT -3354.6834 31 0.044993 OA decomposition OA0003I New best feasible of -3354.6834 found after 0.067989 sec and OA0008I OA converged in 0.078988 seconds found solution of value -3354.6834 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -3354.6834 found by nonlinear programm after 9 iterations and 0 nodes (0.07 seconds) Cbc0031I 8 added rows had average density of 2.875 Cbc0013I At root node, 8 cuts changed objective from -3356.5283 to -3356.5281 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 10 row cuts average 2.8 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -3354.683367099727, took 9 iterations and 0 nodes (0.08 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 10 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 3354.68. Best solution: 3.354683e+03 (0 nodes, 0.086 seconds) Best possible: 3.354683e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn10M03H.gms(1114) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn10M03H.gms Stop 09/08/12 19:59:02 elapsed 0:00:00.256 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt218 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn10M03M.gms =========== ----------------------------- Sa 8. Sep 19:59:01 CEST 2012 ----------------------------- @03 1347127141 --- Job Syn10M03M.gms Start 09/08/12 19:59:01 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn10M03M.gms(783) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- Syn10M03M.gms(781) 3 Mb --- Generating MINLP model m --- Syn10M03M.gms(783) 5 Mb --- 343 rows 166 columns 856 non-zeroes --- 120 nl-code 18 nl-non-zeroes --- 60 discrete-columns --- Syn10M03M.gms(783) 3 Mb --- Executing BONMIN: elapsed 0:00:00.007 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 66 Number of nonzeros in inequality constraint Jacobian.: 732 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 165 variables with only lower bounds: 69 variables with lower and upper bounds: 66 variables with only upper bounds: 0 Total number of equality constraints.................: 21 Total number of inequality constraints...............: 321 inequality constraints with only lower bounds: 75 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 246 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.8820000e+01 9.80e-01 3.78e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.0465377e+02 9.47e-01 3.71e+01 -0.1 1.91e+01 - 1.56e-02 3.33e-02f 1 2 -5.5347478e+02 9.30e-01 3.64e+01 -0.1 1.85e+01 - 1.12e-02 1.86e-02f 1 3 -7.8765441e+02 9.17e-01 3.59e+01 -0.2 1.83e+01 - 3.40e-02 1.35e-02f 1 4 -1.5489416e+03 8.92e-01 3.49e+01 -0.2 2.25e+01 - 1.08e-02 2.79e-02f 1 5 -2.3326735e+03 8.69e-01 3.40e+01 -0.2 3.05e+01 - 1.81e-02 2.54e-02f 1 6 -2.7923521e+03 8.41e-01 3.29e+01 -0.2 1.80e+01 - 2.42e-02 3.25e-02f 1 7 -3.0952063e+03 8.14e-01 3.19e+01 -0.2 1.70e+01 - 4.70e-02 3.20e-02f 1 8 -3.3654180e+03 7.88e-01 3.08e+01 -0.2 1.78e+01 - 1.03e-02 3.22e-02f 1 9 -3.4840825e+03 7.71e-01 3.14e+01 -0.2 1.49e+01 - 7.53e-02 2.14e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.6751978e+03 7.41e-01 3.13e+01 -0.2 1.52e+01 - 2.93e-02 3.81e-02f 1 11 -4.3345174e+03 6.35e-01 3.70e+01 -0.2 1.70e+01 - 4.40e-02 1.44e-01f 1 12 -4.9040172e+03 5.64e-01 3.26e+01 -0.2 2.58e+01 - 9.11e-02 1.11e-01f 1 13 -5.3248541e+03 5.05e-01 2.83e+01 -0.4 2.07e+01 - 2.14e-01 1.04e-01f 1 14 -5.3629209e+03 4.96e-01 5.73e+01 -0.3 1.42e+01 - 2.72e-02 1.77e-02f 1 15 -5.5394312e+03 4.48e-01 2.50e+01 -0.3 1.37e+01 - 3.69e-02 9.69e-02f 1 16 -5.7124041e+03 3.99e-01 2.23e+01 -0.3 1.14e+01 - 1.61e-01 1.11e-01f 1 17 -5.7552562e+03 3.82e-01 2.14e+01 -0.3 9.57e+00 - 3.40e-02 4.14e-02f 1 18 -5.8905161e+03 3.26e-01 1.96e+01 -0.3 9.11e+00 - 8.39e-02 1.47e-01f 1 19 -6.4145739e+03 1.94e-01 5.26e+01 -0.5 7.81e+00 - 2.05e-01 6.65e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -6.6245292e+03 1.70e-01 2.27e+01 -1.3 4.44e+00 - 5.72e-01 5.33e-01f 1 21 -6.7547262e+03 1.57e-01 6.33e+00 -1.7 5.70e+00 - 7.33e-01 7.55e-01f 1 22 -6.8095628e+03 1.21e-01 6.15e+00 -2.6 6.74e+00 - 6.98e-01 9.41e-01f 1 23 -6.8144277e+03 5.13e-02 3.71e+00 -3.3 5.63e+00 - 7.89e-01 8.28e-01f 1 24 -6.8146066e+03 1.54e-02 2.32e+00 -4.4 3.63e+00 - 8.45e-01 9.02e-01h 1 25 -6.8140144e+03 2.26e-03 9.98e-02 -6.0 1.30e+00 - 9.37e-01 9.28e-01h 1 26 -6.8138891e+03 6.31e-05 6.40e-02 -8.0 2.16e-01 - 9.53e-01 9.87e-01h 1 27 -6.8138853e+03 1.50e-06 1.51e+00 -11.0 6.08e-03 - 9.89e-01 9.77e-01h 1 28 -6.8138852e+03 6.33e-07 5.09e+01 -10.3 1.47e-04 - 9.37e-01 5.79e-01h 1 29 -6.8138852e+03 4.11e-14 9.81e+00 -8.3 6.12e-05 - 8.51e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -6.8138852e+03 5.00e-12 1.95e-10 -8.3 1.62e-09 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 30 (scaled) (unscaled) Objective...............: -1.5846244549221556e+03 -6.8138851561652691e+03 Dual infeasibility......: 1.9467449874355225e-10 8.3710034459727463e-10 Constraint violation....: 4.9984461014673798e-12 4.9984461014673798e-12 Complementarity.........: 7.1374414117331994e-09 3.0690998070452759e-08 Overall NLP error.......: 7.1374414117331994e-09 3.0690998070452759e-08 Number of objective function evaluations = 31 Number of objective gradient evaluations = 31 Number of equality constraint evaluations = 31 Number of inequality constraint evaluations = 31 Number of equality constraint Jacobian evaluations = 31 Number of inequality constraint Jacobian evaluations = 31 Number of Lagrangian Hessian evaluations = 30 Total CPU secs in IPOPT (w/o function evaluations) = 0.019 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -6813.8852 30 0.018997 build initial OA NLP0014I 2 OPT -3354.6828 12 0.004999 OA decomposition OA0003I New best feasible of -3354.6828 found after 0.011998 sec and OA0008I OA converged in 0.016997 seconds found solution of value -3354.6828 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -3354.6828 found by nonlinear programm after 2 iterations and 0 nodes (0.02 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -6813.8854 to -6813.8854 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 6 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -3354.682796186029, took 2 iterations and 0 nodes (0.02 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 6 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 3354.68. Best solution: 3.354683e+03 (0 nodes, 0.023 seconds) Best possible: 3.354683e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn10M03M.gms(783) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn10M03M.gms Stop 09/08/12 19:59:02 elapsed 0:00:00.103 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt218 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn10M04H.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn10M04H.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn10M04H.gms(1598) 2 Mb --- Starting execution: elapsed 0:00:00.013 --- Syn10M04H.gms(1596) 3 Mb --- Generating MINLP model m --- Syn10M04H.gms(1598) 5 Mb --- 709 rows 389 columns 1,625 non-zeroes --- 400 nl-code 72 nl-non-zeroes --- 80 discrete-columns --- Syn10M04H.gms(1598) 3 Mb --- Executing BONMIN: elapsed 0:00:00.019 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 544 Number of nonzeros in inequality constraint Jacobian.: 1004 Number of nonzeros in Lagrangian Hessian.............: 96 Total number of variables............................: 388 variables with only lower bounds: 260 variables with lower and upper bounds: 88 variables with only upper bounds: 0 Total number of equality constraints.................: 256 Total number of inequality constraints...............: 452 inequality constraints with only lower bounds: 40 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 412 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -6.5469999e+01 9.80e-01 2.62e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -9.6084258e+01 9.71e-01 2.58e+01 0.2 1.97e+01 - 5.23e-03 8.78e-03f 1 2 -1.2572358e+02 9.55e-01 2.55e+01 0.2 1.96e+01 - 2.09e-02 1.64e-02f 1 3 -4.0671655e+02 7.93e-01 4.00e+01 0.2 2.06e+01 - 4.39e-02 1.70e-01f 1 4 -6.0119100e+02 6.99e-01 2.92e+01 0.1 1.81e+01 - 2.38e-01 1.19e-01f 1 5 -1.4623225e+03 3.55e-01 2.22e+01 -0.1 1.76e+01 - 3.43e-01 4.92e-01f 1 6 -2.5424463e+03 1.62e-01 3.14e+01 -0.2 1.30e+01 - 3.98e-01 5.44e-01f 1 7 -3.6561389e+03 1.26e-01 3.08e+01 -0.7 1.63e+01 - 5.35e-01 7.21e-01f 1 8 -3.8436733e+03 1.12e-01 9.42e+01 -0.9 1.82e+01 - 6.65e-01 2.15e-01f 1 9 -4.1191803e+03 1.02e-01 1.39e+02 -1.2 2.26e+01 - 7.68e-01 3.36e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.2921598e+03 8.73e-02 2.62e+02 -1.3 2.37e+01 - 1.00e+00 2.83e-01f 1 11 -4.3832894e+03 6.32e-02 2.04e+02 -1.5 1.35e+01 - 4.49e-01 3.19e-01f 1 12 -4.4648873e+03 3.05e-02 1.98e+02 -1.6 5.61e+00 - 1.00e+00 5.16e-01f 1 13 -4.5433706e+03 5.73e-03 1.52e+01 -2.8 2.59e+00 - 4.11e-01 8.59e-01f 1 14 -4.5559283e+03 1.00e-03 4.80e+01 -3.0 2.00e+00 - 5.70e-01 9.71e-01f 1 15 -4.5580209e+03 3.48e-04 8.42e+01 -3.9 2.95e+00 - 6.97e-01 8.48e-01f 1 16 -4.5586692e+03 1.04e-04 5.59e+01 -4.5 1.80e+00 - 8.71e-01 7.83e-01f 1 17 -4.5588492e+03 2.93e-05 2.49e+01 -6.2 5.50e-01 - 9.20e-01 7.46e-01f 1 18 -4.5588879e+03 9.81e-06 9.74e+01 -6.1 1.43e-01 - 9.90e-01 6.71e-01f 1 19 -4.5589055e+03 1.06e-06 5.24e+01 -7.5 4.78e-02 - 7.59e-01 8.96e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.5589072e+03 2.43e-07 1.19e+02 -8.4 1.56e-02 - 9.25e-01 8.32e-01h 1 21 -4.5589075e+03 6.11e-08 2.66e+02 -8.7 9.77e-02 - 9.83e-01 7.30e-01h 1 22 -4.5589075e+03 9.37e-09 4.96e+00 -9.7 1.02e-01 - 5.18e-01 8.27e-01h 1 23 -4.5589075e+03 4.86e-10 7.88e-01 -11.0 8.37e-03 - 9.49e-01 9.41e-01h 1 24 -4.5589075e+03 1.66e-10 4.12e+00 -9.5 4.48e+00 - 1.00e+00 6.53e-01h 1 25 -4.5589075e+03 1.23e-10 5.18e+00 -9.5 1.89e+00 - 1.00e+00 2.49e-01f 3 26 -4.5589075e+03 7.11e-15 7.50e-04 -9.5 1.42e+00 - 1.00e+00 1.00e+00h 1 27 -4.5589075e+03 1.58e-13 3.82e+00 -10.9 9.83e-05 - 8.44e-01 3.52e-01h 1 28 -4.5589075e+03 1.26e-12 2.59e-04 -10.1 3.33e-03 - 1.00e+00 1.00e+00h 1 29 -4.5589075e+03 5.87e-13 1.78e-01 -11.0 1.17e-04 - 5.66e-01 6.31e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -4.5589075e+03 7.11e-15 1.28e-05 -10.5 7.47e-04 - 1.00e+00 1.00e+00h 1 31 -4.5589075e+03 7.11e-15 7.37e-02 -11.0 6.34e-05 - 1.00e+00 8.99e-01h 1 32 -4.5589075e+03 7.11e-15 6.62e-01 -11.0 1.60e-04 - 3.83e-01 1.00e+00h 1 33 -4.5589075e+03 7.11e-15 1.12e-08 -11.0 7.29e-11 - 1.00e+00 1.00e+00h 1 34 -4.5589075e+03 7.11e-15 6.23e-11 -11.0 6.99e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 34 (scaled) (unscaled) Objective...............: -1.0602110549355762e+03 -4.5589075362229778e+03 Dual infeasibility......: 6.2307284331986068e-11 2.6792132262754007e-10 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.0160318194795363e-11 4.3689368237620061e-11 Overall NLP error.......: 6.2307284331986068e-11 2.6792132262754007e-10 Number of objective function evaluations = 37 Number of objective gradient evaluations = 35 Number of equality constraint evaluations = 37 Number of inequality constraint evaluations = 37 Number of equality constraint Jacobian evaluations = 35 Number of inequality constraint Jacobian evaluations = 35 Number of Lagrangian Hessian evaluations = 34 Total CPU secs in IPOPT (w/o function evaluations) = 0.068 Total CPU secs in NLP function evaluations = 0.015 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4558.9075 34 0.082987 build initial OA NLP0014I 2 OPT -4557.063 27 0.045993 OA decomposition OA0003I New best feasible of -4557.063 found after 0.075989 sec and OA0008I OA converged in 0.091986 seconds found solution of value -4557.063 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -4557.063 found by nonlinear programm after 13 iterations and 0 nodes (0.09 seconds) Cbc0031I 11 added rows had average density of 2.9090909 Cbc0013I At root node, 11 cuts changed objective from -4558.9081 to -4558.9079 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 14 row cuts average 2.8 elements, 0 column cuts (11 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -4557.063030207821, took 13 iterations and 0 nodes (0.09 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 14 cuts of which 11 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 4557.06. Best solution: 4.557063e+03 (0 nodes, 0.104 seconds) Best possible: 4.557063e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn10M04H.gms(1598) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn10M04H.gms Stop 09/08/12 19:59:02 elapsed 0:00:00.303 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn10M04M.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn10M04M.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn10M04M.gms(1156) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- Syn10M04M.gms(1154) 3 Mb --- Generating MINLP model m --- Syn10M04M.gms(1156) 5 Mb --- 517 rows 221 columns 1,281 non-zeroes --- 160 nl-code 24 nl-non-zeroes --- 80 discrete-columns --- Syn10M04M.gms(1156) 3 Mb --- Executing BONMIN: elapsed 0:00:00.015 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 88 Number of nonzeros in inequality constraint Jacobian.: 1116 Number of nonzeros in Lagrangian Hessian.............: 24 Total number of variables............................: 220 variables with only lower bounds: 92 variables with lower and upper bounds: 88 variables with only upper bounds: 0 Total number of equality constraints.................: 28 Total number of inequality constraints...............: 488 inequality constraints with only lower bounds: 100 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 388 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -6.5469999e+01 9.80e-01 3.74e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.7917792e+02 9.47e-01 3.67e+01 -0.1 1.91e+01 - 1.16e-02 3.38e-02f 1 2 -6.0504411e+02 9.33e-01 3.61e+01 -0.1 1.84e+01 - 8.27e-03 1.49e-02f 1 3 -1.0245951e+03 9.17e-01 3.55e+01 -0.2 1.82e+01 - 2.30e-02 1.70e-02f 1 4 -1.6725301e+03 8.98e-01 3.48e+01 -0.2 2.79e+01 - 1.41e-02 2.11e-02f 1 5 -2.6449663e+03 8.75e-01 3.39e+01 -0.2 4.04e+01 - 1.99e-02 2.52e-02f 1 6 -3.5416900e+03 8.49e-01 3.29e+01 -0.2 2.79e+01 - 2.04e-02 2.95e-02f 1 7 -3.9269714e+03 8.28e-01 3.21e+01 -0.2 1.77e+01 - 3.47e-02 2.44e-02f 1 8 -4.3425307e+03 7.98e-01 3.09e+01 -0.2 1.57e+01 - 2.03e-02 3.72e-02f 1 9 -4.6236898e+03 7.73e-01 3.00e+01 -0.2 1.57e+01 - 2.28e-02 3.07e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.8071503e+03 7.57e-01 2.94e+01 -0.2 1.61e+01 - 6.97e-02 2.04e-02f 1 11 -5.4934627e+03 6.72e-01 2.75e+01 -0.2 1.42e+01 - 3.93e-02 1.13e-01f 1 12 -6.2614753e+03 5.81e-01 5.30e+01 -0.2 2.20e+01 - 5.21e-02 1.36e-01f 1 13 -6.9866986e+03 5.17e-01 4.89e+01 -0.2 2.91e+01 - 8.36e-02 1.10e-01f 1 14 -7.0851070e+03 5.06e-01 1.57e+02 -0.3 2.09e+01 - 1.30e-01 2.14e-02f 1 15 -7.4885645e+03 4.31e-01 1.16e+02 -0.3 1.55e+01 - 3.85e-02 1.47e-01f 1 16 -7.6617337e+03 3.96e-01 1.07e+02 -0.3 1.23e+01 - 1.58e-01 8.31e-02f 1 17 -7.7349615e+03 3.75e-01 1.02e+02 -0.3 9.79e+00 - 3.50e-02 5.20e-02f 1 18 -7.9879216e+03 3.01e-01 8.21e+01 -0.3 9.13e+00 - 6.74e-02 1.96e-01f 1 19 -8.7498638e+03 2.20e-01 6.65e+01 -0.5 7.69e+00 - 2.08e-01 7.03e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.0108181e+03 1.74e-01 2.82e+01 -1.3 4.41e+00 - 5.78e-01 5.23e-01f 1 21 -9.2078932e+03 1.72e-01 1.08e+01 -1.7 5.76e+00 - 7.15e-01 8.96e-01f 1 22 -9.2442842e+03 1.09e-01 1.08e+01 -2.5 6.84e+00 - 7.23e-01 8.59e-01f 1 23 -9.2517050e+03 5.13e-02 1.60e+00 -3.4 5.81e+00 - 7.97e-01 7.86e-01f 1 24 -9.2526436e+03 1.65e-02 1.32e+00 -4.3 3.96e+00 - 8.82e-01 9.14e-01h 1 25 -9.2517346e+03 2.08e-03 1.35e-01 -6.0 1.48e+00 - 9.56e-01 9.66e-01h 1 26 -9.2515601e+03 5.89e-05 1.51e-01 -8.3 2.15e-01 - 9.64e-01 9.87e-01h 1 27 -9.2515549e+03 2.21e-06 5.29e+00 -11.0 6.57e-03 - 9.89e-01 9.63e-01h 1 28 -9.2515547e+03 7.30e-07 1.97e+00 -11.0 2.49e-04 - 9.90e-01 6.69e-01h 1 29 -9.2515547e+03 3.55e-15 2.05e+02 -8.7 8.19e-05 - 3.52e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -9.2515547e+03 8.88e-16 7.10e-10 -8.7 2.50e-09 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 30 (scaled) (unscaled) Objective...............: -2.1515243409752538e+03 -9.2515546661935914e+03 Dual infeasibility......: 7.1041429517252923e-10 3.0547814692418755e-09 Constraint violation....: 8.8817841970012523e-16 8.8817841970012523e-16 Complementarity.........: 2.4676459292861631e-09 1.0610877495930502e-08 Overall NLP error.......: 2.4676459292861631e-09 1.0610877495930502e-08 Number of objective function evaluations = 31 Number of objective gradient evaluations = 31 Number of equality constraint evaluations = 31 Number of inequality constraint evaluations = 31 Number of equality constraint Jacobian evaluations = 31 Number of inequality constraint Jacobian evaluations = 31 Number of Lagrangian Hessian evaluations = 30 Total CPU secs in IPOPT (w/o function evaluations) = 0.051 Total CPU secs in NLP function evaluations = 0.010 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9251.5547 30 0.060991 build initial OA NLP0014I 2 OPT -4557.0623 18 0.028995 OA decomposition OA0003I New best feasible of -4557.0623 found after 0.059991 sec and OA0008I OA converged in 0.074989 seconds found solution of value -4557.0623 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -4557.0623 found by nonlinear programm after 2 iterations and 0 nodes (0.07 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -9251.555 to -9251.555 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 5 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -4557.062339279812, took 2 iterations and 0 nodes (0.07 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 5 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 4557.06. Best solution: 4.557062e+03 (0 nodes, 0.082 seconds) Best possible: 4.557062e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn10M04M.gms(1156) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn10M04M.gms Stop 09/08/12 19:59:02 elapsed 0:00:00.250 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt211 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn10M.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn10M.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn10M.gms(302) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- Syn10M.gms(298) 4 Mb --- Generating MINLP model RETRO_8_SYNTH_10_MULTI_BIGM --- Syn10M.gms(302) 6 Mb --- 55 rows 36 columns 155 non-zeroes --- 40 nl-code 6 nl-non-zeroes --- 10 discrete-columns --- Syn10M.gms(302) 4 Mb --- Executing BONMIN: elapsed 0:00:00.007 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 22 Number of nonzeros in inequality constraint Jacobian.: 114 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 35 variables with only lower bounds: 23 variables with lower and upper bounds: 12 variables with only upper bounds: 0 Total number of equality constraints.................: 7 Total number of inequality constraints...............: 47 inequality constraints with only lower bounds: 15 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 32 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.6460000e+01 9.80e-01 3.60e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.2299202e+02 8.91e-01 3.80e+01 -0.3 4.53e+00 - 1.42e-02 9.13e-02f 1 2 -1.7909549e+02 8.77e-01 3.75e+01 -0.4 5.47e+00 - 2.60e-02 1.51e-02f 1 3 -5.0439335e+02 8.37e-01 3.58e+01 -0.4 1.08e+01 - 1.40e-02 4.53e-02f 1 4 -6.5481457e+02 8.08e-01 3.46e+01 -0.4 7.88e+00 - 1.03e-01 3.46e-02f 1 5 -8.0184242e+02 7.77e-01 4.80e+01 -0.5 5.81e+00 - 1.19e-01 3.86e-02f 1 6 -9.2134087e+02 7.43e-01 5.60e+01 -0.4 5.18e+00 - 1.88e-02 4.41e-02f 1 7 -1.1234572e+03 6.73e-01 6.57e+01 -0.5 5.26e+00 - 1.84e-01 9.36e-02f 1 8 -1.1438045e+03 6.62e-01 8.14e+01 -0.4 4.27e+00 - 9.76e-03 1.70e-02f 1 9 -1.5155527e+03 4.85e-01 4.79e+01 -0.7 4.98e+00 - 1.35e-01 2.67e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.6078552e+03 4.39e-01 3.02e+01 -0.8 4.97e+00 - 2.54e-01 9.58e-02f 1 11 -1.7210818e+03 3.52e-01 4.99e+01 -0.7 5.41e+00 - 6.36e-02 1.97e-01f 1 12 -1.8117147e+03 2.57e-01 3.02e+01 -0.7 2.99e+00 - 6.29e-02 2.71e-01f 1 13 -1.8224047e+03 2.47e-01 2.75e+01 -0.9 3.83e+00 - 6.14e-01 3.98e-02f 1 14 -1.8541638e+03 2.14e-01 2.58e+01 -0.9 5.87e+00 - 5.76e-02 1.33e-01f 1 15 -1.8689951e+03 1.80e-01 8.33e+01 -0.8 2.35e+00 - 5.76e-02 1.60e-01f 1 16 -1.9893789e+03 2.60e-01 1.31e+01 -1.4 3.92e+00 - 3.51e-01 9.28e-01f 1 17 -2.0015095e+03 7.71e-02 4.20e+00 -2.5 2.65e+00 - 7.42e-01 8.49e-01f 1 18 -2.0031463e+03 1.39e-02 5.76e-01 -4.3 7.57e-01 - 8.80e-01 8.40e-01f 1 19 -2.0034461e+03 3.29e-04 2.94e-02 -6.0 1.38e-01 - 9.28e-01 9.80e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.0034550e+03 4.17e-06 1.79e-03 -8.2 3.26e-03 - 9.72e-01 9.90e-01h 1 21 -2.0034558e+03 1.45e-07 4.87e-02 -10.6 5.05e-04 - 9.96e-01 9.92e-01h 1 22 -2.0034558e+03 2.33e-09 1.34e+03 -7.6 1.85e-05 - 1.48e-02 9.94e-01h 1 23 -2.0034558e+03 1.71e-16 3.02e-11 -7.6 1.33e-07 - 1.00e+00 1.00e+00h 1 24 -2.0034558e+03 1.93e-12 5.06e+00 -11.0 3.69e-07 - 9.72e-01 9.92e-01h 1 25 -2.0034558e+03 1.78e-15 1.26e+02 -9.4 5.39e-09 - 6.51e-02 9.06e-01f 1 In iteration 25, 1 Slack too small, adjusting variable bound 26 -2.0034558e+03 1.78e-15 1.25e+02 -9.4 1.03e-07 - 3.61e-02 1.14e-02f 1 In iteration 26, 1 Slack too small, adjusting variable bound 27 -2.0034558e+03 4.44e-16 7.53e+01 -9.4 3.11e-09 - 1.00e+00 4.22e-01h 1 In iteration 27, 1 Slack too small, adjusting variable bound 28 -2.0034558e+03 4.44e-16 2.71e+01 -9.4 2.87e-09 - 8.05e-01 6.53e-01h 1 29 -2.0034558e+03 1.78e-15 1.59e-12 -9.4 1.39e-09 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 29 (scaled) (unscaled) Objective...............: -4.0069116361214242e+02 -2.0034558180607121e+03 Dual infeasibility......: 1.5863771695190733e-12 7.9318858475953666e-12 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 1.8068042346683946e-09 9.0340211733419725e-09 Overall NLP error.......: 1.8068042346683946e-09 9.0340211733419725e-09 Number of objective function evaluations = 30 Number of objective gradient evaluations = 30 Number of equality constraint evaluations = 30 Number of inequality constraint evaluations = 30 Number of equality constraint Jacobian evaluations = 30 Number of inequality constraint Jacobian evaluations = 30 Number of Lagrangian Hessian evaluations = 29 Total CPU secs in IPOPT (w/o function evaluations) = 0.009 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2003.4558 29 0.009998 build initial OA NLP0014I 2 OPT -1254.3536 10 0.002999 OA decomposition OA0003I New best feasible of -1254.3536 found after 0.005999 sec and NLP0014I 3 OPT -1267.3536 9 0.003 OA decomposition OA0003I New best feasible of -1267.3536 found after 0.009999 sec and OA0008I OA converged in 0.009999 seconds found solution of value -1267.3536 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -1267.3536 found by nonlinear programm after 2 iterations and 0 nodes (0.01 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -2003.4559 to -2003.4559 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1267.353550289301, took 2 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 3 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1267.35. Best solution: 1.267354e+03 (0 nodes, 0.013 seconds) Best possible: 1.267354e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn10M.gms(302) 2 Mb --- Reading solution for model RETRO_8_SYNTH_10_MULTI_BIGM *** Status: Normal completion --- Job Syn10M.gms Stop 09/08/12 19:59:02 elapsed 0:00:00.081 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt221 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn20H.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn20H.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn20H.gms(560) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- Syn20H.gms(558) 3 Mb --- Generating MINLP model m --- Syn20H.gms(560) 5 Mb --- 234 rows 152 columns 534 non-zeroes --- 235 nl-code 42 nl-non-zeroes --- 20 discrete-columns --- Syn20H.gms(560) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 225 Number of nonzeros in inequality constraint Jacobian.: 278 Number of nonzeros in Lagrangian Hessian.............: 54 Total number of variables............................: 151 variables with only lower bounds: 127 variables with lower and upper bounds: 24 variables with only upper bounds: 0 Total number of equality constraints.................: 106 Total number of inequality constraints...............: 127 inequality constraints with only lower bounds: 27 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 100 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.8590000e+01 9.80e-01 2.58e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -5.9737688e+01 9.57e-01 2.51e+01 -0.3 4.96e+00 - 1.43e-02 2.36e-02f 1 2 -8.5843096e+01 8.71e-01 2.76e+01 -0.3 4.81e+00 - 4.38e-02 9.02e-02f 1 3 -1.3568376e+02 6.55e-01 4.04e+01 -0.4 5.14e+00 - 8.45e-02 2.48e-01f 1 4 -2.1002404e+02 4.95e-01 2.19e+01 -0.6 3.85e+00 - 3.48e-01 2.44e-01f 1 5 -4.8007313e+02 2.92e-01 1.77e+01 -0.5 6.72e+00 - 3.28e-01 4.10e-01f 1 6 -6.5319244e+02 1.58e-01 7.44e+00 -0.9 5.71e+00 - 5.21e-01 4.61e-01f 1 7 -7.6732818e+02 8.70e-02 9.03e+00 -1.1 6.37e+00 - 6.35e-01 4.48e-01f 1 8 -8.5353283e+02 3.76e-02 4.88e+00 -2.0 2.71e+00 - 6.50e-01 5.68e-01f 1 9 -8.9787676e+02 1.17e-02 2.93e+00 -2.4 2.06e+00 - 8.28e-01 6.88e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -9.2476876e+02 3.80e-04 3.21e+00 -3.3 1.95e+00 - 1.38e-01 9.68e-01f 1 11 -9.2688340e+02 4.47e-05 2.09e+00 -4.7 2.59e-01 - 8.18e-01 9.25e-01f 1 12 -9.2719211e+02 7.11e-06 1.44e+00 -6.4 1.36e-01 - 9.10e-01 9.37e-01f 1 13 -9.2721798e+02 1.76e-07 3.11e+00 -5.9 3.40e-02 - 9.90e-01 9.95e-01h 1 14 -9.2721915e+02 2.39e-08 2.74e+00 -8.5 2.64e-03 - 8.71e-01 8.65e-01h 1 15 -9.2721930e+02 3.55e-09 1.36e+01 -10.1 5.06e-04 - 9.80e-01 8.52e-01h 1 16 -9.2721932e+02 1.96e-10 1.40e+00 -11.0 1.64e-03 - 9.84e-01 9.45e-01h 1 17 -9.2721932e+02 6.08e-14 4.65e-02 -9.1 3.67e+00 - 1.00e+00 9.94e-01h 1 18 -9.2721932e+02 1.84e-14 2.97e+00 -11.0 4.02e-01 - 9.89e-01 6.97e-01h 1 19 -9.2721932e+02 3.00e-15 1.69e+00 -10.0 1.29e+00 - 1.00e+00 8.39e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.2721932e+02 1.78e-15 1.53e-05 -10.0 1.86e-01 - 1.00e+00 1.00e+00h 1 21 -9.2721932e+02 1.04e-14 7.37e-01 -11.0 3.28e-03 - 9.66e-01 7.41e-01h 1 22 -9.2721932e+02 4.44e-16 1.64e-05 -10.8 3.21e-02 - 1.00e+00 1.00e+00h 1 23 -9.2721932e+02 1.78e-15 5.22e-07 -11.0 2.31e-03 - 1.00e+00 1.00e+00h 1 24 -9.2721932e+02 1.78e-15 8.71e-09 -11.0 1.20e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 24 (scaled) (unscaled) Objective...............: -1.3245990327868597e+02 -9.2721932295080182e+02 Dual infeasibility......: 8.7132579901227913e-09 6.0992805930859539e-08 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 1.0051017961078785e-11 7.0357125727551494e-11 Overall NLP error.......: 8.7132579901227913e-09 6.0992805930859539e-08 Number of objective function evaluations = 25 Number of objective gradient evaluations = 25 Number of equality constraint evaluations = 25 Number of inequality constraint evaluations = 25 Number of equality constraint Jacobian evaluations = 25 Number of inequality constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Total CPU secs in IPOPT (w/o function evaluations) = 0.013 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -927.21932 24 0.013998 build initial OA NLP0014I 2 OPT -700.57851 37 0.017998 OA decomposition OA0003I New best feasible of -700.57851 found after 0.021997 sec and NLP0014I 3 OPT -924.26343 29 0.014998 OA decomposition OA0003I New best feasible of -924.26343 found after 0.039994 sec and OA0008I OA converged in 0.042993 seconds found solution of value -924.26343 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -924.26343 found by nonlinear programm after 9 iterations and 0 nodes (0.04 seconds) Cbc0031I 5 added rows had average density of 2.6 Cbc0013I At root node, 5 cuts changed objective from -927.2198 to -927.21974 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 11 row cuts average 2.6 elements, 0 column cuts (5 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -924.2634251051629, took 9 iterations and 0 nodes (0.04 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 11 cuts of which 5 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 924.263. Best solution: 9.242634e+02 (0 nodes, 0.047 seconds) Best possible: 9.242634e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn20H.gms(560) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn20H.gms Stop 09/08/12 19:59:02 elapsed 0:00:00.122 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt208 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn20M02H.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn20M02H.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn20M02H.gms(1391) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- Syn20M02H.gms(1389) 3 Mb --- Generating MINLP model m --- Syn20M02H.gms(1391) 5 Mb --- 607 rows 383 columns 1,375 non-zeroes --- 470 nl-code 84 nl-non-zeroes --- 80 discrete-columns --- Syn20M02H.gms(1391) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 530 Number of nonzeros in inequality constraint Jacobian.: 776 Number of nonzeros in Lagrangian Hessian.............: 108 Total number of variables............................: 382 variables with only lower bounds: 254 variables with lower and upper bounds: 88 variables with only upper bounds: 0 Total number of equality constraints.................: 252 Total number of inequality constraints...............: 354 inequality constraints with only lower bounds: 54 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 300 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.8650000e+01 9.80e-01 2.52e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.7654517e+01 9.72e-01 2.49e+01 0.1 1.97e+01 - 6.38e-03 7.79e-03f 1 2 -5.5808163e+01 9.51e-01 2.43e+01 0.1 1.95e+01 - 2.09e-02 2.15e-02f 1 3 -8.8362070e+01 8.39e-01 4.05e+01 0.1 2.11e+01 - 2.32e-02 1.18e-01f 1 4 -1.1793620e+02 7.54e-01 2.56e+01 0.1 1.97e+01 - 1.70e-01 1.02e-01f 1 5 -2.7342894e+02 4.53e-01 1.94e+01 0.0 1.89e+01 - 3.55e-01 3.99e-01f 1 6 -6.0477147e+02 2.03e-01 2.78e+01 -0.2 1.19e+01 - 4.01e-01 5.52e-01f 1 7 -8.9374001e+02 1.21e-01 1.66e+01 -0.4 1.56e+01 - 5.46e-01 4.02e-01f 1 8 -1.3009675e+03 9.28e-02 5.36e+01 -0.6 1.72e+01 - 4.08e-01 6.74e-01f 1 9 -1.4780752e+03 8.25e-02 1.09e+01 -1.1 1.84e+01 - 6.20e-01 4.80e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.5206230e+03 7.05e-02 1.35e+02 -1.3 1.90e+01 - 7.81e-01 1.81e-01f 1 11 -1.6392436e+03 4.24e-02 6.90e+01 -1.8 1.43e+01 - 6.35e-01 5.47e-01f 1 12 -1.7317919e+03 2.29e-03 4.78e+00 -1.8 4.43e+00 - 9.65e-01 9.81e-01f 1 13 -1.7519073e+03 6.43e-04 1.39e+01 -3.8 5.16e+00 - 7.15e-01 8.52e-01f 1 14 -1.7553878e+03 2.25e-04 5.42e+01 -4.1 1.22e+00 - 7.93e-01 6.49e-01f 1 15 -1.7569035e+03 5.70e-05 1.36e+02 -4.3 4.67e-01 - 9.69e-01 7.63e-01f 1 16 -1.7573712e+03 8.84e-06 1.11e+01 -6.1 1.23e-01 - 6.76e-01 8.65e-01f 1 17 -1.7574182e+03 2.83e-06 2.60e+02 -5.7 2.08e-02 - 9.97e-01 6.80e-01f 1 18 -1.7574367e+03 7.31e-07 4.75e+01 -6.7 6.97e-03 - 9.49e-01 7.42e-01h 1 19 -1.7574427e+03 2.30e-07 2.56e+01 -8.3 1.85e-03 - 8.58e-01 8.81e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.7574430e+03 1.61e-07 3.99e+01 -7.3 2.54e-04 - 4.48e-01 4.71e-01h 1 21 -1.7574431e+03 1.14e-07 4.50e+02 -7.2 1.18e-04 - 1.00e+00 3.07e-01h 1 22 -1.7574434e+03 9.84e-09 2.49e+02 -9.3 7.71e-05 - 4.96e-01 9.41e-01h 1 23 -1.7574434e+03 4.49e-09 5.00e+01 -10.0 4.88e-06 - 9.88e-01 5.44e-01h 1 24 -1.7574434e+03 1.81e-10 8.57e+00 -8.5 2.32e-06 - 6.65e-01 1.00e+00h 1 25 -1.7574434e+03 8.88e-16 9.57e-03 -8.5 1.72e-07 - 1.00e+00 1.00e+00h 1 26 -1.7574434e+03 8.33e-16 5.76e+00 -10.6 8.37e-07 - 8.96e-01 7.10e-01h 1 27 -1.7574434e+03 7.11e-15 4.41e-04 -9.3 1.12e-07 - 1.00e+00 1.00e+00h 1 28 -1.7574434e+03 1.78e-15 5.10e+00 -11.0 1.33e-07 - 9.50e-01 5.50e-01h 1 29 -1.7574434e+03 7.11e-15 1.85e-04 -10.0 3.51e-08 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -1.7574434e+03 8.88e-16 1.65e+00 -11.0 2.35e-08 - 8.19e-01 5.35e-01h 1 31 -1.7574434e+03 7.11e-15 4.04e-05 -10.5 5.10e-09 - 1.00e+00 1.00e+00h 1 32 -1.7574434e+03 8.88e-16 7.65e-01 -11.0 3.76e-09 - 9.40e-01 6.03e-01h 1 33 -1.7574434e+03 7.11e-15 2.33e-06 -11.0 1.76e-09 - 1.00e+00 1.00e+00h 1 34 -1.7574434e+03 8.88e-16 1.81e-08 -11.0 4.98e-10 - 1.00e+00 1.00e+00h 1 35 -1.7574434e+03 8.88e-16 1.83e-10 -11.0 3.52e-11 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 35 (scaled) (unscaled) Objective...............: -4.3393665188155853e+02 -1.7574434401203121e+03 Dual infeasibility......: 1.8262961976045489e-10 7.3964996002984225e-10 Constraint violation....: 8.8817841970012523e-16 8.8817841970012523e-16 Complementarity.........: 1.0032394645759065e-11 4.0631198315324215e-11 Overall NLP error.......: 1.8262961976045489e-10 7.3964996002984225e-10 Number of objective function evaluations = 36 Number of objective gradient evaluations = 36 Number of equality constraint evaluations = 36 Number of inequality constraint evaluations = 36 Number of equality constraint Jacobian evaluations = 36 Number of inequality constraint Jacobian evaluations = 36 Number of Lagrangian Hessian evaluations = 35 Total CPU secs in IPOPT (w/o function evaluations) = 0.030 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1757.4434 35 0.034994 build initial OA NLP0014I 2 OPT -1752.1335 66 0.046993 OA decomposition OA0003I New best feasible of -1752.1335 found after 0.061991 sec and NLP0014I 3 OPT -1749.3248 68 0.053992 OA decomposition OA0008I OA converged in 0.136979 seconds found solution of value -1752.1335 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 7 branch-and-bound nodes in total Cbc0012I Integer solution of -1752.1335 found by nonlinear programm after 11 iterations and 0 nodes (0.13 seconds) Cbc0031I 8 added rows had average density of 2.375 Cbc0013I At root node, 8 cuts changed objective from -1757.4439 to -1757.4438 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 14 row cuts average 2.3 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1752.133458397584, took 11 iterations and 0 nodes (0.13 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 14 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1752.13. Best solution: 1.752133e+03 (0 nodes, 0.146 seconds) Best possible: 1.752133e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn20M02H.gms(1391) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn20M02H.gms Stop 09/08/12 19:59:02 elapsed 0:00:00.249 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt211 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn20M02M.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn20M02M.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn20M02M.gms(926) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- Syn20M02M.gms(924) 3 Mb --- Generating MINLP model m --- Syn20M02M.gms(926) 5 Mb --- 407 rows 211 columns 1,011 non-zeroes --- 190 nl-code 28 nl-non-zeroes --- 80 discrete-columns --- Syn20M02M.gms(926) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 70 Number of nonzeros in inequality constraint Jacobian.: 872 Number of nonzeros in Lagrangian Hessian.............: 28 Total number of variables............................: 210 variables with only lower bounds: 82 variables with lower and upper bounds: 88 variables with only upper bounds: 0 Total number of equality constraints.................: 22 Total number of inequality constraints...............: 384 inequality constraints with only lower bounds: 112 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 272 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.8650000e+01 9.80e-01 3.59e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.5799199e+02 9.44e-01 3.71e+01 -0.2 1.92e+01 - 1.04e-02 3.64e-02f 1 2 -3.7628016e+02 9.31e-01 3.66e+01 -0.2 1.85e+01 - 1.29e-02 1.40e-02f 1 3 -4.9997374e+02 9.23e-01 3.62e+01 -0.2 1.83e+01 - 2.04e-02 8.67e-03f 1 4 -7.1666249e+02 9.09e-01 3.57e+01 -0.2 2.64e+01 - 1.87e-02 1.47e-02f 1 5 -1.7348430e+03 8.71e-01 3.43e+01 -0.2 3.49e+01 - 8.92e-03 4.23e-02f 1 6 -2.2629563e+03 8.42e-01 3.31e+01 -0.2 3.12e+01 - 4.40e-02 3.36e-02f 1 7 -2.3663583e+03 8.34e-01 3.28e+01 -0.2 3.24e+01 - 2.46e-02 8.76e-03f 1 8 -2.5496801e+03 8.14e-01 3.20e+01 -0.2 2.02e+01 - 2.44e-02 2.44e-02f 1 9 -2.8144810e+03 7.71e-01 3.03e+01 -0.2 1.83e+01 - 2.28e-02 5.25e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.9234621e+03 7.33e-01 2.98e+01 -0.2 1.68e+01 - 2.00e-02 4.94e-02f 1 11 -3.1255127e+03 6.81e-01 2.95e+01 -0.2 2.33e+01 - 4.61e-02 7.13e-02f 1 12 -3.4461419e+03 6.24e-01 2.59e+01 -0.2 3.28e+01 - 1.00e-01 8.34e-02f 1 13 -3.5645533e+03 5.97e-01 2.35e+01 -0.3 2.33e+01 - 1.98e-01 4.33e-02f 1 14 -4.0300142e+03 4.77e-01 1.87e+01 -0.6 1.86e+01 - 2.45e-01 2.01e-01f 1 15 -4.0744568e+03 4.60e-01 2.49e+01 -0.3 2.11e+01 - 2.96e-02 3.47e-02f 1 16 -4.1409443e+03 4.27e-01 2.27e+01 -0.3 1.66e+01 - 1.05e-01 7.31e-02f 1 17 -4.1664099e+03 4.07e-01 2.09e+01 -0.4 2.23e+01 - 6.86e-02 4.58e-02f 1 18 -4.3597263e+03 2.70e-01 4.22e+01 -0.4 8.76e+00 - 5.18e-02 3.38e-01f 1 19 -4.5550809e+03 1.54e-01 2.42e+01 -0.6 7.94e+00 - 4.70e-01 4.28e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.6963332e+03 8.50e-02 1.30e+01 -1.3 4.17e+00 - 5.71e-01 4.51e-01f 1 21 -4.7917341e+03 1.07e-01 6.04e+00 -1.7 4.86e+00 - 7.02e-01 5.36e-01f 1 22 -4.8477875e+03 9.86e-02 3.35e+00 -2.3 5.31e+00 - 7.60e-01 6.19e-01f 1 23 -4.8764439e+03 6.62e-02 5.76e-01 -3.1 4.92e+00 - 7.24e-01 7.64e-01f 1 24 -4.8834332e+03 2.09e-02 1.12e+00 -3.4 2.95e+00 - 7.81e-01 8.85e-01f 1 25 -4.8841563e+03 4.31e-03 1.58e-01 -5.3 1.11e+00 - 8.59e-01 8.62e-01h 1 26 -4.8842154e+03 8.63e-04 3.70e-02 -6.4 2.11e-01 - 9.16e-01 8.09e-01h 1 27 -4.8842275e+03 2.76e-05 6.66e-04 -9.7 4.23e-02 - 9.73e-01 9.71e-01h 1 28 -4.8842278e+03 9.87e-08 1.41e-02 -11.0 1.32e-03 - 9.99e-01 9.97e-01h 1 29 -4.8842278e+03 3.90e-08 6.04e+01 -10.5 5.10e-04 - 9.92e-01 6.05e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -4.8842278e+03 3.90e-08 8.37e+00 -9.2 7.29e-02 - 1.00e+00 1.31e-05h 15 31 -4.8842278e+03 5.13e-11 6.72e-10 -9.2 1.13e-02 - 1.00e+00 1.00e+00H 1 Number of Iterations....: 31 (scaled) (unscaled) Objective...............: -1.2059821795778855e+03 -4.8842278272904368e+03 Dual infeasibility......: 6.7153979422388120e-10 2.7197361666067187e-09 Constraint violation....: 5.1280535373621206e-11 5.1280535373621206e-11 Complementarity.........: 7.9919944481889170e-10 3.2367577515165116e-09 Overall NLP error.......: 7.9919944481889170e-10 3.2367577515165116e-09 Number of objective function evaluations = 50 Number of objective gradient evaluations = 32 Number of equality constraint evaluations = 50 Number of inequality constraint evaluations = 50 Number of equality constraint Jacobian evaluations = 32 Number of inequality constraint Jacobian evaluations = 32 Number of Lagrangian Hessian evaluations = 31 Total CPU secs in IPOPT (w/o function evaluations) = 0.049 Total CPU secs in NLP function evaluations = 0.009 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4884.2278 31 0.057991 build initial OA NLP0014I 2 OPT -1750.3987 19 0.023997 OA decomposition OA0003I New best feasible of -1750.3987 found after 0.048993 sec and NLP0014I 3 OPT -1752.1332 16 0.019997 OA decomposition OA0003I New best feasible of -1752.1332 found after 0.091986 sec and OA0008I OA converged in 0.113983 seconds found solution of value -1752.1332 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 2 branch-and-bound nodes in total Cbc0012I Integer solution of -1752.1332 found by nonlinear programm after 2 iterations and 0 nodes (0.11 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -4884.228 to -4884.228 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 6 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -1752.133203403981, took 2 iterations and 0 nodes (0.11 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 6 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1752.13. Best solution: 1.752133e+03 (0 nodes, 0.122 seconds) Best possible: 1.752133e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn20M02M.gms(926) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn20M02M.gms Stop 09/08/12 19:59:02 elapsed 0:00:00.283 @04 1347127142 ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- =ready= Linux opt218 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn20M03H.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn20M03H.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn20M03H.gms(2254) 2 Mb --- Starting execution: elapsed 0:00:00.017 --- Syn20M03H.gms(2252) 3 Mb --- Generating MINLP model m --- Syn20M03H.gms(2254) 6 Mb --- 1,000 rows 574 columns 2,272 non-zeroes --- 705 nl-code 126 nl-non-zeroes --- 120 discrete-columns --- Syn20M03H.gms(2254) 3 Mb --- Executing BONMIN: elapsed 0:00:00.024 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 795 Number of nonzeros in inequality constraint Jacobian.: 1374 Number of nonzeros in Lagrangian Hessian.............: 162 Total number of variables............................: 573 variables with only lower bounds: 381 variables with lower and upper bounds: 132 variables with only upper bounds: 0 Total number of equality constraints.................: 378 Total number of inequality constraints...............: 621 inequality constraints with only lower bounds: 81 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 540 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -5.8799999e+01 9.80e-01 2.56e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -7.2540274e+01 9.73e-01 2.53e+01 0.1 1.97e+01 - 6.19e-03 7.51e-03f 1 2 -8.7291637e+01 9.53e-01 2.48e+01 0.1 1.95e+01 - 2.10e-02 2.02e-02f 1 3 -1.2914332e+02 8.74e-01 3.42e+01 0.1 2.10e+01 - 2.31e-02 8.30e-02f 1 4 -2.1086485e+02 7.20e-01 3.53e+01 0.1 2.02e+01 - 1.32e-01 1.76e-01f 1 5 -4.2599384e+02 4.54e-01 2.18e+01 -0.1 1.77e+01 - 3.75e-01 3.69e-01f 1 6 -8.4879740e+02 2.51e-01 1.29e+01 -0.2 1.22e+01 - 4.27e-01 4.48e-01f 1 7 -1.3176286e+03 1.44e-01 1.19e+01 -0.4 1.48e+01 - 4.50e-01 4.27e-01f 1 8 -1.9531343e+03 8.79e-02 1.82e+01 -0.5 1.70e+01 - 7.82e-01 6.89e-01f 1 9 -2.2375572e+03 8.38e-02 9.04e+01 -0.9 1.90e+01 - 7.91e-01 5.03e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.3279579e+03 6.99e-02 1.39e+02 -1.4 1.95e+01 - 6.54e-01 2.35e-01f 1 11 -2.4643271e+03 4.68e-02 9.95e+01 -1.8 1.47e+01 - 7.35e-01 4.58e-01f 1 12 -2.5342034e+03 2.67e-02 1.24e+02 -1.9 5.28e+00 - 9.78e-01 4.28e-01f 1 13 -2.6334571e+03 4.07e-03 1.65e+01 -3.5 8.56e+00 - 5.18e-01 8.52e-01f 1 14 -2.6472874e+03 1.20e-03 6.83e+00 -3.7 6.06e+00 - 7.81e-01 7.02e-01f 1 15 -2.6522514e+03 2.04e-04 2.00e+01 -3.6 2.00e+00 - 6.27e-01 8.22e-01f 1 16 -2.6535696e+03 4.50e-05 2.74e+00 -5.0 6.50e-01 - 8.43e-01 7.76e-01f 1 17 -2.6539211e+03 6.51e-06 2.87e+00 -6.0 1.50e-01 - 7.32e-01 8.50e-01f 1 18 -2.6539573e+03 2.57e-06 1.60e+01 -6.2 2.50e-02 - 1.00e+00 5.79e-01h 1 19 -2.6539788e+03 3.95e-07 5.27e+00 -6.8 5.07e-02 - 1.00e+00 7.87e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.6539845e+03 3.70e-08 2.99e+00 -8.1 1.03e-02 - 9.56e-01 9.06e-01h 1 21 -2.6539850e+03 4.24e-07 1.19e+02 -8.4 4.50e-02 - 9.81e-01 7.03e-01h 1 22 -2.6539851e+03 1.94e-07 2.48e+02 -8.3 1.68e-01 - 1.00e+00 4.99e-01h 1 23 -2.6539852e+03 2.66e-08 4.46e+01 -10.1 1.11e-03 - 9.04e-01 8.52e-01h 1 24 -2.6539852e+03 9.85e-11 8.73e-01 -9.0 1.17e-01 - 1.00e+00 9.89e-01h 1 25 -2.6539852e+03 1.22e-13 2.42e-03 -9.1 4.82e-02 - 1.00e+00 1.00e+00h 1 26 -2.6539852e+03 3.55e-13 3.75e+00 -10.6 1.98e-04 - 8.95e-01 4.93e-01h 1 27 -2.6539852e+03 8.88e-16 3.20e-04 -9.7 1.30e-02 - 1.00e+00 1.00e+00h 1 28 -2.6539852e+03 7.11e-15 2.31e+00 -10.7 5.20e-04 - 7.17e-01 4.38e-01h 1 29 -2.6539852e+03 7.11e-15 6.44e-05 -10.1 6.07e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -2.6539852e+03 7.11e-15 9.94e-01 -11.0 2.51e-05 - 8.79e-01 6.39e-01h 1 31 -2.6539852e+03 8.88e-16 2.51e-05 -10.7 1.89e-04 - 1.00e+00 1.00e+00h 1 32 -2.6539852e+03 7.11e-15 1.80e-01 -11.0 5.89e-06 - 1.00e+00 8.41e-01h 1 33 -2.6539852e+03 7.11e-15 1.02e-07 -11.0 6.41e-06 - 1.00e+00 1.00e+00h 1 34 -2.6539852e+03 7.11e-15 7.44e-09 -11.0 1.68e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 34 (scaled) (unscaled) Objective...............: -6.1720585758164896e+02 -2.6539851876010907e+03 Dual infeasibility......: 7.4449996306791277e-09 3.2013498411920245e-08 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.0767204761016990e-11 4.6298980472373060e-11 Overall NLP error.......: 7.4449996306791277e-09 3.2013498411920245e-08 Number of objective function evaluations = 35 Number of objective gradient evaluations = 35 Number of equality constraint evaluations = 35 Number of inequality constraint evaluations = 35 Number of equality constraint Jacobian evaluations = 35 Number of inequality constraint Jacobian evaluations = 35 Number of Lagrangian Hessian evaluations = 34 Total CPU secs in IPOPT (w/o function evaluations) = 0.092 Total CPU secs in NLP function evaluations = 0.018 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2653.9852 34 0.109983 build initial OA NLP0014I 2 OPT -2646.9513 65 0.150977 OA decomposition OA0003I New best feasible of -2646.9513 found after 0.199969 sec and OA0008I OA converged in 0.224965 seconds found solution of value -2646.9513 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -2646.9513 found by nonlinear programm after 20 iterations and 0 nodes (0.21 seconds) Cbc0031I 10 added rows had average density of 2.2 Cbc0013I At root node, 10 cuts changed objective from -2653.9859 to -2653.9858 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 22 row cuts average 2.2 elements, 0 column cuts (10 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2646.951303774174, took 20 iterations and 0 nodes (0.21 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 22 cuts of which 10 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2646.95. Best solution: 2.646951e+03 (0 nodes, 0.238 seconds) Best possible: 2.646951e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn20M03H.gms(2254) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn20M03H.gms Stop 09/08/12 19:59:03 elapsed 0:00:00.472 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn20M03M.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn20M03M.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn20M03M.gms(1557) 2 Mb --- Starting execution: elapsed 0:00:00.012 --- Syn20M03M.gms(1555) 3 Mb --- Generating MINLP model m --- Syn20M03M.gms(1557) 5 Mb --- 700 rows 316 columns 1,726 non-zeroes --- 285 nl-code 42 nl-non-zeroes --- 120 discrete-columns --- Syn20M03M.gms(1557) 3 Mb --- Executing BONMIN: elapsed 0:00:00.018 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 105 Number of nonzeros in inequality constraint Jacobian.: 1518 Number of nonzeros in Lagrangian Hessian.............: 42 Total number of variables............................: 315 variables with only lower bounds: 123 variables with lower and upper bounds: 132 variables with only upper bounds: 0 Total number of equality constraints.................: 33 Total number of inequality constraints...............: 666 inequality constraints with only lower bounds: 168 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 498 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -5.8799999e+01 9.80e-01 3.43e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.2654808e+02 9.45e-01 3.46e+01 -0.2 1.92e+01 - 1.14e-02 3.53e-02f 1 2 -5.1720476e+02 9.32e-01 3.40e+01 -0.2 1.85e+01 - 1.23e-02 1.46e-02f 1 3 -7.9214090e+02 9.18e-01 3.36e+01 -0.2 1.83e+01 - 2.17e-02 1.41e-02f 1 4 -1.1470008e+03 9.03e-01 3.30e+01 -0.2 2.15e+01 - 2.34e-02 1.70e-02f 1 5 -2.5465744e+03 8.62e-01 3.16e+01 -0.2 3.41e+01 - 1.76e-02 4.54e-02f 1 6 -3.3348944e+03 8.38e-01 3.06e+01 -0.2 3.04e+01 - 3.74e-02 2.78e-02f 1 7 -3.7944721e+03 8.10e-01 2.96e+01 -0.2 2.44e+01 - 3.58e-02 3.31e-02f 1 8 -3.9257981e+03 7.97e-01 2.92e+01 -0.2 1.70e+01 - 2.60e-02 1.60e-02f 1 9 -4.1822924e+03 7.72e-01 2.83e+01 -0.2 1.94e+01 - 4.00e-02 3.13e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.4030913e+03 7.37e-01 2.69e+01 -0.2 1.80e+01 - 2.12e-02 4.60e-02f 1 11 -4.5877870e+03 7.08e-01 2.69e+01 -0.2 2.09e+01 - 2.12e-02 3.84e-02f 1 12 -4.7264809e+03 6.85e-01 2.54e+01 -0.2 2.35e+01 - 4.07e-02 3.32e-02f 1 13 -5.4584197e+03 5.75e-01 2.10e+01 -0.2 2.37e+01 - 1.72e-01 1.61e-01f 1 14 -6.0403503e+03 4.80e-01 2.21e+01 -0.5 2.02e+01 - 2.56e-01 1.65e-01f 1 15 -6.1183644e+03 4.63e-01 3.75e+01 -0.4 1.76e+01 - 8.09e-02 3.54e-02f 1 16 -6.1923871e+03 4.38e-01 3.97e+01 -0.3 1.47e+01 - 9.61e-02 5.44e-02f 1 17 -6.3417909e+03 3.75e-01 4.03e+01 -0.4 1.71e+01 - 5.65e-02 1.42e-01f 1 18 -6.5279541e+03 2.86e-01 2.81e+01 -0.4 8.22e+00 - 5.76e-02 2.38e-01f 1 19 -6.8045677e+03 1.69e-01 3.03e+01 -0.5 7.32e+00 - 2.20e-01 4.09e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.0317874e+03 9.36e-02 1.78e+01 -1.0 5.24e+00 - 4.28e-01 4.46e-01f 1 21 -7.2045844e+03 1.01e-01 6.23e+00 -1.6 4.38e+00 - 6.13e-01 5.44e-01f 1 22 -7.3038829e+03 1.03e-01 4.19e+00 -1.9 5.01e+00 - 5.72e-01 6.37e-01f 1 23 -7.3399644e+03 7.23e-02 7.32e-01 -2.3 4.85e+00 - 6.12e-01 5.76e-01f 1 24 -7.3619830e+03 4.10e-02 9.01e-01 -2.9 4.01e+00 - 7.77e-01 7.14e-01f 1 25 -7.3672506e+03 2.12e-02 3.20e+00 -3.6 2.28e+00 - 7.92e-01 5.56e-01f 1 26 -7.3704865e+03 6.78e-03 7.65e-01 -4.3 1.36e+00 - 7.63e-01 7.62e-01f 1 27 -7.3709372e+03 3.45e-03 4.48e+00 -4.7 4.14e-01 - 9.62e-01 5.00e-01h 1 28 -7.3713784e+03 2.14e-04 1.97e-01 -7.6 2.14e-01 - 9.59e-01 9.56e-01h 1 29 -7.3713948e+03 2.73e-06 2.08e-03 -11.0 1.13e-02 - 9.89e-01 9.88e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -7.3713950e+03 3.93e-08 4.06e-01 -11.0 1.40e-04 - 9.98e-01 9.86e-01h 1 31 -7.3713950e+03 9.10e-09 1.28e+00 -10.4 3.13e-02 - 1.00e+00 7.68e-01h 1 32 -7.3713950e+03 6.72e-09 7.96e-01 -9.3 1.56e+00 - 2.58e-01 2.58e-01h 1 33 -7.3713950e+03 6.29e-09 1.03e+01 -9.3 9.07e-01 - 1.00e+00 6.25e-02f 5 34 -7.3713950e+03 2.66e-09 2.33e+01 -9.3 2.32e-01 - 3.36e-01 5.67e-01h 1 35 -7.3713950e+03 1.27e-09 1.62e+01 -9.3 9.94e-02 - 1.00e+00 5.00e-01f 2 36 -7.3713950e+03 1.78e-15 9.08e-11 -9.3 4.93e-02 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 36 (scaled) (unscaled) Objective...............: -1.7142779099649267e+03 -7.3713950128491852e+03 Dual infeasibility......: 9.0809762041082416e-11 3.9048197677665439e-10 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 5.5960790589226150e-10 2.4063139953367244e-09 Overall NLP error.......: 5.5960790589226150e-10 2.4063139953367244e-09 Number of objective function evaluations = 42 Number of objective gradient evaluations = 37 Number of equality constraint evaluations = 42 Number of inequality constraint evaluations = 42 Number of equality constraint Jacobian evaluations = 37 Number of inequality constraint Jacobian evaluations = 37 Number of Lagrangian Hessian evaluations = 36 Total CPU secs in IPOPT (w/o function evaluations) = 0.081 Total CPU secs in NLP function evaluations = 0.012 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7371.395 36 0.092985 build initial OA NLP0014I 2 OPT -2602.2164 19 0.033995 OA decomposition OA0003I New best feasible of -2602.2164 found after 0.072989 sec and NLP0014I 3 OPT -2646.9509 21 0.040993 OA decomposition OA0003I New best feasible of -2646.9509 found after 0.137979 sec and OA0008I OA converged in 0.159976 seconds found solution of value -2646.9509 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -2646.9509 found by nonlinear programm after 5 iterations and 0 nodes (0.15 seconds) Cbc0031I 4 added rows had average density of 3 Cbc0013I At root node, 4 cuts changed objective from -7371.3953 to -7371.3953 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 3.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -2646.950917708257, took 5 iterations and 0 nodes (0.15 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 2646.95. Best solution: 2.646951e+03 (0 nodes, 0.17 seconds) Best possible: 2.646951e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn20M03M.gms(1557) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn20M03M.gms Stop 09/08/12 19:59:03 elapsed 0:00:00.378 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt221 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn20M04H.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn20M04H.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn20M04H.gms(3250) 2 Mb --- Starting execution: elapsed 0:00:00.012 --- Syn20M04H.gms(3248) 3 Mb --- Generating MINLP model m --- Syn20M04H.gms(3250) 6 Mb --- 1,453 rows 765 columns 3,309 non-zeroes --- 940 nl-code 168 nl-non-zeroes --- 160 discrete-columns --- Syn20M04H.gms(3250) 3 Mb --- Executing BONMIN: elapsed 0:00:00.016 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1060 Number of nonzeros in inequality constraint Jacobian.: 2112 Number of nonzeros in Lagrangian Hessian.............: 216 Total number of variables............................: 764 variables with only lower bounds: 508 variables with lower and upper bounds: 176 variables with only upper bounds: 0 Total number of equality constraints.................: 504 Total number of inequality constraints...............: 948 inequality constraints with only lower bounds: 108 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 840 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -7.9549999e+01 9.80e-01 2.55e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -9.7770149e+01 9.73e-01 2.53e+01 0.1 1.97e+01 - 6.09e-03 7.31e-03f 1 2 -1.1890916e+02 9.54e-01 2.50e+01 0.1 1.95e+01 - 2.17e-02 1.89e-02f 1 3 -1.5350826e+02 9.12e-01 2.66e+01 0.1 2.10e+01 - 2.44e-02 4.45e-02f 1 4 -3.8041461e+02 6.04e-01 6.00e+01 0.1 2.06e+01 - 9.42e-02 3.38e-01f 1 5 -5.5894544e+02 4.67e-01 4.85e+01 -0.2 1.48e+01 - 4.20e-01 2.27e-01f 1 6 -1.2516112e+03 2.35e-01 3.08e+01 -0.1 1.39e+01 - 6.52e-01 4.97e-01f 1 7 -2.0279259e+03 7.40e-02 2.29e+01 -0.4 1.11e+01 - 5.18e-01 6.85e-01f 1 8 -2.7711277e+03 9.07e-02 3.17e+01 -1.0 1.56e+01 - 4.97e-01 6.61e-01f 1 9 -3.0031929e+03 8.13e-02 7.30e+01 -1.2 1.94e+01 - 7.09e-01 3.34e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.1966096e+03 6.96e-02 1.43e+02 -1.5 2.10e+01 - 8.22e-01 3.25e-01f 1 11 -3.2957957e+03 5.44e-02 1.72e+02 -1.6 1.60e+01 - 6.38e-01 3.09e-01f 1 12 -3.3964551e+03 3.25e-02 1.23e+02 -2.1 8.96e+00 - 7.25e-01 4.52e-01f 1 13 -3.5158564e+03 1.75e-03 2.05e+00 -2.3 3.83e+00 - 8.82e-01 9.40e-01f 1 14 -3.5306933e+03 5.95e-04 4.07e+01 -3.3 9.54e+00 - 5.04e-01 7.25e-01f 1 15 -3.5356951e+03 2.31e-04 2.52e+00 -3.8 6.94e+00 - 6.77e-01 6.13e-01f 1 16 -3.5385663e+03 5.80e-05 3.26e+01 -4.1 3.54e+00 - 8.89e-01 7.61e-01f 1 17 -3.5396663e+03 6.58e-06 3.68e+00 -6.1 1.12e+00 - 7.13e-01 9.11e-01f 1 18 -3.5397261e+03 2.97e-06 5.45e+01 -6.1 1.03e-01 - 9.91e-01 5.49e-01f 1 19 -3.5397668e+03 6.33e-07 1.14e+01 -6.8 1.10e-01 - 1.00e+00 7.88e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -3.5397773e+03 5.37e-08 1.49e+01 -8.4 2.52e-02 - 9.84e-01 9.16e-01h 1 21 -3.5397780e+03 2.61e-07 2.49e+02 -8.5 4.26e-01 - 1.00e+00 7.26e-01h 1 22 -3.5397783e+03 3.79e-08 8.45e+01 -9.0 1.79e-01 - 1.00e+00 8.69e-01h 1 23 -3.5397783e+03 1.00e-08 4.17e+01 -9.9 4.35e-02 - 9.76e-01 7.02e-01h 1 24 -3.5397783e+03 2.42e-10 2.59e+00 -8.8 3.85e+00 - 1.00e+00 9.14e-01h 1 25 -3.5397783e+03 7.11e-15 6.61e+00 -8.8 3.15e+00 - 3.27e-04 1.00e+00f 1 26 -3.5397783e+03 7.11e-15 1.46e-05 -8.8 1.13e-05 - 1.00e+00 1.00e+00h 1 27 -3.5397783e+03 7.11e-15 5.19e+00 -10.6 3.76e-06 - 9.02e-01 5.70e-01h 1 28 -3.5397783e+03 7.11e-15 4.06e-04 -9.5 8.93e-07 - 1.00e+00 1.00e+00h 1 29 -3.5397783e+03 7.11e-15 5.31e+00 -11.0 7.65e-07 - 9.18e-01 4.49e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -3.5397783e+03 7.11e-15 5.51e-01 -10.1 2.60e-07 - 9.40e-01 8.95e-01h 1 31 -3.5397783e+03 7.11e-15 9.23e-01 -10.1 2.70e-08 - 1.00e+00 5.00e-01f 2 32 -3.5397783e+03 7.11e-15 2.43e-06 -10.1 1.35e-08 - 1.00e+00 1.00e+00h 1 33 -3.5397783e+03 8.88e-16 7.32e-01 -11.0 1.61e-07 - 8.70e-01 6.71e-01h 1 34 -3.5397783e+03 8.88e-16 2.09e-05 -10.7 3.09e-08 - 1.00e+00 1.00e+00f 1 35 -3.5397783e+03 1.78e-15 3.42e-06 -11.0 2.00e-08 - 1.00e+00 1.00e+00h 1 36 -3.5397783e+03 8.88e-16 1.99e-07 -11.0 1.07e-09 - 1.00e+00 1.00e+00h 1 37 -3.5397783e+03 7.11e-15 6.47e-09 -11.0 2.32e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 37 (scaled) (unscaled) Objective...............: -8.2320426585518862e+02 -3.5397783431773109e+03 Dual infeasibility......: 6.4697751669950954e-09 2.7820033218078910e-08 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.1140734888855044e-11 4.7905160022076691e-11 Overall NLP error.......: 6.4697751669950954e-09 2.7820033218078910e-08 Number of objective function evaluations = 39 Number of objective gradient evaluations = 38 Number of equality constraint evaluations = 39 Number of inequality constraint evaluations = 39 Number of equality constraint Jacobian evaluations = 38 Number of inequality constraint Jacobian evaluations = 38 Number of Lagrangian Hessian evaluations = 37 Total CPU secs in IPOPT (w/o function evaluations) = 0.141 Total CPU secs in NLP function evaluations = 0.022 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -3539.7783 37 0.162975 build initial OA NLP0014I 2 OPT -3532.7445 65 0.206968 OA decomposition OA0003I New best feasible of -3532.7445 found after 0.280957 sec and OA0008I OA converged in 0.315952 seconds found solution of value -3532.7445 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -3532.7445 found by nonlinear programm after 23 iterations and 0 nodes (0.30 seconds) Cbc0031I 15 added rows had average density of 2.3333333 Cbc0013I At root node, 15 cuts changed objective from -3539.7793 to -3539.7791 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 28 row cuts average 2.3 elements, 0 column cuts (15 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -3532.744459259792, took 23 iterations and 0 nodes (0.30 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 28 cuts of which 15 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 3532.74. Best solution: 3.532744e+03 (0 nodes, 0.337 seconds) Best possible: 3.532744e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn20M04H.gms(3250) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn20M04H.gms Stop 09/08/12 19:59:03 elapsed 0:00:00.612 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt208 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn20M04M.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn20M04M.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn20M04M.gms(2315) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- Syn20M04M.gms(2313) 3 Mb --- Generating MINLP model m --- Syn20M04M.gms(2315) 6 Mb --- 1,053 rows 421 columns 2,581 non-zeroes --- 380 nl-code 56 nl-non-zeroes --- 160 discrete-columns --- Syn20M04M.gms(2315) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 140 Number of nonzeros in inequality constraint Jacobian.: 2304 Number of nonzeros in Lagrangian Hessian.............: 56 Total number of variables............................: 420 variables with only lower bounds: 164 variables with lower and upper bounds: 176 variables with only upper bounds: 0 Total number of equality constraints.................: 44 Total number of inequality constraints...............: 1008 inequality constraints with only lower bounds: 224 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 784 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -7.9549999e+01 9.80e-01 3.42e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.8391042e+02 9.49e-01 3.42e+01 -0.2 1.92e+01 - 1.18e-02 3.16e-02f 1 2 -6.7829351e+02 9.35e-01 3.37e+01 -0.2 1.86e+01 - 9.37e-03 1.46e-02f 1 3 -1.0044443e+03 9.24e-01 3.33e+01 -0.2 1.84e+01 - 2.00e-02 1.22e-02f 1 4 -1.2637545e+03 9.16e-01 3.30e+01 -0.2 2.28e+01 - 1.50e-02 8.75e-03f 1 5 -1.8757111e+03 8.99e-01 3.24e+01 -0.2 2.99e+01 - 2.22e-02 1.82e-02f 1 6 -3.6558415e+03 8.66e-01 3.12e+01 -0.2 3.74e+01 - 2.41e-02 3.72e-02f 1 7 -4.0406139e+03 8.55e-01 3.08e+01 -0.2 2.79e+01 - 2.61e-02 1.16e-02f 1 8 -4.7658886e+03 8.30e-01 2.99e+01 -0.2 3.04e+01 - 3.03e-02 2.99e-02f 1 9 -5.2177250e+03 8.04e-01 2.90e+01 -0.2 1.98e+01 - 2.00e-02 3.16e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -5.4871813e+03 7.78e-01 2.82e+01 -0.2 1.87e+01 - 2.09e-02 3.15e-02f 1 11 -5.6963135e+03 7.56e-01 2.73e+01 -0.2 2.02e+01 - 3.02e-02 2.93e-02f 1 12 -6.0350278e+03 7.13e-01 2.72e+01 -0.3 2.05e+01 - 3.73e-02 5.67e-02f 1 13 -6.3265780e+03 6.78e-01 2.59e+01 -0.2 2.18e+01 - 4.86e-02 4.90e-02f 1 14 -7.0254666e+03 6.06e-01 2.53e+01 -0.2 2.41e+01 - 7.32e-02 1.06e-01f 1 15 -7.9656315e+03 4.92e-01 2.09e+01 -0.4 1.92e+01 - 1.82e-01 1.89e-01f 1 16 -8.1014227e+03 4.72e-01 7.35e+01 -0.4 1.36e+01 - 1.25e-01 3.99e-02f 1 17 -8.2319807e+03 4.40e-01 4.34e+01 -0.3 1.26e+01 - 1.35e-02 6.69e-02f 1 18 -8.4059273e+03 3.92e-01 3.82e+01 -0.3 1.11e+01 - 1.03e-01 1.11e-01f 1 19 -8.5927616e+03 3.24e-01 3.93e+01 -0.4 8.72e+00 - 7.17e-02 1.73e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -8.8521896e+03 2.36e-01 4.04e+01 -0.4 7.68e+00 - 1.11e-01 2.72e-01f 1 21 -9.2435107e+03 1.14e-01 4.68e+01 -0.6 7.48e+00 - 2.45e-01 5.15e-01f 1 22 -9.5481751e+03 8.80e-02 1.93e+01 -1.1 3.85e+00 - 5.86e-01 5.83e-01f 1 23 -9.7215125e+03 9.73e-02 9.94e+00 -1.6 4.36e+00 - 5.84e-01 6.37e-01f 1 24 -9.8136624e+03 8.16e-02 1.25e+01 -2.0 4.75e+00 - 5.58e-01 7.21e-01f 1 25 -9.8385451e+03 5.09e-02 1.26e+00 -2.4 4.10e+00 - 6.15e-01 5.59e-01f 1 26 -9.8562406e+03 2.52e-02 1.34e+00 -3.1 3.09e+00 - 7.51e-01 7.05e-01f 1 27 -9.8605653e+03 1.36e-02 7.19e+00 -3.9 1.53e+00 - 8.17e-01 5.05e-01f 1 28 -9.8636701e+03 4.49e-03 3.22e+00 -4.1 1.07e+00 - 7.69e-01 7.21e-01f 1 29 -9.8642409e+03 2.38e-03 1.44e+01 -4.7 2.97e-01 - 9.98e-01 4.76e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -9.8648715e+03 1.30e-04 5.68e-01 -7.9 1.60e-01 - 9.62e-01 9.61e-01f 1 31 -9.8648913e+03 1.84e-06 1.31e-02 -10.7 7.33e-03 - 9.84e-01 9.86e-01h 1 32 -9.8648913e+03 4.08e-08 1.17e+00 -11.0 1.11e-03 - 9.89e-01 9.78e-01h 1 33 -9.8648913e+03 6.66e-09 8.90e-01 -11.0 2.81e-05 -4.0 9.93e-01 8.37e-01h 1 34 -9.8648913e+03 6.66e-09 2.11e+00 -9.3 1.99e+01 - 1.00e+00 7.53e-06h 14 35 -9.8648913e+03 9.71e-11 3.04e-06 -9.3 4.72e-01 - 1.00e+00 1.00e+00H 1 36 -9.8648913e+03 9.79e-11 5.05e-01 -11.0 3.02e-04 - 1.00e+00 7.73e-01h 1 37 -9.8648913e+03 8.84e-11 4.64e+03 -10.3 7.04e-02 - 4.95e-03 9.69e-02h 1 38 -9.8648913e+03 7.82e-11 4.10e+03 -10.3 3.86e-02 - 8.97e-02 1.15e-01f 1 39 -9.8648913e+03 5.49e-11 2.88e+03 -10.3 1.43e-02 - 7.30e-02 2.98e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -9.8648913e+03 3.55e-15 1.23e+01 -10.3 6.62e-04 - 3.98e-01 1.00e+00f 1 41 -9.8648913e+03 8.88e-16 2.37e-10 -10.3 6.22e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 41 (scaled) (unscaled) Objective...............: -2.2941607708772199e+03 -9.8648913147720450e+03 Dual infeasibility......: 2.3746997195824099e-10 1.0211208794204362e-09 Constraint violation....: 8.8817841970012523e-16 8.8817841970012523e-16 Complementarity.........: 7.1031256690653160e-11 3.0543440376980859e-10 Overall NLP error.......: 2.3746997195824099e-10 1.0211208794204362e-09 Number of objective function evaluations = 59 Number of objective gradient evaluations = 42 Number of equality constraint evaluations = 59 Number of inequality constraint evaluations = 59 Number of equality constraint Jacobian evaluations = 42 Number of inequality constraint Jacobian evaluations = 42 Number of Lagrangian Hessian evaluations = 41 Total CPU secs in IPOPT (w/o function evaluations) = 0.115 Total CPU secs in NLP function evaluations = 0.021 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9864.8913 41 0.135979 build initial OA NLP0014I 2 OPT -3488.0094 19 0.042994 OA decomposition OA0003I New best feasible of -3488.0094 found after 0.099985 sec and NLP0014I 3 OPT -3532.7439 19 0.046993 OA decomposition OA0003I New best feasible of -3532.7439 found after 0.181972 sec and OA0008I OA converged in 0.214967 seconds found solution of value -3532.7439 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -3532.7439 found by nonlinear programm after 4 iterations and 0 nodes (0.21 seconds) Cbc0031I 4 added rows had average density of 3 Cbc0013I At root node, 4 cuts changed objective from -9864.8918 to -9864.8918 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 10 row cuts average 3.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -3532.743935948996, took 4 iterations and 0 nodes (0.21 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 10 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 3532.74. Best solution: 3.532744e+03 (0 nodes, 0.226 seconds) Best possible: 3.532744e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn20M04M.gms(2315) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn20M04M.gms Stop 09/08/12 19:59:03 elapsed 0:00:00.443 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt211 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn20M.gms =========== ----------------------------- Sa 8. Sep 19:59:02 CEST 2012 ----------------------------- @03 1347127142 --- Job Syn20M.gms Start 09/08/12 19:59:02 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn20M.gms(289) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- Syn20M.gms(287) 3 Mb --- Generating MINLP model m --- Syn20M.gms(289) 5 Mb --- 114 rows 66 columns 312 non-zeroes --- 95 nl-code 14 nl-non-zeroes --- 20 discrete-columns --- Syn20M.gms(289) 3 Mb --- Executing BONMIN: elapsed 0:00:00.007 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 35 Number of nonzeros in inequality constraint Jacobian.: 246 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 65 variables with only lower bounds: 41 variables with lower and upper bounds: 24 variables with only upper bounds: 0 Total number of equality constraints.................: 11 Total number of inequality constraints...............: 102 inequality constraints with only lower bounds: 36 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 66 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -3.8590000e+01 9.80e-01 3.46e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.0569741e+02 9.52e-01 3.38e+01 -0.4 4.56e+00 - 2.10e-02 2.89e-02f 1 2 -2.3752652e+02 9.08e-01 3.31e+01 -0.4 4.66e+00 - 2.99e-02 4.58e-02f 1 3 -5.7583363e+02 8.49e-01 3.27e+01 -0.5 6.38e+00 - 4.45e-02 6.49e-02f 1 4 -7.6100885e+02 8.37e-01 3.13e+01 -0.4 1.68e+01 - 2.54e-02 1.37e-02f 1 5 -9.6577897e+02 8.09e-01 2.88e+01 -0.4 1.48e+01 - 8.42e-02 3.37e-02f 1 6 -1.1559200e+03 7.78e-01 1.07e+02 -0.5 9.65e+00 - 2.77e-01 3.81e-02f 1 7 -1.9180872e+03 6.15e-01 6.75e+01 -0.8 5.80e+00 - 1.16e-01 2.09e-01f 1 8 -2.3211930e+03 5.25e-01 5.83e+01 -0.7 5.17e+00 - 1.57e-01 1.47e-01f 1 9 -2.3413116e+03 5.20e-01 2.49e+01 -0.5 6.27e+00 - 6.05e-02 9.77e-03f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.5533302e+03 4.52e-01 2.48e+01 -0.6 4.90e+00 - 3.22e-02 1.31e-01f 1 11 -2.5874409e+03 4.37e-01 1.96e+01 -0.6 4.48e+00 - 4.18e-02 3.15e-02f 1 12 -2.7324190e+03 3.67e-01 3.53e+01 -0.6 4.61e+00 - 4.59e-01 1.60e-01f 1 13 -2.7896192e+03 3.31e-01 3.00e+01 -0.7 6.03e+00 - 5.17e-02 9.89e-02f 1 14 -2.8137193e+03 2.98e-01 2.59e+01 -0.7 3.67e+00 - 7.88e-02 9.89e-02f 1 15 -2.8410744e+03 2.26e-01 2.78e+01 -0.7 2.04e+00 - 3.72e-01 2.41e-01f 1 16 -2.8990247e+03 4.50e-02 3.56e+01 -0.7 1.70e+00 - 3.01e-01 8.01e-01f 1 17 -2.9468705e+03 7.79e-03 3.32e+01 -1.3 1.94e+00 - 5.89e-01 8.75e-01f 1 18 -2.9613620e+03 4.45e-02 1.98e+01 -2.2 3.02e+00 - 6.52e-01 7.51e-01f 1 19 -2.9682013e+03 4.34e-02 5.51e+00 -3.1 2.64e+00 - 7.77e-01 8.06e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.9704387e+03 6.65e-03 2.11e+01 -3.7 1.04e+00 - 6.62e-01 9.55e-01f 1 21 -2.9706650e+03 2.49e-04 2.88e+00 -5.3 1.57e-01 - 9.05e-01 9.62e-01h 1 22 -2.9706751e+03 6.22e-06 1.68e-01 -11.0 5.42e-03 - 9.87e-01 9.75e-01h 1 23 -2.9706753e+03 6.33e-08 2.93e-02 -11.0 1.21e-04 - 9.90e-01 9.90e-01h 1 24 -2.9706754e+03 1.57e-09 2.52e-01 -11.0 1.15e-04 - 9.73e-01 9.75e-01h 1 25 -2.9706754e+03 4.44e-16 1.86e+01 -9.2 2.96e-01 - 1.42e-01 1.00e+00h 1 26 -2.9706754e+03 4.44e-16 1.90e-01 -9.2 4.16e-01 - 9.46e-01 1.00e+00h 1 27 -2.9706754e+03 1.78e-15 2.12e-10 -9.2 1.46e+00 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 27 (scaled) (unscaled) Objective...............: -4.2438219312459728e+02 -2.9706753518721812e+03 Dual infeasibility......: 2.1159675379855422e-10 1.4811772765898796e-09 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 1.3394629177307328e-09 9.3762404241151302e-09 Overall NLP error.......: 1.3394629177307328e-09 9.3762404241151302e-09 Number of objective function evaluations = 28 Number of objective gradient evaluations = 28 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 28 Number of inequality constraint Jacobian evaluations = 28 Number of Lagrangian Hessian evaluations = 27 Total CPU secs in IPOPT (w/o function evaluations) = 0.020 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2970.6754 27 0.022996 build initial OA NLP0014I 2 OPT -911.26331 14 0.012998 OA decomposition OA0003I New best feasible of -911.26331 found after 0.021997 sec and NLP0014I 3 OPT -924.26331 16 0.014997 OA decomposition OA0003I New best feasible of -924.26331 found after 0.043993 sec and OA0008I OA converged in 0.043993 seconds found solution of value -924.26331 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 0 branch-and-bound nodes in total Cbc0012I Integer solution of -924.26331 found by nonlinear programm after 3 iterations and 0 nodes (0.04 seconds) Cbc0031I 3 added rows had average density of 3 Cbc0013I At root node, 3 cuts changed objective from -2970.6756 to -2970.6755 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 4 row cuts average 3.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -924.2633112164815, took 3 iterations and 0 nodes (0.04 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 4 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 924.263. Best solution: 9.242633e+02 (0 nodes, 0.049 seconds) Best possible: 9.242633e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn20M.gms(289) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn20M.gms Stop 09/08/12 19:59:03 elapsed 0:00:00.168 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn40H.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job Syn40H.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn40H.gms(1087) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- Syn40H.gms(1085) 3 Mb --- Generating MINLP model m --- Syn40H.gms(1087) 5 Mb --- 467 rows 303 columns 1,071 non-zeroes --- 470 nl-code 84 nl-non-zeroes --- 40 discrete-columns --- Syn40H.gms(1087) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 450 Number of nonzeros in inequality constraint Jacobian.: 554 Number of nonzeros in Lagrangian Hessian.............: 108 Total number of variables............................: 302 variables with only lower bounds: 255 variables with lower and upper bounds: 47 variables with only upper bounds: 0 Total number of equality constraints.................: 212 Total number of inequality constraints...............: 254 inequality constraints with only lower bounds: 54 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 200 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.9300000e+01 9.80e-01 2.57e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.4065488e+01 9.72e-01 2.53e+01 0.1 1.97e+01 - 6.54e-03 7.84e-03f 1 2 -2.5430686e+01 9.59e-01 2.55e+01 0.1 1.95e+01 - 2.01e-02 1.41e-02f 1 3 -2.6186595e+01 9.25e-01 2.61e+01 0.1 2.09e+01 - 1.72e-02 3.46e-02f 1 4 -2.3067430e+01 8.64e-01 2.45e+01 0.1 2.09e+01 - 6.58e-02 6.65e-02f 1 5 1.0753587e+01 5.07e-01 1.23e+02 0.1 2.13e+01 - 1.59e-01 4.13e-01f 1 6 2.1300249e+01 3.39e-01 8.18e+01 -0.2 1.16e+01 - 4.22e-01 3.31e-01f 1 7 2.8752828e+01 8.27e-02 1.92e+01 -0.6 6.85e+00 - 7.45e-01 7.56e-01h 1 8 1.0925697e+01 8.29e-03 1.28e+01 -1.6 1.81e+00 - 6.25e-01 9.00e-01h 1 9 -3.0297705e+00 4.96e-03 1.85e+02 -1.3 5.94e+00 - 7.29e-01 4.02e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.9109590e+01 9.26e-03 1.67e+01 -1.7 5.89e+00 - 5.90e-01 7.52e-01f 1 11 -6.4109090e+01 5.44e-03 1.57e+01 -2.6 8.41e+00 - 6.85e-01 7.42e-01f 1 12 -7.4367068e+01 2.71e-03 5.19e+00 -3.6 6.47e+00 - 8.36e-01 7.10e-01f 1 13 -7.7339669e+01 1.12e-03 1.51e+01 -4.0 1.97e+00 - 7.88e-01 6.72e-01f 1 14 -7.8812125e+01 1.17e-04 1.72e+01 -5.0 6.40e-01 - 4.27e-01 9.56e-01f 1 15 -7.8878545e+01 1.57e-05 5.02e+00 -7.4 2.90e-02 - 9.64e-01 8.86e-01f 1 16 -7.8882732e+01 4.77e-05 2.60e+01 -5.7 3.48e-03 - 5.76e-01 5.50e-01h 1 17 -7.8883171e+01 4.43e-05 6.75e+02 -6.1 3.72e-03 - 1.00e+00 7.26e-02h 1 18 -7.8885126e+01 1.35e-06 9.78e-01 -5.7 8.53e-04 - 1.00e+00 1.00e+00h 1 19 -7.8886948e+01 2.82e-06 5.65e+02 -8.2 3.45e-04 - 7.76e-01 9.00e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.8887004e+01 1.86e-06 2.78e+02 -8.1 8.62e-05 - 1.00e+00 3.65e-01h 1 21 -7.8887066e+01 8.14e-07 1.28e+02 -8.3 9.00e-05 - 1.00e+00 5.95e-01h 1 22 -7.8887100e+01 1.35e-07 2.44e+01 -8.7 4.75e-05 - 1.00e+00 8.41e-01h 1 23 -7.8887102e+01 1.23e-09 1.70e-01 -8.3 9.93e-06 - 1.00e+00 9.85e-01h 1 24 -7.8887106e+01 2.01e-09 1.06e+01 -11.0 1.08e-06 - 9.71e-01 7.77e-01h 1 25 -7.8887107e+01 4.67e-10 4.83e-03 -9.2 4.58e-07 - 1.00e+00 1.00e+00h 1 26 -7.8887107e+01 2.63e-10 3.40e+00 -11.0 2.63e-07 - 9.58e-01 5.85e-01h 1 27 -7.8887107e+01 1.94e-11 3.50e-04 -10.0 1.13e-07 - 1.00e+00 1.00e+00h 1 28 -7.8887107e+01 9.88e-12 2.32e+00 -11.0 4.61e-08 - 8.49e-01 5.34e-01h 1 29 -7.8887107e+01 4.44e-16 2.52e-05 -10.6 1.42e-08 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -7.8887107e+01 1.11e-16 7.80e-01 -11.0 9.04e-09 - 6.69e-01 1.00e+00h 1 31 -7.8887107e+01 4.44e-16 2.48e-06 -10.9 7.94e-10 - 1.00e+00 1.00e+00h 1 32 -7.8887107e+01 3.55e-15 4.02e-06 -11.0 6.94e-10 - 1.00e+00 1.00e+00h 1 33 -7.8887107e+01 4.44e-16 1.12e-07 -11.0 7.14e-11 - 1.00e+00 1.00e+00h 1 34 -7.8887107e+01 2.22e-16 5.37e-10 -11.0 2.89e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 34 (scaled) (unscaled) Objective...............: -2.2539173551572944e+01 -7.8887107430505310e+01 Dual infeasibility......: 5.3713289371870587e-10 1.8799651280154706e-09 Constraint violation....: 2.2204460492503131e-16 2.2204460492503131e-16 Complementarity.........: 1.0000474169560828e-11 3.5001659593462899e-11 Overall NLP error.......: 5.3713289371870587e-10 1.8799651280154706e-09 Number of objective function evaluations = 35 Number of objective gradient evaluations = 35 Number of equality constraint evaluations = 35 Number of inequality constraint evaluations = 35 Number of equality constraint Jacobian evaluations = 35 Number of inequality constraint Jacobian evaluations = 35 Number of Lagrangian Hessian evaluations = 34 Total CPU secs in IPOPT (w/o function evaluations) = 0.053 Total CPU secs in NLP function evaluations = 0.009 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -78.887107 34 0.06199 build initial OA NLP0014I 2 OPT -61.197161 126 0.19897 OA decomposition OA0003I New best feasible of -61.197161 found after 0.221967 sec and NLP0014I 3 OPT -52.449735 39 0.059991 OA decomposition NLP0014I 4 OPT -67.713387 48 0.071989 OA decomposition OA0003I New best feasible of -67.713387 found after 0.39594 sec and NLP0014I 5 OPT -59.847971 63 0.092986 OA decomposition OA0008I OA converged in 0.537919 seconds found solution of value -67.713387 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 28 branch-and-bound nodes in total Cbc0012I Integer solution of -67.713387 found by nonlinear programm after 14 iterations and 0 nodes (0.53 seconds) Cbc0031I 10 added rows had average density of 2.3 Cbc0013I At root node, 10 cuts changed objective from -78.887371 to -78.887323 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 21 row cuts average 2.5 elements, 0 column cuts (10 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -67.7133868503721, took 14 iterations and 0 nodes (0.53 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 21 cuts of which 10 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 67.7134. Best solution: 6.771339e+01 (0 nodes, 0.561 seconds) Best possible: 6.771339e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn40H.gms(1087) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn40H.gms Stop 09/08/12 19:59:03 elapsed 0:00:00.730 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt213 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn40M02H.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job Syn40M02H.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn40M02H.gms(2743) 2 Mb --- Starting execution: elapsed 0:00:00.013 --- Syn40M02H.gms(2741) 3 Mb --- Generating MINLP model m --- Syn40M02H.gms(2743) 6 Mb --- 1,213 rows 765 columns 2,741 non-zeroes --- 940 nl-code 168 nl-non-zeroes --- 160 discrete-columns --- Syn40M02H.gms(2743) 3 Mb --- Executing BONMIN: elapsed 0:00:00.017 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1060 Number of nonzeros in inequality constraint Jacobian.: 1548 Number of nonzeros in Lagrangian Hessian.............: 216 Total number of variables............................: 764 variables with only lower bounds: 510 variables with lower and upper bounds: 174 variables with only upper bounds: 0 Total number of equality constraints.................: 504 Total number of inequality constraints...............: 708 inequality constraints with only lower bounds: 108 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 600 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -6.7319999e+01 9.80e-01 2.56e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -9.4807236e+01 9.58e-01 2.49e+01 -0.3 6.04e+00 - 1.53e-02 2.28e-02f 1 2 -1.0144021e+02 9.21e-01 2.41e+01 -0.4 6.21e+00 - 3.72e-02 3.82e-02f 1 3 -1.0235574e+02 8.56e-01 2.45e+01 -0.4 5.78e+00 - 5.46e-02 7.11e-02f 1 4 -8.0033743e+01 6.70e-01 2.10e+01 -0.4 4.75e+00 - 2.02e-01 2.17e-01f 1 5 -3.0011160e+01 1.48e-01 4.06e+01 -0.6 3.86e+00 - 3.46e-01 7.79e-01f 1 6 -6.6525995e+01 2.96e-02 1.27e+01 -1.7 8.78e-01 - 6.49e-01 8.00e-01f 1 7 -1.2036946e+02 1.92e-02 1.50e+01 -1.4 3.66e+00 - 4.74e-01 3.50e-01f 1 8 -2.3525110e+02 3.41e-02 2.53e+01 -1.7 4.38e+00 - 3.71e-01 6.62e-01f 1 9 -3.2654992e+02 2.62e-02 1.62e+01 -2.4 3.24e+00 - 6.23e-01 7.97e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.6025254e+02 1.29e-02 2.43e+00 -2.9 2.99e+00 - 7.08e-01 6.19e-01f 1 11 -3.8622455e+02 3.91e-03 1.25e+01 -3.3 2.02e+00 - 6.36e-01 7.61e-01f 1 12 -3.9216681e+02 1.65e-03 3.22e+01 -3.5 5.76e-01 - 7.16e-01 5.69e-01f 1 13 -3.9597052e+02 5.71e-04 2.27e+01 -4.3 5.34e-01 - 7.77e-01 6.51e-01f 1 14 -3.9810161e+02 1.35e-05 8.29e+01 -4.6 3.42e-01 - 3.70e-01 9.84e-01f 1 15 -3.9824883e+02 1.30e-06 5.60e+01 -5.9 7.65e-02 - 8.02e-01 9.35e-01f 1 16 -3.9825590e+02 7.88e-07 1.80e+02 -7.7 2.39e-02 - 9.81e-01 3.95e-01h 1 17 -3.9826220e+02 3.11e-07 3.19e+01 -6.9 1.63e-02 - 1.00e+00 6.05e-01h 1 18 -3.9826624e+02 5.83e-07 7.53e-01 -6.9 6.54e-03 - 1.00e+00 9.97e-01h 1 19 -3.9826658e+02 1.68e-07 4.14e+02 -8.7 1.00e-04 - 9.48e-01 5.84e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -3.9826674e+02 6.73e-08 1.09e+02 -8.3 3.35e-05 - 1.00e+00 7.56e-01h 1 21 -3.9826678e+02 3.75e-08 5.52e+01 -8.7 1.02e-05 - 1.00e+00 5.95e-01h 1 22 -3.9826680e+02 9.21e-09 1.99e-02 -8.4 2.69e-06 - 1.00e+00 1.00e+00h 1 23 -3.9826681e+02 1.06e-08 1.04e+01 -10.9 2.08e-06 - 9.85e-01 7.32e-01h 1 24 -3.9826682e+02 7.93e-11 1.52e-03 -9.3 3.61e-07 - 1.00e+00 1.00e+00h 1 25 -3.9826682e+02 5.77e-11 4.30e+00 -11.0 2.24e-07 - 9.76e-01 5.61e-01h 1 26 -3.9826682e+02 1.78e-15 1.75e-04 -10.0 5.80e-08 - 1.00e+00 1.00e+00h 1 27 -3.9826682e+02 3.79e-12 3.76e-01 -10.8 3.06e-08 - 5.75e-01 5.01e-01h 1 28 -3.9826682e+02 1.87e-11 7.19e+01 -10.4 5.31e-09 - 2.74e-02 1.00e+00h 1 29 -3.9826682e+02 1.87e-11 7.27e+01 -10.4 5.22e-11 - 1.00e+00 1.22e-04h 14 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -3.9826682e+02 1.93e-12 2.46e-07 -10.4 4.19e-11 - 1.00e+00 1.00e+00h 1 31 -3.9826682e+02 7.80e-12 6.12e-01 -11.0 1.23e-08 - 9.92e-01 7.30e-01h 1 32 -3.9826682e+02 2.24e-12 4.58e-01 -11.0 2.66e-09 - 1.00e+00 7.13e-01h 1 33 -3.9826682e+02 1.96e-12 5.17e-01 -11.0 7.60e-10 - 1.00e+00 1.25e-01f 4 34 -3.9826682e+02 1.78e-15 1.49e-06 -11.0 6.65e-10 - 1.00e+00 1.00e+00h 1 35 -3.9826682e+02 1.78e-15 6.33e-07 -11.0 3.64e-10 - 1.00e+00 1.00e+00h 1 36 -3.9826682e+02 1.78e-15 5.64e-10 -11.0 3.78e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 36 (scaled) (unscaled) Objective...............: -6.6377803185330563e+01 -3.9826681911198341e+02 Dual infeasibility......: 5.6444432461333349e-10 3.3866659476800010e-09 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 1.0002620728822553e-11 6.0015724372935326e-11 Overall NLP error.......: 5.6444432461333349e-10 3.3866659476800010e-09 Number of objective function evaluations = 54 Number of objective gradient evaluations = 37 Number of equality constraint evaluations = 54 Number of inequality constraint evaluations = 54 Number of equality constraint Jacobian evaluations = 37 Number of inequality constraint Jacobian evaluations = 37 Number of Lagrangian Hessian evaluations = 36 Total CPU secs in IPOPT (w/o function evaluations) = 0.051 Total CPU secs in NLP function evaluations = 0.012 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -398.26682 36 0.06299 build initial OA NLP0014I 2 OPT -388.77273 47 0.058991 OA decomposition OA0003I New best feasible of -388.77273 found after 0.090986 sec and NLP0014I 3 OPT -373.97756 64 0.081988 OA decomposition NLP0014I 4 OPT -387.19338 62 0.176973 OA decomposition OA0008I OA converged in 0.512922 seconds found solution of value -388.77273 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 72 branch-and-bound nodes in total Cbc0012I Integer solution of -388.77273 found by nonlinear programm after 44 iterations and 0 nodes (0.51 seconds) Cbc0031I 28 added rows had average density of 2.25 Cbc0013I At root node, 28 cuts changed objective from -398.26778 to -398.2676 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 43 row cuts average 2.4 elements, 0 column cuts (28 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -388.7727338445123, took 44 iterations and 0 nodes (0.51 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 43 cuts of which 28 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 388.773. Best solution: 3.887727e+02 (0 nodes, 0.529 seconds) Best possible: 3.887727e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn40M02H.gms(2743) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn40M02H.gms Stop 09/08/12 19:59:03 elapsed 0:00:00.675 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt211 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn40M02M.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job Syn40M02M.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn40M02M.gms(1813) 2 Mb --- Starting execution: elapsed 0:00:00.015 --- Syn40M02M.gms(1811) 3 Mb --- Generating MINLP model m --- Syn40M02M.gms(1813) 5 Mb --- 813 rows 421 columns 2,013 non-zeroes --- 380 nl-code 56 nl-non-zeroes --- 160 discrete-columns --- Syn40M02M.gms(1813) 3 Mb --- Executing BONMIN: elapsed 0:00:00.021 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 140 Number of nonzeros in inequality constraint Jacobian.: 1740 Number of nonzeros in Lagrangian Hessian.............: 56 Total number of variables............................: 420 variables with only lower bounds: 166 variables with lower and upper bounds: 174 variables with only upper bounds: 0 Total number of equality constraints.................: 44 Total number of inequality constraints...............: 768 inequality constraints with only lower bounds: 224 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 544 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -6.7319999e+01 9.80e-01 3.38e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.6760849e+02 9.54e-01 3.34e+01 -0.4 5.12e+00 - 2.00e-02 2.70e-02f 1 2 -3.2889221e+02 9.26e-01 3.38e+01 -0.5 5.99e+00 - 1.60e-02 2.92e-02f 1 3 -5.9399911e+02 8.96e-01 3.30e+01 -0.5 7.92e+00 - 2.87e-02 3.18e-02f 1 4 -1.5949445e+03 8.36e-01 3.40e+01 -0.5 1.54e+01 - 2.86e-02 6.73e-02f 1 5 -2.8400357e+03 7.96e-01 3.40e+01 -0.5 3.65e+01 - 2.68e-02 4.82e-02f 1 6 -3.0649536e+03 7.78e-01 2.97e+01 -0.5 2.04e+01 - 6.94e-02 2.16e-02f 1 7 -3.3598820e+03 7.26e-01 3.00e+01 -0.5 9.15e+00 - 3.66e-02 6.75e-02f 1 8 -3.6876884e+03 6.51e-01 3.02e+01 -0.5 7.50e+00 - 5.05e-02 1.04e-01f 1 9 -3.8995963e+03 5.77e-01 2.02e+01 -0.5 7.78e+00 - 3.51e-01 1.13e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.0899435e+03 4.38e-01 1.53e+01 -0.8 3.19e+00 - 3.44e-01 2.42e-01f 1 11 -4.1321333e+03 3.85e-01 1.90e+01 -0.8 2.76e+00 - 3.95e-01 1.20e-01f 1 12 -4.2494402e+03 2.21e-01 7.76e+00 -0.9 2.46e+00 - 2.68e-01 4.25e-01f 1 13 -4.3319897e+03 1.04e-01 3.67e+00 -1.1 1.69e+00 - 4.83e-01 5.28e-01h 1 14 -4.4192338e+03 2.31e-02 2.13e+01 -1.2 1.09e+00 - 4.00e-01 7.79e-01h 1 15 -4.4589316e+03 1.20e-02 1.14e+01 -1.7 1.06e+00 - 7.18e-01 4.83e-01f 1 16 -4.5057943e+03 4.80e-03 5.93e+00 -2.3 1.51e+00 - 6.29e-01 5.99e-01f 1 17 -4.5295627e+03 1.88e-03 1.05e+01 -2.4 1.58e+00 - 4.48e-01 6.09e-01f 1 18 -4.5384200e+03 8.40e-04 6.42e+01 -2.4 1.22e+00 - 2.83e-01 5.52e-01f 1 19 -4.5437871e+03 4.46e-04 2.79e+01 -2.6 1.51e+00 - 6.75e-01 4.70e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.5495504e+03 1.39e-04 4.53e+01 -2.8 4.83e-01 - 8.02e-01 6.88e-01f 1 21 -4.5531616e+03 4.50e-05 1.01e+01 -3.7 4.01e-01 - 6.45e-01 6.76e-01f 1 22 -4.5545413e+03 1.63e-05 1.10e+01 -4.8 1.46e-01 - 8.53e-01 6.39e-01f 1 23 -4.5552158e+03 2.63e-06 2.72e-01 -5.6 3.96e-02 - 6.91e-01 8.38e-01f 1 24 -4.5553336e+03 4.69e-06 9.40e-02 -7.3 8.41e-03 - 9.21e-01 8.82e-01h 1 25 -4.5553493e+03 2.25e-07 2.75e-02 -11.0 1.00e-03 - 9.80e-01 9.79e-01h 1 26 -4.5553496e+03 4.21e-09 4.85e+00 -11.0 2.06e-05 - 9.90e-01 9.81e-01h 1 27 -4.5553496e+03 1.23e-09 1.06e+02 -11.0 3.99e-07 - 9.83e-01 6.76e-01h 1 28 -4.5553496e+03 2.01e-09 2.35e-07 -9.4 1.21e-07 - 1.00e+00 1.00e+00h 1 29 -4.5553496e+03 5.66e-10 9.15e+00 -10.2 3.03e-08 - 4.50e-01 7.24e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -4.5553496e+03 2.22e-10 6.23e-10 -9.8 1.88e-09 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 30 (scaled) (unscaled) Objective...............: -7.5922493366935407e+02 -4.5553496020161247e+03 Dual infeasibility......: 6.2311768245226773e-10 3.7387060947136064e-09 Constraint violation....: 2.2174928560048102e-10 2.2174928560048102e-10 Complementarity.........: 3.1616884406275477e-10 1.8970130643765289e-09 Overall NLP error.......: 6.2311768245226773e-10 3.7387060947136064e-09 Number of objective function evaluations = 31 Number of objective gradient evaluations = 31 Number of equality constraint evaluations = 31 Number of inequality constraint evaluations = 31 Number of equality constraint Jacobian evaluations = 31 Number of inequality constraint Jacobian evaluations = 31 Number of Lagrangian Hessian evaluations = 30 Total CPU secs in IPOPT (w/o function evaluations) = 0.065 Total CPU secs in NLP function evaluations = 0.015 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4555.3496 30 0.079987 build initial OA NLP0014I 2 OPT -376.48749 19 0.038994 OA decomposition OA0003I New best feasible of -376.48749 found after 0.116982 sec and NLP0014I 3 OPT -387.2834 28 0.055991 OA decomposition OA0003I New best feasible of -387.2834 found after 0.222966 sec and NLP0014I 4 OPT -388.77236 20 0.050992 OA decomposition OA0003I New best feasible of -388.77236 found after 0.334949 sec and OA0008I OA converged in 0.39294 seconds found solution of value -388.77236 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 38 branch-and-bound nodes in total Cbc0012I Integer solution of -388.77236 found by nonlinear programm after 3 iterations and 0 nodes (0.38 seconds) Cbc0031I 3 added rows had average density of 3 Cbc0013I At root node, 3 cuts changed objective from -4555.3499 to -4555.3499 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 3.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -388.7723580117942, took 3 iterations and 0 nodes (0.39 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 388.772. Best solution: 3.887724e+02 (0 nodes, 0.406 seconds) Best possible: 3.887724e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn40M02M.gms(1813) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn40M02M.gms Stop 09/08/12 19:59:03 elapsed 0:00:00.603 @04 1347127143 ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- =ready= Linux opt218 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn40M03H.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job Syn40M03H.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn40M03H.gms(4491) 3 Mb --- Starting execution: elapsed 0:00:00.029 --- Syn40M03H.gms(4489) 3 Mb --- Generating MINLP model m --- Syn40M03H.gms(4491) 6 Mb --- 1,999 rows 1,147 columns 4,531 non-zeroes --- 1,410 nl-code 252 nl-non-zeroes --- 240 discrete-columns --- Syn40M03H.gms(4491) 4 Mb --- Executing BONMIN: elapsed 0:00:00.043 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1590 Number of nonzeros in inequality constraint Jacobian.: 2742 Number of nonzeros in Lagrangian Hessian.............: 324 Total number of variables............................: 1146 variables with only lower bounds: 765 variables with lower and upper bounds: 261 variables with only upper bounds: 0 Total number of equality constraints.................: 756 Total number of inequality constraints...............: 1242 inequality constraints with only lower bounds: 162 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1080 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -6.1849999e+01 9.80e-01 2.56e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -7.2550959e+01 9.72e-01 2.53e+01 0.1 1.97e+01 - 7.03e-03 8.30e-03f 1 2 -7.4645220e+01 9.59e-01 2.54e+01 0.1 1.95e+01 - 2.06e-02 1.32e-02f 1 3 -7.2563192e+01 9.38e-01 2.47e+01 0.0 2.05e+01 - 1.89e-02 2.24e-02f 1 4 -5.2530137e+01 8.23e-01 4.16e+01 0.0 2.21e+01 - 5.00e-02 1.23e-01f 1 5 3.0299263e+01 5.11e-01 1.47e+02 -0.0 2.34e+01 - 1.15e-01 3.79e-01f 1 6 2.0063171e+01 3.64e-01 8.69e+01 -0.2 1.38e+01 - 4.49e-01 2.88e-01f 1 7 1.9411451e+01 1.40e-01 4.73e+01 -0.4 9.39e+00 - 1.00e+00 6.16e-01h 1 8 -3.5698885e+01 9.56e-03 3.45e+01 -1.4 2.94e+00 - 5.63e-01 9.32e-01h 1 9 -8.9412227e+01 1.57e-02 5.93e+01 -1.2 9.28e+00 - 5.45e-01 4.45e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.9383372e+02 3.75e-02 5.71e+00 -1.5 8.30e+00 - 6.27e-01 6.72e-01f 1 11 -2.8156571e+02 2.66e-02 5.76e+01 -1.8 9.01e+00 - 7.39e-01 6.70e-01f 1 12 -3.5488783e+02 1.53e-02 4.37e+01 -2.6 9.07e+00 - 5.59e-01 7.13e-01f 1 13 -3.9094095e+02 7.49e-03 7.92e+01 -3.1 7.31e+00 - 5.51e-01 6.93e-01f 1 14 -4.0458676e+02 3.28e-03 1.29e+02 -3.2 6.17e+00 - 7.43e-01 6.21e-01f 1 15 -4.1055576e+02 1.30e-03 1.06e+03 -3.3 3.69e+00 - 2.27e-01 6.14e-01f 1 16 -4.1419268e+02 6.74e-05 4.83e+03 -3.3 4.98e+00 - 2.64e-01 9.15e-01h 1 17 -4.1571001e+02 2.55e-05 4.34e+02 -4.1 3.24e+00 - 6.96e-01 5.31e-01f 1 18 -4.1705042e+02 3.53e-06 4.93e+02 -4.9 2.28e+00 - 6.86e-01 7.99e-01f 1 19 -4.1727891e+02 1.36e-06 1.85e+02 -5.8 5.26e-01 - 9.53e-01 5.74e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.1744583e+02 7.89e-08 1.32e+02 -8.5 2.31e-01 - 9.69e-01 9.41e-01f 1 21 -4.1744973e+02 3.61e-08 5.16e+03 -6.8 2.01e-02 - 1.00e+00 4.09e-01h 1 22 -4.1745388e+02 4.31e-07 1.81e+03 -6.9 3.25e-02 - 1.00e+00 7.25e-01h 1 23 -4.1745559e+02 9.09e-08 4.88e+02 -7.4 4.12e-03 - 1.00e+00 8.33e-01h 1 24 -4.1745591e+02 4.62e-08 3.55e+02 -8.8 5.76e-04 - 1.00e+00 5.98e-01h 1 25 -4.1745605e+02 1.86e-08 4.91e+01 -8.1 5.65e-02 - 1.00e+00 8.31e-01h 1 26 -4.1745605e+02 1.66e-08 1.03e+02 -8.8 6.65e-03 - 1.00e+00 1.15e-01h 1 27 -4.1745609e+02 1.09e-08 7.17e+00 -8.3 1.18e-01 - 1.00e+00 8.92e-01h 1 28 -4.1745609e+02 4.94e-09 3.59e+00 -8.3 7.05e-02 - 1.00e+00 5.00e-01f 2 29 -4.1745609e+02 7.11e-15 3.60e-04 -8.3 3.52e-02 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -4.1745610e+02 1.48e-09 8.57e+00 -9.6 2.04e-05 - 7.36e-01 5.63e-01h 1 31 -4.1745611e+02 3.52e-10 4.17e-03 -8.8 3.55e-06 - 1.00e+00 1.00e+00h 1 32 -4.1745611e+02 9.47e-10 4.19e+00 -10.7 6.45e-06 - 8.95e-01 6.26e-01h 1 33 -4.1745611e+02 2.81e-10 2.09e-03 -9.5 1.26e-06 - 1.00e+00 1.00e+00h 1 34 -4.1745611e+02 2.04e-10 5.47e+00 -11.0 1.18e-06 - 9.50e-01 4.40e-01h 1 In iteration 34, 2 Slacks too small, adjusting variable bounds 35 -4.1745611e+02 5.03e-11 5.71e-01 -10.2 6.00e-07 - 1.00e+00 9.37e-01h 1 36 -4.1745611e+02 3.55e-15 1.77e-05 -10.2 7.59e-08 - 1.00e+00 1.00e+00h 1 37 -4.1745611e+02 2.19e-12 1.38e-01 -11.0 3.54e-07 - 7.25e-01 6.94e-01h 1 38 -4.1745611e+02 1.78e-15 2.74e-05 -10.7 1.06e-07 - 1.00e+00 1.00e+00h 1 39 -4.1745611e+02 3.55e-15 2.42e-01 -11.0 1.29e-07 - 1.00e+00 8.28e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -4.1745611e+02 7.11e-15 5.08e-06 -11.0 4.52e-08 - 1.00e+00 1.00e+00h 1 41 -4.1745611e+02 8.88e-16 2.94e-08 -11.0 1.63e-09 - 1.00e+00 1.00e+00h 1 42 -4.1745611e+02 7.11e-15 3.09e-11 -11.0 4.30e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 42 (scaled) (unscaled) Objective...............: -9.7082816889509431e+01 -4.1745611262489058e+02 Dual infeasibility......: 3.0885301260941134e-11 1.3280679542204688e-10 Constraint violation....: 7.1054273576010019e-15 7.1054273576010019e-15 Complementarity.........: 1.0000278678612956e-11 4.3001198318035714e-11 Overall NLP error.......: 3.0885301260941134e-11 1.3280679542204688e-10 Number of objective function evaluations = 44 Number of objective gradient evaluations = 43 Number of equality constraint evaluations = 44 Number of inequality constraint evaluations = 44 Number of equality constraint Jacobian evaluations = 43 Number of inequality constraint Jacobian evaluations = 43 Number of Lagrangian Hessian evaluations = 42 Total CPU secs in IPOPT (w/o function evaluations) = 0.195 Total CPU secs in NLP function evaluations = 0.040 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -417.45611 42 0.234965 build initial OA NLP0014I 2 OPT -318.64672 40 0.161975 OA decomposition OA0003I New best feasible of -318.64672 found after 0.250962 sec and NLP0014I 3 OPT -369.36693 41 0.169974 OA decomposition OA0003I New best feasible of -369.36693 found after 0.555916 sec and NLP0014I 4 OPT -393.47909 48 0.087987 OA decomposition OA0003I New best feasible of -393.47909 found after 0.700894 sec and NLP0014I 5 OPT -395.14853 53 0.097985 OA decomposition OA0003I New best feasible of -395.14853 found after 0.85887 sec and OA0008I OA converged in 0.92486 seconds found solution of value -395.14853 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 137 branch-and-bound nodes in total Cbc0012I Integer solution of -395.14853 found by nonlinear programm after 48 iterations and 0 nodes (0.90 seconds) Cbc0031I 29 added rows had average density of 2.2758621 Cbc0013I At root node, 29 cuts changed objective from -417.45708 to -417.4569 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 60 row cuts average 2.5 elements, 0 column cuts (29 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -395.1485251105607, took 48 iterations and 0 nodes (0.90 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 60 cuts of which 29 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 395.149. Best solution: 3.951485e+02 (0 nodes, 0.943 seconds) Best possible: 3.951485e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn40M03H.gms(4491) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn40M03H.gms Stop 09/08/12 19:59:04 elapsed 0:00:01.324 @04 1347127144 ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- =ready= Linux opt214 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn40M03M.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job Syn40M03M.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn40M03M.gms(3080) 2 Mb --- Starting execution: elapsed 0:00:00.013 --- Syn40M03M.gms(3078) 3 Mb --- Generating MINLP model m --- Syn40M03M.gms(3080) 6 Mb --- 1,399 rows 631 columns 3,439 non-zeroes --- 570 nl-code 84 nl-non-zeroes --- 240 discrete-columns --- Syn40M03M.gms(3080) 3 Mb --- Executing BONMIN: elapsed 0:00:00.018 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 210 Number of nonzeros in inequality constraint Jacobian.: 3030 Number of nonzeros in Lagrangian Hessian.............: 84 Total number of variables............................: 630 variables with only lower bounds: 249 variables with lower and upper bounds: 261 variables with only upper bounds: 0 Total number of equality constraints.................: 66 Total number of inequality constraints...............: 1332 inequality constraints with only lower bounds: 336 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 996 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -6.1849999e+01 9.80e-01 3.43e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.4939518e+02 9.61e-01 3.38e+01 -0.2 1.92e+01 - 1.14e-02 1.92e-02f 1 2 -3.9677490e+02 9.48e-01 3.33e+01 -0.2 1.88e+01 - 1.02e-02 1.37e-02f 1 3 -5.7761260e+02 9.39e-01 3.30e+01 -0.2 1.87e+01 - 1.70e-02 1.00e-02f 1 4 -7.4429810e+02 9.31e-01 3.27e+01 -0.2 1.86e+01 - 2.28e-02 8.24e-03f 1 5 -1.1626890e+03 9.16e-01 3.22e+01 -0.2 2.86e+01 - 1.52e-02 1.64e-02f 1 6 -3.0024367e+03 8.70e-01 3.10e+01 -0.2 3.92e+01 - 2.00e-02 4.98e-02f 1 7 -3.1974974e+03 8.60e-01 3.05e+01 -0.3 3.31e+01 - 5.21e-02 1.11e-02f 1 8 -3.5139516e+03 8.33e-01 2.95e+01 -0.3 2.12e+01 - 3.05e-02 3.22e-02f 1 9 -3.8687210e+03 7.81e-01 2.76e+01 -0.3 1.93e+01 - 2.79e-02 6.21e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.9141205e+03 7.72e-01 3.09e+01 -0.3 2.30e+01 - 7.28e-02 1.17e-02f 1 11 -4.2316138e+03 6.83e-01 2.59e+01 -0.3 1.90e+01 - 3.04e-02 1.15e-01f 1 12 -4.8639133e+03 5.80e-01 4.22e+01 -0.3 5.08e+01 - 2.97e-02 1.51e-01f 1 13 -5.0686186e+03 5.40e-01 3.97e+01 -0.3 3.37e+01 - 1.76e-01 6.99e-02f 1 14 -5.3055631e+03 4.68e-01 3.41e+01 -0.5 2.30e+01 - 2.48e-01 1.33e-01f 1 15 -5.3991668e+03 4.18e-01 3.08e+01 -0.4 1.69e+01 - 3.59e-01 1.06e-01f 1 16 -5.6598734e+03 2.40e-01 1.77e+01 -0.8 8.58e+00 - 2.95e-01 4.26e-01f 1 17 -5.7456358e+03 1.20e-01 8.85e+00 -0.6 7.67e+00 - 3.98e-01 5.00e-01h 1 18 -5.8459771e+03 4.29e-02 8.83e+00 -0.8 4.04e+00 - 5.91e-01 6.43e-01h 1 19 -5.9736517e+03 1.86e-02 6.11e+00 -1.5 2.41e+00 - 5.33e-01 5.67e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -6.0622160e+03 5.72e-03 5.17e+01 -1.5 3.57e+00 - 4.23e-01 6.92e-01f 1 21 -6.1199252e+03 1.32e-03 9.88e+01 -1.7 3.35e+00 - 5.32e-01 7.69e-01h 1 22 -6.1510617e+03 6.03e-04 1.99e+01 -2.4 2.19e+00 - 6.31e-01 5.43e-01f 1 23 -6.1743244e+03 1.63e-04 7.20e+01 -2.6 9.88e-01 - 5.74e-01 7.30e-01f 1 24 -6.1835245e+03 3.89e-05 1.13e+02 -2.8 1.07e+00 - 6.55e-01 7.61e-01f 1 25 -6.1877995e+03 1.30e-05 5.13e+01 -3.7 1.27e+00 - 6.41e-01 6.66e-01f 1 26 -6.1895766e+03 3.85e-06 1.51e+02 -3.9 1.42e+00 - 5.53e-01 7.03e-01f 1 27 -6.1901175e+03 3.13e-03 2.36e+02 -4.1 7.42e-01 - 5.18e-01 6.04e-01f 1 28 -6.1903434e+03 2.97e-03 1.46e+02 -4.4 3.97e-01 - 6.11e-01 5.01e-01h 1 29 -6.1905178e+03 1.34e-03 1.59e+02 -5.6 1.37e-01 - 9.16e-01 5.75e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -6.1906198e+03 6.02e-04 1.44e+01 -7.1 1.11e-02 - 9.77e-01 7.73e-01h 1 31 -6.1906487e+03 2.23e-05 1.16e+01 -9.9 1.96e-03 - 9.85e-01 9.65e-01h 1 32 -6.1906498e+03 4.17e-07 3.29e+01 -10.3 6.93e-05 - 9.90e-01 9.81e-01h 1 33 -6.1906498e+03 4.16e-07 3.32e+01 -7.9 5.67e-01 - 1.09e-03 7.17e-04H 1 34 -6.1906498e+03 1.46e-03 2.27e+02 -8.0 4.45e-01 - 6.75e-01 4.32e-01H 1 35 -6.1906498e+03 1.19e-08 6.69e+00 -8.0 2.11e-01 - 1.00e+00 9.47e-02h 4 36 -6.1906498e+03 1.36e-10 2.49e-09 -8.0 1.22e-01 - 1.00e+00 1.00e+00h 1 37 -6.1906498e+03 1.16e-11 1.13e-09 -8.0 1.53e-02 - 1.00e+00 1.00e+00h 1 38 -6.1906498e+03 1.08e-10 3.98e-11 -8.0 4.60e-04 - 1.00e+00 1.00e+00h 1 39 -6.1906498e+03 2.62e-11 1.62e+01 -11.0 3.50e-06 - 9.35e-01 7.81e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -6.1906498e+03 1.09e-14 3.24e-09 -9.1 5.15e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 40 (scaled) (unscaled) Objective...............: -1.4396859939342701e+03 -6.1906497739173610e+03 Dual infeasibility......: 3.2376402969704114e-09 1.3921853276972769e-08 Constraint violation....: 1.0935696792557792e-14 1.0935696792557792e-14 Complementarity.........: 1.3756811646269799e-09 5.9154290078960136e-09 Overall NLP error.......: 3.2376402969704114e-09 1.3921853276972769e-08 Number of objective function evaluations = 49 Number of objective gradient evaluations = 41 Number of equality constraint evaluations = 49 Number of inequality constraint evaluations = 49 Number of equality constraint Jacobian evaluations = 41 Number of inequality constraint Jacobian evaluations = 41 Number of Lagrangian Hessian evaluations = 40 Total CPU secs in IPOPT (w/o function evaluations) = 0.164 Total CPU secs in NLP function evaluations = 0.024 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -6190.6498 40 0.187972 build initial OA NLP0014I 2 OPT -354.68942 30 0.088986 OA decomposition OA0003I New best feasible of -354.68942 found after 0.171974 sec and NLP0014I 3 OPT -361.10484 22 0.06799 OA decomposition OA0003I New best feasible of -361.10484 found after 0.320952 sec and NLP0014I 4 OPT -372.05985 20 0.059991 OA decomposition OA0003I New best feasible of -372.05985 found after 0.481927 sec and NLP0014I 5 OPT -395.06532 19 0.054992 OA decomposition OA0003I New best feasible of -395.06532 found after 0.639903 sec and NLP0014I 6 OPT -395.14805 19 0.035994 OA decomposition OA0003I New best feasible of -395.14805 found after 0.810877 sec and OA0008I OA converged in 0.811877 seconds found solution of value -395.14805 (lower bound 1e+50 ). OA0010I Performed 5 iterations, explored 80 branch-and-bound nodes in total Cbc0012I Integer solution of -395.14805 found by nonlinear programm after 10 iterations and 0 nodes (0.79 seconds) Cbc0031I 7 added rows had average density of 3 Cbc0013I At root node, 7 cuts changed objective from -6190.6501 to -6190.6501 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 22 row cuts average 3.0 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -395.1480486680102, took 10 iterations and 0 nodes (0.80 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 22 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 395.148. Best solution: 3.951480e+02 (0 nodes, 0.827 seconds) Best possible: 3.951480e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn40M03M.gms(3080) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn40M03M.gms Stop 09/08/12 19:59:04 elapsed 0:00:01.103 @04 1347127144 ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- =ready= Linux opt208 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn40M04H.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job Syn40M04H.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn40M04H.gms(6508) 3 Mb --- Starting execution: elapsed 0:00:00.041 --- Syn40M04H.gms(6506) 3 Mb --- Generating MINLP model m --- Syn40M04H.gms(6508) 6 Mb --- 2,905 rows 1,529 columns 6,601 non-zeroes --- 1,880 nl-code 336 nl-non-zeroes --- 320 discrete-columns --- Syn40M04H.gms(6508) 4 Mb --- Executing BONMIN: elapsed 0:00:00.060 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2120 Number of nonzeros in inequality constraint Jacobian.: 4216 Number of nonzeros in Lagrangian Hessian.............: 432 Total number of variables............................: 1528 variables with only lower bounds: 1020 variables with lower and upper bounds: 348 variables with only upper bounds: 0 Total number of equality constraints.................: 1008 Total number of inequality constraints...............: 1896 inequality constraints with only lower bounds: 216 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1680 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.3092000e+02 9.80e-01 2.41e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.7432979e+02 9.61e-01 2.36e+01 -0.3 5.67e+00 - 1.29e-02 1.89e-02f 1 2 -1.9621999e+02 9.33e-01 2.30e+01 -0.3 5.61e+00 - 2.65e-02 3.00e-02f 1 3 -2.1065873e+02 8.78e-01 2.15e+01 -0.3 5.55e+00 - 6.07e-02 5.86e-02f 1 4 -2.0142579e+02 7.04e-01 2.80e+01 -0.4 6.12e+00 - 1.10e-01 1.98e-01f 1 5 -1.5428909e+02 3.33e-01 3.35e+01 -0.4 5.46e+00 - 3.48e-01 5.27e-01f 1 6 -1.8016565e+02 1.80e-01 4.10e+01 -0.6 3.27e+00 - 1.00e+00 4.61e-01f 1 7 -3.0863789e+02 1.97e-02 2.23e+01 -1.4 1.66e+00 - 4.42e-01 8.90e-01h 1 8 -4.4160017e+02 1.15e-02 1.06e+01 -1.4 2.84e+00 - 5.33e-01 5.53e-01f 1 9 -6.1575743e+02 1.21e-02 2.20e+01 -1.7 2.52e+00 - 5.89e-01 6.85e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -7.4074587e+02 7.31e-03 2.80e+00 -2.0 3.49e+00 - 6.77e-01 6.63e-01f 1 11 -8.6581077e+02 5.57e-03 3.20e+01 -3.0 2.33e+00 - 6.29e-01 9.02e-01f 1 12 -8.9344499e+02 2.25e-03 6.61e+01 -3.3 1.17e+00 - 5.93e-01 7.07e-01f 1 13 -9.0487142e+02 1.06e-03 1.08e+02 -3.4 1.98e+00 - 5.34e-01 5.83e-01f 1 14 -9.0967408e+02 6.78e-04 6.53e+02 -3.7 1.96e+00 - 7.49e-01 3.80e-01f 1 15 -9.1345909e+02 3.27e-04 1.41e+03 -3.5 1.33e+00 - 7.77e-01 5.07e-01f 1 16 -9.1690632e+02 1.15e-04 4.47e+01 -4.0 9.05e-01 - 4.54e-01 6.24e-01f 1 17 -9.1900489e+02 4.01e-05 9.45e+01 -4.8 5.22e-01 - 5.98e-01 6.84e-01f 1 18 -9.1926466e+02 2.92e-05 2.36e+03 -4.8 1.74e-01 - 9.18e-01 2.68e-01f 1 19 -9.1999312e+02 8.07e-06 4.21e+02 -6.5 1.52e-01 - 8.16e-01 8.22e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.2012416e+02 1.52e-05 2.05e+02 -7.1 3.22e-02 - 9.84e-01 8.21e-01f 1 21 -9.2014226e+02 9.68e-06 1.84e+03 -7.1 1.33e-02 - 1.00e+00 6.25e-01h 1 22 -9.2014791e+02 4.76e-06 2.24e+03 -7.1 1.61e-02 - 9.96e-01 5.66e-01h 1 23 -9.2015098e+02 1.77e-06 1.40e+03 -7.9 2.44e-03 - 1.00e+00 6.32e-01h 1 24 -9.2015268e+02 4.42e-07 1.77e+02 -9.9 5.75e-04 - 9.23e-01 8.84e-01h 1 25 -9.2015274e+02 2.83e-07 1.22e+02 -8.4 2.50e-02 - 1.00e+00 3.33e-01h 1 26 -9.2015282e+02 1.11e-08 7.43e-02 -8.1 3.22e-03 - 1.00e+00 1.00e+00h 1 27 -9.2015284e+02 8.49e-09 5.60e+01 -9.6 5.97e-05 - 1.00e+00 2.99e-01h 1 28 -9.2015287e+02 4.84e-09 1.50e+01 -8.7 1.26e-02 - 1.00e+00 5.89e-01h 1 29 -9.2015288e+02 6.40e-10 7.70e-03 -8.7 5.87e-03 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -9.2015289e+02 1.25e-09 2.67e+00 -9.9 2.91e-06 - 7.01e-01 5.74e-01h 1 31 -9.2015289e+02 1.78e-15 1.03e-03 -9.2 7.19e-07 - 1.00e+00 1.00e+00h 1 32 -9.2015290e+02 2.02e-10 6.85e+00 -10.9 1.13e-06 - 9.49e-01 5.05e-01h 1 33 -9.2015290e+02 1.36e-10 1.42e-03 -9.8 5.18e-07 - 1.00e+00 1.00e+00h 1 34 -9.2015290e+02 8.34e-11 3.81e+00 -11.0 3.74e-07 - 7.76e-01 4.90e-01h 1 35 -9.2015290e+02 1.78e-15 1.12e+00 -10.3 1.45e-07 - 6.68e-01 1.00e+00h 1 36 -9.2015290e+02 1.78e-15 2.57e-06 -10.3 3.56e-09 - 1.00e+00 1.00e+00h 1 37 -9.2015290e+02 1.78e-15 1.40e-01 -11.0 1.26e-07 - 7.59e-01 7.13e-01h 1 38 -9.2015290e+02 1.78e-15 3.85e-06 -10.8 2.49e-08 - 1.00e+00 1.00e+00h 1 39 -9.2015290e+02 1.78e-15 3.81e-06 -11.0 2.21e-08 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -9.2015290e+02 1.78e-15 2.55e-07 -11.0 3.28e-10 - 1.00e+00 1.00e+00h 1 41 -9.2015290e+02 1.78e-15 6.75e-09 -11.0 2.41e-11 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 41 (scaled) (unscaled) Objective...............: -1.4377389079522419e+02 -9.2015290108943486e+02 Dual infeasibility......: 6.7535077113989317e-09 4.3222449352953165e-08 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 1.0071133338241838e-11 6.4455253364747769e-11 Overall NLP error.......: 6.7535077113989317e-09 4.3222449352953165e-08 Number of objective function evaluations = 42 Number of objective gradient evaluations = 42 Number of equality constraint evaluations = 42 Number of inequality constraint evaluations = 42 Number of equality constraint Jacobian evaluations = 42 Number of inequality constraint Jacobian evaluations = 42 Number of Lagrangian Hessian evaluations = 41 Total CPU secs in IPOPT (w/o function evaluations) = 0.267 Total CPU secs in NLP function evaluations = 0.062 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -920.1529 41 0.32895 build initial OA NLP0014I 2 OPT -837.71246 44 0.245963 OA decomposition OA0003I New best feasible of -837.71246 found after 0.436934 sec and NLP0014I 3 OPT -901.55251 62 0.159976 OA decomposition OA0003I New best feasible of -901.55251 found after 0.747887 sec and NLP0014I 4 OPT -901.60212 47 0.117982 OA decomposition OA0003I New best feasible of -901.60212 found after 0.99085 sec and NLP0014I 5 OPT -901.75162 59 0.146978 OA decomposition OA0003I New best feasible of -901.75162 found after 1.267808 sec and OA0008I OA converged in 1.404787 seconds found solution of value -901.75162 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 284 branch-and-bound nodes in total Cbc0012I Integer solution of -901.75162 found by nonlinear programm after 73 iterations and 0 nodes (1.35 seconds) Cbc0031I 53 added rows had average density of 2.3773585 Cbc0013I At root node, 53 cuts changed objective from -920.15479 to -920.15417 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 72 row cuts average 2.5 elements, 0 column cuts (53 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -901.7516160010524, took 73 iterations and 0 nodes (1.36 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 72 cuts of which 53 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 901.752. Best solution: 9.017516e+02 (0 nodes, 1.428 seconds) Best possible: 9.017516e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn40M04H.gms(6508) 3 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn40M04H.gms Stop 09/08/12 19:59:05 elapsed 0:00:01.924 @04 1347127145 ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- =ready= Linux opt221 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn40M04M.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job Syn40M04M.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn40M04M.gms(4600) 3 Mb --- Starting execution: elapsed 0:00:00.032 --- Syn40M04M.gms(4598) 3 Mb --- Generating MINLP model m --- Syn40M04M.gms(4600) 6 Mb --- 2,105 rows 841 columns 5,145 non-zeroes --- 760 nl-code 112 nl-non-zeroes --- 320 discrete-columns --- Syn40M04M.gms(4600) 4 Mb --- Executing BONMIN: elapsed 0:00:00.045 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 280 Number of nonzeros in inequality constraint Jacobian.: 4600 Number of nonzeros in Lagrangian Hessian.............: 112 Total number of variables............................: 840 variables with only lower bounds: 332 variables with lower and upper bounds: 348 variables with only upper bounds: 0 Total number of equality constraints.................: 88 Total number of inequality constraints...............: 2016 inequality constraints with only lower bounds: 448 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1568 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.3092000e+02 9.80e-01 3.36e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.3301848e+02 9.54e-01 3.35e+01 -0.4 5.18e+00 - 1.48e-02 2.70e-02f 1 2 -5.4934049e+02 9.34e-01 3.29e+01 -0.4 5.34e+00 - 2.54e-02 2.02e-02f 1 3 -1.0193188e+03 9.10e-01 3.20e+01 -0.4 6.86e+00 - 3.18e-02 2.64e-02f 1 4 -3.6910188e+03 8.33e-01 3.08e+01 -0.4 1.49e+01 - 2.52e-02 8.41e-02f 1 5 -5.0514528e+03 8.10e-01 2.92e+01 -0.4 2.56e+01 - 3.93e-02 2.81e-02f 1 6 -5.2930225e+03 8.02e-01 2.83e+01 -0.4 2.18e+01 - 7.43e-02 8.95e-03f 1 7 -6.3388452e+03 7.47e-01 2.64e+01 -0.4 1.53e+01 - 6.02e-02 6.88e-02f 1 8 -7.0806124e+03 6.71e-01 2.50e+01 -0.4 7.34e+00 - 3.83e-02 1.02e-01f 1 9 -7.5629572e+03 5.89e-01 2.63e+01 -0.5 5.67e+00 - 5.37e-02 1.23e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -7.9422817e+03 4.87e-01 2.59e+01 -0.5 3.90e+00 - 9.67e-02 1.73e-01f 1 11 -8.1154551e+03 4.12e-01 1.49e+01 -0.6 3.24e+00 - 5.14e-01 1.52e-01f 1 12 -8.3672470e+03 2.45e-01 8.66e+00 -0.8 2.01e+00 - 3.16e-01 4.07e-01f 1 13 -8.4811066e+03 1.54e-01 2.51e+01 -0.8 1.62e+00 - 7.21e-01 3.71e-01h 1 14 -8.7155923e+03 4.17e-02 7.02e+00 -1.1 1.37e+00 - 4.89e-01 7.29e-01h 1 15 -8.8568354e+03 1.66e-02 6.44e-01 -1.4 1.23e+00 - 6.34e-01 6.02e-01h 1 16 -8.9956402e+03 2.44e-03 1.25e+01 -1.5 1.03e+00 - 7.81e-01 8.53e-01h 1 17 -9.0796893e+03 9.76e-04 1.22e+01 -2.4 1.26e+00 - 5.55e-01 5.99e-01f 1 18 -9.1192847e+03 4.29e-04 1.31e+01 -2.5 1.61e+00 - 5.36e-01 5.61e-01f 1 19 -9.1384804e+03 2.30e-04 8.09e+01 -2.8 1.23e+00 - 7.07e-01 4.63e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.1515297e+03 1.09e-04 2.91e+00 -2.9 8.27e-01 - 4.50e-01 5.24e-01f 1 21 -9.1589323e+03 5.42e-05 3.55e+01 -3.3 3.39e-01 - 5.89e-01 5.05e-01f 1 22 -9.1660956e+03 7.44e-04 2.50e+02 -3.5 6.13e-01 - 5.03e-01 9.09e-01f 1 23 -9.1677959e+03 3.52e-04 4.00e+01 -4.7 2.42e-01 - 7.87e-01 7.06e-01f 1 24 -9.1681925e+03 1.89e-04 6.79e+01 -4.8 5.89e-01 - 6.08e-01 5.20e-01f 1 25 -9.1684646e+03 7.92e-05 1.13e+02 -5.5 3.03e-02 - 8.54e-01 6.49e-01h 1 26 -9.1686239e+03 8.90e-06 1.14e+01 -7.8 1.20e-02 - 8.95e-01 9.65e-01h 1 27 -9.1686297e+03 3.35e-07 1.31e+00 -11.0 1.48e-03 - 9.84e-01 9.83e-01h 1 28 -9.1686298e+03 4.01e-08 1.42e+02 -11.0 1.09e-04 - 9.89e-01 8.83e-01h 1 29 -9.1686298e+03 3.60e-08 2.23e+01 -9.1 7.09e-02 - 1.00e+00 1.01e-01h 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -9.1686298e+03 1.70e-09 1.36e+02 -8.8 8.15e-02 - 5.62e-01 1.00e+00h 1 31 -9.1686298e+03 1.04e-11 2.21e-09 -8.8 6.19e-02 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 31 (scaled) (unscaled) Objective...............: -1.4325984048883308e+03 -9.1686297912853170e+03 Dual infeasibility......: 2.2141981581569325e-09 1.4170868212204369e-08 Constraint violation....: 1.0398553540887014e-11 1.0398553540887014e-11 Complementarity.........: 1.8107802610909525e-09 1.1588993670982096e-08 Overall NLP error.......: 2.2141981581569325e-09 1.4170868212204369e-08 Number of objective function evaluations = 35 Number of objective gradient evaluations = 32 Number of equality constraint evaluations = 35 Number of inequality constraint evaluations = 35 Number of equality constraint Jacobian evaluations = 32 Number of inequality constraint Jacobian evaluations = 32 Number of Lagrangian Hessian evaluations = 31 Total CPU secs in IPOPT (w/o function evaluations) = 0.173 Total CPU secs in NLP function evaluations = 0.027 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9168.6298 31 0.19997 build initial OA NLP0014I 2 OPT -805.70808 28 0.113982 OA decomposition OA0003I New best feasible of -805.70808 found after 0.243963 sec and NLP0014I 3 OPT -901.10893 23 0.054991 OA decomposition OA0003I New best feasible of -901.10893 found after 0.467929 sec and NLP0014I 4 OPT -901.64232 21 0.038995 OA decomposition OA0003I New best feasible of -901.64232 found after 0.610908 sec and NLP0014I 5 OPT -901.6014 42 0.077988 OA decomposition NLP0014I 6 OPT -901.75112 21 0.038994 OA decomposition OA0003I New best feasible of -901.75112 found after 0.967853 sec and OA0008I OA converged in 0.968853 seconds found solution of value -901.75112 (lower bound 1e+50 ). OA0010I Performed 5 iterations, explored 174 branch-and-bound nodes in total Cbc0012I Integer solution of -901.75112 found by nonlinear programm after 1 iterations and 0 nodes (0.94 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from -9168.6304 to -9168.6304 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 25 row cuts average 3.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -901.7511234110718, took 1 iterations and 0 nodes (0.94 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 25 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 901.751. Best solution: 9.017511e+02 (0 nodes, 0.983 seconds) Best possible: 9.017511e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn40M04M.gms(4600) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn40M04M.gms Stop 09/08/12 19:59:04 elapsed 0:00:01.331 @04 1347127144 ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- =ready= Linux opt211 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/Syn/gms/Syn40M.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job Syn40M.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- Syn40M.gms(542) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- Syn40M.gms(540) 3 Mb --- Generating MINLP model m --- Syn40M.gms(542) 5 Mb --- 227 rows 131 columns 627 non-zeroes --- 190 nl-code 28 nl-non-zeroes --- 40 discrete-columns --- Syn40M.gms(542) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami Note: Maximization problem reformulated as minimization problem for Bonmin, objective values are negated in output. List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 70 Number of nonzeros in inequality constraint Jacobian.: 490 Number of nonzeros in Lagrangian Hessian.............: 28 Total number of variables............................: 130 variables with only lower bounds: 83 variables with lower and upper bounds: 47 variables with only upper bounds: 0 Total number of equality constraints.................: 22 Total number of inequality constraints...............: 204 inequality constraints with only lower bounds: 72 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 132 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -1.9300000e+01 9.80e-01 3.49e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -5.4450005e+01 9.60e-01 3.42e+01 -0.1 1.91e+01 - 1.29e-02 2.01e-02f 1 2 -1.7808452e+02 9.45e-01 3.37e+01 -0.1 1.86e+01 - 1.99e-02 1.56e-02f 1 3 -2.6938332e+02 9.33e-01 3.33e+01 -0.1 1.85e+01 - 2.12e-02 1.24e-02f 1 4 -8.9041418e+02 8.56e-01 7.40e+01 -0.1 2.69e+01 - 1.81e-02 8.26e-02f 1 5 -1.0892023e+03 8.37e-01 7.27e+01 -0.2 2.33e+01 - 4.12e-02 2.32e-02f 1 6 -1.1568473e+03 8.08e-01 9.58e+01 -0.2 1.67e+01 - 1.35e-01 3.38e-02f 1 7 -1.5301385e+03 6.75e-01 8.00e+01 -0.2 6.11e+01 - 5.66e-02 1.65e-01f 1 8 -1.5810438e+03 6.12e-01 7.24e+01 -0.4 1.35e+01 - 2.05e-01 9.30e-02f 1 9 -1.6776046e+03 4.50e-01 5.32e+01 -0.4 2.44e+01 - 2.10e-01 2.66e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.6979058e+03 3.70e-01 4.38e+01 -0.6 8.36e+00 - 4.70e-01 1.77e-01f 1 11 -1.7416064e+03 2.10e-01 2.48e+01 -0.7 1.25e+01 - 2.44e-01 4.33e-01f 1 12 -1.7709357e+03 8.10e-02 9.58e+00 -0.8 6.42e+00 - 6.11e-01 6.13e-01f 1 13 -1.8070855e+03 2.65e-02 3.22e+00 -1.7 1.65e+00 - 5.69e-01 6.73e-01f 1 14 -1.8187552e+03 2.06e-03 8.87e+01 -1.4 3.38e+00 - 3.49e-01 9.22e-01h 1 15 -1.8257276e+03 9.05e-04 4.13e+01 -2.2 1.85e+00 - 8.04e-01 5.61e-01f 1 16 -1.8315741e+03 1.99e-04 1.45e+01 -2.9 2.09e+00 - 8.15e-01 7.80e-01f 1 17 -1.8326962e+03 9.17e-05 5.60e+01 -3.1 1.01e+00 - 6.68e-01 5.40e-01f 1 18 -1.8335252e+03 3.19e-03 1.14e+02 -3.1 9.30e-01 - 1.00e+00 8.65e-01f 1 19 -1.8337682e+03 4.99e-03 7.26e+01 -4.6 4.93e-01 - 7.55e-01 6.09e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.8338045e+03 3.59e-03 5.22e+02 -4.4 1.75e-01 - 8.66e-01 2.54e-01h 1 21 -1.8339061e+03 3.39e-05 2.76e+01 -4.9 1.45e-02 - 1.00e+00 9.69e-01h 1 22 -1.8339134e+03 2.63e-06 3.92e+00 -10.0 2.62e-03 - 9.83e-01 9.60e-01h 1 23 -1.8339137e+03 8.33e-08 8.25e-01 -11.0 4.26e-04 - 9.89e-01 9.89e-01h 1 24 -1.8339137e+03 1.16e-09 2.00e+00 -11.0 7.80e-05 - 9.90e-01 9.87e-01h 1 25 -1.8339137e+03 8.88e-16 2.80e+00 -10.0 5.60e-02 - 8.08e-01 1.00e+00h 1 26 -1.8339137e+03 5.77e-16 8.34e-14 -10.0 3.54e-02 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 26 (scaled) (unscaled) Objective...............: -5.2397534732595352e+02 -1.8339137156408374e+03 Dual infeasibility......: 8.3439096574515212e-14 2.9203683801080324e-13 Constraint violation....: 5.7665774269009911e-16 5.7665774269009911e-16 Complementarity.........: 1.6049332302328632e-10 5.6172663058150214e-10 Overall NLP error.......: 1.6049332302328632e-10 5.6172663058150214e-10 Number of objective function evaluations = 27 Number of objective gradient evaluations = 27 Number of equality constraint evaluations = 27 Number of inequality constraint evaluations = 27 Number of equality constraint Jacobian evaluations = 27 Number of inequality constraint Jacobian evaluations = 27 Number of Lagrangian Hessian evaluations = 26 Total CPU secs in IPOPT (w/o function evaluations) = 0.027 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1833.9137 26 0.031995 build initial OA NLP0014I 2 OPT -55.713256 20 0.019997 OA decomposition OA0003I New best feasible of -55.713256 found after 0.043993 sec and NLP0014I 3 OPT -58.209555 18 0.019997 OA decomposition OA0003I New best feasible of -58.209555 found after 0.076988 sec and NLP0014I 4 OPT -52.449605 21 0.023996 OA decomposition NLP0014I 5 OPT -67.713256 17 0.018997 OA decomposition OA0003I New best feasible of -67.713256 found after 0.166975 sec and OA0008I OA converged in 0.166975 seconds found solution of value -67.713256 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 18 branch-and-bound nodes in total Cbc0012I Integer solution of -67.713256 found by nonlinear programm after 2 iterations and 0 nodes (0.16 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -1833.9138 to -1833.9138 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 4 row cuts average 3.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -67.71325626331961, took 2 iterations and 0 nodes (0.17 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 4 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 67.7133. Best solution: 6.771326e+01 (0 nodes, 0.174 seconds) Best possible: 6.771326e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- Syn40M.gms(542) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job Syn40M.gms Stop 09/08/12 19:59:04 elapsed 0:00:00.304 @04 1347127144 ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- =ready= Linux opt213 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/StochasticServiceSystemDesign/gms/sssd-8-4-3.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job sssd-8-4-3.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- sssd-8-4-3.gms(156) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- sssd-8-4-3.gms(154) 3 Mb --- Generating MINLP model m --- sssd-8-4-3.gms(156) 5 Mb --- 41 rows 61 columns 185 non-zeroes --- 85 nl-code 12 nl-non-zeroes --- 44 discrete-columns --- sssd-8-4-3.gms(156) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 76 Number of nonzeros in inequality constraint Jacobian.: 60 Number of nonzeros in Lagrangian Hessian.............: 4 Total number of variables............................: 60 variables with only lower bounds: 16 variables with lower and upper bounds: 44 variables with only upper bounds: 0 Total number of equality constraints.................: 12 Total number of inequality constraints...............: 28 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 28 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.8563122e+03 9.60e-01 2.87e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 6.9648061e+03 8.73e-01 2.67e+01 -0.5 1.23e+00 - 7.54e-02 9.03e-02f 1 2 2.5143254e+04 6.19e-01 2.90e+01 -0.6 1.10e+00 - 1.70e-01 2.92e-01h 1 3 3.5368885e+04 4.41e-01 1.22e+01 -0.8 5.78e-01 - 5.11e-01 2.88e-01h 1 4 5.8774419e+04 1.35e-01 9.38e+00 -1.4 3.00e-01 - 5.11e-01 6.93e-01h 1 5 7.3184576e+04 2.08e-03 2.45e+00 -1.8 2.77e-01 - 8.93e-01 1.00e+00h 1 6 7.3467432e+04 2.75e-04 8.71e-01 -2.5 3.39e-01 - 7.05e-01 8.55e-01h 1 7 7.3338167e+04 2.69e-06 3.37e-01 -3.6 3.34e-01 - 6.83e-01 9.83e-01f 1 8 7.3299476e+04 1.67e-07 8.77e-02 -4.3 1.86e-01 - 7.36e-01 8.02e-01f 1 9 7.3284952e+04 2.22e-16 1.66e-02 -5.3 2.02e-01 - 7.81e-01 9.13e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 7.3284105e+04 2.22e-16 4.61e-03 -5.7 1.46e-01 - 7.53e-01 7.25e-01f 1 11 7.3283732e+04 8.88e-16 1.98e-03 -5.7 3.57e-01 - 7.72e-01 7.14e-01h 1 12 7.3283661e+04 8.88e-16 3.04e-03 -8.3 2.87e-03 - 9.98e-01 5.05e-01h 1 13 7.3283592e+04 2.62e-10 2.00e-05 -11.0 2.70e-04 - 9.97e-01 9.93e-01h 1 14 7.3283592e+04 6.66e-16 1.71e-12 -11.0 1.74e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 1.0660757075469559e+02 7.3283591940357364e+04 Dual infeasibility......: 1.7106501355657390e-12 1.1759257396078971e-09 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Complementarity.........: 1.6420526006317653e-11 1.1287707981470973e-08 Overall NLP error.......: 1.6420526006317653e-11 1.1287707981470973e-08 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 15 Number of inequality constraint evaluations = 15 Number of equality constraint Jacobian evaluations = 15 Number of inequality constraint Jacobian evaluations = 15 Number of Lagrangian Hessian evaluations = 14 Total CPU secs in IPOPT (w/o function evaluations) = 0.010 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 73283.592 14 0.009999 build initial OA NLP0014I 2 OPT 619203.39 16 0.008999 OA decomposition OA0003I New best feasible of 619203.39 found after 0.167974 sec and NLP0014I 3 OPT 309496.56 14 0.006999 OA decomposition OA0003I New best feasible of 309496.56 found after 0.279957 sec and NLP0014I 4 OPT 221309.57 13 0.006999 OA decomposition OA0003I New best feasible of 221309.57 found after 0.464929 sec and NLP0014I 5 OPT 206305.38 12 0.002999 OA decomposition OA0003I New best feasible of 206305.38 found after 0.599908 sec and NLP0014I 6 OPT 198401.6 11 0.002999 OA decomposition OA0003I New best feasible of 198401.6 found after 0.700893 sec and NLP0014I 7 OPT 197377.03 12 0.004 OA decomposition OA0003I New best feasible of 197377.03 found after 0.808877 sec and NLP0014I 8 OPT 197338.6 11 0.002999 OA decomposition OA0003I New best feasible of 197338.6 found after 0.91586 sec and NLP0014I 9 OPT 197181.47 13 0.004999 OA decomposition OA0003I New best feasible of 197181.47 found after 1.031843 sec and OA0008I OA converged in 1.146825 seconds found solution of value 197181.47 (lower bound 1e+50 ). OA0010I Performed 8 iterations, explored 9039 branch-and-bound nodes in total Cbc0012I Integer solution of 197181.47 found by nonlinear programm after 2 iterations and 0 nodes (1.15 seconds) Cbc0013I At root node, 0 cuts changed objective from 73283.544 to 73283.544 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 6 row cuts average 2.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 197181.4745815453, took 2 iterations and 0 nodes (1.15 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 6 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 197181. Best solution: 1.971815e+05 (0 nodes, 1.166 seconds) Best possible: 1.971815e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- sssd-8-4-3.gms(156) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job sssd-8-4-3.gms Stop 09/08/12 19:59:05 elapsed 0:00:01.268 @04 1347127145 ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/StochasticServiceSystemDesign/gms/sssd-10-4-3.gms =========== ----------------------------- Sa 8. Sep 19:59:03 CEST 2012 ----------------------------- @03 1347127143 --- Job sssd-10-4-3.gms Start 09/08/12 19:59:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- sssd-10-4-3.gms(169) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- sssd-10-4-3.gms(167) 3 Mb --- Generating MINLP model m --- sssd-10-4-3.gms(169) 5 Mb --- 43 rows 69 columns 209 non-zeroes --- 85 nl-code 12 nl-non-zeroes --- 52 discrete-columns --- sssd-10-4-3.gms(169) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 92 Number of nonzeros in inequality constraint Jacobian.: 60 Number of nonzeros in Lagrangian Hessian.............: 4 Total number of variables............................: 68 variables with only lower bounds: 16 variables with lower and upper bounds: 52 variables with only upper bounds: 0 Total number of equality constraints.................: 14 Total number of inequality constraints...............: 28 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 28 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.7239888e+03 9.60e-01 2.85e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.7718996e+03 8.46e-01 2.64e+01 -0.5 1.22e+00 - 8.58e-02 1.19e-01f 1 2 2.0428626e+04 6.31e-01 2.23e+01 -0.6 9.11e-01 - 2.20e-01 2.54e-01h 1 3 3.3162293e+04 3.92e-01 1.18e+01 -0.9 4.56e-01 - 5.68e-01 3.78e-01h 1 4 5.5573058e+04 5.43e-02 6.86e+00 -1.3 2.93e-01 - 6.45e-01 8.62e-01h 1 5 6.0779639e+04 2.02e-03 1.88e+00 -2.0 3.72e-01 - 8.33e-01 9.63e-01h 1 6 6.0705380e+04 1.71e-04 5.19e-01 -2.6 3.21e-01 - 7.62e-01 9.15e-01h 1 7 6.0585393e+04 3.59e-05 1.60e-01 -3.4 3.63e-01 - 6.96e-01 7.90e-01f 1 8 6.0529188e+04 4.76e-06 4.26e-02 -4.5 2.47e-01 - 7.67e-01 8.67e-01f 1 9 6.0521605e+04 8.68e-07 1.13e-02 -5.3 1.04e-01 - 7.76e-01 8.18e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.0519439e+04 1.19e-07 1.46e-03 -6.8 5.62e-02 - 8.86e-01 8.63e-01h 1 11 6.0519122e+04 3.81e-09 6.01e-05 -10.1 6.38e-03 - 9.86e-01 9.68e-01h 1 12 6.0519112e+04 7.57e-13 1.40e-08 -11.0 1.75e-04 - 1.00e+00 1.00e+00h 1 In iteration 12, 1 Slack too small, adjusting variable bound 13 6.0519112e+04 3.82e-14 2.65e-03 -11.0 1.31e-08 - 1.00e+00 9.50e-01h 1 14 6.0519112e+04 6.66e-16 4.76e-14 -11.0 7.74e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 9.4114314431369124e+01 6.0519111699107962e+04 Dual infeasibility......: 4.7645282297950601e-14 3.0637742821023247e-11 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Complementarity.........: 1.3496227482757849e-11 8.6785915987435921e-09 Overall NLP error.......: 1.3496227482757849e-11 8.6785915987435921e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 15 Number of inequality constraint evaluations = 15 Number of equality constraint Jacobian evaluations = 15 Number of inequality constraint Jacobian evaluations = 15 Number of Lagrangian Hessian evaluations = 14 Total CPU secs in IPOPT (w/o function evaluations) = 0.009 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 60519.112 14 0.008999 build initial OA NLP0014I 2 OPT 158000.57 11 0.005999 OA decomposition OA0003I New best feasible of 158000.57 found after 0.201969 sec and NLP0014I 3 OPT 169487.41 12 0.005999 OA decomposition NLP0014I 4 OPT 154655.2 12 0.005 OA decomposition OA0003I New best feasible of 154655.2 found after 0.966853 sec and NLP0014I 5 OPT 152709.94 12 0.003999 OA decomposition OA0003I New best feasible of 152709.94 found after 1.11383 sec and NLP0014I 6 OPT 152888.09 10 0.002999 OA decomposition NLP0014I 7 OPT 152720.43 10 0.002999 OA decomposition OA0008I OA converged in 1.614754 seconds found solution of value 152709.94 (lower bound 1e+50 ). OA0010I Performed 6 iterations, explored 12478 branch-and-bound nodes in total Cbc0012I Integer solution of 152709.94 found by nonlinear programm after 2 iterations and 0 nodes (1.61 seconds) Cbc0013I At root node, 0 cuts changed objective from 60519.069 to 60519.069 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 2.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 152709.9440601555, took 2 iterations and 0 nodes (1.61 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 3 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 152710. Best solution: 1.527099e+05 (0 nodes, 1.636 seconds) Best possible: 1.527099e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- sssd-10-4-3.gms(169) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job sssd-10-4-3.gms Stop 09/08/12 19:59:05 elapsed 0:00:01.739 @04 1347127145 ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- =ready= Linux opt211 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/StochasticServiceSystemDesign/gms/sssd-12-5-3.gms =========== ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- @03 1347127144 --- Job sssd-12-5-3.gms Start 09/08/12 19:59:04 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- sssd-12-5-3.gms(203) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- sssd-12-5-3.gms(201) 3 Mb --- Generating MINLP model m --- sssd-12-5-3.gms(203) 5 Mb --- 53 rows 96 columns 291 non-zeroes --- 106 nl-code 15 nl-non-zeroes --- 75 discrete-columns --- sssd-12-5-3.gms(203) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 135 Number of nonzeros in inequality constraint Jacobian.: 75 Number of nonzeros in Lagrangian Hessian.............: 5 Total number of variables............................: 95 variables with only lower bounds: 20 variables with lower and upper bounds: 75 variables with only upper bounds: 0 Total number of equality constraints.................: 17 Total number of inequality constraints...............: 35 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 35 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.1923351e+03 9.50e-01 2.85e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.2898628e+04 8.33e-01 2.67e+01 -0.5 1.28e+00 - 8.16e-02 1.23e-01f 1 2 3.1461630e+04 6.43e-01 2.19e+01 -0.6 9.69e-01 - 2.12e-01 2.29e-01h 1 3 5.2852257e+04 4.00e-01 1.25e+01 -0.8 5.55e-01 - 5.44e-01 3.78e-01h 1 4 8.5660737e+04 9.93e-02 5.96e+00 -1.4 2.54e-01 - 6.12e-01 7.52e-01h 1 5 1.0059236e+05 7.99e-04 9.38e-01 -1.7 2.83e-01 - 9.40e-01 1.00e+00h 1 6 1.0035082e+05 6.66e-16 3.76e-01 -2.4 4.16e-01 - 7.02e-01 9.97e-01f 1 7 1.0017077e+05 4.44e-16 1.36e-01 -3.2 3.35e-01 - 6.99e-01 5.80e-01f 1 8 1.0000534e+05 1.11e-15 4.79e-02 -3.3 6.08e-01 - 6.51e-01 8.41e-01f 1 9 9.9988908e+04 5.55e-16 5.59e-02 -3.8 3.14e-01 - 8.36e-01 2.55e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 9.9948004e+04 6.66e-16 2.29e-02 -4.2 2.54e-01 - 4.95e-01 8.13e-01f 1 11 9.9939009e+04 4.44e-16 3.14e-03 -5.1 7.27e-02 - 8.58e-01 6.71e-01f 1 12 9.9936526e+04 6.66e-16 4.38e-03 -5.0 1.59e-01 - 6.51e-01 5.90e-01f 1 13 9.9934677e+04 4.44e-16 4.41e-03 -6.0 1.18e-01 - 6.11e-01 8.02e-01f 1 14 9.9934083e+04 6.66e-16 3.66e-04 -7.3 2.36e-02 - 7.27e-01 9.90e-01h 1 15 9.9934074e+04 1.11e-15 8.89e-07 -11.0 1.66e-04 - 9.99e-01 9.95e-01h 1 16 9.9934074e+04 6.66e-16 1.21e-04 -11.0 7.37e-07 - 1.00e+00 9.79e-01h 1 17 9.9934074e+04 1.33e-15 2.11e-14 -11.0 1.54e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 17 (scaled) (unscaled) Objective...............: 1.2599879598261366e+02 9.9934074060360203e+04 Dual infeasibility......: 2.1056151041983537e-14 1.6700373533300046e-11 Constraint violation....: 1.3322676295501878e-15 1.3322676295501878e-15 Complementarity.........: 2.3509870469369183e-11 1.8646504661517636e-08 Overall NLP error.......: 2.3509870469369183e-11 1.8646504661517636e-08 Number of objective function evaluations = 18 Number of objective gradient evaluations = 18 Number of equality constraint evaluations = 18 Number of inequality constraint evaluations = 18 Number of equality constraint Jacobian evaluations = 18 Number of inequality constraint Jacobian evaluations = 18 Number of Lagrangian Hessian evaluations = 17 Total CPU secs in IPOPT (w/o function evaluations) = 0.010 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 99934.074 17 0.010998 build initial OA NLP0014I 2 OPT 10120803 23 0.012998 OA decomposition OA0003I New best feasible of 10120803 found after 0.52392 sec and NLP0014I 3 OPT 3493920.7 21 0.005 OA decomposition OA0003I New best feasible of 3493920.7 found after 0.85787 sec and NLP0014I 4 OPT 1654848.5 18 0.005999 OA decomposition OA0003I New best feasible of 1654848.5 found after 1.131828 sec and NLP0014I 5 OPT 891514.11 16 0.004 OA decomposition OA0003I New best feasible of 891514.11 found after 1.586759 sec and NLP0014I 6 OPT 515014.39 15 0.004999 OA decomposition OA0003I New best feasible of 515014.39 found after 2.313648 sec and NLP0014I 7 OPT 350760.05 14 0.004 OA decomposition OA0003I New best feasible of 350760.05 found after 3.605452 sec and NLP0014I 8 OPT 281119.03 12 0.002999 OA decomposition OA0003I New best feasible of 281119.03 found after 4.127372 sec and NLP0014I 9 OPT 263630.9 11 0.002999 OA decomposition OA0003I New best feasible of 263630.9 found after 4.805269 sec and NLP0014I 10 OPT 261839.26 10 0.003 OA decomposition OA0003I New best feasible of 261839.26 found after 7.586847 sec and NLP0014I 11 OPT 261184.39 10 0.002999 OA decomposition OA0003I New best feasible of 261184.39 found after 9.332581 sec and NLP0014I 12 OPT 261142.54 10 0.003 OA decomposition OA0003I New best feasible of 261142.54 found after 9.761516 sec and OA0008I OA converged in 10.200449 seconds found solution of value 261142.54 (lower bound 1e+50 ). OA0010I Performed 11 iterations, explored 88600 branch-and-bound nodes in total Cbc0012I Integer solution of 261142.54 found by nonlinear programm after 3 iterations and 0 nodes (10.20 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from 99934.006 to 99934.006 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 12 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 261142.5445403313, took 3 iterations and 0 nodes (10.20 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 12 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 261143. Best solution: 2.611425e+05 (0 nodes, 10.316 seconds) Best possible: 2.611425e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- sssd-12-5-3.gms(203) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job sssd-12-5-3.gms Stop 09/08/12 19:59:14 elapsed 0:00:10.423 @04 1347127154 ----------------------------- Sa 8. Sep 19:59:14 CEST 2012 ----------------------------- =ready= Linux opt212 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/StochasticServiceSystemDesign/gms/sssd-15-6-3.gms =========== ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- @03 1347127144 --- Job sssd-15-6-3.gms Start 09/08/12 19:59:04 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- sssd-15-6-3.gms(252) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- sssd-15-6-3.gms(251) 3 Mb --- Generating MINLP model m --- sssd-15-6-3.gms(252) 5 Mb --- 64 rows 133 columns 403 non-zeroes --- 127 nl-code 18 nl-non-zeroes --- 108 discrete-columns --- sssd-15-6-3.gms(252) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 198 Number of nonzeros in inequality constraint Jacobian.: 90 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 132 variables with only lower bounds: 24 variables with lower and upper bounds: 108 variables with only upper bounds: 0 Total number of equality constraints.................: 21 Total number of inequality constraints...............: 42 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 42 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 5.2454688e+03 9.40e-01 2.87e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6697885e+04 8.37e-01 2.72e+01 -0.4 1.38e+00 - 7.05e-02 1.10e-01f 1 2 4.4772643e+04 6.49e-01 2.46e+01 -0.6 1.13e+00 - 1.83e-01 2.24e-01h 1 3 7.0815912e+04 4.49e-01 1.37e+01 -0.8 6.35e-01 - 4.67e-01 3.08e-01h 1 4 1.2517481e+05 1.23e-01 8.60e+00 -1.2 3.49e-01 - 5.79e-01 7.27e-01h 1 5 1.5313896e+05 6.23e-03 3.94e+00 -1.7 2.60e-01 - 7.97e-01 9.49e-01h 1 6 1.5526248e+05 8.88e-16 1.31e+00 -2.1 3.58e-01 - 7.70e-01 1.00e+00h 1 7 1.5485827e+05 6.66e-16 3.83e-01 -2.6 3.04e-01 - 7.06e-01 7.81e-01f 1 8 1.5467279e+05 4.44e-16 1.24e-01 -3.2 3.19e-01 - 7.11e-01 5.52e-01f 1 9 1.5456308e+05 8.88e-16 4.46e-02 -3.3 4.06e-01 - 6.69e-01 5.67e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.5447898e+05 4.44e-16 1.42e-02 -3.9 3.20e-01 - 6.99e-01 6.88e-01f 1 11 1.5443095e+05 6.66e-16 9.27e-03 -4.5 2.75e-01 - 4.79e-01 9.40e-01f 1 12 1.5442678e+05 8.88e-16 2.81e-03 -5.4 1.38e-01 - 9.00e-01 6.50e-01f 1 13 1.5442477e+05 4.44e-16 1.42e-03 -6.9 2.56e-02 - 9.67e-01 7.68e-01f 1 14 1.5442418e+05 8.88e-16 1.82e-05 -9.9 4.49e-03 - 9.94e-01 9.89e-01f 1 15 1.5442417e+05 1.33e-15 2.88e-09 -11.0 2.10e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: 1.8874141825305185e+02 1.5442416891225649e+05 Dual infeasibility......: 2.8772575433322345e-09 2.3541102371069881e-06 Constraint violation....: 1.3322676295501878e-15 1.3322676295501878e-15 Complementarity.........: 3.0401486867440577e-11 2.4873842671389801e-08 Overall NLP error.......: 2.8772575433322345e-09 2.3541102371069881e-06 Number of objective function evaluations = 16 Number of objective gradient evaluations = 16 Number of equality constraint evaluations = 16 Number of inequality constraint evaluations = 16 Number of equality constraint Jacobian evaluations = 16 Number of inequality constraint Jacobian evaluations = 16 Number of Lagrangian Hessian evaluations = 15 Total CPU secs in IPOPT (w/o function evaluations) = 0.006 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 154424.17 15 0.005999 build initial OA NLP0014I 2 OPT 8026525.6 23 0.005999 OA decomposition OA0003I New best feasible of 8026525.6 found after 0.814876 sec and NLP0014I 3 OPT 1523209.2 18 0.004999 OA decomposition OA0003I New best feasible of 1523209.2 found after 1.151825 sec and NLP0014I 4 OPT 870463.99 16 0.004 OA decomposition OA0003I New best feasible of 870463.99 found after 1.58176 sec and NLP0014I 5 OPT 590824.8 14 0.005 OA decomposition OA0003I New best feasible of 590824.8 found after 3.524465 sec and NLP0014I 6 OPT 477829.83 14 0.004999 OA decomposition OA0003I New best feasible of 477829.83 found after 7.76482 sec and NLP0014I 7 OPT 443612.53 11 0.002999 OA decomposition OA0003I New best feasible of 443612.53 found after 10.083467 sec and NLP0014I 8 OPT 444437.82 11 0.002999 OA decomposition NLP0014I 9 OPT 440807.6 13 0.004999 OA decomposition OA0003I New best feasible of 440807.6 found after 27.860765 sec and NLP0014I 10 OPT 440748.2 13 0.005999 OA decomposition OA0003I New best feasible of 440748.2 found after 32.614042 sec and NLP0014I 11 OPT 440748.47 13 0.005999 OA decomposition NLP0014I 12 OPT 440711.35 10 0.002999 OA decomposition OA0003I New best feasible of 440711.35 found after 38.303177 sec and OA0008I OA converged in 40.495844 seconds found solution of value 440711.35 (lower bound 1e+50 ). OA0010I Performed 11 iterations, explored 333160 branch-and-bound nodes in total Cbc0012I Integer solution of 440711.35 found by nonlinear programm after 4 iterations and 0 nodes (40.49 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 1 cuts changed objective from 154424.08 to 154424.08 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 2.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 440711.3544049232, took 4 iterations and 0 nodes (40.50 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 440711. Best solution: 4.407114e+05 (0 nodes, 40.95 seconds) Best possible: 4.407114e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- sssd-15-6-3.gms(252) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job sssd-15-6-3.gms Stop 09/08/12 19:59:45 elapsed 0:00:41.016 @04 1347127185 ----------------------------- Sa 8. Sep 19:59:45 CEST 2012 ----------------------------- =ready= Linux opt214 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/StochasticServiceSystemDesign/gms/sssd-16-8-3.gms =========== ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- @03 1347127144 --- Job sssd-16-8-3.gms Start 09/08/12 19:59:04 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- sssd-16-8-3.gms(324) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- sssd-16-8-3.gms(322) 3 Mb --- Generating MINLP model m --- sssd-16-8-3.gms(324) 5 Mb --- 81 rows 185 columns 561 non-zeroes --- 169 nl-code 24 nl-non-zeroes --- 152 discrete-columns --- sssd-16-8-3.gms(324) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 280 Number of nonzeros in inequality constraint Jacobian.: 120 Number of nonzeros in Lagrangian Hessian.............: 8 Total number of variables............................: 184 variables with only lower bounds: 32 variables with lower and upper bounds: 152 variables with only upper bounds: 0 Total number of equality constraints.................: 24 Total number of inequality constraints...............: 56 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 56 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 8.3711197e+03 9.20e-01 2.87e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.0110629e+04 7.94e-01 2.73e+01 -0.4 1.36e+00 - 7.76e-02 1.37e-01f 1 2 6.7636283e+04 6.27e-01 2.28e+01 -0.6 1.04e+00 - 1.95e-01 2.10e-01h 1 3 1.0801720e+05 4.21e-01 1.35e+01 -0.8 5.77e-01 - 4.56e-01 3.29e-01h 1 4 1.9485087e+05 7.32e-02 6.03e+00 -1.1 3.26e-01 - 7.45e-01 8.26e-01h 1 5 2.2456970e+05 8.35e-04 2.07e+00 -1.6 3.10e-01 - 8.60e-01 1.00e+00h 1 6 2.2422717e+05 8.88e-16 4.00e-01 -2.0 4.27e-01 - 8.51e-01 1.00e+00h 1 7 2.2355311e+05 6.66e-16 9.51e-02 -2.5 3.70e-01 - 7.62e-01 7.09e-01f 1 8 2.2314361e+05 1.33e-15 3.85e-02 -2.9 3.50e-01 - 6.72e-01 5.96e-01f 1 9 2.2277615e+05 7.77e-16 7.06e-02 -3.6 3.48e-01 - 4.33e-01 7.94e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.2264544e+05 8.88e-16 5.03e-02 -3.9 2.22e-01 - 5.02e-01 1.00e+00f 1 11 2.2262288e+05 4.44e-16 9.91e-03 -5.0 1.50e-01 - 7.91e-01 8.12e-01f 1 12 2.2261802e+05 1.11e-15 2.74e-03 -5.3 1.64e-01 - 7.52e-01 7.21e-01f 1 13 2.2261601e+05 4.44e-16 6.46e-04 -6.1 5.08e-02 - 7.03e-01 8.09e-01f 1 14 2.2261542e+05 8.88e-16 8.90e-05 -6.7 2.89e-02 - 9.62e-01 1.00e+00f 1 15 2.2261539e+05 6.66e-16 6.64e-07 -11.0 8.56e-04 - 9.92e-01 9.96e-01h 1 16 2.2261539e+05 8.88e-16 2.15e-04 -11.0 3.20e-06 - 1.00e+00 9.61e-01h 1 17 2.2261539e+05 1.33e-15 9.92e-02 -11.0 1.24e-07 - 6.78e-01 9.78e-01h 1 18 2.2261539e+05 6.66e-16 3.74e-14 -11.0 2.81e-09 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 18 (scaled) (unscaled) Objective...............: 2.2662298632282744e+02 2.2261538849110052e+05 Dual infeasibility......: 3.7408041050101687e-14 3.6746517757014456e-11 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Complementarity.........: 2.8625386012989037e-11 2.8119175073051187e-08 Overall NLP error.......: 2.8625386012989037e-11 2.8119175073051187e-08 Number of objective function evaluations = 19 Number of objective gradient evaluations = 19 Number of equality constraint evaluations = 19 Number of inequality constraint evaluations = 19 Number of equality constraint Jacobian evaluations = 19 Number of inequality constraint Jacobian evaluations = 19 Number of Lagrangian Hessian evaluations = 18 Total CPU secs in IPOPT (w/o function evaluations) = 0.015 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 222615.39 18 0.016997 build initial OA NLP0014I 2 OPT 4057748.1 20 0.005999 OA decomposition OA0003I New best feasible of 4057748.1 found after 0.812877 sec and NLP0014I 3 OPT 1971398.9 18 0.005999 OA decomposition OA0003I New best feasible of 1971398.9 found after 1.162823 sec and NLP0014I 4 OPT 1253922.9 16 0.005 OA decomposition OA0003I New best feasible of 1253922.9 found after 2.266656 sec and NLP0014I 5 OPT 848079.2 15 0.004999 OA decomposition OA0003I New best feasible of 848079.2 found after 12.200145 sec and NLP0014I 6 OPT 711054.4 13 0.004999 OA decomposition OA0003I New best feasible of 711054.4 found after 15.640622 sec and NLP0014I 7 OPT 679520.29 13 0.005 OA decomposition OA0003I New best feasible of 679520.29 found after 19.848983 sec and NLP0014I 8 OPT 716369.01 14 0.003999 OA decomposition NLP0014I 9 OPT 640770.99 12 0.003 OA decomposition OA0003I New best feasible of 640770.99 found after 26.064038 sec and NLP0014I 10 OPT 620217.56 11 0.002999 OA decomposition OA0003I New best feasible of 620217.56 found after 28.717634 sec and OA0012I After 210.99892.1f seconds, 10 iterations upper bound 620211.350g, lower bound 612912.310g NLP0014I 11 OPT 616070.66 10 0.004 OA decomposition OA0003I New best feasible of 616070.66 found after 211.00292 sec and NLP0014I 12 OPT 616123.18 11 0.003 OA decomposition NLP0014I 13 OPT 615811.09 13 0.006999 OA decomposition OA0003I New best feasible of 615811.09 found after 280.46736 sec and NLP0014I 14 OPT 615763.37 10 0.003 OA decomposition OA0003I New best feasible of 615763.37 found after 309.56094 sec and OA0008I OA converged in 335.14105 seconds found solution of value 615763.37 (lower bound 1e+50 ). OA0010I Performed 13 iterations, explored 2552120 branch-and-bound nodes in total Cbc0012I Integer solution of 615763.37 found by nonlinear programm after 5 iterations and 0 nodes (335.14 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 1 cuts changed objective from 222615.25 to 222615.25 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 15 row cuts average 2.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 615763.3652041641, took 5 iterations and 0 nodes (335.14 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 15 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 615763. Best solution: 6.157634e+05 (0 nodes, 338.427 seconds) Best possible: 6.157634e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- sssd-16-8-3.gms(324) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job sssd-16-8-3.gms Stop 09/08/12 20:04:43 elapsed 0:05:38.546 @04 1347127483 ----------------------------- Sa 8. Sep 20:04:43 CEST 2012 ----------------------------- =ready= Linux opt204 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/StochasticServiceSystemDesign/gms/sssd-18-8-3.gms =========== ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- @03 1347127144 --- Job sssd-18-8-3.gms Start 09/08/12 19:59:04 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- sssd-18-8-3.gms(338) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- sssd-18-8-3.gms(336) 3 Mb --- Generating MINLP model m --- sssd-18-8-3.gms(338) 5 Mb --- 83 rows 201 columns 609 non-zeroes --- 169 nl-code 24 nl-non-zeroes --- 168 discrete-columns --- sssd-18-8-3.gms(338) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 312 Number of nonzeros in inequality constraint Jacobian.: 120 Number of nonzeros in Lagrangian Hessian.............: 8 Total number of variables............................: 200 variables with only lower bounds: 32 variables with lower and upper bounds: 168 variables with only upper bounds: 0 Total number of equality constraints.................: 26 Total number of inequality constraints...............: 56 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 56 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.4552172e+03 9.20e-01 2.86e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.8947985e+04 7.81e-01 2.74e+01 -0.4 1.37e+00 - 7.89e-02 1.51e-01f 1 2 5.7497489e+04 6.32e-01 2.09e+01 -0.6 9.85e-01 - 2.07e-01 1.91e-01h 1 3 9.6955719e+04 4.04e-01 1.34e+01 -0.8 5.65e-01 - 4.83e-01 3.61e-01h 1 4 1.6168604e+05 1.03e-01 6.17e+00 -1.2 2.76e-01 - 6.84e-01 7.45e-01h 1 5 1.9324043e+05 1.14e-03 6.34e-01 -1.5 3.12e-01 - 1.00e+00 1.00e+00h 1 6 1.9287808e+05 6.66e-16 4.40e-01 -2.6 2.28e-01 - 5.59e-01 1.00e+00f 1 7 1.9201928e+05 4.44e-16 1.61e-01 -2.6 5.20e-01 - 6.02e-01 1.00e+00f 1 8 1.9160652e+05 8.88e-16 6.79e-02 -3.4 3.99e-01 - 6.82e-01 8.20e-01f 1 9 1.9148512e+05 6.66e-16 2.23e-02 -4.0 2.74e-01 - 7.13e-01 6.21e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.9142023e+05 6.66e-16 8.09e-03 -4.6 2.48e-01 - 7.49e-01 7.27e-01f 1 11 1.9139527e+05 4.97e-07 3.77e-02 -5.1 1.68e-01 - 6.08e-01 9.14e-01f 1 12 1.9139247e+05 8.88e-16 4.74e-03 -5.2 3.66e-02 - 8.56e-01 8.90e-01f 1 13 1.9139125e+05 4.64e-10 3.97e-03 -6.1 2.99e-02 - 7.84e-01 9.55e-01f 1 14 1.9139110e+05 2.62e-10 6.92e-05 -9.1 3.76e-03 - 9.44e-01 8.74e-01h 1 15 1.9139107e+05 3.48e-12 6.57e-06 -11.0 5.17e-04 - 9.78e-01 9.98e-01h 1 16 1.9139107e+05 8.88e-16 7.99e-05 -11.0 9.61e-07 - 1.00e+00 9.73e-01h 1 17 1.9139107e+05 1.11e-15 1.96e-02 -11.0 2.57e-08 - 7.63e-01 1.00e+00h 1 18 1.9139107e+05 1.11e-15 2.35e-14 -11.0 1.61e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 18 (scaled) (unscaled) Objective...............: 2.2049247898122331e+02 1.9139107329494093e+05 Dual infeasibility......: 2.3516629257996572e-14 2.0412818318172472e-11 Constraint violation....: 1.1102230246251565e-15 1.1102230246251565e-15 Complementarity.........: 1.2145330741897507e-11 1.0542345466630429e-08 Overall NLP error.......: 1.2145330741897507e-11 1.0542345466630429e-08 Number of objective function evaluations = 19 Number of objective gradient evaluations = 19 Number of equality constraint evaluations = 19 Number of inequality constraint evaluations = 19 Number of equality constraint Jacobian evaluations = 19 Number of inequality constraint Jacobian evaluations = 19 Number of Lagrangian Hessian evaluations = 18 Total CPU secs in IPOPT (w/o function evaluations) = 0.018 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 191391.07 18 0.017997 build initial OA NLP0014I 2 OPT 805465.01 15 0.003999 OA decomposition OA0003I New best feasible of 805465.01 found after 0.953855 sec and NLP0014I 3 OPT 591878.95 13 0.004 OA decomposition OA0003I New best feasible of 591878.95 found after 1.338797 sec and OA0012I After 123.54022.1f seconds, 3 iterations upper bound 591873.030g, lower bound 442257.470g NLP0014I 4 OPT 1840139.5 18 0.005 OA decomposition OA0012I After 497.19242.1f seconds, 4 iterations upper bound 591873.030g, lower bound 460809.40g NLP0014I 5 OPT 1115079.6 17 0.006 OA decomposition OA0012I After 763.7249.1f seconds, 5 iterations upper bound 591873.030g, lower bound 474447.870g NLP0014I 6 OPT 744185.96 15 0.005 OA decomposition NLP0014I 7 OPT 594022.15 14 0.001999 OA decomposition OA0012I After 1059.086.1f seconds, 7 iterations upper bound 591873.030g, lower bound 498082.070g NLP0014I 8 OPT 537486.32 13 0.005999 OA decomposition OA0003I New best feasible of 537486.32 found after 1059.092 sec and NLP0014I 9 OPT 524164.1 13 0.005999 OA decomposition OA0003I New best feasible of 524164.1 found after 1061.7946 sec and NLP0014I 10 OPT 526962.75 11 0.004 OA decomposition NLP0014I 11 OPT 524347.59 11 0.003999 OA decomposition OA0012I After 1166.6976.1f seconds, 11 iterations upper bound 524158.860g, lower bound 523889.220g NLP0014I 12 OPT 524062.79 13 0.005999 OA decomposition OA0003I New best feasible of 524062.79 found after 1166.7046 sec and OA0008I OA converged in 1230.31 seconds found solution of value 524062.79 (lower bound 1e+50 ). OA0010I Performed 11 iterations, explored 11041083 branch-and-bound nodes in total Cbc0012I Integer solution of 524062.79 found by nonlinear programm after 3 iterations and 0 nodes (1230.31 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 1 cuts changed objective from 191390.95 to 191390.95 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 15 row cuts average 2.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 524062.7872262954, took 3 iterations and 0 nodes (1230.31 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 15 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 524063. Best solution: 5.240628e+05 (0 nodes, 1244.3 seconds) Best possible: 5.240628e+05 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- sssd-18-8-3.gms(338) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job sssd-18-8-3.gms Stop 09/08/12 20:19:49 elapsed 0:20:44.532 @04 1347128389 ----------------------------- Sa 8. Sep 20:19:49 CEST 2012 ----------------------------- =ready= Linux opt218 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/StochasticServiceSystemDesign/gms/sssd-20-9-3.gms =========== ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- @03 1347127144 --- Job sssd-20-9-3.gms Start 09/08/12 19:59:04 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- sssd-20-9-3.gms(391) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- sssd-20-9-3.gms(389) 3 Mb --- Generating MINLP model m --- sssd-20-9-3.gms(391) 5 Mb --- 93 rows 244 columns 739 non-zeroes --- 190 nl-code 27 nl-non-zeroes --- 207 discrete-columns --- sssd-20-9-3.gms(391) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 387 Number of nonzeros in inequality constraint Jacobian.: 135 Number of nonzeros in Lagrangian Hessian.............: 9 Total number of variables............................: 243 variables with only lower bounds: 36 variables with lower and upper bounds: 207 variables with only upper bounds: 0 Total number of equality constraints.................: 29 Total number of inequality constraints...............: 63 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 63 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.5163460e+03 9.10e-01 2.86e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.2926298e+04 7.45e-01 2.75e+01 -0.4 1.37e+00 - 8.33e-02 1.81e-01f 1 2 5.5644067e+04 6.17e-01 2.02e+01 -0.6 8.80e-01 - 2.28e-01 1.72e-01h 1 3 9.6286357e+04 3.78e-01 1.33e+01 -0.8 5.33e-01 - 5.18e-01 3.87e-01h 1 4 1.5560869e+05 8.99e-02 5.70e+00 -1.3 2.39e-01 - 6.73e-01 7.62e-01h 1 5 1.8147471e+05 9.41e-04 2.75e+00 -1.7 1.81e-01 - 8.12e-01 1.00e+00h 1 6 1.8151151e+05 8.88e-16 3.57e-03 -2.0 3.71e-01 - 1.00e+00 1.00e+00h 1 7 1.8067017e+05 6.66e-16 1.24e-01 -2.7 3.39e-01 - 3.96e-01 9.00e-01f 1 8 1.8043693e+05 1.33e-15 7.76e-02 -3.0 3.05e-01 - 4.82e-01 6.70e-01f 1 9 1.8029192e+05 6.66e-16 2.99e-02 -3.3 5.33e-01 - 6.28e-01 6.46e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.8019485e+05 8.88e-16 2.80e-02 -3.9 2.72e-01 - 6.12e-01 7.02e-01f 1 11 1.8014819e+05 4.44e-16 3.48e-02 -4.1 4.13e-01 - 6.72e-01 8.58e-01f 1 12 1.8013077e+05 1.33e-15 2.13e-02 -4.7 4.15e-01 - 5.66e-01 8.25e-01f 1 13 1.8012591e+05 1.55e-15 5.93e-03 -4.7 1.10e-01 - 6.55e-01 1.00e+00f 1 14 1.8012369e+05 1.11e-15 1.43e-03 -6.4 5.43e-02 - 8.39e-01 6.52e-01f 1 15 1.8012261e+05 4.44e-16 3.72e-04 -7.0 6.34e-02 - 7.68e-01 8.84e-01f 1 16 1.8012245e+05 8.88e-16 7.10e-05 -8.8 2.89e-02 - 8.97e-01 9.82e-01f 1 17 1.8012244e+05 1.11e-15 4.93e-08 -11.0 4.65e-04 - 9.99e-01 9.99e-01h 1 In iteration 17, 1 Slack too small, adjusting variable bound 18 1.8012244e+05 6.66e-16 3.88e-03 -11.0 3.43e-08 - 1.00e+00 8.32e-01h 1 19 1.8012244e+05 8.88e-16 1.46e-03 -11.0 5.77e-09 - 9.76e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.8012244e+05 6.66e-16 2.68e-14 -11.0 1.46e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 20 (scaled) (unscaled) Objective...............: 2.3421064580435930e+02 1.8012244207281890e+05 Dual infeasibility......: 2.6801349141272442e-14 2.0611891665269413e-11 Constraint violation....: 6.6613381477509392e-16 6.6613381477509392e-16 Complementarity.........: 1.1120128902276483e-11 8.5520654586969848e-09 Overall NLP error.......: 1.1120128902276483e-11 8.5520654586969848e-09 Number of objective function evaluations = 21 Number of objective gradient evaluations = 21 Number of equality constraint evaluations = 21 Number of inequality constraint evaluations = 21 Number of equality constraint Jacobian evaluations = 21 Number of inequality constraint Jacobian evaluations = 21 Number of Lagrangian Hessian evaluations = 20 Total CPU secs in IPOPT (w/o function evaluations) = 0.017 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 180122.44 20 0.019997 build initial OA NLP0014I 2 OPT 89273117 84 0.025996 OA decomposition OA0003I New best feasible of 89273117 found after 0.616906 sec and NLP0014I 3 OPT 17880321 27 0.009998 OA decomposition OA0003I New best feasible of 17880321 found after 2.936553 sec and NLP0014I 4 OPT 7875486.5 23 0.007999 OA decomposition OA0003I New best feasible of 7875486.5 found after 5.889105 sec and OA0012I After 366.94422.1f seconds, 4 iterations upper bound 7875407.70g, lower bound 403648.130g NLP0014I 5 OPT 3380356.5 20 0.006999 OA decomposition OA0003I New best feasible of 3380356.5 found after 366.95222 sec and NLP0014I 6 OPT 1833093.1 18 0.006999 OA decomposition OA0003I New best feasible of 1833093.1 found after 419.41324 sec and OA0012I After 1012.2571.1f seconds, 6 iterations upper bound 1833074.80g, lower bound 421740.370g NLP0014I 7 OPT 1083495.9 17 0.006 OA decomposition OA0003I New best feasible of 1083495.9 found after 1012.2631 sec and OA0012I After 1725.4437.1f seconds, 7 iterations upper bound 10834850g, lower bound 432483.60g NLP0014I 8 OPT 725600.89 15 0.005 OA decomposition OA0003I New best feasible of 725600.89 found after 1725.4497 sec and OA0012I After 2036.5614.1f seconds, 8 iterations upper bound 725593.630g, lower bound 441247.410g NLP0014I 9 OPT 562185.54 14 0.005 OA decomposition OA0003I New best feasible of 562185.54 found after 2036.5674 sec and OA0012I After 3463.1255.1f seconds, 9 iterations upper bound 562179.910g, lower bound 451538.20g NLP0014I 10 OPT 499063.86 12 0.004999 OA decomposition OA0003I New best feasible of 499063.86 found after 3463.1305 sec and NLP0014I 11 OPT 481232.76 11 0.003 OA decomposition OA0003I New best feasible of 481232.76 found after 3519.8129 sec and OA0012I After 4905.5562.1f seconds, 11 iterations upper bound 481227.950g, lower bound 473388.50g NLP0014I 12 OPT 479668.68 11 0.002999 OA decomposition OA0003I New best feasible of 479668.68 found after 4905.5602 sec and OA0012I After 7200.4224.1f seconds, 12 iterations upper bound 479663.890g, lower bound 476276.480g NLP0014I 13 OPT 478654.52 13 0.006999 OA decomposition OA0003I New best feasible of 478654.52 found after 7200.4294 sec and OA0009I OA interupted after 7200.4294 seconds found solution of value 478654.52 (lower bound 476276.48 ). OA0010I Performed 12 iterations, explored 56236443 branch-and-bound nodes in total Cbc0031I 15 added rows had average density of 2 Cbc0013I At root node, 15 cuts changed objective from 180122.32 to 180122.32 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 15 row cuts average 2.0 elements, 0 column cuts (15 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 180122.32), took 6 iterations and 0 nodes (7200.43 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 15 cuts of which 15 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 1.801223e+05 (only reliable for convex models) --- Restarting execution --- sssd-20-9-3.gms(391) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job sssd-20-9-3.gms Stop 09/08/12 22:00:24 elapsed 2:01:19.697 @04 1347134424 ----------------------------- Sa 8. Sep 22:00:24 CEST 2012 ----------------------------- =ready= Linux opt224 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/StochasticServiceSystemDesign/gms/sssd-22-8-3.gms =========== ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- @03 1347127144 --- Job sssd-22-8-3.gms Start 09/08/12 19:59:04 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- sssd-22-8-3.gms(375) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- sssd-22-8-3.gms(373) 3 Mb --- Generating MINLP model m --- sssd-22-8-3.gms(375) 5 Mb --- 87 rows 233 columns 705 non-zeroes --- 169 nl-code 24 nl-non-zeroes --- 200 discrete-columns --- sssd-22-8-3.gms(375) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 376 Number of nonzeros in inequality constraint Jacobian.: 120 Number of nonzeros in Lagrangian Hessian.............: 8 Total number of variables............................: 232 variables with only lower bounds: 32 variables with lower and upper bounds: 200 variables with only upper bounds: 0 Total number of equality constraints.................: 30 Total number of inequality constraints...............: 56 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 56 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 8.2036433e+03 9.20e-01 2.87e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.3920127e+04 7.76e-01 2.76e+01 -0.4 1.41e+00 - 7.63e-02 1.57e-01f 1 2 6.1788923e+04 6.42e-01 2.03e+01 -0.6 9.81e-01 - 2.16e-01 1.73e-01h 1 3 1.1091694e+05 3.96e-01 1.36e+01 -0.8 6.20e-01 - 5.18e-01 3.83e-01h 1 4 1.8138601e+05 1.05e-01 6.62e+00 -1.2 2.84e-01 - 6.38e-01 7.34e-01h 1 5 2.1562413e+05 5.21e-03 5.91e+00 -1.8 1.51e-01 - 6.40e-01 9.51e-01h 1 6 2.1815933e+05 8.88e-16 1.34e+00 -2.0 2.49e-01 - 8.20e-01 1.00e+00h 1 7 2.1738526e+05 4.44e-16 6.81e-02 -2.3 3.87e-01 - 9.52e-01 8.78e-01f 1 8 2.1689226e+05 6.66e-16 2.21e-02 -2.9 4.95e-01 - 6.91e-01 6.80e-01f 1 9 2.1661826e+05 6.66e-16 8.60e-02 -3.3 4.37e-01 - 3.41e-01 7.09e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.1655342e+05 1.33e-15 3.02e-02 -3.5 5.25e-01 - 5.31e-01 3.76e-01f 1 11 2.1644300e+05 1.33e-15 4.76e-02 -3.5 4.57e-01 - 3.72e-01 9.23e-01f 1 12 2.1640782e+05 1.33e-15 1.39e-02 -4.2 4.83e-01 - 6.74e-01 5.78e-01f 1 13 2.1639706e+05 1.11e-15 1.12e-02 -4.4 1.46e-01 - 6.19e-01 3.55e-01f 1 14 2.1637097e+05 8.88e-16 1.10e-02 -5.1 2.88e-01 - 4.88e-01 9.64e-01f 1 15 2.1636826e+05 6.66e-16 1.95e-03 -6.7 4.39e-02 - 8.17e-01 8.86e-01f 1 16 2.1636791e+05 8.88e-16 1.35e-04 -8.7 4.97e-03 - 9.40e-01 9.17e-01f 1 17 2.1636788e+05 6.66e-16 1.70e-06 -11.0 4.41e-04 - 9.99e-01 9.95e-01h 1 18 2.1636788e+05 6.66e-16 2.14e-06 -11.0 2.29e-06 - 1.00e+00 9.96e-01h 1 19 2.1636788e+05 8.88e-16 2.41e-14 -11.0 8.51e-09 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 19 (scaled) (unscaled) Objective...............: 2.2918307444709765e+02 2.1636787693568130e+05 Dual infeasibility......: 2.4089515829434553e-14 2.2742505784939076e-11 Constraint violation....: 8.8817841970012523e-16 8.8817841970012523e-16 Complementarity.........: 2.6601980975970219e-11 2.5114481773751902e-08 Overall NLP error.......: 2.6601980975970219e-11 2.5114481773751902e-08 Number of objective function evaluations = 20 Number of objective gradient evaluations = 20 Number of equality constraint evaluations = 20 Number of inequality constraint evaluations = 20 Number of equality constraint Jacobian evaluations = 20 Number of inequality constraint Jacobian evaluations = 20 Number of Lagrangian Hessian evaluations = 19 Total CPU secs in IPOPT (w/o function evaluations) = 0.006 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 216367.88 19 0.005999 build initial OA NLP0014I 2 OPT 73583868 51 0.036994 OA decomposition OA0003I New best feasible of 73583868 found after 0.338949 sec and NLP0014I 3 OPT 2945535.3 19 0.005999 OA decomposition OA0003I New best feasible of 2945535.3 found after 1.399788 sec and NLP0014I 4 OPT 1565402.8 18 0.005999 OA decomposition OA0003I New best feasible of 1565402.8 found after 4.722283 sec and NLP0014I 5 OPT 999078.79 16 0.005999 OA decomposition OA0003I New best feasible of 999078.79 found after 7.464866 sec and NLP0014I 6 OPT 1288239.2 17 0.005999 OA decomposition OA0012I After 905.87029.1f seconds, 6 iterations upper bound 999068.80g, lower bound 500861.930g NLP0014I 7 OPT 851094.82 15 0.003 OA decomposition OA0003I New best feasible of 851094.82 found after 905.87329 sec and OA0012I After 7200.6263.1f seconds, 7 iterations upper bound 851086.310g, lower bound 530705.620g NLP0014I 8 OPT 664109.44 13 0.004999 OA decomposition OA0003I New best feasible of 664109.44 found after 7200.6323 sec and OA0009I OA interupted after 7200.6323 seconds found solution of value 664109.44 (lower bound 530705.62 ). OA0010I Performed 7 iterations, explored 66974848 branch-and-bound nodes in total Cbc0031I 12 added rows had average density of 2 Cbc0013I At root node, 12 cuts changed objective from 216367.74 to 216367.74 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 12 row cuts average 2.0 elements, 0 column cuts (12 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 216367.74), took 3 iterations and 0 nodes (7200.63 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 12 cuts of which 12 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 2.163677e+05 (only reliable for convex models) --- Restarting execution --- sssd-22-8-3.gms(375) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job sssd-22-8-3.gms Stop 09/08/12 22:00:51 elapsed 2:01:47.227 @04 1347134451 ----------------------------- Sa 8. Sep 22:00:51 CEST 2012 ----------------------------- =ready= Linux opt221 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/UncapacitatedFacilityLocation/gms/uflquad-15-60.gms =========== ----------------------------- Sa 8. Sep 19:59:04 CEST 2012 ----------------------------- @03 1347127144 --- Job uflquad-15-60.gms Start 09/08/12 19:59:04 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- uflquad-15-60.gms(2593) 2 Mb --- Starting execution: elapsed 0:00:00.013 --- uflquad-15-60.gms(2592) 3 Mb --- Generating MIQCP model m --- uflquad-15-60.gms(2593) 6 Mb --- 961 rows 916 columns 3,616 non-zeroes --- 3,602 nl-code 900 nl-non-zeroes --- 15 discrete-columns --- uflquad-15-60.gms(2593) 3 Mb --- Executing BONMIN: elapsed 0:00:00.017 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 900 Number of nonzeros in inequality constraint Jacobian.: 1800 Number of nonzeros in Lagrangian Hessian.............: 900 Total number of variables............................: 915 variables with only lower bounds: 900 variables with lower and upper bounds: 15 variables with only upper bounds: 0 Total number of equality constraints.................: 60 Total number of inequality constraints...............: 900 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 900 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 4.9397806e+01 8.50e-01 9.78e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.1866336e+02 4.06e-01 2.86e+00 -2.5 6.38e-02 - 1.41e-01 5.22e-01h 1 2 3.3790260e+02 1.44e-01 1.01e+00 -2.6 7.51e-02 - 4.99e-01 6.47e-01h 1 3 3.8542266e+02 4.22e-02 2.94e-01 -4.0 2.92e-02 - 7.99e-01 7.06e-01h 1 4 4.0490150e+02 3.36e-03 2.34e-02 -6.1 9.84e-03 - 9.13e-01 9.20e-01h 1 5 4.0655707e+02 7.47e-05 5.20e-04 -9.7 1.06e-03 - 9.80e-01 9.78e-01h 1 6 4.0659384e+02 7.30e-08 5.29e-07 -11.0 3.16e-05 - 9.99e-01 9.99e-01h 1 7 4.0659388e+02 4.44e-16 3.81e-14 -11.0 3.78e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: 1.0533520192126376e+02 4.0659387941607815e+02 Dual infeasibility......: 3.8076178755677043e-14 1.4697404999691339e-13 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Complementarity.........: 1.2774793104953629e-11 4.9310701385121011e-11 Overall NLP error.......: 1.2774793104953629e-11 4.9310701385121011e-11 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 8 Number of inequality constraint evaluations = 8 Number of equality constraint Jacobian evaluations = 8 Number of inequality constraint Jacobian evaluations = 8 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.008 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 406.59388 7 0.010999 build initial OA NLP0014I 2 OPT 1440.866 8 0.010998 OA decomposition OA0003I New best feasible of 1440.866 found after 0.042993 sec and NLP0014I 3 OPT 2017.6227 10 0.011998 OA decomposition NLP0014I 4 OPT 2027.0115 10 0.013997 OA decomposition NLP0014I 5 OPT 2266.6491 10 0.013997 OA decomposition NLP0014I 6 OPT 1501.8166 8 0.010998 OA decomposition NLP0014I 7 OPT 2063.1318 10 0.013998 OA decomposition NLP0014I 8 OPT 2075.8187 10 0.012998 OA decomposition NLP0014I 9 OPT 1913.8073 10 0.030995 OA decomposition NLP0014I 10 OPT 1930.5859 10 0.029996 OA decomposition NLP0014I 11 OPT 1604.2064 8 0.024996 OA decomposition NLP0014I 12 OPT 2231.6484 10 0.028995 OA decomposition NLP0014I 13 OPT 1526.1882 8 0.024997 OA decomposition NLP0014I 14 OPT 2118.9619 10 0.013998 OA decomposition NLP0014I 15 OPT 2008.6684 10 0.012998 OA decomposition NLP0014I 16 OPT 1951.0774 10 0.013997 OA decomposition NLP0014I 17 OPT 1148.2123 12 0.014997 OA decomposition OA0003I New best feasible of 1148.2123 found after 1.263807 sec and NLP0014I 18 OPT 1151.5029 12 0.015998 OA decomposition NLP0014I 19 OPT 1133.2744 12 0.015998 OA decomposition OA0003I New best feasible of 1133.2744 found after 2.624601 sec and NLP0014I 20 OPT 1129.837 12 0.014997 OA decomposition OA0003I New best feasible of 1129.837 found after 3.105527 sec and NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 1067.1 13 0.015997 OA decomposition OA0003I New best feasible of 1067.1 found after 3.639446 sec and NLP0014I 22 OPT 1147.0471 12 0.015998 OA decomposition NLP0014I 23 OPT 1127.9575 12 0.015997 OA decomposition NLP0014I 24 OPT 1141.7369 11 0.014998 OA decomposition NLP0014I 25 OPT 1063.1931 12 0.014997 OA decomposition OA0003I New best feasible of 1063.1931 found after 6.401026 sec and NLP0014I 26 OPT 1205.8977 12 0.014997 OA decomposition NLP0014I 27 OPT 1182.1291 12 0.014998 OA decomposition NLP0014I 28 OPT 1203.0059 12 0.014997 OA decomposition NLP0014I 29 OPT 1197.3627 13 0.017997 OA decomposition NLP0014I 30 OPT 1337.4627 13 0.016997 OA decomposition NLP0014I 31 OPT 1317.5883 12 0.015997 OA decomposition NLP0014I 32 OPT 1213.081 12 0.015997 OA decomposition NLP0014I 33 OPT 1179.5052 9 0.012998 OA decomposition NLP0014I 34 OPT 1226.1378 12 0.014998 OA decomposition NLP0014I 35 OPT 1199.7553 12 0.015998 OA decomposition NLP0014I 36 OPT 1144.1654 13 0.017997 OA decomposition NLP0014I 37 OPT 1227.2687 12 0.015997 OA decomposition NLP0014I 38 OPT 1246.9093 13 0.014998 OA decomposition NLP0014I 39 OPT 1096.5126 12 0.015997 OA decomposition NLP0014I 40 OPT 1227.5401 12 0.015997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 1225.1451 12 0.015998 OA decomposition NLP0014I 42 OPT 1206.6609 13 0.017997 OA decomposition NLP0014I 43 OPT 1223.0736 12 0.015998 OA decomposition NLP0014I 44 OPT 1209.2391 12 0.015997 OA decomposition NLP0014I 45 OPT 1211.0911 12 0.015998 OA decomposition NLP0014I 46 OPT 1233.5633 12 0.016998 OA decomposition NLP0014I 47 OPT 1270.0406 12 0.014997 OA decomposition NLP0014I 48 OPT 1396.8617 9 0.011999 OA decomposition NLP0014I 49 OPT 1328.285 13 0.016998 OA decomposition NLP0014I 50 OPT 1281.9958 13 0.016998 OA decomposition NLP0014I 51 OPT 1248.78 9 0.012998 OA decomposition NLP0014I 52 OPT 1216.669 12 0.016997 OA decomposition NLP0014I 53 OPT 1266.603 13 0.015998 OA decomposition NLP0014I 54 OPT 1380.1453 14 0.018997 OA decomposition NLP0014I 55 OPT 1393.9218 13 0.016997 OA decomposition NLP0014I 56 OPT 1253.8725 13 0.016997 OA decomposition NLP0014I 57 OPT 1266.6172 9 0.011998 OA decomposition NLP0014I 58 OPT 1283.8713 12 0.014997 OA decomposition NLP0014I 59 OPT 1359.0055 13 0.016997 OA decomposition NLP0014I 60 OPT 1421.7624 13 0.015998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 1279.416 13 0.016997 OA decomposition NLP0014I 62 OPT 1446.735 13 0.016998 OA decomposition NLP0014I 63 OPT 1338.3625 13 0.017997 OA decomposition NLP0014I 64 OPT 1321.5222 12 0.015997 OA decomposition NLP0014I 65 OPT 1171.9682 11 0.014998 OA decomposition NLP0014I 66 OPT 1284.3728 13 0.016998 OA decomposition NLP0014I 67 OPT 1258.6578 13 0.016998 OA decomposition NLP0014I 68 OPT 1409.9439 13 0.015998 OA decomposition NLP0014I 69 OPT 1346.4514 13 0.016997 OA decomposition NLP0014I 70 OPT 1418.5794 13 0.015998 OA decomposition NLP0014I 71 OPT 1429.5219 13 0.016997 OA decomposition NLP0014I 72 OPT 1265.4075 11 0.014997 OA decomposition NLP0014I 73 OPT 1411.3733 13 0.016997 OA decomposition NLP0014I 74 OPT 1415.2198 11 0.013998 OA decomposition NLP0014I 75 OPT 1292.1862 13 0.015997 OA decomposition NLP0014I 76 OPT 1394.4688 12 0.015997 OA decomposition NLP0014I 77 OPT 1202.5318 10 0.011998 OA decomposition NLP0014I 78 OPT 1290.4142 12 0.015998 OA decomposition NLP0014I 79 OPT 1396.8568 13 0.016997 OA decomposition NLP0014I 80 OPT 1377.3263 12 0.015998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT 1302.1793 12 0.016998 OA decomposition NLP0014I 82 OPT 1467.8334 13 0.017997 OA decomposition NLP0014I 83 OPT 1423.1672 13 0.017998 OA decomposition NLP0014I 84 OPT 1308.0089 12 0.015998 OA decomposition NLP0014I 85 OPT 1488.143 13 0.015998 OA decomposition NLP0014I 86 OPT 1476.7161 12 0.015997 OA decomposition NLP0014I 87 OPT 1472.1671 9 0.012998 OA decomposition NLP0014I 88 OPT 1446.4309 13 0.016997 OA decomposition NLP0014I 89 OPT 1440.293 14 0.017998 OA decomposition NLP0014I 90 OPT 1386.9519 13 0.016997 OA decomposition NLP0014I 91 OPT 1447.8022 9 0.011998 OA decomposition NLP0014I 92 OPT 1473.2498 12 0.016998 OA decomposition NLP0014I 93 OPT 1344.9998 12 0.014998 OA decomposition NLP0014I 94 OPT 1468.8225 8 0.011999 OA decomposition NLP0014I 95 OPT 1449.9804 8 0.011999 OA decomposition NLP0014I 96 OPT 1450.8013 12 0.014997 OA decomposition NLP0014I 97 OPT 1395.6774 12 0.014997 OA decomposition NLP0014I 98 OPT 1492.356 12 0.015998 OA decomposition NLP0014I 99 OPT 1401.5599 13 0.015998 OA decomposition NLP0014I 100 OPT 1455.7427 13 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT 1467.5654 13 0.016997 OA decomposition NLP0014I 102 OPT 1519.4465 13 0.016997 OA decomposition NLP0014I 103 OPT 1548.4731 11 0.014997 OA decomposition NLP0014I 104 OPT 1470.4113 13 0.017997 OA decomposition NLP0014I 105 OPT 1439.1946 13 0.017998 OA decomposition NLP0014I 106 OPT 1400.3982 13 0.016997 OA decomposition OA0012I After 100.24776.1f seconds, 106 iterations upper bound 1063.18250g, lower bound 724.957990g NLP0014I 107 OPT 1450.5723 13 0.017997 OA decomposition NLP0014I 108 OPT 1435.3376 12 0.015998 OA decomposition NLP0014I 109 OPT 1369.6279 13 0.017997 OA decomposition NLP0014I 110 OPT 1514.4048 13 0.016998 OA decomposition NLP0014I 111 OPT 1561.8077 13 0.017997 OA decomposition NLP0014I 112 OPT 1500.0567 13 0.015998 OA decomposition NLP0014I 113 OPT 1456.5454 13 0.016998 OA decomposition NLP0014I 114 OPT 1520.0974 13 0.015998 OA decomposition NLP0014I 115 OPT 1510.813 13 0.015997 OA decomposition NLP0014I 116 OPT 1534.6363 12 0.015998 OA decomposition NLP0014I 117 OPT 1572.1961 13 0.016997 OA decomposition NLP0014I 118 OPT 1553.206 13 0.017997 OA decomposition NLP0014I 119 OPT 1523.716 8 0.010999 OA decomposition NLP0014I 120 OPT 1619.1309 11 0.014997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 121 OPT 1592.6678 11 0.014998 OA decomposition NLP0014I 122 OPT 1134.244 11 0.014997 OA decomposition NLP0014I 123 OPT 1133.3137 10 0.012998 OA decomposition NLP0014I 124 OPT 1162.0384 11 0.014998 OA decomposition NLP0014I 125 OPT 1109.3223 10 0.013998 OA decomposition NLP0014I 126 OPT 1201.5307 11 0.013998 OA decomposition NLP0014I 127 OPT 1150.3348 8 0.011998 OA decomposition NLP0014I 128 OPT 1159.4845 11 0.014998 OA decomposition NLP0014I 129 OPT 1164.4166 10 0.013998 OA decomposition NLP0014I 130 OPT 1156.7546 8 0.011999 OA decomposition NLP0014I 131 OPT 1229.6955 11 0.014998 OA decomposition NLP0014I 132 OPT 1200.495 10 0.012998 OA decomposition NLP0014I 133 OPT 1165.3049 11 0.013998 OA decomposition NLP0014I 134 OPT 1161.6327 10 0.012998 OA decomposition NLP0014I 135 OPT 1200.7352 11 0.013998 OA decomposition NLP0014I 136 OPT 1227.4776 8 0.008999 OA decomposition NLP0014I 137 OPT 1230.1299 11 0.014997 OA decomposition NLP0014I 138 OPT 1228.9309 11 0.014997 OA decomposition NLP0014I 139 OPT 1209.7076 11 0.014997 OA decomposition NLP0014I 140 OPT 1248.4754 8 0.011999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 141 OPT 1260.793 11 0.014998 OA decomposition NLP0014I 142 OPT 1225.506 10 0.013998 OA decomposition NLP0014I 143 OPT 1207.7877 11 0.014998 OA decomposition NLP0014I 144 OPT 1200.1237 12 0.015997 OA decomposition NLP0014I 145 OPT 1200.9481 10 0.013998 OA decomposition OA0012I After 202.03029.1f seconds, 145 iterations upper bound 1063.18250g, lower bound 934.092030g NLP0014I 146 OPT 1219.1808 11 0.014998 OA decomposition NLP0014I 147 OPT 1243.6777 11 0.013998 OA decomposition NLP0014I 148 OPT 1256.8912 8 0.010999 OA decomposition NLP0014I 149 OPT 1184.5581 10 0.013997 OA decomposition NLP0014I 150 OPT 1289.1769 11 0.014997 OA decomposition NLP0014I 151 OPT 1262.4706 11 0.014998 OA decomposition NLP0014I 152 OPT 1230.7178 11 0.013998 OA decomposition NLP0014I 153 OPT 1264.8574 11 0.014997 OA decomposition NLP0014I 154 OPT 1210.1492 8 0.011998 OA decomposition NLP0014I 155 OPT 1258.4954 11 0.013998 OA decomposition NLP0014I 156 OPT 1224.9364 8 0.010999 OA decomposition NLP0014I 157 OPT 1230.1061 11 0.014997 OA decomposition NLP0014I 158 OPT 1218.5434 10 0.013998 OA decomposition NLP0014I 159 OPT 1262.6045 8 0.011999 OA decomposition NLP0014I 160 OPT 1239.9364 11 0.014997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 161 OPT 1249.176 11 0.013998 OA decomposition NLP0014I 162 OPT 1206.9453 11 0.013998 OA decomposition NLP0014I 163 OPT 1194.6915 10 0.013998 OA decomposition NLP0014I 164 OPT 1237.9629 11 0.015998 OA decomposition NLP0014I 165 OPT 1245.6526 10 0.013998 OA decomposition NLP0014I 166 OPT 1252.2389 11 0.014997 OA decomposition NLP0014I 167 OPT 1256.7332 8 0.010999 OA decomposition NLP0014I 168 OPT 1231.9236 10 0.013998 OA decomposition OA0012I After 302.73998.1f seconds, 168 iterations upper bound 1063.18250g, lower bound 965.97620g NLP0014I 169 OPT 1284.2718 8 0.011998 OA decomposition NLP0014I 170 OPT 1292.7197 11 0.014997 OA decomposition NLP0014I 171 OPT 1228.8477 10 0.012998 OA decomposition NLP0014I 172 OPT 1263.7413 11 0.014998 OA decomposition NLP0014I 173 OPT 1286.3548 8 0.011998 OA decomposition NLP0014I 174 OPT 1232.3026 11 0.014998 OA decomposition NLP0014I 175 OPT 1235.5651 11 0.014998 OA decomposition NLP0014I 176 OPT 1276.7721 11 0.014997 OA decomposition NLP0014I 177 OPT 1240.0402 11 0.013998 OA decomposition NLP0014I 178 OPT 1302.4266 11 0.014997 OA decomposition NLP0014I 179 OPT 1310.1658 11 0.013998 OA decomposition NLP0014I 180 OPT 1264.1219 8 0.011998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 181 OPT 1227.1303 11 0.013998 OA decomposition NLP0014I 182 OPT 1240.2563 11 0.014998 OA decomposition NLP0014I 183 OPT 1286.8343 11 0.014998 OA decomposition NLP0014I 184 OPT 1319.1446 11 0.014998 OA decomposition NLP0014I 185 OPT 1286.6923 10 0.013998 OA decomposition NLP0014I 186 OPT 1234.4449 11 0.012998 OA decomposition NLP0014I 187 OPT 1252.4508 11 0.012998 OA decomposition NLP0014I 188 OPT 1295.4924 11 0.013998 OA decomposition OA0012I After 405.37137.1f seconds, 188 iterations upper bound 1063.18250g, lower bound 980.570740g NLP0014I 189 OPT 1297.0384 11 0.013997 OA decomposition NLP0014I 190 OPT 1241.9664 11 0.014998 OA decomposition NLP0014I 191 OPT 1260.8332 11 0.012998 OA decomposition NLP0014I 192 OPT 1303.4022 11 0.014998 OA decomposition NLP0014I 193 OPT 1295.1463 11 0.015998 OA decomposition NLP0014I 194 OPT 1303.8558 11 0.014997 OA decomposition NLP0014I 195 OPT 1254.9407 10 0.012998 OA decomposition NLP0014I 196 OPT 1289.0855 11 0.014997 OA decomposition NLP0014I 197 OPT 1305.3828 11 0.014997 OA decomposition NLP0014I 198 OPT 1308.7055 8 0.011998 OA decomposition NLP0014I 199 OPT 1305.4248 11 0.014998 OA decomposition NLP0014I 200 OPT 1251.4147 11 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 201 OPT 1305.6214 8 0.011998 OA decomposition NLP0014I 202 OPT 1213.4063 10 0.011998 OA decomposition NLP0014I 203 OPT 1246.3806 11 0.014998 OA decomposition NLP0014I 204 OPT 1302.6781 11 0.015997 OA decomposition NLP0014I 205 OPT 1286.1099 10 0.013998 OA decomposition OA0012I After 507.1559.1f seconds, 205 iterations upper bound 1063.18250g, lower bound 995.775150g NLP0014I 206 OPT 1319.6556 11 0.014998 OA decomposition NLP0014I 207 OPT 1308.9636 11 0.014998 OA decomposition NLP0014I 208 OPT 1307.0664 11 0.014998 OA decomposition NLP0014I 209 OPT 1289.2271 11 0.014997 OA decomposition NLP0014I 210 OPT 1302.0785 11 0.014997 OA decomposition NLP0014I 211 OPT 1277.0987 11 0.014998 OA decomposition NLP0014I 212 OPT 1313.5108 11 0.014998 OA decomposition NLP0014I 213 OPT 1358.6598 8 0.009999 OA decomposition NLP0014I 214 OPT 1266.1768 11 0.013997 OA decomposition NLP0014I 215 OPT 1323.7024 11 0.013997 OA decomposition NLP0014I 216 OPT 1314.3527 11 0.014997 OA decomposition NLP0014I 217 OPT 1293.8759 10 0.012998 OA decomposition NLP0014I 218 OPT 1377.623 8 0.011998 OA decomposition NLP0014I 219 OPT 1275.5852 11 0.013998 OA decomposition NLP0014I 220 OPT 1303.8553 11 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 221 OPT 1355.0054 11 0.014998 OA decomposition OA0012I After 609.64032.1f seconds, 221 iterations upper bound 1063.18250g, lower bound 1010.3820g NLP0014I 222 OPT 1275.9067 11 0.014998 OA decomposition NLP0014I 223 OPT 1322.1328 8 0.008998 OA decomposition NLP0014I 224 OPT 1306.0839 11 0.013998 OA decomposition NLP0014I 225 OPT 1311.2545 11 0.014998 OA decomposition NLP0014I 226 OPT 1304.366 8 0.011998 OA decomposition NLP0014I 227 OPT 1306.5737 11 0.014998 OA decomposition NLP0014I 228 OPT 1300.6501 10 0.013998 OA decomposition NLP0014I 229 OPT 1311.1194 10 0.013998 OA decomposition NLP0014I 230 OPT 1306.153 11 0.014997 OA decomposition NLP0014I 231 OPT 1307.6612 10 0.013998 OA decomposition NLP0014I 232 OPT 1336.1324 11 0.014998 OA decomposition NLP0014I 233 OPT 1320.4212 11 0.015998 OA decomposition NLP0014I 234 OPT 1344.4792 11 0.013998 OA decomposition NLP0014I 235 OPT 1323.0342 11 0.014997 OA decomposition NLP0014I 236 OPT 1315.4919 10 0.012998 OA decomposition OA0012I After 712.15873.1f seconds, 236 iterations upper bound 1063.18250g, lower bound 1017.92060g NLP0014I 237 OPT 1382.2388 11 0.014998 OA decomposition NLP0014I 238 OPT 1311.7727 8 0.011998 OA decomposition NLP0014I 239 OPT 1311.2939 10 0.012998 OA decomposition NLP0014I 240 OPT 1297.9782 10 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 241 OPT 1304.0437 10 0.012998 OA decomposition NLP0014I 242 OPT 1319.2302 10 0.011998 OA decomposition NLP0014I 243 OPT 1291.4155 10 0.012998 OA decomposition NLP0014I 244 OPT 1310.8362 8 0.010998 OA decomposition NLP0014I 245 OPT 1334.1574 8 0.011998 OA decomposition NLP0014I 246 OPT 1303.4016 10 0.013998 OA decomposition NLP0014I 247 OPT 1283.8139 11 0.014998 OA decomposition NLP0014I 248 OPT 1275.9687 12 0.015997 OA decomposition NLP0014I 249 OPT 1312.4095 11 0.014998 OA decomposition NLP0014I 250 OPT 1335.9197 8 0.011999 OA decomposition OA0012I After 813.38335.1f seconds, 250 iterations upper bound 1063.18250g, lower bound 1024.17790g NLP0014I 251 OPT 1349.0537 11 0.015997 OA decomposition NLP0014I 252 OPT 1404.0352 11 0.014998 OA decomposition NLP0014I 253 OPT 1294.6261 11 0.014998 OA decomposition NLP0014I 254 OPT 1323.7311 8 0.011998 OA decomposition NLP0014I 255 OPT 1339.7365 11 0.014998 OA decomposition NLP0014I 256 OPT 1288.1657 11 0.014997 OA decomposition NLP0014I 257 OPT 1348.9745 11 0.014997 OA decomposition NLP0014I 258 OPT 1322.552 8 0.011998 OA decomposition NLP0014I 259 OPT 1316.9768 10 0.013998 OA decomposition NLP0014I 260 OPT 1337.0853 11 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 261 OPT 1320.7051 8 0.010999 OA decomposition NLP0014I 262 OPT 1324.2503 11 0.014998 OA decomposition NLP0014I 263 OPT 1308.6513 11 0.014998 OA decomposition NLP0014I 264 OPT 1282.0333 11 0.014998 OA decomposition OA0012I After 920.2711.1f seconds, 264 iterations upper bound 1063.18250g, lower bound 1035.01570g NLP0014I 265 OPT 1353.161 11 0.014998 OA decomposition NLP0014I 266 OPT 1348.6888 8 0.010999 OA decomposition NLP0014I 267 OPT 1319.5101 11 0.014998 OA decomposition NLP0014I 268 OPT 1305.4316 11 0.014998 OA decomposition NLP0014I 269 OPT 1346.3813 9 0.012998 OA decomposition NLP0014I 270 OPT 1354.602 9 0.012998 OA decomposition NLP0014I 271 OPT 1393.59 11 0.014998 OA decomposition NLP0014I 272 OPT 1379.6994 11 0.013998 OA decomposition NLP0014I 273 OPT 1306.9355 11 0.015998 OA decomposition NLP0014I 274 OPT 1341.1179 8 0.011998 OA decomposition NLP0014I 275 OPT 1376.3385 10 0.013998 OA decomposition NLP0014I 276 OPT 1352.5493 11 0.014998 OA decomposition OA0012I After 1023.3424.1f seconds, 276 iterations upper bound 1063.18250g, lower bound 1044.64180g NLP0014I 277 OPT 1333.6122 11 0.014998 OA decomposition NLP0014I 278 OPT 1347.9933 11 0.014998 OA decomposition NLP0014I 279 OPT 1344.8342 11 0.014998 OA decomposition NLP0014I 280 OPT 1338.4147 10 0.012998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 281 OPT 1340.2856 11 0.014998 OA decomposition NLP0014I 282 OPT 1345.184 8 0.011999 OA decomposition NLP0014I 283 OPT 1340.3284 11 0.014998 OA decomposition NLP0014I 284 OPT 1343.9192 11 0.013998 OA decomposition NLP0014I 285 OPT 1338.9551 11 0.013998 OA decomposition NLP0014I 286 OPT 1302.4352 11 0.014998 OA decomposition NLP0014I 287 OPT 1345.7519 8 0.009998 OA decomposition NLP0014I 288 OPT 1359.0626 11 0.012999 OA decomposition OA0012I After 1129.5163.1f seconds, 288 iterations upper bound 1063.18250g, lower bound 1051.27250g NLP0014I 289 OPT 1292.3346 11 0.014998 OA decomposition NLP0014I 290 OPT 1428.197 11 0.014998 OA decomposition NLP0014I 291 OPT 1372.7396 11 0.014998 OA decomposition NLP0014I 292 OPT 1412.9484 8 0.010999 OA decomposition NLP0014I 293 OPT 1327.858 11 0.014997 OA decomposition NLP0014I 294 OPT 1352.0698 10 0.012998 OA decomposition NLP0014I 295 OPT 1335.7782 10 0.012998 OA decomposition NLP0014I 296 OPT 1309.0413 11 0.012998 OA decomposition NLP0014I 297 OPT 1352.9452 9 0.012998 OA decomposition NLP0014I 298 OPT 1360.8547 11 0.014997 OA decomposition NLP0014I 299 OPT 1352.6555 11 0.015997 OA decomposition NLP0014I 300 OPT 1349.5535 9 0.012998 OA decomposition OA0012I After 1234.9713.1f seconds, 300 iterations upper bound 1063.18250g, lower bound 1056.29760g NLP0012I Num Status Obj It time Location NLP0014I 301 OPT 1374.6034 11 0.015998 OA decomposition NLP0014I 302 OPT 1357.9984 8 0.011998 OA decomposition NLP0014I 303 OPT 1362.7466 11 0.014998 OA decomposition NLP0014I 304 OPT 1355.3769 11 0.014998 OA decomposition NLP0014I 305 OPT 1380.7142 8 0.011998 OA decomposition NLP0014I 306 OPT 1372.6384 11 0.014998 OA decomposition NLP0014I 307 OPT 1351.4815 11 0.015998 OA decomposition NLP0014I 308 OPT 1342.4772 10 0.011998 OA decomposition NLP0014I 309 OPT 1377.4285 11 0.014998 OA decomposition NLP0014I 310 OPT 1336.9512 11 0.014998 OA decomposition OA0008I OA converged in 1327.0093 seconds found solution of value 1063.1931 (lower bound 1e+50 ). OA0010I Performed 309 iterations, explored 221888 branch-and-bound nodes in total Cbc0012I Integer solution of 1063.1931 found by nonlinear programm after 31 iterations and 0 nodes (1327.01 seconds) Cbc0031I 13 added rows had average density of 152 Cbc0013I At root node, 13 cuts changed objective from 406.59383 to 406.59383 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 57 row cuts average 181.3 elements, 0 column cuts (13 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 1063.193096269119, took 31 iterations and 0 nodes (1327.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 57 cuts of which 13 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1063.19. Best solution: 1.063193e+03 (0 nodes, 1331 seconds) Best possible: 1.063193e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- uflquad-15-60.gms(2593) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job uflquad-15-60.gms Stop 09/08/12 20:21:16 elapsed 0:22:11.263 @04 1347128476 ----------------------------- Sa 8. Sep 20:21:16 CEST 2012 ----------------------------- =ready= Linux opt219 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/UncapacitatedFacilityLocation/gms/uflquad-15-80.gms =========== ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- @03 1347127145 --- Job uflquad-15-80.gms Start 09/08/12 19:59:05 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- uflquad-15-80.gms(3474) 3 Mb --- Starting execution: elapsed 0:00:00.036 --- uflquad-15-80.gms(3472) 3 Mb --- Generating MIQCP model m --- uflquad-15-80.gms(3474) 6 Mb --- 1,281 rows 1,216 columns 4,816 non-zeroes --- 4,802 nl-code 1,200 nl-non-zeroes --- 15 discrete-columns --- uflquad-15-80.gms(3474) 3 Mb --- Executing BONMIN: elapsed 0:00:00.048 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1200 Number of nonzeros in inequality constraint Jacobian.: 2400 Number of nonzeros in Lagrangian Hessian.............: 1200 Total number of variables............................: 1215 variables with only lower bounds: 1200 variables with lower and upper bounds: 15 variables with only upper bounds: 0 Total number of equality constraints.................: 80 Total number of inequality constraints...............: 1200 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1200 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 5.1819471e+01 8.50e-01 6.53e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.0674170e+02 2.75e-01 3.93e+00 -2.6 6.42e-02 - 1.39e-01 6.76e-01h 1 2 3.9572692e+02 9.99e-02 1.43e+00 -3.1 4.34e-02 - 6.00e-01 6.37e-01h 1 3 4.3991306e+02 1.68e-02 2.40e-01 -4.5 1.83e-02 - 8.52e-01 8.32e-01h 1 4 4.4791276e+02 1.43e-03 2.04e-02 -6.5 5.11e-03 - 9.45e-01 9.15e-01h 1 5 4.4853201e+02 6.77e-05 1.06e-03 -8.6 1.81e-03 - 9.81e-01 9.53e-01h 1 6 4.4855816e+02 3.48e-07 1.10e-05 -11.0 1.46e-04 - 9.99e-01 9.95e-01h 1 7 4.4855827e+02 4.44e-16 4.27e-14 -11.0 1.07e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: 1.1355905666918849e+02 4.4855827384329450e+02 Dual infeasibility......: 4.2730166680092050e-14 1.6878415838636358e-13 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Complementarity.........: 1.5868217233423439e-11 6.2679458072022584e-11 Overall NLP error.......: 1.5868217233423439e-11 6.2679458072022584e-11 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 8 Number of inequality constraint evaluations = 8 Number of equality constraint Jacobian evaluations = 8 Number of inequality constraint Jacobian evaluations = 8 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.028 Total CPU secs in NLP function evaluations = 0.006 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 448.55827 7 0.033994 build initial OA NLP0014I 2 OPT 2067.2913 8 0.030995 OA decomposition OA0003I New best feasible of 2067.2913 found after 0.123981 sec and NLP0014I 3 OPT 2035.9868 8 0.031995 OA decomposition OA0003I New best feasible of 2035.9868 found after 0.246962 sec and NLP0014I 4 OPT 2466.0397 10 0.034995 OA decomposition NLP0014I 5 OPT 2313.982 8 0.030995 OA decomposition NLP0014I 6 OPT 2384.5473 8 0.031995 OA decomposition NLP0014I 7 OPT 2432.2898 8 0.030995 OA decomposition NLP0014I 8 OPT 1898.6428 8 0.031995 OA decomposition OA0003I New best feasible of 1898.6428 found after 0.781881 sec and NLP0014I 9 OPT 1840.37 8 0.019997 OA decomposition OA0003I New best feasible of 1840.37 found after 0.894864 sec and NLP0014I 10 OPT 2397.705 8 0.014998 OA decomposition NLP0014I 11 OPT 2449.0663 10 0.016998 OA decomposition NLP0014I 12 OPT 2831.3637 11 0.018997 OA decomposition NLP0014I 13 OPT 1776.6837 8 0.014998 OA decomposition OA0003I New best feasible of 1776.6837 found after 1.11783 sec and NLP0014I 14 OPT 2401.3634 11 0.018997 OA decomposition NLP0014I 15 OPT 2463.4596 10 0.016998 OA decomposition NLP0014I 16 OPT 2424.9266 10 0.017997 OA decomposition NLP0014I 17 OPT 1249.9032 13 0.021997 OA decomposition OA0003I New best feasible of 1249.9032 found after 1.504771 sec and NLP0014I 18 OPT 1283.1901 13 0.022997 OA decomposition NLP0014I 19 OPT 1386.3417 13 0.020997 OA decomposition NLP0014I 20 OPT 1406.8206 12 0.020997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 1329.0062 13 0.021997 OA decomposition NLP0014I 22 OPT 1417.3799 12 0.019997 OA decomposition NLP0014I 23 OPT 1442.9927 13 0.020997 OA decomposition NLP0014I 24 OPT 1484.6684 13 0.021997 OA decomposition NLP0014I 25 OPT 1420.6208 14 0.022997 OA decomposition NLP0014I 26 OPT 1433.1707 12 0.019996 OA decomposition NLP0014I 27 OPT 1420.065 13 0.021997 OA decomposition NLP0014I 28 OPT 1319.2634 9 0.015998 OA decomposition NLP0014I 29 OPT 1436.4586 12 0.020997 OA decomposition NLP0014I 30 OPT 1425.2944 13 0.020997 OA decomposition NLP0014I 31 OPT 1367.5118 11 0.017998 OA decomposition NLP0014I 32 OPT 1499.0309 9 0.015997 OA decomposition NLP0014I 33 OPT 1520.5131 14 0.022996 OA decomposition NLP0014I 34 OPT 1350.9357 9 0.016997 OA decomposition NLP0014I 35 OPT 1312.5226 13 0.022996 OA decomposition NLP0014I 36 OPT 1507.3095 13 0.021997 OA decomposition NLP0014I 37 OPT 1468.8355 13 0.021996 OA decomposition NLP0014I 38 OPT 1298.4315 13 0.020997 OA decomposition NLP0014I 39 OPT 1628.3064 13 0.020997 OA decomposition NLP0014I 40 OPT 1484.293 14 0.023996 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 1429.0667 13 0.020997 OA decomposition NLP0014I 42 OPT 1368.1 13 0.021996 OA decomposition NLP0014I 43 OPT 1606.6131 13 0.021997 OA decomposition NLP0014I 44 OPT 1365.7268 13 0.021997 OA decomposition NLP0014I 45 OPT 1388.0275 13 0.021997 OA decomposition NLP0014I 46 OPT 1532.2026 14 0.022996 OA decomposition NLP0014I 47 OPT 1569.6274 12 0.019997 OA decomposition NLP0014I 48 OPT 1504.3267 12 0.019997 OA decomposition NLP0014I 49 OPT 1352.2469 9 0.016998 OA decomposition NLP0014I 50 OPT 1408.6334 13 0.022997 OA decomposition NLP0014I 51 OPT 1415.496 13 0.021996 OA decomposition NLP0014I 52 OPT 1506.1514 12 0.020997 OA decomposition NLP0014I 53 OPT 1412.4309 13 0.020997 OA decomposition NLP0014I 54 OPT 1487.0396 13 0.020997 OA decomposition NLP0014I 55 OPT 1496.7322 13 0.021997 OA decomposition NLP0014I 56 OPT 1492.2859 10 0.016998 OA decomposition NLP0014I 57 OPT 1518.114 14 0.023997 OA decomposition NLP0014I 58 OPT 1502.9527 13 0.021996 OA decomposition NLP0014I 59 OPT 1686.9458 14 0.023997 OA decomposition NLP0014I 60 OPT 1584.102 13 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 1537.9293 13 0.021997 OA decomposition NLP0014I 62 OPT 1604.3147 12 0.020997 OA decomposition NLP0014I 63 OPT 1591.5536 10 0.015997 OA decomposition NLP0014I 64 OPT 1455.6627 13 0.022996 OA decomposition NLP0014I 65 OPT 1497.4656 11 0.018997 OA decomposition NLP0014I 66 OPT 1618.6855 12 0.020997 OA decomposition NLP0014I 67 OPT 1624.599 14 0.023996 OA decomposition NLP0014I 68 OPT 1593.5314 13 0.019997 OA decomposition NLP0014I 69 OPT 1605.4708 13 0.022997 OA decomposition NLP0014I 70 OPT 1444.086 9 0.015997 OA decomposition NLP0014I 71 OPT 1523.3434 11 0.019996 OA decomposition NLP0014I 72 OPT 1449.0557 13 0.021997 OA decomposition NLP0014I 73 OPT 1429.7466 12 0.020997 OA decomposition NLP0014I 74 OPT 1697.4666 13 0.022997 OA decomposition NLP0014I 75 OPT 1492.5659 11 0.018997 OA decomposition NLP0014I 76 OPT 1564.5752 12 0.019997 OA decomposition NLP0014I 77 OPT 1439.2766 9 0.014998 OA decomposition NLP0014I 78 OPT 1667.9383 13 0.021996 OA decomposition NLP0014I 79 OPT 1455.0662 12 0.020996 OA decomposition NLP0014I 80 OPT 1523.5959 13 0.020997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT 1573.3585 12 0.019997 OA decomposition NLP0014I 82 OPT 1581.1365 13 0.021997 OA decomposition NLP0014I 83 OPT 1679.0298 13 0.021997 OA decomposition OA0012I After 100.25776.1f seconds, 83 iterations upper bound 1249.89070g, lower bound 744.128260g NLP0014I 84 OPT 1460.6463 14 0.021997 OA decomposition NLP0014I 85 OPT 1574.2987 12 0.019997 OA decomposition NLP0014I 86 OPT 1383.4145 12 0.019997 OA decomposition NLP0014I 87 OPT 1472.6508 12 0.020997 OA decomposition NLP0014I 88 OPT 1708.324 13 0.021997 OA decomposition NLP0014I 89 OPT 1466.3266 14 0.023996 OA decomposition NLP0014I 90 OPT 1553.6342 13 0.021997 OA decomposition NLP0014I 91 OPT 1477.0085 12 0.020997 OA decomposition NLP0014I 92 OPT 1435.396 12 0.019997 OA decomposition NLP0014I 93 OPT 1634.6104 12 0.020997 OA decomposition NLP0014I 94 OPT 1518.5772 12 0.020997 OA decomposition NLP0014I 95 OPT 1561.2408 11 0.018997 OA decomposition NLP0014I 96 OPT 1217.9894 12 0.020997 OA decomposition OA0003I New best feasible of 1217.9894 found after 126.63775 sec and NLP0014I 97 OPT 1509.0179 13 0.021997 OA decomposition NLP0014I 98 OPT 1417.5637 12 0.020997 OA decomposition NLP0014I 99 OPT 1520.4487 14 0.023997 OA decomposition NLP0014I 100 OPT 1522.6772 12 0.020997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT 1523.7885 10 0.017997 OA decomposition NLP0014I 102 OPT 1531.0297 13 0.021997 OA decomposition NLP0014I 103 OPT 1617.7476 13 0.021996 OA decomposition NLP0014I 104 OPT 1535.1199 13 0.021997 OA decomposition NLP0014I 105 OPT 1633.8579 10 0.017997 OA decomposition NLP0014I 106 OPT 1527.9817 13 0.021996 OA decomposition NLP0014I 107 OPT 1446.9283 9 0.016998 OA decomposition NLP0014I 108 OPT 1582.524 10 0.017997 OA decomposition NLP0014I 109 OPT 1681.1258 13 0.021996 OA decomposition NLP0014I 110 OPT 1565.7803 14 0.022996 OA decomposition NLP0014I 111 OPT 1688.6162 13 0.020997 OA decomposition NLP0014I 112 OPT 1731.4671 12 0.018997 OA decomposition NLP0014I 113 OPT 1738.0971 12 0.020997 OA decomposition NLP0014I 114 OPT 1584.4711 13 0.021997 OA decomposition NLP0014I 115 OPT 1608.0654 13 0.021997 OA decomposition NLP0014I 116 OPT 1705.2351 14 0.022997 OA decomposition NLP0014I 117 OPT 1500.2581 12 0.018997 OA decomposition NLP0014I 118 OPT 1591.3814 14 0.023996 OA decomposition NLP0014I 119 OPT 1599.9901 13 0.020997 OA decomposition NLP0014I 120 OPT 1519.6439 12 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 121 OPT 1257.1716 12 0.019997 OA decomposition NLP0014I 122 OPT 1256.385 12 0.018998 OA decomposition NLP0014I 123 OPT 1780.4415 13 0.020997 OA decomposition OA0012I After 201.59635.1f seconds, 123 iterations upper bound 1217.97720g, lower bound 824.999190g NLP0014I 124 OPT 1773.1137 11 0.017997 OA decomposition NLP0014I 125 OPT 1295.9653 12 0.019997 OA decomposition NLP0014I 126 OPT 1266.6462 12 0.020996 OA decomposition NLP0014I 127 OPT 1250.4902 8 0.013998 OA decomposition NLP0014I 128 OPT 1267.0769 12 0.020997 OA decomposition NLP0014I 129 OPT 1333.0845 10 0.016998 OA decomposition NLP0014I 130 OPT 1298.5196 10 0.016997 OA decomposition NLP0014I 131 OPT 1342.9888 12 0.020997 OA decomposition NLP0014I 132 OPT 1285.2742 8 0.014998 OA decomposition NLP0014I 133 OPT 1295.5369 11 0.018997 OA decomposition NLP0014I 134 OPT 1358.3793 11 0.017998 OA decomposition NLP0014I 135 OPT 1348.5817 11 0.018997 OA decomposition NLP0014I 136 OPT 1320.6597 8 0.013998 OA decomposition NLP0014I 137 OPT 1350.7229 12 0.019997 OA decomposition NLP0014I 138 OPT 1312.2974 13 0.021996 OA decomposition NLP0014I 139 OPT 1346.3328 11 0.018997 OA decomposition NLP0014I 140 OPT 1319.5715 8 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 141 OPT 1363.2825 12 0.020997 OA decomposition NLP0014I 142 OPT 1343.6009 12 0.018998 OA decomposition NLP0014I 143 OPT 1419.3846 12 0.020997 OA decomposition NLP0014I 144 OPT 1311.7065 11 0.017997 OA decomposition NLP0014I 145 OPT 1367.4814 8 0.014998 OA decomposition OA0012I After 306.34043.1f seconds, 145 iterations upper bound 1217.97720g, lower bound 949.616110g NLP0014I 146 OPT 1407.5535 11 0.017997 OA decomposition NLP0014I 147 OPT 1369.6429 13 0.021996 OA decomposition NLP0014I 148 OPT 1357.8428 11 0.018997 OA decomposition NLP0014I 149 OPT 1393.2839 9 0.016998 OA decomposition NLP0014I 150 OPT 1348.5581 12 0.020996 OA decomposition NLP0014I 151 OPT 1326.8407 8 0.013998 OA decomposition NLP0014I 152 OPT 1386.6571 12 0.019996 OA decomposition NLP0014I 153 OPT 1401.4171 12 0.020997 OA decomposition NLP0014I 154 OPT 1344.2415 8 0.014998 OA decomposition NLP0014I 155 OPT 1360.0378 11 0.018997 OA decomposition NLP0014I 156 OPT 1415.6811 11 0.018998 OA decomposition NLP0014I 157 OPT 1368.8045 12 0.019997 OA decomposition NLP0014I 158 OPT 1342.7764 12 0.020997 OA decomposition NLP0014I 159 OPT 1360.646 8 0.014997 OA decomposition NLP0014I 160 OPT 1380.844 11 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 161 OPT 1397.7409 12 0.020996 OA decomposition OA0012I After 408.72586.1f seconds, 161 iterations upper bound 1217.97720g, lower bound 977.979610g NLP0014I 162 OPT 1398.4104 11 0.018997 OA decomposition NLP0014I 163 OPT 1355.9788 8 0.014998 OA decomposition NLP0014I 164 OPT 1364.7168 8 0.013997 OA decomposition NLP0014I 165 OPT 1407.1569 13 0.022996 OA decomposition NLP0014I 166 OPT 1408.9172 11 0.017998 OA decomposition NLP0014I 167 OPT 1373.4911 11 0.018997 OA decomposition NLP0014I 168 OPT 1400.8644 12 0.018997 OA decomposition NLP0014I 169 OPT 1381.2972 12 0.020997 OA decomposition NLP0014I 170 OPT 1367.0606 10 0.017997 OA decomposition NLP0014I 171 OPT 1417.1298 11 0.018997 OA decomposition NLP0014I 172 OPT 1380.3342 8 0.014998 OA decomposition NLP0014I 173 OPT 1414.258 11 0.018998 OA decomposition NLP0014I 174 OPT 1361.5953 8 0.013998 OA decomposition NLP0014I 175 OPT 1367.2517 12 0.020996 OA decomposition OA0012I After 515.0747.1f seconds, 175 iterations upper bound 1217.97720g, lower bound 993.770870g NLP0014I 176 OPT 1360.6457 11 0.018998 OA decomposition NLP0014I 177 OPT 1378.2498 12 0.020997 OA decomposition NLP0014I 178 OPT 1401.4343 13 0.021997 OA decomposition NLP0014I 179 OPT 1387.4991 11 0.018997 OA decomposition NLP0014I 180 OPT 1367.3826 12 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 181 OPT 1370.6653 11 0.017997 OA decomposition NLP0014I 182 OPT 1393.7692 11 0.017997 OA decomposition NLP0014I 183 OPT 1396.2929 12 0.018997 OA decomposition NLP0014I 184 OPT 1448.2988 11 0.018997 OA decomposition NLP0014I 185 OPT 1403.7838 12 0.020997 OA decomposition NLP0014I 186 OPT 1452.1636 13 0.022997 OA decomposition NLP0014I 187 OPT 1412.8033 11 0.018997 OA decomposition OA0012I After 615.94336.1f seconds, 187 iterations upper bound 1217.97720g, lower bound 1010.18040g NLP0014I 188 OPT 1411.3947 11 0.018997 OA decomposition NLP0014I 189 OPT 1416.0442 11 0.018998 OA decomposition NLP0014I 190 OPT 1409.0679 12 0.020997 OA decomposition NLP0014I 191 OPT 1405.6836 11 0.017997 OA decomposition NLP0014I 192 OPT 1404.1683 12 0.020997 OA decomposition NLP0014I 193 OPT 1410.1607 11 0.018998 OA decomposition NLP0014I 194 OPT 1429.5762 8 0.013998 OA decomposition NLP0014I 195 OPT 1413.4262 11 0.019997 OA decomposition NLP0014I 196 OPT 1392.4924 11 0.017997 OA decomposition NLP0014I 197 OPT 1464.205 11 0.018997 OA decomposition NLP0014I 198 OPT 1412.1453 8 0.013998 OA decomposition OA0012I After 719.11668.1f seconds, 198 iterations upper bound 1217.97720g, lower bound 1027.09160g NLP0014I 199 OPT 1424.2109 11 0.019997 OA decomposition NLP0014I 200 OPT 1457.111 11 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 201 OPT 1399.5215 12 0.020997 OA decomposition NLP0014I 202 OPT 1464.5904 12 0.020997 OA decomposition NLP0014I 203 OPT 1430.9512 13 0.021997 OA decomposition NLP0014I 204 OPT 1417.3546 10 0.017998 OA decomposition NLP0014I 205 OPT 1418.203 11 0.018997 OA decomposition NLP0014I 206 OPT 1402.257 11 0.018997 OA decomposition NLP0014I 207 OPT 1479.5427 13 0.020997 OA decomposition NLP0014I 208 OPT 1492.8832 12 0.020996 OA decomposition OA0012I After 822.99289.1f seconds, 208 iterations upper bound 1217.97720g, lower bound 1042.30930g NLP0014I 209 OPT 1471.8929 11 0.017997 OA decomposition NLP0014I 210 OPT 1413.2985 12 0.018997 OA decomposition NLP0014I 211 OPT 1443.1726 11 0.018997 OA decomposition NLP0014I 212 OPT 1475.2773 11 0.018997 OA decomposition NLP0014I 213 OPT 1438.5607 11 0.018997 OA decomposition NLP0014I 214 OPT 1375.246 11 0.018997 OA decomposition NLP0014I 215 OPT 1412.0051 8 0.014997 OA decomposition NLP0014I 216 OPT 1421.9527 11 0.018997 OA decomposition NLP0014I 217 OPT 1436.7056 11 0.018997 OA decomposition NLP0014I 218 OPT 1467.7402 8 0.014998 OA decomposition OA0012I After 935.20583.1f seconds, 218 iterations upper bound 1217.97720g, lower bound 1054.88260g NLP0014I 219 OPT 1477.6363 12 0.020997 OA decomposition NLP0014I 220 OPT 1429.7626 11 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 221 OPT 1447.7464 11 0.018997 OA decomposition NLP0014I 222 OPT 1418.9383 12 0.020996 OA decomposition NLP0014I 223 OPT 1386.9752 10 0.017997 OA decomposition NLP0014I 224 OPT 1419.267 12 0.019997 OA decomposition NLP0014I 225 OPT 1434.5844 8 0.014998 OA decomposition NLP0014I 226 OPT 1398.3816 10 0.016997 OA decomposition NLP0014I 227 OPT 1484.9536 12 0.019997 OA decomposition OA0012I After 1041.0807.1f seconds, 227 iterations upper bound 1217.97720g, lower bound 1061.92860g NLP0014I 228 OPT 1430.8707 12 0.020997 OA decomposition NLP0014I 229 OPT 1453.2229 8 0.014998 OA decomposition NLP0014I 230 OPT 1481.5062 11 0.018997 OA decomposition NLP0014I 231 OPT 1419.7621 12 0.016997 OA decomposition NLP0014I 232 OPT 1431.7608 12 0.020996 OA decomposition NLP0014I 233 OPT 1466.271 12 0.020996 OA decomposition NLP0014I 234 OPT 1431.2831 13 0.021996 OA decomposition NLP0014I 235 OPT 1468.346 11 0.018997 OA decomposition OA0012I After 1145.6348.1f seconds, 235 iterations upper bound 1217.97720g, lower bound 1068.38810g NLP0014I 236 OPT 1445.6505 11 0.019997 OA decomposition NLP0014I 237 OPT 1479.4126 12 0.017997 OA decomposition NLP0014I 238 OPT 1451.8439 12 0.018997 OA decomposition NLP0014I 239 OPT 1478.7799 13 0.021997 OA decomposition NLP0014I 240 OPT 1454.8061 12 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 241 OPT 1474.4699 12 0.020997 OA decomposition NLP0014I 242 OPT 1474.5845 12 0.019997 OA decomposition NLP0014I 243 OPT 1435.4651 11 0.018997 OA decomposition OA0012I After 1251.6687.1f seconds, 243 iterations upper bound 1217.97720g, lower bound 1076.81410g NLP0014I 244 OPT 1436.2438 11 0.019997 OA decomposition NLP0014I 245 OPT 1412.8981 10 0.016997 OA decomposition NLP0014I 246 OPT 1494.4002 12 0.020997 OA decomposition NLP0014I 247 OPT 1415.0411 11 0.018997 OA decomposition NLP0014I 248 OPT 1411.2946 8 0.013997 OA decomposition NLP0014I 249 OPT 1451.3831 12 0.021996 OA decomposition NLP0014I 250 OPT 1487.8723 12 0.019997 OA decomposition NLP0014I 251 OPT 1488.5279 12 0.020997 OA decomposition OA0012I After 1363.0248.1f seconds, 251 iterations upper bound 1217.97720g, lower bound 1082.38480g NLP0014I 252 OPT 1496.0734 12 0.019997 OA decomposition NLP0014I 253 OPT 1465.0085 12 0.020997 OA decomposition NLP0014I 254 OPT 1441.724 11 0.018997 OA decomposition NLP0014I 255 OPT 1518.7935 12 0.019997 OA decomposition NLP0014I 256 OPT 1463.0703 9 0.014997 OA decomposition NLP0014I 257 OPT 1502.845 8 0.012998 OA decomposition NLP0014I 258 OPT 1492.8769 11 0.018997 OA decomposition OA0012I After 1466.667.1f seconds, 258 iterations upper bound 1217.97720g, lower bound 1088.86250g NLP0014I 259 OPT 1537.2097 12 0.020996 OA decomposition NLP0014I 260 OPT 1485.7247 11 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 261 OPT 1500.6166 12 0.019997 OA decomposition NLP0014I 262 OPT 1481.6846 10 0.016997 OA decomposition NLP0014I 263 OPT 1449.6218 11 0.019997 OA decomposition NLP0014I 264 OPT 1455.0511 11 0.018997 OA decomposition NLP0014I 265 OPT 1455.2128 13 0.020997 OA decomposition OA0012I After 1577.3312.1f seconds, 265 iterations upper bound 1217.97720g, lower bound 1093.32580g NLP0014I 266 OPT 1478.6402 11 0.018997 OA decomposition NLP0014I 267 OPT 1444.7834 11 0.018997 OA decomposition NLP0014I 268 OPT 1497.2237 12 0.018997 OA decomposition NLP0014I 269 OPT 1447.1512 8 0.013998 OA decomposition NLP0014I 270 OPT 1471.9153 11 0.018997 OA decomposition NLP0014I 271 OPT 1493.2924 11 0.018997 OA decomposition NLP0014I 272 OPT 1486.0676 12 0.019996 OA decomposition OA0012I After 1684.3529.1f seconds, 272 iterations upper bound 1217.97720g, lower bound 1096.3810g NLP0014I 273 OPT 1512.4639 13 0.021997 OA decomposition NLP0014I 274 OPT 1465.5229 8 0.014998 OA decomposition NLP0014I 275 OPT 1458.6321 11 0.019997 OA decomposition NLP0014I 276 OPT 1508.4998 12 0.020997 OA decomposition NLP0014I 277 OPT 1488.3291 11 0.018997 OA decomposition NLP0014I 278 OPT 1470.9211 10 0.017998 OA decomposition NLP0014I 279 OPT 1493.4262 11 0.018997 OA decomposition OA0012I After 1793.3204.1f seconds, 279 iterations upper bound 1217.97720g, lower bound 1100.15450g NLP0014I 280 OPT 1428.3539 8 0.014997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 281 OPT 1479.0338 9 0.016997 OA decomposition NLP0014I 282 OPT 1471.0705 11 0.018997 OA decomposition NLP0014I 283 OPT 1502.8232 13 0.021997 OA decomposition NLP0014I 284 OPT 1469.6614 11 0.017997 OA decomposition NLP0014I 285 OPT 1484.1653 12 0.019997 OA decomposition NLP0014I 286 OPT 1485.4441 11 0.018997 OA decomposition OA0012I After 1909.1958.1f seconds, 286 iterations upper bound 1217.97720g, lower bound 1105.450g NLP0014I 287 OPT 1444.7258 10 0.017997 OA decomposition NLP0014I 288 OPT 1458.575 11 0.017997 OA decomposition NLP0014I 289 OPT 1527.027 13 0.022997 OA decomposition NLP0014I 290 OPT 1522.6605 11 0.018997 OA decomposition NLP0014I 291 OPT 1460.1342 10 0.016997 OA decomposition NLP0014I 292 OPT 1440.9698 11 0.018997 OA decomposition OA0012I After 2012.1881.1f seconds, 292 iterations upper bound 1217.97720g, lower bound 1108.81910g NLP0014I 293 OPT 1465.2146 11 0.017997 OA decomposition NLP0014I 294 OPT 1539.8902 12 0.020997 OA decomposition NLP0014I 295 OPT 1483.3365 12 0.020997 OA decomposition NLP0014I 296 OPT 1524.1657 11 0.019997 OA decomposition NLP0014I 297 OPT 1536.1884 12 0.019997 OA decomposition NLP0014I 298 OPT 1490.7129 11 0.018997 OA decomposition OA0012I After 2117.4471.1f seconds, 298 iterations upper bound 1217.97720g, lower bound 1113.08490g NLP0014I 299 OPT 1459.9589 8 0.013998 OA decomposition NLP0014I 300 OPT 1497.2434 12 0.019997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 301 OPT 1505.9723 11 0.018997 OA decomposition NLP0014I 302 OPT 1496.7507 12 0.019997 OA decomposition NLP0014I 303 OPT 1439.2593 10 0.017997 OA decomposition NLP0014I 304 OPT 1488.8905 10 0.017997 OA decomposition OA0012I After 2221.5303.1f seconds, 304 iterations upper bound 1217.97720g, lower bound 1115.68220g NLP0014I 305 OPT 1486.9179 12 0.019997 OA decomposition NLP0014I 306 OPT 1529.8834 12 0.020997 OA decomposition NLP0014I 307 OPT 1446.8946 8 0.014998 OA decomposition NLP0014I 308 OPT 1473.8041 12 0.019997 OA decomposition NLP0014I 309 OPT 1507.3606 13 0.020997 OA decomposition NLP0014I 310 OPT 1488.2409 11 0.018997 OA decomposition OA0012I After 2329.6318.1f seconds, 310 iterations upper bound 1217.97720g, lower bound 1118.40g NLP0014I 311 OPT 1489.6393 12 0.020997 OA decomposition NLP0014I 312 OPT 1493.0854 11 0.017997 OA decomposition NLP0014I 313 OPT 1335.0844 10 0.015997 OA decomposition NLP0014I 314 OPT 1514.2771 11 0.018997 OA decomposition NLP0014I 315 OPT 1484.725 12 0.020997 OA decomposition NLP0014I 316 OPT 1534.3522 12 0.020996 OA decomposition OA0012I After 2437.2535.1f seconds, 316 iterations upper bound 1217.97720g, lower bound 1122.68860g NLP0014I 317 OPT 1546.0389 12 0.018997 OA decomposition NLP0014I 318 OPT 1487.0997 11 0.019997 OA decomposition NLP0014I 319 OPT 1562.4929 13 0.020997 OA decomposition NLP0014I 320 OPT 1532.3102 12 0.020997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 321 OPT 1495.2111 11 0.018997 OA decomposition NLP0014I 322 OPT 1462.1174 11 0.019997 OA decomposition OA0012I After 2550.8352.1f seconds, 322 iterations upper bound 1217.97720g, lower bound 1127.18280g NLP0014I 323 OPT 1492.1566 12 0.017997 OA decomposition NLP0014I 324 OPT 1508.2305 10 0.017997 OA decomposition NLP0014I 325 OPT 1543.4871 12 0.019997 OA decomposition NLP0014I 326 OPT 1505.7014 11 0.018997 OA decomposition NLP0014I 327 OPT 1501.0543 11 0.019997 OA decomposition NLP0014I 328 OPT 1486.7781 12 0.019997 OA decomposition OA0012I After 2668.5263.1f seconds, 328 iterations upper bound 1217.97720g, lower bound 1128.27120g NLP0014I 329 OPT 1440.0396 8 0.012998 OA decomposition NLP0014I 330 OPT 1465.3097 11 0.019997 OA decomposition NLP0014I 331 OPT 1460.0523 10 0.017997 OA decomposition NLP0014I 332 OPT 1505.0729 11 0.017997 OA decomposition NLP0014I 333 OPT 1578.1622 12 0.019997 OA decomposition NLP0014I 334 OPT 1460.7267 10 0.016997 OA decomposition OA0012I After 2786.0135.1f seconds, 334 iterations upper bound 1217.97720g, lower bound 1132.3980g NLP0014I 335 OPT 1498.0498 11 0.016998 OA decomposition NLP0014I 336 OPT 1462.2477 11 0.019997 OA decomposition NLP0014I 337 OPT 1501.42 10 0.016998 OA decomposition NLP0014I 338 OPT 1505.1035 10 0.016997 OA decomposition NLP0014I 339 OPT 1509.0591 12 0.019997 OA decomposition OA0012I After 2886.1172.1f seconds, 339 iterations upper bound 1217.97720g, lower bound 1135.34510g NLP0014I 340 OPT 1503.4964 11 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 341 OPT 1464.7016 11 0.017998 OA decomposition NLP0014I 342 OPT 1497.3295 12 0.020997 OA decomposition NLP0014I 343 OPT 1540.9209 12 0.020997 OA decomposition NLP0014I 344 OPT 1503.9327 12 0.019997 OA decomposition OA0012I After 2988.8786.1f seconds, 344 iterations upper bound 1217.97720g, lower bound 1137.53150g NLP0014I 345 OPT 1515.6592 12 0.020997 OA decomposition NLP0014I 346 OPT 1551.2228 12 0.020996 OA decomposition NLP0014I 347 OPT 1523.4112 12 0.020997 OA decomposition NLP0014I 348 OPT 1509.8434 11 0.017997 OA decomposition NLP0014I 349 OPT 1472.0085 12 0.020997 OA decomposition OA0012I After 3091.874.1f seconds, 349 iterations upper bound 1217.97720g, lower bound 1140.69470g NLP0014I 350 OPT 1502.6697 11 0.018997 OA decomposition NLP0014I 351 OPT 1497.1352 13 0.022997 OA decomposition NLP0014I 352 OPT 1518.8066 12 0.019997 OA decomposition NLP0014I 353 OPT 1514.3278 11 0.018997 OA decomposition NLP0014I 354 OPT 1551.8096 12 0.020997 OA decomposition OA0012I After 3193.5415.1f seconds, 354 iterations upper bound 1217.97720g, lower bound 1144.90420g NLP0014I 355 OPT 1525.8529 11 0.018997 OA decomposition NLP0014I 356 OPT 1552.1118 13 0.021996 OA decomposition NLP0014I 357 OPT 1590.0108 12 0.020996 OA decomposition NLP0014I 358 OPT 1512.6101 12 0.018997 OA decomposition NLP0014I 359 OPT 1533.2695 12 0.020997 OA decomposition OA0012I After 3299.7374.1f seconds, 359 iterations upper bound 1217.97720g, lower bound 1149.85670g NLP0014I 360 OPT 1357.834 11 0.018998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 361 OPT 1482.9757 11 0.018997 OA decomposition NLP0014I 362 OPT 1466.48 11 0.017998 OA decomposition NLP0014I 363 OPT 1532.8187 11 0.019997 OA decomposition NLP0014I 364 OPT 1560.3515 13 0.020997 OA decomposition OA0012I After 3412.5842.1f seconds, 364 iterations upper bound 1217.97720g, lower bound 1154.4850g NLP0014I 365 OPT 1514.0602 11 0.018997 OA decomposition NLP0014I 366 OPT 1489.7116 11 0.017997 OA decomposition NLP0014I 367 OPT 1538.6083 12 0.020996 OA decomposition NLP0014I 368 OPT 1572.3199 13 0.021997 OA decomposition NLP0014I 369 OPT 1571.7313 12 0.020997 OA decomposition OA0012I After 3527.9277.1f seconds, 369 iterations upper bound 1217.97720g, lower bound 1158.12030g NLP0014I 370 OPT 1506.7382 11 0.017998 OA decomposition NLP0014I 371 OPT 1505.6878 11 0.018997 OA decomposition NLP0014I 372 OPT 1514.5373 8 0.014998 OA decomposition NLP0014I 373 OPT 1549.0412 11 0.018997 OA decomposition NLP0014I 374 OPT 1552.9397 11 0.017997 OA decomposition OA0012I After 3645.4798.1f seconds, 374 iterations upper bound 1217.97720g, lower bound 1160.89380g NLP0014I 375 OPT 1556.021 11 0.017997 OA decomposition NLP0014I 376 OPT 1510.1278 11 0.018997 OA decomposition NLP0014I 377 OPT 1591.3988 11 0.018997 OA decomposition NLP0014I 378 OPT 1572.0666 11 0.017997 OA decomposition NLP0014I 379 OPT 1540.3393 11 0.018997 OA decomposition OA0012I After 3764.5717.1f seconds, 379 iterations upper bound 1217.97720g, lower bound 1164.30930g NLP0014I 380 OPT 1570.4727 12 0.020997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 381 OPT 1529.2899 12 0.020997 OA decomposition NLP0014I 382 OPT 1561.0315 11 0.017998 OA decomposition NLP0014I 383 OPT 1522.2612 12 0.019997 OA decomposition NLP0014I 384 OPT 1496.8107 10 0.017997 OA decomposition OA0012I After 3889.2297.1f seconds, 384 iterations upper bound 1217.97720g, lower bound 1166.06480g NLP0014I 385 OPT 1499.4394 8 0.014998 OA decomposition NLP0014I 386 OPT 1560.7397 13 0.021997 OA decomposition NLP0014I 387 OPT 1489.538 12 0.019997 OA decomposition NLP0014I 388 OPT 1512.0086 11 0.019997 OA decomposition OA0012I After 3989.8215.1f seconds, 388 iterations upper bound 1217.97720g, lower bound 1168.43420g NLP0014I 389 OPT 1503.5801 11 0.018997 OA decomposition NLP0014I 390 OPT 1576.0476 12 0.019997 OA decomposition NLP0014I 391 OPT 1505.7709 8 0.014998 OA decomposition NLP0014I 392 OPT 1516.0053 11 0.018997 OA decomposition OA0012I After 4092.1739.1f seconds, 392 iterations upper bound 1217.97720g, lower bound 1171.92630g NLP0014I 393 OPT 1543.9389 12 0.020996 OA decomposition NLP0014I 394 OPT 1538.349 11 0.018997 OA decomposition NLP0014I 395 OPT 1574.261 12 0.019997 OA decomposition NLP0014I 396 OPT 1538.7794 12 0.020997 OA decomposition OA0012I After 4194.9433.1f seconds, 396 iterations upper bound 1217.97720g, lower bound 1173.93510g NLP0014I 397 OPT 1543.9228 12 0.020996 OA decomposition NLP0014I 398 OPT 1550.5556 11 0.018997 OA decomposition NLP0014I 399 OPT 1588.8697 13 0.020997 OA decomposition NLP0014I 400 OPT 1548.962 11 0.018997 OA decomposition OA0012I After 4298.7685.1f seconds, 400 iterations upper bound 1217.97720g, lower bound 1176.10910g NLP0012I Num Status Obj It time Location NLP0014I 401 OPT 1547.0452 13 0.021996 OA decomposition NLP0014I 402 OPT 1604.8033 11 0.018997 OA decomposition NLP0014I 403 OPT 1575.358 11 0.017997 OA decomposition NLP0014I 404 OPT 1548.6468 12 0.019997 OA decomposition OA0012I After 4402.8287.1f seconds, 404 iterations upper bound 1217.97720g, lower bound 1178.2380g NLP0014I 405 OPT 1570.8938 9 0.014998 OA decomposition NLP0014I 406 OPT 1374.1163 8 0.014998 OA decomposition NLP0014I 407 OPT 1551.082 11 0.018998 OA decomposition NLP0014I 408 OPT 1519.2076 8 0.014998 OA decomposition OA0012I After 4507.9857.1f seconds, 408 iterations upper bound 1217.97720g, lower bound 1180.65340g NLP0014I 409 OPT 1541.531 11 0.018997 OA decomposition NLP0014I 410 OPT 1558.1735 11 0.018998 OA decomposition NLP0014I 411 OPT 1517.4466 12 0.020997 OA decomposition NLP0014I 412 OPT 1394.324 12 0.020996 OA decomposition OA0012I After 4615.1904.1f seconds, 412 iterations upper bound 1217.97720g, lower bound 1182.26630g NLP0014I 413 OPT 1510.9014 11 0.018997 OA decomposition NLP0014I 414 OPT 1571.6086 11 0.017998 OA decomposition NLP0014I 415 OPT 1598.2106 11 0.018997 OA decomposition NLP0014I 416 OPT 1563.0142 12 0.020997 OA decomposition OA0012I After 4723.8009.1f seconds, 416 iterations upper bound 1217.97720g, lower bound 1186.120g NLP0014I 417 OPT 1607.6322 13 0.021997 OA decomposition NLP0014I 418 OPT 1524.023 8 0.013998 OA decomposition NLP0014I 419 OPT 1603.127 11 0.018997 OA decomposition NLP0014I 420 OPT 1540.0943 11 0.018997 OA decomposition OA0012I After 4831.1206.1f seconds, 420 iterations upper bound 1217.97720g, lower bound 1187.93110g NLP0012I Num Status Obj It time Location NLP0014I 421 OPT 1557.1552 12 0.020997 OA decomposition NLP0014I 422 OPT 1509.6869 11 0.018997 OA decomposition NLP0014I 423 OPT 1552.4206 11 0.017997 OA decomposition NLP0014I 424 OPT 1603.7585 12 0.020997 OA decomposition OA0012I After 4943.8604.1f seconds, 424 iterations upper bound 1217.97720g, lower bound 1188.93050g NLP0014I 425 OPT 1566.3818 12 0.019997 OA decomposition NLP0014I 426 OPT 1550.0369 11 0.019997 OA decomposition NLP0014I 427 OPT 1618.1006 12 0.019997 OA decomposition NLP0014I 428 OPT 1561.2958 11 0.018997 OA decomposition OA0012I After 5050.7312.1f seconds, 428 iterations upper bound 1217.97720g, lower bound 1190.05210g NLP0014I 429 OPT 1586.755 11 0.018997 OA decomposition NLP0014I 430 OPT 1526.8913 11 0.018997 OA decomposition NLP0014I 431 OPT 1554.3617 11 0.018997 OA decomposition NLP0014I 432 OPT 1579.9396 11 0.018997 OA decomposition OA0012I After 5163.0881.1f seconds, 432 iterations upper bound 1217.97720g, lower bound 1191.57340g NLP0014I 433 OPT 1574.0989 12 0.020997 OA decomposition NLP0014I 434 OPT 1548.9767 8 0.014997 OA decomposition NLP0014I 435 OPT 1553.1148 12 0.020997 OA decomposition NLP0014I 436 OPT 1568.6936 11 0.016997 OA decomposition OA0012I After 5283.9387.1f seconds, 436 iterations upper bound 1217.97720g, lower bound 1193.06850g NLP0014I 437 OPT 1514.8676 8 0.013998 OA decomposition NLP0014I 438 OPT 1574.7303 12 0.020997 OA decomposition NLP0014I 439 OPT 1533.4453 11 0.017997 OA decomposition NLP0014I 440 OPT 1546.7103 11 0.018997 OA decomposition OA0012I After 5405.3883.1f seconds, 440 iterations upper bound 1217.97720g, lower bound 1195.12890g NLP0012I Num Status Obj It time Location NLP0014I 441 OPT 1557.066 11 0.016997 OA decomposition NLP0014I 442 OPT 1395.7056 8 0.014998 OA decomposition NLP0014I 443 OPT 1530.6585 12 0.020997 OA decomposition NLP0014I 444 OPT 1392.35 8 0.014998 OA decomposition OA0012I After 5527.8326.1f seconds, 444 iterations upper bound 1217.97720g, lower bound 1197.87270g NLP0014I 445 OPT 1549.0585 12 0.018997 OA decomposition NLP0014I 446 OPT 1513.7211 11 0.018997 OA decomposition NLP0014I 447 OPT 1565.1431 11 0.018997 OA decomposition NLP0014I 448 OPT 1592.7419 12 0.019997 OA decomposition OA0012I After 5652.7167.1f seconds, 448 iterations upper bound 1217.97720g, lower bound 1201.89970g NLP0014I 449 OPT 1559.7172 11 0.018997 OA decomposition NLP0014I 450 OPT 1559.6876 12 0.020997 OA decomposition NLP0014I 451 OPT 1417.6766 8 0.013998 OA decomposition NLP0014I 452 OPT 1549.9489 10 0.016997 OA decomposition OA0012I After 5785.1795.1f seconds, 452 iterations upper bound 1217.97720g, lower bound 1206.53710g NLP0014I 453 OPT 1406.7227 8 0.014998 OA decomposition NLP0014I 454 OPT 1604.5083 12 0.019997 OA decomposition NLP0014I 455 OPT 1566.3157 12 0.020997 OA decomposition NLP0014I 456 OPT 1570.5595 11 0.019997 OA decomposition OA0012I After 5918.1763.1f seconds, 456 iterations upper bound 1217.97720g, lower bound 1210.01590g NLP0014I 457 OPT 1580.9801 9 0.016998 OA decomposition NLP0014I 458 OPT 1586.341 9 0.015998 OA decomposition NLP0014I 459 OPT 1576.9039 12 0.019997 OA decomposition OA0012I After 6036.8283.1f seconds, 459 iterations upper bound 1217.97720g, lower bound 1211.8630g NLP0014I 460 OPT 1596.4397 11 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 461 OPT 1592.3659 11 0.017997 OA decomposition NLP0014I 462 OPT 1621.0392 11 0.018997 OA decomposition OA0012I After 6138.3588.1f seconds, 462 iterations upper bound 1217.97720g, lower bound 1213.7630g NLP0014I 463 OPT 1583.801 12 0.020997 OA decomposition NLP0014I 464 OPT 1522.8233 11 0.019997 OA decomposition NLP0014I 465 OPT 1563.9675 13 0.021997 OA decomposition NLP0014I 466 OPT 1587.7969 13 0.022997 OA decomposition OA0008I OA converged in 6304.0346 seconds found solution of value 1217.9894 (lower bound 1e+50 ). OA0010I Performed 465 iterations, explored 517616 branch-and-bound nodes in total Cbc0012I Integer solution of 1217.9894 found by nonlinear programm after 9 iterations and 0 nodes (6304.00 seconds) Cbc0031I 8 added rows had average density of 187.375 Cbc0013I At root node, 8 cuts changed objective from 448.55823 to 448.55823 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 55 row cuts average 233.1 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 1217.98941212587, took 9 iterations and 0 nodes (6304.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 55 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 1217.99. Best solution: 1.217989e+03 (0 nodes, 6321.69 seconds) Best possible: 1.217989e+03 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- uflquad-15-80.gms(3474) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job uflquad-15-80.gms Stop 09/08/12 21:44:27 elapsed 1:45:22.053 @04 1347133467 ----------------------------- Sa 8. Sep 21:44:27 CEST 2012 ----------------------------- =ready= Linux opt213 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/UncapacitatedFacilityLocation/gms/uflquad-20-40.gms =========== ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- @03 1347127145 --- Job uflquad-20-40.gms Start 09/08/12 19:59:05 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- uflquad-20-40.gms(2309) 2 Mb --- Starting execution: elapsed 0:00:00.012 --- uflquad-20-40.gms(2307) 3 Mb --- Generating MIQCP model m --- uflquad-20-40.gms(2309) 6 Mb --- 841 rows 821 columns 3,221 non-zeroes --- 3,202 nl-code 800 nl-non-zeroes --- 20 discrete-columns --- uflquad-20-40.gms(2309) 3 Mb --- Executing BONMIN: elapsed 0:00:00.015 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 800 Number of nonzeros in inequality constraint Jacobian.: 1600 Number of nonzeros in Lagrangian Hessian.............: 800 Total number of variables............................: 820 variables with only lower bounds: 800 variables with lower and upper bounds: 20 variables with only upper bounds: 0 Total number of equality constraints.................: 40 Total number of inequality constraints...............: 800 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 800 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0114169e+01 8.00e-01 2.10e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.5682233e+02 4.65e-01 1.58e+00 -2.3 4.83e-02 - 1.86e-01 4.19e-01h 1 2 2.6185186e+02 1.77e-01 6.95e-01 -2.4 7.03e-02 - 5.03e-01 6.19e-01h 1 3 3.0704165e+02 4.71e-02 1.69e-01 -3.7 3.03e-02 - 7.52e-01 7.34e-01h 1 4 3.2419965e+02 4.16e-03 1.74e-02 -5.5 1.03e-02 - 9.02e-01 9.12e-01h 1 5 3.2586236e+02 9.80e-05 7.35e-04 -7.3 3.02e-03 - 9.70e-01 9.76e-01h 1 6 3.2589078e+02 2.22e-16 1.53e-04 -8.1 1.55e-03 - 9.95e-01 1.00e+00h 1 7 3.2588704e+02 3.33e-16 6.03e-14 -8.2 7.18e-04 - 1.00e+00 1.00e+00f 1 8 3.2588600e+02 4.44e-16 3.68e-14 -9.5 2.53e-04 - 1.00e+00 1.00e+00f 1 9 3.2588585e+02 3.33e-16 4.70e-14 -11.0 4.09e-05 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.2588585e+02 3.33e-16 3.35e-14 -11.0 1.13e-06 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 10 (scaled) (unscaled) Objective...............: 8.2502745684301246e+01 3.2588584545298988e+02 Dual infeasibility......: 3.3495528504794598e-14 1.3230733759393866e-13 Constraint violation....: 3.3306690738754696e-16 3.3306690738754696e-16 Complementarity.........: 3.5433429647545834e-11 1.3996204710780604e-10 Overall NLP error.......: 3.5433429647545834e-11 1.3996204710780604e-10 Number of objective function evaluations = 11 Number of objective gradient evaluations = 11 Number of equality constraint evaluations = 11 Number of inequality constraint evaluations = 11 Number of equality constraint Jacobian evaluations = 11 Number of inequality constraint Jacobian evaluations = 11 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.012 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 325.88585 10 0.014998 build initial OA NLP0014I 2 OPT 1140.7225 10 0.009999 OA decomposition OA0003I New best feasible of 1140.7225 found after 0.034995 sec and NLP0014I 3 OPT 1281.6542 10 0.011998 OA decomposition NLP0014I 4 OPT 1494.8908 10 0.011998 OA decomposition NLP0014I 5 OPT 1405.9006 11 0.028996 OA decomposition NLP0014I 6 OPT 1457.9248 11 0.029996 OA decomposition NLP0014I 7 OPT 1450.7233 10 0.026996 OA decomposition NLP0014I 8 OPT 1462.858 10 0.025996 OA decomposition NLP0014I 9 OPT 1221.5952 10 0.026996 OA decomposition NLP0014I 10 OPT 1660.3348 10 0.027996 OA decomposition NLP0014I 11 OPT 1454.507 10 0.011998 OA decomposition NLP0014I 12 OPT 1360.9436 10 0.011999 OA decomposition NLP0014I 13 OPT 1552.09 10 0.012998 OA decomposition NLP0014I 14 OPT 1075.726 8 0.010998 OA decomposition OA0003I New best feasible of 1075.726 found after 0.771883 sec and NLP0014I 15 OPT 1148.3087 8 0.010998 OA decomposition NLP0014I 16 OPT 1126.4508 10 0.011998 OA decomposition NLP0014I 17 OPT 1126.1179 10 0.012998 OA decomposition NLP0014I 18 OPT 1030.8057 8 0.009999 OA decomposition OA0003I New best feasible of 1030.8057 found after 0.931859 sec and NLP0014I 19 OPT 1091.6235 11 0.012998 OA decomposition NLP0014I 20 OPT 1340.7564 10 0.012999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 1562.7583 10 0.011998 OA decomposition NLP0014I 22 OPT 870.37863 12 0.014998 OA decomposition OA0003I New best feasible of 870.37863 found after 1.457779 sec and NLP0014I 23 OPT 860.96056 13 0.015998 OA decomposition OA0003I New best feasible of 860.96056 found after 1.831722 sec and NLP0014I 24 OPT 942.8012 14 0.016998 OA decomposition NLP0014I 25 OPT 968.14337 12 0.013998 OA decomposition NLP0014I 26 OPT 920.95733 12 0.014998 OA decomposition NLP0014I 27 OPT 966.7648 14 0.016997 OA decomposition NLP0014I 28 OPT 969.1765 12 0.014997 OA decomposition NLP0014I 29 OPT 897.76635 12 0.013997 OA decomposition NLP0014I 30 OPT 871.33304 12 0.013998 OA decomposition NLP0014I 31 OPT 913.94683 12 0.014998 OA decomposition NLP0014I 32 OPT 874.43918 11 0.013998 OA decomposition NLP0014I 33 OPT 1005.4002 13 0.015998 OA decomposition NLP0014I 34 OPT 943.5782 11 0.012998 OA decomposition NLP0014I 35 OPT 929.26489 12 0.013998 OA decomposition NLP0014I 36 OPT 930.19635 12 0.014998 OA decomposition NLP0014I 37 OPT 951.32504 11 0.013998 OA decomposition NLP0014I 38 OPT 932.30114 11 0.012998 OA decomposition NLP0014I 39 OPT 977.46343 12 0.014998 OA decomposition NLP0014I 40 OPT 973.9194 13 0.015997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 956.03911 13 0.015997 OA decomposition NLP0014I 42 OPT 916.37067 11 0.012998 OA decomposition NLP0014I 43 OPT 885.83491 11 0.013998 OA decomposition NLP0014I 44 OPT 1023.0312 12 0.012998 OA decomposition NLP0014I 45 OPT 993.17418 12 0.014998 OA decomposition NLP0014I 46 OPT 875.84964 11 0.013998 OA decomposition NLP0014I 47 OPT 882.87073 11 0.013998 OA decomposition NLP0014I 48 OPT 938.43688 12 0.013998 OA decomposition NLP0014I 49 OPT 943.68263 12 0.014997 OA decomposition NLP0014I 50 OPT 1037.6489 12 0.014998 OA decomposition NLP0014I 51 OPT 921.44992 12 0.014998 OA decomposition NLP0014I 52 OPT 935.37051 12 0.011998 OA decomposition NLP0014I 53 OPT 1000.0149 12 0.014998 OA decomposition NLP0014I 54 OPT 908.37308 12 0.014998 OA decomposition NLP0014I 55 OPT 971.09441 13 0.015998 OA decomposition NLP0014I 56 OPT 922.95822 12 0.014998 OA decomposition NLP0014I 57 OPT 1004.2775 12 0.013998 OA decomposition NLP0014I 58 OPT 889.92481 12 0.014998 OA decomposition NLP0014I 59 OPT 1001.975 11 0.013998 OA decomposition NLP0014I 60 OPT 1027.373 12 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 1060.5243 14 0.015997 OA decomposition NLP0014I 62 OPT 941.31239 12 0.014998 OA decomposition NLP0014I 63 OPT 986.00051 13 0.015998 OA decomposition NLP0014I 64 OPT 917.96589 12 0.014998 OA decomposition NLP0014I 65 OPT 967.23872 11 0.013998 OA decomposition NLP0014I 66 OPT 981.94007 11 0.012998 OA decomposition NLP0014I 67 OPT 964.61383 12 0.014998 OA decomposition NLP0014I 68 OPT 1037.8511 12 0.014998 OA decomposition NLP0014I 69 OPT 966.99562 9 0.010999 OA decomposition NLP0014I 70 OPT 961.89873 12 0.014997 OA decomposition NLP0014I 71 OPT 958.57481 11 0.013998 OA decomposition NLP0014I 72 OPT 1021.6134 12 0.014997 OA decomposition NLP0014I 73 OPT 1029.6079 12 0.014998 OA decomposition NLP0014I 74 OPT 968.57873 12 0.014997 OA decomposition NLP0014I 75 OPT 996.29153 9 0.010998 OA decomposition NLP0014I 76 OPT 932.95398 11 0.011998 OA decomposition NLP0014I 77 OPT 976.48292 12 0.014997 OA decomposition NLP0014I 78 OPT 1084.9949 8 0.008999 OA decomposition NLP0014I 79 OPT 1012.2514 12 0.013998 OA decomposition NLP0014I 80 OPT 967.11302 12 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT 1084.6852 8 0.010998 OA decomposition NLP0014I 82 OPT 907.78645 12 0.014998 OA decomposition NLP0014I 83 OPT 950.32365 12 0.013998 OA decomposition NLP0014I 84 OPT 951.72543 12 0.014998 OA decomposition NLP0014I 85 OPT 1004.3792 11 0.012998 OA decomposition NLP0014I 86 OPT 955.27597 11 0.012998 OA decomposition NLP0014I 87 OPT 1033.6014 11 0.012998 OA decomposition NLP0014I 88 OPT 906.15544 9 0.011998 OA decomposition NLP0014I 89 OPT 1029.0399 12 0.013998 OA decomposition NLP0014I 90 OPT 1014.607 11 0.012998 OA decomposition NLP0014I 91 OPT 1082.9182 12 0.014997 OA decomposition NLP0014I 92 OPT 1004.4938 12 0.014997 OA decomposition NLP0014I 93 OPT 978.89631 14 0.016998 OA decomposition NLP0014I 94 OPT 988.0447 12 0.013998 OA decomposition NLP0014I 95 OPT 985.50468 11 0.012998 OA decomposition NLP0014I 96 OPT 1108.4779 8 0.010999 OA decomposition NLP0014I 97 OPT 993.1902 11 0.012998 OA decomposition NLP0014I 98 OPT 991.73621 12 0.013998 OA decomposition NLP0014I 99 OPT 990.99512 11 0.013998 OA decomposition NLP0014I 100 OPT 972.57976 12 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT 1111.9148 13 0.015998 OA decomposition NLP0014I 102 OPT 1117.1021 13 0.015997 OA decomposition NLP0014I 103 OPT 1133.9472 12 0.014997 OA decomposition NLP0014I 104 OPT 1031.534 12 0.014998 OA decomposition NLP0014I 105 OPT 930.22525 11 0.013998 OA decomposition NLP0014I 106 OPT 990.77396 12 0.014997 OA decomposition NLP0014I 107 OPT 1070.4708 12 0.014998 OA decomposition NLP0014I 108 OPT 1060.6916 11 0.012998 OA decomposition NLP0014I 109 OPT 938.96477 11 0.013998 OA decomposition NLP0014I 110 OPT 972.3367 11 0.013998 OA decomposition NLP0014I 111 OPT 998.46484 11 0.013998 OA decomposition NLP0014I 112 OPT 974.57687 11 0.011999 OA decomposition NLP0014I 113 OPT 1059.1011 11 0.013998 OA decomposition NLP0014I 114 OPT 969.28045 12 0.014997 OA decomposition NLP0014I 115 OPT 1043.3952 11 0.013998 OA decomposition NLP0014I 116 OPT 990.92777 11 0.013998 OA decomposition NLP0014I 117 OPT 970.16513 11 0.013998 OA decomposition NLP0014I 118 OPT 1021.6485 11 0.012998 OA decomposition NLP0014I 119 OPT 1062.1914 11 0.012998 OA decomposition NLP0014I 120 OPT 1071.2686 13 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 121 OPT 1018.1855 11 0.013998 OA decomposition NLP0014I 122 OPT 1179.189 12 0.014998 OA decomposition NLP0014I 123 OPT 964.50536 11 0.012998 OA decomposition NLP0014I 124 OPT 1123.7472 12 0.014998 OA decomposition NLP0014I 125 OPT 959.61007 11 0.013998 OA decomposition NLP0014I 126 OPT 1178.83 12 0.014997 OA decomposition NLP0014I 127 OPT 974.05119 11 0.012998 OA decomposition OA0012I After 101.35459.1f seconds, 127 iterations upper bound 860.951950g, lower bound 598.218950g NLP0014I 128 OPT 1135.314 13 0.015998 OA decomposition NLP0014I 129 OPT 983.05953 11 0.012998 OA decomposition NLP0014I 130 OPT 1180.0816 12 0.014998 OA decomposition NLP0014I 131 OPT 949.01155 11 0.013998 OA decomposition NLP0014I 132 OPT 1060.8143 13 0.014998 OA decomposition NLP0014I 133 OPT 978.40815 8 0.010998 OA decomposition NLP0014I 134 OPT 1060.53 12 0.014998 OA decomposition NLP0014I 135 OPT 1036.4497 11 0.012998 OA decomposition NLP0014I 136 OPT 1149.2553 13 0.015998 OA decomposition NLP0014I 137 OPT 1099.5368 11 0.012998 OA decomposition NLP0014I 138 OPT 1022.2937 11 0.012998 OA decomposition NLP0014I 139 OPT 1155.6779 12 0.013998 OA decomposition NLP0014I 140 OPT 1014.0157 12 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 141 OPT 1039.7485 11 0.013998 OA decomposition NLP0014I 142 OPT 1171.7246 12 0.014997 OA decomposition NLP0014I 143 OPT 1037.1448 12 0.014998 OA decomposition NLP0014I 144 OPT 1161.6307 12 0.014998 OA decomposition NLP0014I 145 OPT 1110.4624 12 0.014998 OA decomposition NLP0014I 146 OPT 1099.7196 12 0.014998 OA decomposition NLP0014I 147 OPT 980.86843 11 0.013998 OA decomposition NLP0014I 148 OPT 1106.7015 12 0.013998 OA decomposition NLP0014I 149 OPT 1065.6618 12 0.014998 OA decomposition NLP0014I 150 OPT 983.35217 8 0.008999 OA decomposition NLP0014I 151 OPT 1001.257 10 0.012998 OA decomposition NLP0014I 152 OPT 1071.8603 13 0.015998 OA decomposition NLP0014I 153 OPT 1046.4799 11 0.012998 OA decomposition NLP0014I 154 OPT 1102.2144 12 0.014998 OA decomposition NLP0014I 155 OPT 1045.8002 11 0.012998 OA decomposition NLP0014I 156 OPT 1190.2461 12 0.014998 OA decomposition NLP0014I 157 OPT 1059.0914 11 0.013998 OA decomposition NLP0014I 158 OPT 1129.5793 11 0.012998 OA decomposition NLP0014I 159 OPT 1123.2738 11 0.012998 OA decomposition NLP0014I 160 OPT 1060.0079 11 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 161 OPT 1047.0454 11 0.012998 OA decomposition NLP0014I 162 OPT 1115.2765 12 0.014998 OA decomposition NLP0014I 163 OPT 1073.5193 12 0.014997 OA decomposition NLP0014I 164 OPT 1155.3801 12 0.014998 OA decomposition NLP0014I 165 OPT 1120.9194 12 0.014998 OA decomposition NLP0014I 166 OPT 1225.4094 12 0.014998 OA decomposition NLP0014I 167 OPT 1046.0147 12 0.014997 OA decomposition NLP0014I 168 OPT 1073.6722 12 0.014998 OA decomposition NLP0014I 169 OPT 1015.2071 11 0.013997 OA decomposition NLP0014I 170 OPT 1026.606 10 0.012998 OA decomposition NLP0014I 171 OPT 1089.3764 12 0.014998 OA decomposition NLP0014I 172 OPT 1125.1813 12 0.014998 OA decomposition NLP0014I 173 OPT 1097.5194 12 0.014998 OA decomposition NLP0014I 174 OPT 1067.5408 11 0.012998 OA decomposition NLP0014I 175 OPT 1179.341 11 0.013998 OA decomposition NLP0014I 176 OPT 1190.4329 12 0.014997 OA decomposition NLP0014I 177 OPT 1075.9765 10 0.011998 OA decomposition NLP0014I 178 OPT 1032.2967 11 0.013998 OA decomposition NLP0014I 179 OPT 1097.2212 11 0.012998 OA decomposition NLP0014I 180 OPT 1173.9608 10 0.012998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 181 OPT 1116.4446 12 0.014998 OA decomposition NLP0014I 182 OPT 1026.1817 10 0.012998 OA decomposition NLP0014I 183 OPT 1204.0252 12 0.014998 OA decomposition NLP0014I 184 OPT 1051.3694 10 0.012998 OA decomposition NLP0014I 185 OPT 1072.6167 12 0.014998 OA decomposition NLP0014I 186 OPT 1116.681 12 0.014997 OA decomposition NLP0014I 187 OPT 1074.0782 10 0.012998 OA decomposition NLP0014I 188 OPT 1158.3666 12 0.014998 OA decomposition NLP0014I 189 OPT 1033.4786 10 0.011998 OA decomposition NLP0014I 190 OPT 1137.9563 12 0.013998 OA decomposition NLP0014I 191 OPT 914.818 11 0.012998 OA decomposition NLP0014I 192 OPT 1072.8762 11 0.013998 OA decomposition NLP0014I 193 OPT 1157.6465 12 0.013998 OA decomposition NLP0014I 194 OPT 1268.4165 13 0.014997 OA decomposition NLP0014I 195 OPT 1071.9896 11 0.013997 OA decomposition NLP0014I 196 OPT 1144.9141 12 0.014997 OA decomposition NLP0014I 197 OPT 1142.7892 10 0.012998 OA decomposition OA0012I After 203.32109.1f seconds, 197 iterations upper bound 860.951950g, lower bound 684.55490g NLP0014I 198 OPT 1131.4147 12 0.014997 OA decomposition NLP0014I 199 OPT 1098.2089 12 0.014998 OA decomposition NLP0014I 200 OPT 1169.2928 11 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 201 OPT 1104.0278 12 0.014998 OA decomposition NLP0014I 202 OPT 934.72644 13 0.014998 OA decomposition NLP0014I 203 OPT 1187.1223 12 0.013997 OA decomposition NLP0014I 204 OPT 952.7519 11 0.013998 OA decomposition NLP0014I 205 OPT 977.1776 12 0.014997 OA decomposition NLP0014I 206 OPT 1171.0332 11 0.013998 OA decomposition NLP0014I 207 OPT 1285.404 9 0.011999 OA decomposition NLP0014I 208 OPT 1174.5457 12 0.014998 OA decomposition NLP0014I 209 OPT 1124.4753 11 0.013998 OA decomposition NLP0014I 210 OPT 946.62582 11 0.013998 OA decomposition NLP0014I 211 OPT 932.69066 11 0.013998 OA decomposition NLP0014I 212 OPT 1324.7341 12 0.014998 OA decomposition NLP0014I 213 OPT 1165.7933 10 0.010998 OA decomposition NLP0014I 214 OPT 958.93497 11 0.012998 OA decomposition NLP0014I 215 OPT 968.66326 11 0.013997 OA decomposition NLP0014I 216 OPT 949.95884 11 0.012998 OA decomposition NLP0014I 217 OPT 964.28649 11 0.012998 OA decomposition NLP0014I 218 OPT 968.55293 11 0.013998 OA decomposition NLP0014I 219 OPT 964.74262 9 0.010998 OA decomposition NLP0014I 220 OPT 1317.6775 12 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 221 OPT 937.81538 11 0.013998 OA decomposition NLP0014I 222 OPT 980.90878 11 0.013998 OA decomposition NLP0014I 223 OPT 1203.5367 12 0.013997 OA decomposition NLP0014I 224 OPT 959.68021 11 0.012998 OA decomposition NLP0014I 225 OPT 985.04064 11 0.012998 OA decomposition NLP0014I 226 OPT 1001.8186 12 0.014998 OA decomposition NLP0014I 227 OPT 1157.186 12 0.013998 OA decomposition NLP0014I 228 OPT 964.41804 11 0.012998 OA decomposition NLP0014I 229 OPT 1223.6777 12 0.013998 OA decomposition NLP0014I 230 OPT 1007.1316 13 0.014998 OA decomposition NLP0014I 231 OPT 987.86039 11 0.013998 OA decomposition NLP0014I 232 OPT 1016.9489 11 0.012998 OA decomposition NLP0014I 233 OPT 1011.1739 12 0.014997 OA decomposition NLP0014I 234 OPT 986.12355 11 0.013998 OA decomposition NLP0014I 235 OPT 961.30177 11 0.013998 OA decomposition NLP0014I 236 OPT 978.38912 11 0.013997 OA decomposition NLP0014I 237 OPT 985.14735 11 0.011998 OA decomposition NLP0014I 238 OPT 1017.3271 11 0.013998 OA decomposition OA0012I After 304.74167.1f seconds, 238 iterations upper bound 860.951950g, lower bound 773.61260g NLP0014I 239 OPT 969.97647 11 0.013998 OA decomposition NLP0014I 240 OPT 965.55524 11 0.011998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 241 OPT 991.19301 11 0.013998 OA decomposition NLP0014I 242 OPT 988.32131 11 0.013997 OA decomposition NLP0014I 243 OPT 1003.0305 12 0.013998 OA decomposition NLP0014I 244 OPT 989.17656 11 0.013998 OA decomposition NLP0014I 245 OPT 1018.2911 11 0.012998 OA decomposition NLP0014I 246 OPT 1004.0671 13 0.013998 OA decomposition NLP0014I 247 OPT 996.28295 11 0.012998 OA decomposition NLP0014I 248 OPT 995.87351 11 0.013997 OA decomposition NLP0014I 249 OPT 992.78686 11 0.012998 OA decomposition NLP0014I 250 OPT 996.84212 13 0.015997 OA decomposition NLP0014I 251 OPT 989.95249 8 0.009999 OA decomposition NLP0014I 252 OPT 985.29867 11 0.013998 OA decomposition NLP0014I 253 OPT 1023.2535 11 0.013998 OA decomposition NLP0014I 254 OPT 1025.1612 11 0.013998 OA decomposition NLP0014I 255 OPT 982.91085 11 0.013997 OA decomposition NLP0014I 256 OPT 1005.3836 11 0.013998 OA decomposition NLP0014I 257 OPT 1001.5488 11 0.013998 OA decomposition NLP0014I 258 OPT 981.43597 11 0.013998 OA decomposition NLP0014I 259 OPT 1002.7639 11 0.012998 OA decomposition NLP0014I 260 OPT 1016.0921 12 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 261 OPT 990.20186 11 0.012998 OA decomposition NLP0014I 262 OPT 1025.4067 9 0.010998 OA decomposition NLP0014I 263 OPT 997.58609 11 0.013998 OA decomposition NLP0014I 264 OPT 1028.1276 9 0.011998 OA decomposition NLP0014I 265 OPT 1015.0248 11 0.012998 OA decomposition NLP0014I 266 OPT 1021.7389 13 0.014998 OA decomposition OA0012I After 407.61503.1f seconds, 266 iterations upper bound 860.951950g, lower bound 802.77880g NLP0014I 267 OPT 1019.6111 11 0.013998 OA decomposition NLP0014I 268 OPT 1002.4071 11 0.012998 OA decomposition NLP0014I 269 OPT 976.60885 11 0.012998 OA decomposition NLP0014I 270 OPT 1017.3453 11 0.012998 OA decomposition NLP0014I 271 OPT 993.62389 11 0.013998 OA decomposition NLP0014I 272 OPT 1003.8803 11 0.011998 OA decomposition NLP0014I 273 OPT 994.94707 11 0.013998 OA decomposition NLP0014I 274 OPT 1022.2586 9 0.010999 OA decomposition NLP0014I 275 OPT 1042.7554 11 0.012998 OA decomposition NLP0014I 276 OPT 996.37516 11 0.011998 OA decomposition NLP0014I 277 OPT 1023.2637 8 0.009999 OA decomposition NLP0014I 278 OPT 1003.2667 11 0.012998 OA decomposition NLP0014I 279 OPT 1023.8734 8 0.009999 OA decomposition NLP0014I 280 OPT 1007.7718 11 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 281 OPT 1006.7938 11 0.013998 OA decomposition NLP0014I 282 OPT 1027.1242 11 0.013998 OA decomposition NLP0014I 283 OPT 1024.0231 8 0.010999 OA decomposition NLP0014I 284 OPT 1018.9771 11 0.013998 OA decomposition NLP0014I 285 OPT 1009.8704 11 0.013998 OA decomposition NLP0014I 286 OPT 1030.4797 13 0.015998 OA decomposition NLP0014I 287 OPT 1022.3149 11 0.013998 OA decomposition NLP0014I 288 OPT 1024.952 11 0.013997 OA decomposition NLP0014I 289 OPT 1031.472 11 0.012998 OA decomposition OA0012I After 509.53754.1f seconds, 289 iterations upper bound 860.951950g, lower bound 818.557390g NLP0014I 290 OPT 1050.4925 11 0.012998 OA decomposition NLP0014I 291 OPT 997.9363 11 0.013998 OA decomposition NLP0014I 292 OPT 1046.4752 11 0.012998 OA decomposition NLP0014I 293 OPT 1022.427 11 0.013998 OA decomposition NLP0014I 294 OPT 1026.368 11 0.012998 OA decomposition NLP0014I 295 OPT 1035.519 11 0.013998 OA decomposition NLP0014I 296 OPT 1021.1238 8 0.009998 OA decomposition NLP0014I 297 OPT 1046.7134 11 0.011998 OA decomposition NLP0014I 298 OPT 1003.256 11 0.013998 OA decomposition NLP0014I 299 OPT 1052.4475 11 0.013998 OA decomposition NLP0014I 300 OPT 1013.7187 11 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 301 OPT 1004.3623 11 0.011998 OA decomposition NLP0014I 302 OPT 998.1588 11 0.013998 OA decomposition NLP0014I 303 OPT 1022.5997 11 0.012998 OA decomposition NLP0014I 304 OPT 1021.0721 11 0.013998 OA decomposition NLP0014I 305 OPT 1013.223 11 0.013998 OA decomposition NLP0014I 306 OPT 1032.1876 11 0.012998 OA decomposition NLP0014I 307 OPT 1055.7041 9 0.010999 OA decomposition NLP0014I 308 OPT 1011.5759 11 0.013998 OA decomposition NLP0014I 309 OPT 1013.6936 11 0.013998 OA decomposition NLP0014I 310 OPT 1038.093 13 0.015997 OA decomposition OA0012I After 614.35161.1f seconds, 310 iterations upper bound 860.951950g, lower bound 826.983430g NLP0014I 311 OPT 1045.9267 11 0.012998 OA decomposition NLP0014I 312 OPT 1024.673 11 0.013998 OA decomposition NLP0014I 313 OPT 1034.5586 11 0.013998 OA decomposition NLP0014I 314 OPT 1052.5913 11 0.011998 OA decomposition NLP0014I 315 OPT 1034.9242 11 0.013998 OA decomposition NLP0014I 316 OPT 1057.633 11 0.012998 OA decomposition NLP0014I 317 OPT 990.58644 11 0.012998 OA decomposition NLP0014I 318 OPT 1035.0595 11 0.013998 OA decomposition NLP0014I 319 OPT 1006.8835 10 0.012998 OA decomposition NLP0014I 320 OPT 1030.6027 11 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 321 OPT 1047.768 11 0.013997 OA decomposition NLP0014I 322 OPT 1048.5886 11 0.013998 OA decomposition NLP0014I 323 OPT 1068.1666 11 0.013998 OA decomposition NLP0014I 324 OPT 997.76577 11 0.013998 OA decomposition NLP0014I 325 OPT 1046.1742 11 0.012998 OA decomposition NLP0014I 326 OPT 1025.1185 8 0.010998 OA decomposition NLP0014I 327 OPT 1041.4226 11 0.013997 OA decomposition NLP0014I 328 OPT 1042.8111 11 0.011998 OA decomposition NLP0014I 329 OPT 1039.6384 11 0.013998 OA decomposition OA0012I After 717.91786.1f seconds, 329 iterations upper bound 860.951950g, lower bound 834.898030g NLP0014I 330 OPT 1064.812 11 0.013998 OA decomposition NLP0014I 331 OPT 1025.54 11 0.012999 OA decomposition NLP0014I 332 OPT 1050.4484 9 0.010998 OA decomposition NLP0014I 333 OPT 1025.9803 11 0.013998 OA decomposition NLP0014I 334 OPT 1032.0228 11 0.013998 OA decomposition NLP0014I 335 OPT 1051.0338 8 0.010998 OA decomposition NLP0014I 336 OPT 1034.3049 8 0.010999 OA decomposition NLP0014I 337 OPT 1084.9503 12 0.014998 OA decomposition NLP0014I 338 OPT 1041.3818 11 0.011998 OA decomposition NLP0014I 339 OPT 1041.8449 11 0.013998 OA decomposition NLP0014I 340 OPT 1042.3333 11 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 341 OPT 1075.2392 11 0.013998 OA decomposition NLP0014I 342 OPT 1053.0517 8 0.010998 OA decomposition NLP0014I 343 OPT 1024.4719 11 0.013997 OA decomposition NLP0014I 344 OPT 1041.8111 11 0.012998 OA decomposition NLP0014I 345 OPT 1027.7179 11 0.011998 OA decomposition NLP0014I 346 OPT 1029.2129 8 0.009999 OA decomposition NLP0014I 347 OPT 1026.7403 11 0.013998 OA decomposition OA0012I After 823.5528.1f seconds, 347 iterations upper bound 860.951950g, lower bound 843.041110g NLP0014I 348 OPT 1055.7888 11 0.013998 OA decomposition NLP0014I 349 OPT 1036.0246 11 0.013997 OA decomposition NLP0014I 350 OPT 1029.4618 11 0.013998 OA decomposition NLP0014I 351 OPT 1064.9486 11 0.013998 OA decomposition NLP0014I 352 OPT 1046.3778 11 0.012998 OA decomposition NLP0014I 353 OPT 1054.8461 9 0.011999 OA decomposition NLP0014I 354 OPT 1021.1244 11 0.013998 OA decomposition NLP0014I 355 OPT 1033.002 11 0.011998 OA decomposition NLP0014I 356 OPT 1040.1444 11 0.011999 OA decomposition NLP0014I 357 OPT 1055.0305 11 0.013998 OA decomposition NLP0014I 358 OPT 1028.0913 11 0.013998 OA decomposition NLP0014I 359 OPT 1050.0791 11 0.013998 OA decomposition NLP0014I 360 OPT 1073.1872 12 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 361 OPT 1048.261 11 0.012998 OA decomposition NLP0014I 362 OPT 1038.536 11 0.013998 OA decomposition NLP0014I 363 OPT 1052.435 8 0.010998 OA decomposition NLP0014I 364 OPT 1064.6785 12 0.014998 OA decomposition OA0012I After 925.79126.1f seconds, 364 iterations upper bound 860.951950g, lower bound 850.651370g NLP0014I 365 OPT 1054.9453 8 0.010998 OA decomposition NLP0014I 366 OPT 1051.0831 8 0.010999 OA decomposition NLP0014I 367 OPT 1029.3135 11 0.013998 OA decomposition NLP0014I 368 OPT 1075.4918 10 0.011999 OA decomposition NLP0014I 369 OPT 1088.3542 10 0.012998 OA decomposition NLP0014I 370 OPT 1055.1065 11 0.012998 OA decomposition NLP0014I 371 OPT 1050.9395 11 0.012998 OA decomposition NLP0014I 372 OPT 1052.5203 9 0.010999 OA decomposition NLP0014I 373 OPT 1044.0331 11 0.012998 OA decomposition NLP0014I 374 OPT 1042.8809 11 0.013998 OA decomposition NLP0014I 375 OPT 1059.8666 11 0.013998 OA decomposition NLP0014I 376 OPT 1052.3614 8 0.009999 OA decomposition NLP0014I 377 OPT 1049.5469 11 0.013997 OA decomposition NLP0014I 378 OPT 1075.1141 11 0.012998 OA decomposition NLP0014I 379 OPT 1061.3161 11 0.013998 OA decomposition NLP0014I 380 OPT 1063.1843 11 0.013998 OA decomposition OA0012I After 1030.8303.1f seconds, 380 iterations upper bound 860.951950g, lower bound 856.079810g NLP0012I Num Status Obj It time Location NLP0014I 381 OPT 1076.2974 11 0.013998 OA decomposition NLP0014I 382 OPT 1052.159 11 0.013998 OA decomposition NLP0014I 383 OPT 1052.0681 11 0.013998 OA decomposition NLP0014I 384 OPT 1083.3676 11 0.012998 OA decomposition NLP0014I 385 OPT 1030.4817 10 0.011998 OA decomposition NLP0014I 386 OPT 1055.1879 11 0.012998 OA decomposition NLP0014I 387 OPT 1060.1537 11 0.013997 OA decomposition NLP0014I 388 OPT 1071.674 11 0.011998 OA decomposition NLP0014I 389 OPT 1064.6933 11 0.013998 OA decomposition NLP0014I 390 OPT 1062.652 11 0.013998 OA decomposition NLP0014I 391 OPT 1065.5647 11 0.013997 OA decomposition NLP0014I 392 OPT 1069.0003 11 0.013998 OA decomposition NLP0014I 393 OPT 1050.8584 10 0.011998 OA decomposition NLP0014I 394 OPT 1041.0844 11 0.013998 OA decomposition NLP0014I 395 OPT 1077.609 11 0.012998 OA decomposition OA0008I OA converged in 1135.4044 seconds found solution of value 860.96056 (lower bound 1e+50 ). OA0010I Performed 394 iterations, explored 335698 branch-and-bound nodes in total Cbc0012I Integer solution of 860.96056 found by nonlinear programm after 17 iterations and 0 nodes (1135.40 seconds) Cbc0031I 10 added rows had average density of 118 Cbc0013I At root node, 10 cuts changed objective from 325.88579 to 325.88579 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 71 row cuts average 132.1 elements, 0 column cuts (10 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 860.9605640505335, took 17 iterations and 0 nodes (1135.40 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 71 cuts of which 10 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 860.961. Best solution: 8.609606e+02 (0 nodes, 1138.98 seconds) Best possible: 8.609606e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- uflquad-20-40.gms(2309) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job uflquad-20-40.gms Stop 09/08/12 20:18:04 elapsed 0:18:59.145 @04 1347128284 ----------------------------- Sa 8. Sep 20:18:04 CEST 2012 ----------------------------- =ready= Linux opt208 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/UncapacitatedFacilityLocation/gms/uflquad-20-50.gms =========== ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- @03 1347127145 --- Job uflquad-20-50.gms Start 09/08/12 19:59:05 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- uflquad-20-50.gms(2878) 2 Mb --- Starting execution: elapsed 0:00:00.014 --- uflquad-20-50.gms(2877) 3 Mb --- Generating MIQCP model m --- uflquad-20-50.gms(2878) 6 Mb --- 1,051 rows 1,021 columns 4,021 non-zeroes --- 4,002 nl-code 1,000 nl-non-zeroes --- 20 discrete-columns --- uflquad-20-50.gms(2878) 3 Mb --- Executing BONMIN: elapsed 0:00:00.019 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1000 Number of nonzeros in inequality constraint Jacobian.: 2000 Number of nonzeros in Lagrangian Hessian.............: 1000 Total number of variables............................: 1020 variables with only lower bounds: 1000 variables with lower and upper bounds: 20 variables with only upper bounds: 0 Total number of equality constraints.................: 50 Total number of inequality constraints...............: 1000 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1000 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.4095233e+01 8.00e-01 1.76e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.8281068e+01 4.74e-01 1.84e+00 -2.2 5.45e-02 - 1.71e-01 4.08e-01h 1 2 7.4462106e+01 2.76e-01 1.12e+00 -2.6 4.91e-02 - 5.27e-01 4.18e-01h 1 3 1.0586155e+02 7.77e-02 3.07e-01 -3.5 2.96e-02 - 6.49e-01 7.18e-01h 1 4 1.1713701e+02 1.47e-02 6.30e-02 -4.4 1.08e-02 - 7.42e-01 8.11e-01h 1 5 1.1937544e+02 2.31e-03 9.12e-03 -5.3 3.45e-03 - 8.91e-01 8.43e-01h 1 6 1.1971772e+02 3.32e-04 9.04e-03 -6.8 1.84e-03 - 9.43e-01 8.56e-01h 1 7 1.1976658e+02 3.32e-05 3.52e-03 -7.6 8.90e-04 - 9.55e-01 9.00e-01h 1 8 1.1977116e+02 2.09e-06 1.26e-03 -8.6 4.26e-04 - 9.81e-01 9.37e-01h 1 9 1.1977137e+02 5.49e-08 2.43e-04 -9.6 2.02e-04 - 9.90e-01 9.74e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.1977136e+02 4.33e-10 2.20e-05 -10.4 9.63e-05 - 9.95e-01 9.92e-01h 1 11 1.1977135e+02 1.04e-12 1.19e-05 -11.0 4.74e-05 - 9.94e-01 9.98e-01h 1 12 1.1977135e+02 6.66e-16 3.41e-07 -11.0 2.34e-05 - 1.00e+00 1.00e+00h 1 13 1.1977135e+02 4.44e-16 2.73e-14 -11.0 1.18e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 1.1977135259934818e+02 1.1977135259934818e+02 Dual infeasibility......: 2.7345339791618275e-14 2.7345339791618275e-14 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Complementarity.........: 8.3588318494115842e-09 8.3588318494115842e-09 Overall NLP error.......: 8.3588318494115842e-09 8.3588318494115842e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 Number of equality constraint Jacobian evaluations = 14 Number of inequality constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.040 Total CPU secs in NLP function evaluations = 0.010 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 119.77135 13 0.049992 build initial OA NLP0014I 2 OPT 1202.7997 10 0.032995 OA decomposition OA0003I New best feasible of 1202.7997 found after 0.098985 sec and NLP0014I 3 OPT 1304.547 10 0.030995 OA decomposition NLP0014I 4 OPT 1210.2726 10 0.031995 OA decomposition NLP0014I 5 OPT 1348.296 10 0.030995 OA decomposition NLP0014I 6 OPT 1541.9087 11 0.033995 OA decomposition NLP0014I 7 OPT 627.47977 13 0.040994 OA decomposition OA0003I New best feasible of 627.47977 found after 0.543917 sec and NLP0014I 8 OPT 649.7426 12 0.037994 OA decomposition NLP0014I 9 OPT 620.75892 11 0.033995 OA decomposition OA0003I New best feasible of 620.75892 found after 0.85487 sec and NLP0014I 10 OPT 1219.8523 10 0.013997 OA decomposition NLP0014I 11 OPT 1499.7044 10 0.014997 OA decomposition NLP0014I 12 OPT 1425.4223 10 0.014998 OA decomposition NLP0014I 13 OPT 1482.5878 10 0.014997 OA decomposition NLP0014I 14 OPT 1472.2664 10 0.014998 OA decomposition NLP0014I 15 OPT 1279.5414 10 0.014998 OA decomposition NLP0014I 16 OPT 1498.8488 10 0.013998 OA decomposition NLP0014I 17 OPT 1431.543 10 0.013998 OA decomposition NLP0014I 18 OPT 1442.4703 10 0.014997 OA decomposition NLP0014I 19 OPT 1468.8155 10 0.014998 OA decomposition NLP0014I 20 OPT 1284.6143 10 0.013997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 1822.3814 10 0.014998 OA decomposition NLP0014I 22 OPT 1090.6325 10 0.014998 OA decomposition NLP0014I 23 OPT 1129.3613 10 0.014998 OA decomposition NLP0014I 24 OPT 610.14757 13 0.018997 OA decomposition OA0003I New best feasible of 610.14757 found after 1.619753 sec and NLP0014I 25 OPT 588.93711 11 0.015998 OA decomposition OA0003I New best feasible of 588.93711 found after 1.806725 sec and NLP0014I 26 OPT 606.44506 12 0.017997 OA decomposition NLP0014I 27 OPT 590.07875 13 0.017997 OA decomposition NLP0014I 28 OPT 647.07007 16 0.023996 OA decomposition NLP0014I 29 OPT 623.22494 13 0.018997 OA decomposition NLP0014I 30 OPT 660.84356 13 0.018997 OA decomposition NLP0014I 31 OPT 578.92113 12 0.016997 OA decomposition OA0003I New best feasible of 578.92113 found after 3.87841 sec and NLP0014I 32 OPT 732.62131 14 0.019997 OA decomposition NLP0014I 33 OPT 633.70624 10 0.015997 OA decomposition NLP0014I 34 OPT 775.366 13 0.018997 OA decomposition NLP0014I 35 OPT 599.23817 13 0.018997 OA decomposition NLP0014I 36 OPT 614.41395 15 0.021996 OA decomposition NLP0014I 37 OPT 594.56429 13 0.019997 OA decomposition NLP0014I 38 OPT 625.97799 12 0.015998 OA decomposition NLP0014I 39 OPT 738.0851 13 0.018997 OA decomposition NLP0014I 40 OPT 683.62169 11 0.016997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 639.03465 11 0.015998 OA decomposition NLP0014I 42 OPT 675.75848 11 0.015998 OA decomposition NLP0014I 43 OPT 653.8126 13 0.018998 OA decomposition NLP0014I 44 OPT 664.04768 13 0.018997 OA decomposition NLP0014I 45 OPT 634.1411 13 0.018998 OA decomposition NLP0014I 46 OPT 637.69271 11 0.014998 OA decomposition NLP0014I 47 OPT 698.9894 13 0.018997 OA decomposition NLP0014I 48 OPT 744.44273 13 0.018997 OA decomposition NLP0014I 49 OPT 699.1721 13 0.017998 OA decomposition NLP0014I 50 OPT 644.0419 11 0.016998 OA decomposition NLP0014I 51 OPT 649.61688 15 0.020997 OA decomposition NLP0014I 52 OPT 620.8435 13 0.016997 OA decomposition NLP0014I 53 OPT 631.59334 13 0.017997 OA decomposition NLP0014I 54 OPT 685.54446 15 0.019997 OA decomposition NLP0014I 55 OPT 656.99838 13 0.018997 OA decomposition NLP0014I 56 OPT 650.80931 12 0.016997 OA decomposition NLP0014I 57 OPT 727.85769 13 0.018997 OA decomposition NLP0014I 58 OPT 628.42977 13 0.017997 OA decomposition NLP0014I 59 OPT 608.18504 9 0.013998 OA decomposition NLP0014I 60 OPT 665.18609 10 0.014997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 600.93991 10 0.014998 OA decomposition NLP0014I 62 OPT 773.21108 11 0.016998 OA decomposition NLP0014I 63 OPT 663.87074 13 0.018998 OA decomposition NLP0014I 64 OPT 711.10218 11 0.015997 OA decomposition NLP0014I 65 OPT 699.18931 10 0.014998 OA decomposition NLP0014I 66 OPT 757.92505 13 0.018997 OA decomposition NLP0014I 67 OPT 735.66607 10 0.014998 OA decomposition NLP0014I 68 OPT 638.11905 13 0.018997 OA decomposition NLP0014I 69 OPT 714.68181 13 0.018998 OA decomposition NLP0014I 70 OPT 753.14789 11 0.015997 OA decomposition NLP0014I 71 OPT 682.95176 11 0.015997 OA decomposition NLP0014I 72 OPT 707.40526 11 0.016998 OA decomposition NLP0014I 73 OPT 607.51021 13 0.018997 OA decomposition NLP0014I 74 OPT 728.10103 13 0.017997 OA decomposition NLP0014I 75 OPT 704.58725 11 0.014998 OA decomposition NLP0014I 76 OPT 736.71786 13 0.018997 OA decomposition NLP0014I 77 OPT 761.76313 15 0.021996 OA decomposition NLP0014I 78 OPT 727.35489 13 0.018997 OA decomposition NLP0014I 79 OPT 728.57053 13 0.018997 OA decomposition NLP0014I 80 OPT 681.61753 13 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT 790.40787 13 0.017997 OA decomposition NLP0014I 82 OPT 705.83921 11 0.015998 OA decomposition NLP0014I 83 OPT 637.05965 11 0.015998 OA decomposition NLP0014I 84 OPT 650.42466 10 0.014997 OA decomposition NLP0014I 85 OPT 616.77815 10 0.015997 OA decomposition NLP0014I 86 OPT 676.45701 11 0.013998 OA decomposition NLP0014I 87 OPT 607.57101 12 0.016997 OA decomposition NLP0014I 88 OPT 661.19498 12 0.017997 OA decomposition NLP0014I 89 OPT 623.44634 13 0.018997 OA decomposition NLP0014I 90 OPT 665.81823 13 0.017997 OA decomposition NLP0014I 91 OPT 699.28868 12 0.017997 OA decomposition NLP0014I 92 OPT 775.46882 11 0.015997 OA decomposition NLP0014I 93 OPT 637.46888 15 0.020997 OA decomposition NLP0014I 94 OPT 641.16082 13 0.018998 OA decomposition NLP0014I 95 OPT 632.5454 12 0.017997 OA decomposition NLP0014I 96 OPT 619.69942 13 0.019997 OA decomposition NLP0014I 97 OPT 692.98571 13 0.018997 OA decomposition NLP0014I 98 OPT 679.02069 12 0.017997 OA decomposition NLP0014I 99 OPT 659.0474 11 0.016997 OA decomposition OA0012I After 100.21077.1f seconds, 99 iterations upper bound 578.915340g, lower bound 146.049960g NLP0014I 100 OPT 698.19127 13 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT 708.42294 13 0.018997 OA decomposition NLP0014I 102 OPT 645.47549 11 0.015998 OA decomposition NLP0014I 103 OPT 712.96104 13 0.018997 OA decomposition NLP0014I 104 OPT 773.11271 13 0.018997 OA decomposition NLP0014I 105 OPT 499.28658 14 0.018997 OA decomposition OA0003I New best feasible of 499.28658 found after 115.87038 sec and NLP0014I 106 OPT 722.70598 13 0.018997 OA decomposition NLP0014I 107 OPT 668.9808 13 0.019997 OA decomposition NLP0014I 108 OPT 717.44285 13 0.018997 OA decomposition NLP0014I 109 OPT 673.97629 15 0.020997 OA decomposition NLP0014I 110 OPT 797.75387 13 0.016998 OA decomposition NLP0014I 111 OPT 679.90691 13 0.017998 OA decomposition NLP0014I 112 OPT 655.69313 13 0.018997 OA decomposition NLP0014I 113 OPT 692.68885 15 0.020997 OA decomposition NLP0014I 114 OPT 685.86276 13 0.018997 OA decomposition NLP0014I 115 OPT 696.81074 13 0.018997 OA decomposition NLP0014I 116 OPT 696.88961 13 0.018997 OA decomposition NLP0014I 117 OPT 670.11942 13 0.017998 OA decomposition NLP0014I 118 OPT 729.81467 15 0.020997 OA decomposition NLP0014I 119 OPT 623.95281 9 0.013997 OA decomposition NLP0014I 120 OPT 816.58689 13 0.016997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 121 OPT 691.23256 10 0.014998 OA decomposition NLP0014I 122 OPT 681.92817 13 0.018997 OA decomposition NLP0014I 123 OPT 660.56534 15 0.022997 OA decomposition NLP0014I 124 OPT 686.72615 11 0.016997 OA decomposition NLP0014I 125 OPT 742.36605 11 0.015998 OA decomposition NLP0014I 126 OPT 687.13157 15 0.020996 OA decomposition NLP0014I 127 OPT 657.43286 14 0.017997 OA decomposition NLP0014I 128 OPT 714.88996 11 0.015997 OA decomposition OA0012I After 204.34693.1f seconds, 128 iterations upper bound 499.281590g, lower bound 153.045310g NLP0014I 129 OPT 756.74192 12 0.016998 OA decomposition NLP0014I 130 OPT 660.93 13 0.019997 OA decomposition NLP0014I 131 OPT 725.38222 12 0.016997 OA decomposition NLP0014I 132 OPT 428.38778 11 0.014997 OA decomposition OA0003I New best feasible of 428.38778 found after 217.55493 sec and NLP0014I 133 OPT 649.71525 11 0.016998 OA decomposition NLP0014I 134 OPT 784.81023 13 0.017997 OA decomposition NLP0014I 135 OPT 615.9698 12 0.017997 OA decomposition NLP0014I 136 OPT 731.5974 11 0.015997 OA decomposition NLP0014I 137 OPT 774.50011 10 0.014998 OA decomposition NLP0014I 138 OPT 686.9365 15 0.022996 OA decomposition NLP0014I 139 OPT 633.32786 12 0.015998 OA decomposition NLP0014I 140 OPT 776.99734 13 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 141 OPT 795.28149 13 0.018997 OA decomposition NLP0014I 142 OPT 660.0481 12 0.016997 OA decomposition NLP0014I 143 OPT 765.57329 13 0.018997 OA decomposition NLP0014I 144 OPT 760.61366 10 0.015997 OA decomposition NLP0014I 145 OPT 682.90193 9 0.013998 OA decomposition NLP0014I 146 OPT 679.59207 12 0.016997 OA decomposition NLP0014I 147 OPT 459.17183 15 0.021997 OA decomposition NLP0014I 148 OPT 679.5913 13 0.018997 OA decomposition OA0012I After 309.11601.1f seconds, 148 iterations upper bound 428.38350g, lower bound 159.942470g NLP0014I 149 OPT 729.73103 12 0.017997 OA decomposition NLP0014I 150 OPT 706.10934 12 0.017998 OA decomposition NLP0014I 151 OPT 660.74062 13 0.018998 OA decomposition NLP0014I 152 OPT 717.35947 10 0.014998 OA decomposition NLP0014I 153 OPT 712.02649 13 0.018998 OA decomposition NLP0014I 154 OPT 402.46021 9 0.013998 OA decomposition OA0003I New best feasible of 402.46021 found after 340.55123 sec and NLP0014I 155 OPT 660.06628 10 0.014997 OA decomposition NLP0014I 156 OPT 640.19427 10 0.014998 OA decomposition NLP0014I 157 OPT 701.5088 13 0.018997 OA decomposition NLP0014I 158 OPT 653.33305 15 0.020997 OA decomposition NLP0014I 159 OPT 698.90385 13 0.018997 OA decomposition NLP0014I 160 OPT 671.75382 13 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 161 OPT 710.28514 12 0.015997 OA decomposition NLP0014I 162 OPT 723.06766 13 0.018998 OA decomposition NLP0014I 163 OPT 399.08501 9 0.013998 OA decomposition OA0003I New best feasible of 399.08501 found after 406.38322 sec and OA0012I After 413.46014.1f seconds, 163 iterations upper bound 399.081020g, lower bound 163.349550g NLP0014I 164 OPT 793.68623 14 0.019997 OA decomposition NLP0014I 165 OPT 702.66666 13 0.018997 OA decomposition NLP0014I 166 OPT 811.54881 11 0.016997 OA decomposition NLP0014I 167 OPT 758.46083 15 0.022996 OA decomposition NLP0014I 168 OPT 419.23641 9 0.013998 OA decomposition NLP0014I 169 OPT 414.82264 11 0.015998 OA decomposition NLP0014I 170 OPT 718.55896 12 0.016998 OA decomposition NLP0014I 171 OPT 412.88842 12 0.017997 OA decomposition NLP0014I 172 OPT 675.71819 12 0.016997 OA decomposition NLP0014I 173 OPT 784.43529 15 0.021996 OA decomposition NLP0014I 174 OPT 761.5637 11 0.016998 OA decomposition NLP0014I 175 OPT 409.32378 10 0.014997 OA decomposition NLP0014I 176 OPT 781.84512 10 0.014998 OA decomposition OA0012I After 519.83497.1f seconds, 176 iterations upper bound 399.081020g, lower bound 166.896640g NLP0014I 177 OPT 677.65685 10 0.014997 OA decomposition NLP0014I 178 OPT 392.87336 11 0.015997 OA decomposition OA0003I New best feasible of 392.87336 found after 527.17286 sec and NLP0014I 179 OPT 799.15255 13 0.018997 OA decomposition NLP0014I 180 OPT 705.15219 12 0.016998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 181 OPT 824.4396 11 0.016997 OA decomposition NLP0014I 182 OPT 748.45227 12 0.017998 OA decomposition NLP0014I 183 OPT 726.76515 13 0.018997 OA decomposition NLP0014I 184 OPT 766.0897 10 0.015998 OA decomposition NLP0014I 185 OPT 764.69054 10 0.014998 OA decomposition NLP0014I 186 OPT 760.07406 11 0.013997 OA decomposition NLP0014I 187 OPT 770.26926 10 0.014998 OA decomposition NLP0014I 188 OPT 723.56458 13 0.018997 OA decomposition OA0012I After 623.5962.1f seconds, 188 iterations upper bound 392.869430g, lower bound 170.813640g NLP0014I 189 OPT 500.2002 14 0.020996 OA decomposition NLP0014I 190 OPT 724.16348 13 0.017997 OA decomposition NLP0014I 191 OPT 782.92661 13 0.017997 OA decomposition NLP0014I 192 OPT 742.48842 10 0.014998 OA decomposition NLP0014I 193 OPT 748.47199 13 0.018997 OA decomposition NLP0014I 194 OPT 723.32198 13 0.018997 OA decomposition NLP0014I 195 OPT 755.56801 11 0.016997 OA decomposition NLP0014I 196 OPT 402.93944 12 0.017997 OA decomposition NLP0014I 197 OPT 410.59732 11 0.015997 OA decomposition NLP0014I 198 OPT 709.53946 14 0.018997 OA decomposition OA0012I After 730.08201.1f seconds, 198 iterations upper bound 392.869430g, lower bound 173.800940g NLP0014I 199 OPT 717.89623 13 0.018997 OA decomposition NLP0014I 200 OPT 789.84359 9 0.012998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 201 OPT 430.07444 9 0.013998 OA decomposition NLP0014I 202 OPT 447.23948 10 0.014998 OA decomposition NLP0014I 203 OPT 744.34726 10 0.014998 OA decomposition NLP0014I 204 OPT 406.18956 12 0.017997 OA decomposition NLP0014I 205 OPT 758.03113 13 0.018997 OA decomposition NLP0014I 206 OPT 427.39056 10 0.014997 OA decomposition NLP0014I 207 OPT 423.25882 9 0.011999 OA decomposition OA0012I After 834.35616.1f seconds, 207 iterations upper bound 392.869430g, lower bound 177.42360g NLP0014I 208 OPT 405.44486 9 0.013998 OA decomposition NLP0014I 209 OPT 901.50489 13 0.017997 OA decomposition NLP0014I 210 OPT 736.86206 12 0.017997 OA decomposition NLP0014I 211 OPT 710.6805 12 0.017997 OA decomposition NLP0014I 212 OPT 411.64431 9 0.013998 OA decomposition NLP0014I 213 OPT 431.62958 9 0.013998 OA decomposition NLP0014I 214 OPT 459.10693 9 0.012998 OA decomposition NLP0014I 215 OPT 430.07044 10 0.014998 OA decomposition NLP0014I 216 OPT 833.41162 12 0.017998 OA decomposition OA0012I After 946.22815.1f seconds, 216 iterations upper bound 392.869430g, lower bound 180.207680g NLP0014I 217 OPT 444.40983 11 0.014998 OA decomposition NLP0014I 218 OPT 733.17778 10 0.015998 OA decomposition NLP0014I 219 OPT 707.74322 10 0.014997 OA decomposition NLP0014I 220 OPT 824.38891 13 0.018998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 221 OPT 779.6173 10 0.014998 OA decomposition NLP0014I 222 OPT 801.46952 12 0.016998 OA decomposition OA0012I After 1047.4298.1f seconds, 222 iterations upper bound 392.869430g, lower bound 183.02260g NLP0014I 223 OPT 423.35194 9 0.011998 OA decomposition NLP0014I 224 OPT 416.51836 14 0.021996 OA decomposition NLP0014I 225 OPT 420.8111 9 0.013998 OA decomposition NLP0014I 226 OPT 445.63113 11 0.016997 OA decomposition NLP0014I 227 OPT 424.62738 9 0.013998 OA decomposition NLP0014I 228 OPT 446.5841 9 0.013998 OA decomposition OA0012I After 1152.3188.1f seconds, 228 iterations upper bound 392.869430g, lower bound 186.35620g NLP0014I 229 OPT 431.95839 10 0.014997 OA decomposition NLP0014I 230 OPT 439.27512 10 0.014998 OA decomposition NLP0014I 231 OPT 421.86149 9 0.012998 OA decomposition NLP0014I 232 OPT 417.35021 11 0.015997 OA decomposition NLP0014I 233 OPT 438.04937 11 0.014998 OA decomposition OA0012I After 1258.1707.1f seconds, 233 iterations upper bound 392.869430g, lower bound 188.192740g NLP0014I 234 OPT 400.69868 11 0.014997 OA decomposition NLP0014I 235 OPT 416.2308 13 0.018997 OA decomposition NLP0014I 236 OPT 770.57222 13 0.017997 OA decomposition NLP0014I 237 OPT 788.33766 10 0.014998 OA decomposition OA0012I After 1369.6358.1f seconds, 237 iterations upper bound 392.869430g, lower bound 189.141860g NLP0014I 238 OPT 444.28228 9 0.012998 OA decomposition NLP0014I 239 OPT 428.65671 11 0.016997 OA decomposition NLP0014I 240 OPT 419.64929 10 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 241 OPT 452.50531 14 0.021996 OA decomposition OA0012I After 1478.1323.1f seconds, 241 iterations upper bound 392.869430g, lower bound 191.334710g NLP0014I 242 OPT 430.55282 11 0.016998 OA decomposition NLP0014I 243 OPT 412.12442 10 0.014998 OA decomposition NLP0014I 244 OPT 817.98212 9 0.012998 OA decomposition NLP0014I 245 OPT 763.99325 13 0.018997 OA decomposition NLP0014I 246 OPT 780.96119 14 0.019997 OA decomposition OA0012I After 1603.2893.1f seconds, 246 iterations upper bound 392.869430g, lower bound 191.833360g NLP0014I 247 OPT 422.72786 11 0.015997 OA decomposition NLP0014I 248 OPT 461.86518 11 0.015998 OA decomposition NLP0014I 249 OPT 780.11129 12 0.017997 OA decomposition NLP0014I 250 OPT 417.30848 11 0.016997 OA decomposition OA0012I After 1707.1015.1f seconds, 250 iterations upper bound 392.869430g, lower bound 193.383090g NLP0014I 251 OPT 430.65603 9 0.013998 OA decomposition NLP0014I 252 OPT 419.22949 10 0.013998 OA decomposition NLP0014I 253 OPT 456.57301 11 0.015997 OA decomposition OA0012I After 1817.1118.1f seconds, 253 iterations upper bound 392.869430g, lower bound 194.398130g NLP0014I 254 OPT 812.88314 12 0.016997 OA decomposition NLP0014I 255 OPT 422.53802 13 0.017997 OA decomposition NLP0014I 256 OPT 443.08037 9 0.013998 OA decomposition OA0012I After 1938.2493.1f seconds, 256 iterations upper bound 392.869430g, lower bound 196.178990g NLP0014I 257 OPT 443.30324 11 0.015997 OA decomposition NLP0014I 258 OPT 448.10803 9 0.013998 OA decomposition NLP0014I 259 OPT 805.98652 10 0.014998 OA decomposition OA0012I After 2066.0499.1f seconds, 259 iterations upper bound 392.869430g, lower bound 197.094240g NLP0014I 260 OPT 442.17956 13 0.016998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 261 OPT 427.35762 11 0.015997 OA decomposition NLP0014I 262 OPT 430.94565 11 0.015997 OA decomposition OA0012I After 2201.4943.1f seconds, 262 iterations upper bound 392.869430g, lower bound 197.712880g NLP0014I 263 OPT 431.49848 13 0.018997 OA decomposition NLP0014I 264 OPT 856.04569 9 0.012998 OA decomposition NLP0014I 265 OPT 446.52135 9 0.013998 OA decomposition OA0012I After 2329.7338.1f seconds, 265 iterations upper bound 392.869430g, lower bound 198.56350g NLP0014I 266 OPT 441.62063 11 0.016998 OA decomposition NLP0014I 267 OPT 454.15246 10 0.014997 OA decomposition NLP0014I 268 OPT 848.99913 12 0.017997 OA decomposition OA0012I After 2467.2319.1f seconds, 268 iterations upper bound 392.869430g, lower bound 200.028010g NLP0014I 269 OPT 801.31939 10 0.014998 OA decomposition NLP0014I 270 OPT 437.30441 11 0.014998 OA decomposition NLP0014I 271 OPT 453.3355 10 0.014998 OA decomposition OA0012I After 2603.7782.1f seconds, 271 iterations upper bound 392.869430g, lower bound 201.708420g NLP0014I 272 OPT 413.85584 13 0.018997 OA decomposition NLP0014I 273 OPT 433.96726 9 0.013997 OA decomposition NLP0014I 274 OPT 435.19959 11 0.014998 OA decomposition OA0012I After 2753.4464.1f seconds, 274 iterations upper bound 392.869430g, lower bound 202.589240g NLP0014I 275 OPT 442.9795 10 0.014998 OA decomposition NLP0014I 276 OPT 453.25056 9 0.012998 OA decomposition NLP0014I 277 OPT 457.1288 12 0.014998 OA decomposition OA0012I After 2900.934.1f seconds, 277 iterations upper bound 392.869430g, lower bound 203.930220g NLP0014I 278 OPT 466.06196 9 0.013998 OA decomposition NLP0014I 279 OPT 455.52495 9 0.012998 OA decomposition NLP0014I 280 OPT 435.74393 13 0.016998 OA decomposition OA0012I After 3053.3268.1f seconds, 280 iterations upper bound 392.869430g, lower bound 205.43390g NLP0012I Num Status Obj It time Location NLP0014I 281 OPT 450.64958 11 0.016998 OA decomposition NLP0014I 282 OPT 440.43904 13 0.018997 OA decomposition NLP0014I 283 OPT 465.29691 11 0.015998 OA decomposition OA0012I After 3200.0275.1f seconds, 283 iterations upper bound 392.869430g, lower bound 206.044760g NLP0014I 284 OPT 445.07398 9 0.013997 OA decomposition NLP0014I 285 OPT 492.9059 11 0.015998 OA decomposition OA0012I After 3316.4618.1f seconds, 285 iterations upper bound 392.869430g, lower bound 207.336230g NLP0014I 286 OPT 452.69236 9 0.013998 OA decomposition NLP0014I 287 OPT 460.77507 11 0.015997 OA decomposition OA0012I After 3426.0692.1f seconds, 287 iterations upper bound 392.869430g, lower bound 208.040250g NLP0014I 288 OPT 449.65477 13 0.017997 OA decomposition NLP0014I 289 OPT 425.76376 9 0.013998 OA decomposition OA0012I After 3535.1376.1f seconds, 289 iterations upper bound 392.869430g, lower bound 208.273540g NLP0014I 290 OPT 430.97162 11 0.016998 OA decomposition NLP0014I 291 OPT 441.33794 11 0.014998 OA decomposition OA0012I After 3644.7009.1f seconds, 291 iterations upper bound 392.869430g, lower bound 208.746960g NLP0014I 292 OPT 464.1164 10 0.014998 OA decomposition NLP0014I 293 OPT 461.23193 9 0.013998 OA decomposition OA0012I After 3771.8586.1f seconds, 293 iterations upper bound 392.869430g, lower bound 209.694290g NLP0014I 294 OPT 428.26011 13 0.018997 OA decomposition NLP0014I 295 OPT 478.54437 9 0.012998 OA decomposition OA0012I After 3876.0308.1f seconds, 295 iterations upper bound 392.869430g, lower bound 209.82530g NLP0014I 296 OPT 465.00053 11 0.015998 OA decomposition NLP0014I 297 OPT 439.98196 11 0.015998 OA decomposition OA0012I After 4012.9369.1f seconds, 297 iterations upper bound 392.869430g, lower bound 210.003030g NLP0014I 298 OPT 405.17038 13 0.017997 OA decomposition NLP0014I 299 OPT 452.45944 14 0.021997 OA decomposition OA0012I After 4146.6546.1f seconds, 299 iterations upper bound 392.869430g, lower bound 210.765010g NLP0014I 300 OPT 453.77874 11 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 301 OPT 491.97169 11 0.015997 OA decomposition OA0012I After 4297.4827.1f seconds, 301 iterations upper bound 392.869430g, lower bound 211.578660g NLP0014I 302 OPT 469.61315 11 0.015997 OA decomposition NLP0014I 303 OPT 456.08426 11 0.015998 OA decomposition OA0012I After 4429.4706.1f seconds, 303 iterations upper bound 392.869430g, lower bound 212.641580g NLP0014I 304 OPT 464.9684 9 0.012998 OA decomposition NLP0014I 305 OPT 475.95325 13 0.018997 OA decomposition OA0012I After 4566.4748.1f seconds, 305 iterations upper bound 392.869430g, lower bound 213.172650g NLP0014I 306 OPT 453.74578 11 0.014998 OA decomposition NLP0014I 307 OPT 450.67358 11 0.015997 OA decomposition OA0012I After 4714.8312.1f seconds, 307 iterations upper bound 392.869430g, lower bound 213.910030g NLP0014I 308 OPT 443.39913 9 0.012998 OA decomposition NLP0014I 309 OPT 463.73233 13 0.018997 OA decomposition OA0012I After 4856.1258.1f seconds, 309 iterations upper bound 392.869430g, lower bound 214.604820g NLP0014I 310 OPT 392.13653 11 0.015998 OA decomposition OA0003I New best feasible of 392.13653 found after 4856.1428 sec and NLP0014I 311 OPT 450.09971 13 0.017997 OA decomposition OA0012I After 4996.0725.1f seconds, 311 iterations upper bound 392.132610g, lower bound 215.115450g NLP0014I 312 OPT 435.27612 11 0.016998 OA decomposition NLP0014I 313 OPT 435.5182 9 0.013998 OA decomposition OA0012I After 5132.8107.1f seconds, 313 iterations upper bound 392.132610g, lower bound 215.485130g NLP0014I 314 OPT 402.31421 11 0.014998 OA decomposition NLP0014I 315 OPT 875.66086 14 0.020997 OA decomposition OA0012I After 5283.7867.1f seconds, 315 iterations upper bound 392.132610g, lower bound 215.792020g NLP0014I 316 OPT 454.52164 9 0.013998 OA decomposition NLP0014I 317 OPT 465.88904 13 0.017997 OA decomposition OA0012I After 5431.9052.1f seconds, 317 iterations upper bound 392.132610g, lower bound 217.282590g NLP0014I 318 OPT 448.9674 11 0.015997 OA decomposition NLP0014I 319 OPT 441.41955 13 0.018997 OA decomposition OA0012I After 5584.78.1f seconds, 319 iterations upper bound 392.132610g, lower bound 217.838160g NLP0014I 320 OPT 448.32358 11 0.015998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 321 OPT 397.48983 11 0.016998 OA decomposition OA0012I After 5749.349.1f seconds, 321 iterations upper bound 392.132610g, lower bound 218.159180g NLP0014I 322 OPT 454.66605 9 0.013998 OA decomposition NLP0014I 323 OPT 494.64605 9 0.013998 OA decomposition OA0012I After 5907.3879.1f seconds, 323 iterations upper bound 392.132610g, lower bound 219.129590g NLP0014I 324 OPT 453.54452 11 0.016998 OA decomposition NLP0014I 325 OPT 466.83851 9 0.012998 OA decomposition OA0012I After 6073.1187.1f seconds, 325 iterations upper bound 392.132610g, lower bound 219.574360g NLP0014I 326 OPT 423.62665 11 0.016998 OA decomposition NLP0014I 327 OPT 456.49746 12 0.016998 OA decomposition OA0012I After 6237.5767.1f seconds, 327 iterations upper bound 392.132610g, lower bound 219.676980g NLP0014I 328 OPT 477.04644 9 0.012998 OA decomposition NLP0014I 329 OPT 394.31648 11 0.015998 OA decomposition OA0012I After 6407.104.1f seconds, 329 iterations upper bound 392.132610g, lower bound 219.929340g NLP0014I 330 OPT 472.35956 11 0.015997 OA decomposition NLP0014I 331 OPT 443.83539 11 0.016998 OA decomposition OA0012I After 6563.5732.1f seconds, 331 iterations upper bound 392.132610g, lower bound 220.274650g NLP0014I 332 OPT 398.99829 8 0.011998 OA decomposition NLP0014I 333 OPT 470.28427 13 0.018997 OA decomposition OA0012I After 6722.0371.1f seconds, 333 iterations upper bound 392.132610g, lower bound 220.421690g NLP0014I 334 OPT 460.9154 11 0.016997 OA decomposition NLP0014I 335 OPT 452.80534 8 0.011998 OA decomposition OA0012I After 6890.2335.1f seconds, 335 iterations upper bound 392.132610g, lower bound 220.666850g NLP0014I 336 OPT 478.15852 13 0.017997 OA decomposition NLP0014I 337 OPT 473.53712 9 0.012998 OA decomposition OA0012I After 7045.7749.1f seconds, 337 iterations upper bound 392.132610g, lower bound 220.828970g NLP0014I 338 OPT 481.29393 11 0.016998 OA decomposition NLP0014I 339 OPT 385.39644 9 0.012998 OA decomposition OA0003I New best feasible of 385.39644 found after 7135.4262 sec and OA0012I After 7200.0064.1f seconds, 339 iterations upper bound 385.392590g, lower bound 221.059810g NLP0014I 340 OPT 460.37574 13 0.019997 OA decomposition OA0009I OA interupted after 7200.0294 seconds found solution of value 385.39644 (lower bound 221.05981 ). OA0010I Performed 339 iterations, explored 967510 branch-and-bound nodes in total NLP0012I Num Status Obj It time Location NLP0014I 341 OPT 1541.9087 11 0.015997 check integer sol. OA0003I New best feasible of 1541.9087 found after 7200.0474 sec and Cbc0031I 65 added rows had average density of 193.46154 Cbc0013I At root node, 65 cuts changed objective from 119.77134 to 119.77134 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 64 row cuts average 195.2 elements, 0 column cuts (64 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 1 row cuts average 84.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 119.77134), took 514 iterations and 0 nodes (7200.20 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 64 cuts of which 64 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 1 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 1.197713e+02 (only reliable for convex models) --- Restarting execution --- uflquad-20-50.gms(2878) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job uflquad-20-50.gms Stop 09/08/12 21:59:26 elapsed 2:00:20.735 @04 1347134366 ----------------------------- Sa 8. Sep 21:59:26 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/UncapacitatedFacilityLocation/gms/uflquad-25-25.gms =========== ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- @03 1347127145 --- Job uflquad-25-25.gms Start 09/08/12 19:59:05 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- uflquad-25-25.gms(1790) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- uflquad-25-25.gms(1788) 3 Mb --- Generating MIQCP model m --- uflquad-25-25.gms(1790) 5 Mb --- 651 rows 651 columns 2,526 non-zeroes --- 2,502 nl-code 625 nl-non-zeroes --- 25 discrete-columns --- uflquad-25-25.gms(1790) 3 Mb --- Executing BONMIN: elapsed 0:00:00.015 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 625 Number of nonzeros in inequality constraint Jacobian.: 1250 Number of nonzeros in Lagrangian Hessian.............: 625 Total number of variables............................: 650 variables with only lower bounds: 625 variables with lower and upper bounds: 25 variables with only upper bounds: 0 Total number of equality constraints.................: 25 Total number of inequality constraints...............: 625 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 625 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.5955731e+01 7.50e-01 3.65e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1209766e+02 5.32e-01 2.63e+00 -2.1 4.15e-02 - 2.28e-01 2.91e-01h 1 2 2.7407969e+02 1.16e-01 1.81e+00 -2.0 1.09e-01 - 2.88e-01 7.83e-01h 1 3 2.8026991e+02 5.06e-02 5.11e-01 -3.5 3.21e-02 - 7.22e-01 5.62e-01h 1 4 2.9472080e+02 6.41e-03 8.69e-02 -4.7 1.74e-02 - 8.32e-01 8.73e-01h 1 5 2.9686327e+02 1.75e-04 6.04e-03 -6.4 4.14e-03 - 9.44e-01 9.73e-01h 1 6 2.9684929e+02 4.44e-16 1.57e-03 -7.3 2.13e-03 - 9.76e-01 1.00e+00h 1 7 2.9683554e+02 4.44e-16 3.35e-04 -7.7 9.52e-04 - 9.90e-01 1.00e+00f 1 8 2.9683303e+02 4.44e-16 4.14e-14 -9.0 3.68e-04 - 1.00e+00 1.00e+00f 1 9 2.9683268e+02 5.55e-16 2.25e-04 -10.9 8.57e-05 - 1.00e+00 9.85e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.9683267e+02 4.44e-16 4.53e+02 -8.5 6.09e-06 - 1.47e-03 1.00e+00f 1 11 2.9683266e+02 4.44e-16 3.94e-14 -8.8 7.27e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 7.8113858560686410e+01 2.9683266253060839e+02 Dual infeasibility......: 3.9448361635581783e-14 1.4990377421521078e-13 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Complementarity.........: 2.2113144912531487e-09 8.4029950667619649e-09 Overall NLP error.......: 2.2113144912531487e-09 8.4029950667619649e-09 Number of objective function evaluations = 12 Number of objective gradient evaluations = 12 Number of equality constraint evaluations = 12 Number of inequality constraint evaluations = 12 Number of equality constraint Jacobian evaluations = 12 Number of inequality constraint Jacobian evaluations = 12 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.016 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 296.83266 11 0.015997 build initial OA NLP0014I 2 OPT 716.37006 10 0.008999 OA decomposition OA0003I New best feasible of 716.37006 found after 0.027996 sec and NLP0014I 3 OPT 769.13875 9 0.008999 OA decomposition NLP0014I 4 OPT 882.17668 10 0.021997 OA decomposition NLP0014I 5 OPT 914.6402 8 0.018998 OA decomposition NLP0014I 6 OPT 908.77838 8 0.017998 OA decomposition NLP0014I 7 OPT 781.87263 9 0.018997 OA decomposition NLP0014I 8 OPT 890.17848 8 0.017998 OA decomposition NLP0014I 9 OPT 1081.7404 11 0.023996 OA decomposition NLP0014I 10 OPT 823.35463 9 0.009999 OA decomposition NLP0014I 11 OPT 938.30338 10 0.009999 OA decomposition NLP0014I 12 OPT 1133.9259 10 0.010998 OA decomposition NLP0014I 13 OPT 990.03176 10 0.008998 OA decomposition NLP0014I 14 OPT 1055.8539 10 0.009999 OA decomposition NLP0014I 15 OPT 982.11208 10 0.009998 OA decomposition NLP0014I 16 OPT 1091.8575 10 0.010999 OA decomposition NLP0014I 17 OPT 1029.4054 10 0.010998 OA decomposition NLP0014I 18 OPT 1201.9614 10 0.009998 OA decomposition NLP0014I 19 OPT 923.5358 10 0.010999 OA decomposition NLP0014I 20 OPT 1206.6522 10 0.010999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 893.02185 9 0.008999 OA decomposition NLP0014I 22 OPT 992.11326 11 0.010998 OA decomposition NLP0014I 23 OPT 901.52929 10 0.010998 OA decomposition NLP0014I 24 OPT 1262.1558 11 0.010998 OA decomposition NLP0014I 25 OPT 1029.144 10 0.007999 OA decomposition NLP0014I 26 OPT 983.46865 11 0.011998 OA decomposition NLP0014I 27 OPT 673.69689 9 0.009999 OA decomposition OA0003I New best feasible of 673.69689 found after 1.707741 sec and NLP0014I 28 OPT 695.57743 9 0.008998 OA decomposition NLP0014I 29 OPT 732.69323 8 0.008999 OA decomposition NLP0014I 30 OPT 711.15169 12 0.012998 OA decomposition NLP0014I 31 OPT 680.06594 11 0.011999 OA decomposition NLP0014I 32 OPT 756.79383 10 0.010998 OA decomposition NLP0014I 33 OPT 788.99792 14 0.013997 OA decomposition NLP0014I 34 OPT 720.96785 11 0.011998 OA decomposition NLP0014I 35 OPT 725.25756 9 0.009998 OA decomposition NLP0014I 36 OPT 753.09197 12 0.011999 OA decomposition NLP0014I 37 OPT 799.23091 12 0.011998 OA decomposition NLP0014I 38 OPT 744.32944 12 0.011998 OA decomposition NLP0014I 39 OPT 730.48035 11 0.010998 OA decomposition NLP0014I 40 OPT 730.20468 12 0.011998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 735.49553 8 0.008999 OA decomposition NLP0014I 42 OPT 768.74947 9 0.008998 OA decomposition NLP0014I 43 OPT 760.98223 8 0.006999 OA decomposition NLP0014I 44 OPT 755.92751 9 0.009998 OA decomposition NLP0014I 45 OPT 764.59648 12 0.011998 OA decomposition NLP0014I 46 OPT 792.46281 11 0.009998 OA decomposition NLP0014I 47 OPT 794.97723 12 0.011998 OA decomposition NLP0014I 48 OPT 792.37919 12 0.011999 OA decomposition NLP0014I 49 OPT 776.4799 10 0.009999 OA decomposition NLP0014I 50 OPT 819.29027 11 0.009998 OA decomposition NLP0014I 51 OPT 816.11421 14 0.013998 OA decomposition NLP0014I 52 OPT 764.81566 12 0.012998 OA decomposition NLP0014I 53 OPT 771.25504 12 0.011998 OA decomposition NLP0014I 54 OPT 756.58657 11 0.011998 OA decomposition NLP0014I 55 OPT 763.00511 9 0.008999 OA decomposition NLP0014I 56 OPT 829.51477 12 0.010998 OA decomposition NLP0014I 57 OPT 806.55323 11 0.010999 OA decomposition NLP0014I 58 OPT 833.35753 11 0.010998 OA decomposition NLP0014I 59 OPT 790.65628 11 0.009999 OA decomposition NLP0014I 60 OPT 734.76189 11 0.010999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 747.69165 11 0.009998 OA decomposition NLP0014I 62 OPT 785.97477 11 0.010998 OA decomposition NLP0014I 63 OPT 834.63929 11 0.011998 OA decomposition NLP0014I 64 OPT 784.42405 8 0.007999 OA decomposition NLP0014I 65 OPT 819.03416 11 0.010998 OA decomposition NLP0014I 66 OPT 798.01236 11 0.011998 OA decomposition NLP0014I 67 OPT 783.60474 11 0.009998 OA decomposition NLP0014I 68 OPT 778.83266 11 0.009998 OA decomposition NLP0014I 69 OPT 817.80331 11 0.010998 OA decomposition NLP0014I 70 OPT 819.66416 11 0.010998 OA decomposition NLP0014I 71 OPT 882.15417 14 0.013998 OA decomposition NLP0014I 72 OPT 801.87773 11 0.011999 OA decomposition NLP0014I 73 OPT 784.04323 12 0.011998 OA decomposition NLP0014I 74 OPT 830.9407 12 0.011998 OA decomposition NLP0014I 75 OPT 804.32782 11 0.011998 OA decomposition NLP0014I 76 OPT 814.72416 12 0.011998 OA decomposition NLP0014I 77 OPT 847.56275 11 0.010998 OA decomposition NLP0014I 78 OPT 785.77743 12 0.011998 OA decomposition NLP0014I 79 OPT 763.73731 11 0.010998 OA decomposition NLP0014I 80 OPT 833.17514 11 0.009998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT 834.75793 10 0.010998 OA decomposition NLP0014I 82 OPT 845.43695 12 0.011998 OA decomposition NLP0014I 83 OPT 869.64894 14 0.013998 OA decomposition NLP0014I 84 OPT 876.27072 11 0.011998 OA decomposition NLP0014I 85 OPT 793.75772 11 0.010998 OA decomposition NLP0014I 86 OPT 862.25704 11 0.010998 OA decomposition NLP0014I 87 OPT 855.44821 14 0.012998 OA decomposition NLP0014I 88 OPT 765.23403 11 0.010998 OA decomposition NLP0014I 89 OPT 805.76282 12 0.012998 OA decomposition NLP0014I 90 OPT 793.25028 12 0.012998 OA decomposition NLP0014I 91 OPT 791.53601 8 0.007999 OA decomposition NLP0014I 92 OPT 812.70392 12 0.011998 OA decomposition NLP0014I 93 OPT 837.81661 14 0.013998 OA decomposition NLP0014I 94 OPT 796.03565 10 0.010998 OA decomposition NLP0014I 95 OPT 809.16839 11 0.010999 OA decomposition NLP0014I 96 OPT 827.07081 11 0.010999 OA decomposition NLP0014I 97 OPT 839.21797 12 0.010998 OA decomposition NLP0014I 98 OPT 828.39053 11 0.010998 OA decomposition NLP0014I 99 OPT 877.0321 12 0.010999 OA decomposition NLP0014I 100 OPT 871.77726 11 0.010998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT 842.89244 13 0.012998 OA decomposition NLP0014I 102 OPT 857.31401 11 0.011999 OA decomposition NLP0014I 103 OPT 908.92945 8 0.008999 OA decomposition NLP0014I 104 OPT 850.14541 11 0.010998 OA decomposition NLP0014I 105 OPT 896.31729 12 0.011998 OA decomposition NLP0014I 106 OPT 881.21475 12 0.011998 OA decomposition NLP0014I 107 OPT 864.00474 11 0.011998 OA decomposition NLP0014I 108 OPT 822.82439 8 0.008999 OA decomposition NLP0014I 109 OPT 918.81564 12 0.010999 OA decomposition NLP0014I 110 OPT 833.28971 11 0.010999 OA decomposition NLP0014I 111 OPT 810.42917 11 0.009998 OA decomposition NLP0014I 112 OPT 805.58403 13 0.012998 OA decomposition NLP0014I 113 OPT 927.05819 11 0.010998 OA decomposition NLP0014I 114 OPT 870.47578 12 0.011998 OA decomposition NLP0014I 115 OPT 818.1506 11 0.011998 OA decomposition NLP0014I 116 OPT 898.39038 11 0.010999 OA decomposition NLP0014I 117 OPT 861.29124 11 0.010998 OA decomposition NLP0014I 118 OPT 843.37296 12 0.011998 OA decomposition NLP0014I 119 OPT 817.95665 12 0.011998 OA decomposition NLP0014I 120 OPT 856.74778 11 0.010998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 121 OPT 951.82997 11 0.011998 OA decomposition NLP0014I 122 OPT 816.71546 11 0.010998 OA decomposition NLP0014I 123 OPT 865.08464 11 0.011998 OA decomposition NLP0014I 124 OPT 843.7917 9 0.008999 OA decomposition NLP0014I 125 OPT 890.47202 11 0.010998 OA decomposition NLP0014I 126 OPT 904.41192 14 0.013997 OA decomposition NLP0014I 127 OPT 903.72745 12 0.012998 OA decomposition NLP0014I 128 OPT 840.59362 10 0.010998 OA decomposition NLP0014I 129 OPT 841.31833 11 0.009998 OA decomposition NLP0014I 130 OPT 819.34725 12 0.011998 OA decomposition NLP0014I 131 OPT 864.7496 10 0.010998 OA decomposition NLP0014I 132 OPT 880.68133 11 0.010998 OA decomposition NLP0014I 133 OPT 824.62233 12 0.011998 OA decomposition NLP0014I 134 OPT 868.24156 12 0.012998 OA decomposition NLP0014I 135 OPT 931.4376 9 0.006999 OA decomposition NLP0014I 136 OPT 845.66522 12 0.012998 OA decomposition NLP0014I 137 OPT 886.94681 11 0.010999 OA decomposition NLP0014I 138 OPT 856.72179 11 0.011999 OA decomposition NLP0014I 139 OPT 856.72789 11 0.010999 OA decomposition NLP0014I 140 OPT 838.43612 12 0.011998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 141 OPT 906.48303 8 0.006999 OA decomposition NLP0014I 142 OPT 961.37232 14 0.014997 OA decomposition NLP0014I 143 OPT 821.26931 11 0.009999 OA decomposition NLP0014I 144 OPT 868.13966 12 0.011998 OA decomposition NLP0014I 145 OPT 898.18161 11 0.011999 OA decomposition NLP0014I 146 OPT 937.85596 12 0.011998 OA decomposition NLP0014I 147 OPT 939.61161 12 0.011998 OA decomposition NLP0014I 148 OPT 836.01815 12 0.011998 OA decomposition NLP0014I 149 OPT 866.03337 11 0.011998 OA decomposition NLP0014I 150 OPT 832.4108 12 0.012998 OA decomposition NLP0014I 151 OPT 822.9284 11 0.011998 OA decomposition NLP0014I 152 OPT 932.76299 11 0.011998 OA decomposition NLP0014I 153 OPT 855.59278 12 0.012998 OA decomposition NLP0014I 154 OPT 903.8747 11 0.011998 OA decomposition NLP0014I 155 OPT 840.86692 11 0.009998 OA decomposition NLP0014I 156 OPT 932.28868 14 0.014998 OA decomposition NLP0014I 157 OPT 853.96359 11 0.010998 OA decomposition NLP0014I 158 OPT 957.64112 13 0.010999 OA decomposition NLP0014I 159 OPT 906.66544 12 0.010998 OA decomposition NLP0014I 160 OPT 824.67505 11 0.010998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 161 OPT 878.62567 11 0.009999 OA decomposition NLP0014I 162 OPT 891.02337 12 0.010999 OA decomposition NLP0014I 163 OPT 866.3649 8 0.008998 OA decomposition NLP0014I 164 OPT 850.47514 12 0.011999 OA decomposition NLP0014I 165 OPT 883.80906 12 0.011998 OA decomposition NLP0014I 166 OPT 890.31122 10 0.010998 OA decomposition NLP0014I 167 OPT 910.99128 11 0.010998 OA decomposition NLP0014I 168 OPT 875.22128 10 0.009999 OA decomposition NLP0014I 169 OPT 865.24636 13 0.013998 OA decomposition NLP0014I 170 OPT 972.7272 11 0.010999 OA decomposition NLP0014I 171 OPT 947.62872 11 0.010999 OA decomposition NLP0014I 172 OPT 951.53057 8 0.008998 OA decomposition NLP0014I 173 OPT 875.77232 12 0.011998 OA decomposition NLP0014I 174 OPT 897.09676 12 0.010998 OA decomposition NLP0014I 175 OPT 845.57875 12 0.011999 OA decomposition NLP0014I 176 OPT 888.73812 13 0.013998 OA decomposition NLP0014I 177 OPT 955.61796 11 0.011998 OA decomposition NLP0014I 178 OPT 858.04937 12 0.011998 OA decomposition NLP0014I 179 OPT 846.96756 11 0.009999 OA decomposition NLP0014I 180 OPT 954.63194 11 0.011999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 181 OPT 904.47296 12 0.011998 OA decomposition NLP0014I 182 OPT 873.08561 11 0.011999 OA decomposition NLP0014I 183 OPT 869.08881 11 0.011998 OA decomposition NLP0014I 184 OPT 890.08085 12 0.011998 OA decomposition NLP0014I 185 OPT 882.40209 8 0.008999 OA decomposition NLP0014I 186 OPT 927.07696 13 0.012998 OA decomposition NLP0014I 187 OPT 935.30129 11 0.010998 OA decomposition NLP0014I 188 OPT 956.22903 10 0.010998 OA decomposition NLP0014I 189 OPT 967.01335 11 0.010999 OA decomposition NLP0014I 190 OPT 884.89473 13 0.012998 OA decomposition NLP0014I 191 OPT 985.16901 9 0.009998 OA decomposition NLP0014I 192 OPT 918.67674 11 0.011998 OA decomposition NLP0014I 193 OPT 948.39772 11 0.010998 OA decomposition NLP0014I 194 OPT 913.52993 10 0.010998 OA decomposition NLP0014I 195 OPT 931.82638 14 0.013998 OA decomposition NLP0014I 196 OPT 892.23194 13 0.012998 OA decomposition NLP0014I 197 OPT 922.64621 10 0.009998 OA decomposition OA0012I After 100.69869.1f seconds, 197 iterations upper bound 673.690150g, lower bound 602.156160g NLP0014I 198 OPT 933.15969 12 0.011998 OA decomposition NLP0014I 199 OPT 871.90794 11 0.011998 OA decomposition NLP0014I 200 OPT 978.11898 11 0.010999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 201 OPT 905.43288 8 0.006999 OA decomposition NLP0014I 202 OPT 916.37241 11 0.010998 OA decomposition NLP0014I 203 OPT 890.96866 12 0.011998 OA decomposition NLP0014I 204 OPT 880.96375 12 0.011998 OA decomposition NLP0014I 205 OPT 965.64841 12 0.010998 OA decomposition NLP0014I 206 OPT 893.18073 11 0.008999 OA decomposition NLP0014I 207 OPT 944.49368 11 0.010998 OA decomposition NLP0014I 208 OPT 1041.9606 11 0.011998 OA decomposition NLP0014I 209 OPT 951.66567 12 0.011998 OA decomposition NLP0014I 210 OPT 1000.241 13 0.011998 OA decomposition NLP0014I 211 OPT 872.87952 10 0.010998 OA decomposition NLP0014I 212 OPT 932.09282 12 0.011998 OA decomposition NLP0014I 213 OPT 980.71533 13 0.011998 OA decomposition NLP0014I 214 OPT 929.3808 13 0.011998 OA decomposition NLP0014I 215 OPT 890.81564 11 0.010998 OA decomposition NLP0014I 216 OPT 882.8443 11 0.011998 OA decomposition NLP0014I 217 OPT 929.64111 11 0.011998 OA decomposition NLP0014I 218 OPT 895.00725 12 0.011998 OA decomposition NLP0014I 219 OPT 956.89471 10 0.010998 OA decomposition NLP0014I 220 OPT 924.91014 12 0.012998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 221 OPT 982.73263 11 0.011998 OA decomposition NLP0014I 222 OPT 881.58363 10 0.010999 OA decomposition NLP0014I 223 OPT 934.83424 11 0.010998 OA decomposition NLP0014I 224 OPT 894.6184 13 0.012998 OA decomposition NLP0014I 225 OPT 921.73092 11 0.011998 OA decomposition NLP0014I 226 OPT 983.86739 12 0.012998 OA decomposition NLP0014I 227 OPT 986.37609 12 0.010998 OA decomposition NLP0014I 228 OPT 917.34663 10 0.010998 OA decomposition NLP0014I 229 OPT 921.99581 9 0.009998 OA decomposition NLP0014I 230 OPT 959.30352 12 0.011999 OA decomposition NLP0014I 231 OPT 921.73858 11 0.011998 OA decomposition NLP0014I 232 OPT 904.27839 10 0.009998 OA decomposition NLP0014I 233 OPT 881.59629 10 0.008998 OA decomposition NLP0014I 234 OPT 917.81842 12 0.012998 OA decomposition NLP0014I 235 OPT 981.40015 12 0.012998 OA decomposition NLP0014I 236 OPT 945.84278 12 0.012998 OA decomposition NLP0014I 237 OPT 897.09466 12 0.012998 OA decomposition NLP0014I 238 OPT 946.47538 11 0.010998 OA decomposition NLP0014I 239 OPT 1046.3079 11 0.010998 OA decomposition NLP0014I 240 OPT 955.53676 8 0.008999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 241 OPT 898.18348 9 0.008999 OA decomposition NLP0014I 242 OPT 910.70214 11 0.011998 OA decomposition NLP0014I 243 OPT 1020.8194 11 0.011998 OA decomposition NLP0014I 244 OPT 951.36801 14 0.013998 OA decomposition NLP0014I 245 OPT 939.85343 8 0.008999 OA decomposition NLP0014I 246 OPT 971.65398 14 0.013998 OA decomposition NLP0014I 247 OPT 918.14033 13 0.012998 OA decomposition NLP0014I 248 OPT 903.83318 12 0.010998 OA decomposition NLP0014I 249 OPT 1077.4844 11 0.011998 OA decomposition NLP0014I 250 OPT 950.24456 11 0.011999 OA decomposition NLP0014I 251 OPT 956.54911 13 0.012998 OA decomposition NLP0014I 252 OPT 894.98473 11 0.011998 OA decomposition NLP0014I 253 OPT 921.08454 11 0.010998 OA decomposition NLP0014I 254 OPT 921.00294 12 0.010998 OA decomposition NLP0014I 255 OPT 939.24513 8 0.008999 OA decomposition NLP0014I 256 OPT 942.29627 12 0.012998 OA decomposition NLP0014I 257 OPT 927.85156 11 0.010998 OA decomposition NLP0014I 258 OPT 901.99233 11 0.011998 OA decomposition NLP0014I 259 OPT 975.23611 11 0.011998 OA decomposition NLP0014I 260 OPT 952.75793 14 0.012998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 261 OPT 959.95662 8 0.006999 OA decomposition NLP0014I 262 OPT 963.46596 11 0.009998 OA decomposition NLP0014I 263 OPT 954.79155 12 0.011998 OA decomposition NLP0014I 264 OPT 1021.9363 11 0.009998 OA decomposition NLP0014I 265 OPT 952.11332 10 0.010998 OA decomposition NLP0014I 266 OPT 1013.7239 14 0.012998 OA decomposition NLP0014I 267 OPT 945.9004 13 0.012998 OA decomposition NLP0014I 268 OPT 918.37797 12 0.012998 OA decomposition NLP0014I 269 OPT 958.27879 8 0.008999 OA decomposition NLP0014I 270 OPT 942.13788 13 0.013998 OA decomposition NLP0014I 271 OPT 966.50709 14 0.013998 OA decomposition NLP0014I 272 OPT 1014.8077 13 0.011998 OA decomposition NLP0014I 273 OPT 980.62865 11 0.011998 OA decomposition NLP0014I 274 OPT 1076.7797 13 0.011998 OA decomposition NLP0014I 275 OPT 1011.2099 11 0.010998 OA decomposition NLP0014I 276 OPT 976.68984 10 0.008999 OA decomposition NLP0014I 277 OPT 919.67519 14 0.013998 OA decomposition NLP0014I 278 OPT 922.95107 12 0.011998 OA decomposition NLP0014I 279 OPT 988.25746 11 0.010999 OA decomposition NLP0014I 280 OPT 941.39983 13 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 281 OPT 976.62474 11 0.010998 OA decomposition NLP0014I 282 OPT 990.07114 9 0.009998 OA decomposition NLP0014I 283 OPT 953.36541 12 0.011998 OA decomposition NLP0014I 284 OPT 1042.0477 9 0.009999 OA decomposition NLP0014I 285 OPT 1051.4595 12 0.012998 OA decomposition NLP0014I 286 OPT 995.87634 14 0.013998 OA decomposition NLP0014I 287 OPT 947.22013 12 0.012998 OA decomposition NLP0014I 288 OPT 921.66121 12 0.012998 OA decomposition NLP0014I 289 OPT 978.26873 12 0.011998 OA decomposition NLP0014I 290 OPT 970.56978 11 0.010999 OA decomposition OA0008I OA converged in 186.86259 seconds found solution of value 673.69689 (lower bound 1e+50 ). OA0010I Performed 289 iterations, explored 100566 branch-and-bound nodes in total Cbc0012I Integer solution of 673.69689 found by nonlinear programm after 11 iterations and 0 nodes (186.86 seconds) Cbc0031I 11 added rows had average density of 75.454545 Cbc0013I At root node, 11 cuts changed objective from 296.83259 to 296.83259 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 25 row cuts average 76.3 elements, 0 column cuts (11 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 673.6968872102181, took 11 iterations and 0 nodes (186.86 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 25 cuts of which 11 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 673.697. Best solution: 6.736969e+02 (0 nodes, 187.599 seconds) Best possible: 6.736969e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- uflquad-25-25.gms(1790) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job uflquad-25-25.gms Stop 09/08/12 20:02:13 elapsed 0:03:07.693 @04 1347127333 ----------------------------- Sa 8. Sep 20:02:13 CEST 2012 ----------------------------- =ready= Linux opt226 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/UncapacitatedFacilityLocation/gms/uflquad-25-30.gms =========== ----------------------------- Sa 8. Sep 19:59:05 CEST 2012 ----------------------------- @03 1347127145 --- Job uflquad-25-30.gms Start 09/08/12 19:59:05 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- uflquad-25-30.gms(2139) 2 Mb --- Starting execution: elapsed 0:00:00.021 --- uflquad-25-30.gms(2137) 3 Mb --- Generating MIQCP model m --- uflquad-25-30.gms(2139) 6 Mb --- 781 rows 776 columns 3,026 non-zeroes --- 3,002 nl-code 750 nl-non-zeroes --- 25 discrete-columns --- uflquad-25-30.gms(2139) 3 Mb --- Executing BONMIN: elapsed 0:00:00.028 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 750 Number of nonzeros in inequality constraint Jacobian.: 1500 Number of nonzeros in Lagrangian Hessian.............: 750 Total number of variables............................: 775 variables with only lower bounds: 750 variables with lower and upper bounds: 25 variables with only upper bounds: 0 Total number of equality constraints.................: 30 Total number of inequality constraints...............: 750 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 750 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.9517200e+01 7.50e-01 2.95e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.3194253e+02 4.99e-01 1.97e+00 -2.2 4.08e-02 - 2.24e-01 3.35e-01h 1 2 2.7137369e+02 1.24e-01 1.16e+00 -2.2 1.04e-01 - 4.26e-01 7.52e-01h 1 3 2.8454954e+02 4.27e-02 3.14e-01 -3.6 3.50e-02 - 7.26e-01 6.54e-01h 1 4 2.9694038e+02 4.03e-03 4.35e-02 -4.8 1.60e-02 - 8.71e-01 9.06e-01h 1 5 2.9809154e+02 9.14e-05 3.17e-03 -6.4 3.56e-03 - 9.56e-01 9.77e-01h 1 6 2.9803410e+02 4.44e-16 1.43e-03 -7.0 1.74e-03 - 9.70e-01 1.00e+00h 1 7 2.9801900e+02 4.44e-16 2.51e-05 -7.7 8.55e-04 - 9.99e-01 1.00e+00f 1 8 2.9801681e+02 4.44e-16 7.08e-05 -8.9 3.55e-04 - 9.93e-01 1.00e+00f 1 9 2.9801669e+02 4.44e-16 9.96e-05 -10.8 9.00e-05 - 1.00e+00 9.89e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.9801669e+02 4.44e-16 6.73e+00 -11.0 7.83e-06 - 1.00e+00 2.30e-01f 1 11 2.9801669e+02 4.44e-16 6.12e+01 -9.7 6.07e-06 - 4.29e-02 1.00e+00f 1 12 2.9801669e+02 4.44e-16 4.61e+01 -9.7 5.70e-10 - 1.24e-01 1.00e+00h 1 13 2.9801669e+02 4.44e-16 3.02e-14 -9.7 1.73e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 7.4878565911762450e+01 2.9801669232881460e+02 Dual infeasibility......: 3.0249641311093702e-14 1.2039357241815294e-13 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Complementarity.........: 2.9646390303235642e-10 1.1799263340687787e-09 Overall NLP error.......: 2.9646390303235642e-10 1.1799263340687787e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 Number of equality constraint Jacobian evaluations = 14 Number of inequality constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.047 Total CPU secs in NLP function evaluations = 0.009 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 298.01669 13 0.055991 build initial OA NLP0014I 2 OPT 759.36572 9 0.020997 OA decomposition OA0003I New best feasible of 759.36572 found after 0.070989 sec and NLP0014I 3 OPT 1021.094 11 0.027995 OA decomposition NLP0014I 4 OPT 819.53186 9 0.022996 OA decomposition NLP0014I 5 OPT 864.09565 8 0.021996 OA decomposition NLP0014I 6 OPT 839.57493 10 0.025996 OA decomposition NLP0014I 7 OPT 1416.4188 10 0.025996 OA decomposition NLP0014I 8 OPT 973.23167 10 0.025996 OA decomposition NLP0014I 9 OPT 1089.7914 10 0.026996 OA decomposition NLP0014I 10 OPT 934.45532 8 0.009998 OA decomposition NLP0014I 11 OPT 943.8445 10 0.010998 OA decomposition NLP0014I 12 OPT 850.05392 9 0.010998 OA decomposition NLP0014I 13 OPT 981.26884 10 0.011999 OA decomposition NLP0014I 14 OPT 1125.3977 10 0.011998 OA decomposition NLP0014I 15 OPT 1124.3195 10 0.011998 OA decomposition NLP0014I 16 OPT 1027.8516 10 0.011999 OA decomposition NLP0014I 17 OPT 1113.6747 10 0.010998 OA decomposition NLP0014I 18 OPT 1263.3065 10 0.011999 OA decomposition NLP0014I 19 OPT 1451.8307 10 0.011998 OA decomposition NLP0014I 20 OPT 1130.1032 10 0.011998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 1205.1101 11 0.012998 OA decomposition NLP0014I 22 OPT 985.66791 12 0.013998 OA decomposition NLP0014I 23 OPT 1395.7676 11 0.012998 OA decomposition NLP0014I 24 OPT 1111.7308 11 0.012998 OA decomposition NLP0014I 25 OPT 951.48169 12 0.012998 OA decomposition NLP0014I 26 OPT 1355.0367 11 0.011998 OA decomposition NLP0014I 27 OPT 696.50122 11 0.011998 OA decomposition OA0003I New best feasible of 696.50122 found after 2.296651 sec and NLP0014I 28 OPT 669.83956 12 0.013998 OA decomposition OA0003I New best feasible of 669.83956 found after 2.479623 sec and NLP0014I 29 OPT 689.77004 11 0.012998 OA decomposition NLP0014I 30 OPT 696.98128 11 0.011998 OA decomposition NLP0014I 31 OPT 723.8275 9 0.010998 OA decomposition NLP0014I 32 OPT 744.80188 10 0.011998 OA decomposition NLP0014I 33 OPT 760.11803 12 0.013998 OA decomposition NLP0014I 34 OPT 763.7037 11 0.012998 OA decomposition NLP0014I 35 OPT 747.86055 11 0.011998 OA decomposition NLP0014I 36 OPT 793.03217 11 0.012998 OA decomposition NLP0014I 37 OPT 754.43086 11 0.011999 OA decomposition NLP0014I 38 OPT 761.67362 11 0.012998 OA decomposition NLP0014I 39 OPT 740.10813 11 0.012998 OA decomposition NLP0014I 40 OPT 856.0613 11 0.012998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 754.93552 11 0.011998 OA decomposition NLP0014I 42 OPT 748.46143 11 0.012998 OA decomposition NLP0014I 43 OPT 758.25548 9 0.010998 OA decomposition NLP0014I 44 OPT 717.74068 8 0.009999 OA decomposition NLP0014I 45 OPT 753.51565 11 0.012998 OA decomposition NLP0014I 46 OPT 823.72617 11 0.011998 OA decomposition NLP0014I 47 OPT 779.79409 11 0.012998 OA decomposition NLP0014I 48 OPT 772.78318 12 0.012998 OA decomposition NLP0014I 49 OPT 781.01869 12 0.013998 OA decomposition NLP0014I 50 OPT 748.08398 8 0.009998 OA decomposition NLP0014I 51 OPT 794.21004 10 0.011998 OA decomposition NLP0014I 52 OPT 864.39438 11 0.012998 OA decomposition NLP0014I 53 OPT 815.37416 11 0.012998 OA decomposition NLP0014I 54 OPT 786.98915 9 0.011998 OA decomposition NLP0014I 55 OPT 779.59418 9 0.010998 OA decomposition NLP0014I 56 OPT 828.35055 11 0.012998 OA decomposition NLP0014I 57 OPT 776.18438 8 0.009999 OA decomposition NLP0014I 58 OPT 793.04796 9 0.009999 OA decomposition NLP0014I 59 OPT 803.9985 12 0.013998 OA decomposition NLP0014I 60 OPT 863.202 12 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 824.3258 11 0.012998 OA decomposition NLP0014I 62 OPT 833.29189 12 0.014998 OA decomposition NLP0014I 63 OPT 782.9874 11 0.011998 OA decomposition NLP0014I 64 OPT 831.12174 11 0.012998 OA decomposition NLP0014I 65 OPT 828.29825 9 0.010998 OA decomposition NLP0014I 66 OPT 814.20502 11 0.012998 OA decomposition NLP0014I 67 OPT 818.3778 12 0.011999 OA decomposition NLP0014I 68 OPT 821.89928 11 0.012998 OA decomposition NLP0014I 69 OPT 818.01678 12 0.013998 OA decomposition NLP0014I 70 OPT 816.23958 11 0.012998 OA decomposition NLP0014I 71 OPT 865.09742 12 0.013997 OA decomposition NLP0014I 72 OPT 830.03711 11 0.012998 OA decomposition NLP0014I 73 OPT 843.35803 12 0.012998 OA decomposition NLP0014I 74 OPT 854.09712 12 0.013997 OA decomposition NLP0014I 75 OPT 868.42286 10 0.011998 OA decomposition NLP0014I 76 OPT 856.05288 11 0.012998 OA decomposition NLP0014I 77 OPT 866.83404 11 0.012998 OA decomposition NLP0014I 78 OPT 945.19743 12 0.013998 OA decomposition NLP0014I 79 OPT 846.25522 13 0.013998 OA decomposition NLP0014I 80 OPT 829.78847 11 0.012998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT 807.25114 11 0.012998 OA decomposition NLP0014I 82 OPT 813.62364 11 0.012998 OA decomposition NLP0014I 83 OPT 916.51275 11 0.012998 OA decomposition NLP0014I 84 OPT 846.8563 11 0.013998 OA decomposition NLP0014I 85 OPT 897.99722 9 0.010998 OA decomposition NLP0014I 86 OPT 904.86609 12 0.012998 OA decomposition NLP0014I 87 OPT 968.57833 8 0.009999 OA decomposition NLP0014I 88 OPT 826.25741 11 0.012998 OA decomposition NLP0014I 89 OPT 879.7359 14 0.015998 OA decomposition NLP0014I 90 OPT 863.20262 11 0.012998 OA decomposition NLP0014I 91 OPT 892.30281 11 0.012998 OA decomposition NLP0014I 92 OPT 905.61402 12 0.013998 OA decomposition NLP0014I 93 OPT 854.33882 12 0.011998 OA decomposition NLP0014I 94 OPT 844.03506 11 0.012998 OA decomposition NLP0014I 95 OPT 863.20564 11 0.012998 OA decomposition NLP0014I 96 OPT 836.4382 8 0.009998 OA decomposition NLP0014I 97 OPT 877.46576 13 0.014998 OA decomposition NLP0014I 98 OPT 861.73481 10 0.009999 OA decomposition NLP0014I 99 OPT 859.07829 12 0.014998 OA decomposition NLP0014I 100 OPT 873.9505 12 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT 882.24067 12 0.013998 OA decomposition NLP0014I 102 OPT 895.6346 12 0.013997 OA decomposition NLP0014I 103 OPT 898.41614 12 0.011998 OA decomposition NLP0014I 104 OPT 953.69712 11 0.012998 OA decomposition NLP0014I 105 OPT 970.30318 11 0.012998 OA decomposition NLP0014I 106 OPT 851.03258 10 0.011998 OA decomposition NLP0014I 107 OPT 877.63139 10 0.012998 OA decomposition NLP0014I 108 OPT 881.80115 11 0.013998 OA decomposition NLP0014I 109 OPT 864.63754 11 0.013998 OA decomposition NLP0014I 110 OPT 906.83734 11 0.012998 OA decomposition NLP0014I 111 OPT 917.72051 9 0.011999 OA decomposition NLP0014I 112 OPT 902.93851 12 0.014998 OA decomposition NLP0014I 113 OPT 937.58779 12 0.013998 OA decomposition NLP0014I 114 OPT 856.54868 13 0.014997 OA decomposition NLP0014I 115 OPT 947.81663 12 0.013998 OA decomposition NLP0014I 116 OPT 903.68516 12 0.012998 OA decomposition NLP0014I 117 OPT 900.18234 11 0.012998 OA decomposition NLP0014I 118 OPT 870.47565 11 0.012998 OA decomposition NLP0014I 119 OPT 874.26146 12 0.013998 OA decomposition NLP0014I 120 OPT 947.50308 12 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 121 OPT 919.48954 14 0.016997 OA decomposition NLP0014I 122 OPT 895.12683 11 0.013998 OA decomposition NLP0014I 123 OPT 957.82655 11 0.012998 OA decomposition NLP0014I 124 OPT 971.32223 11 0.011998 OA decomposition NLP0014I 125 OPT 878.6048 12 0.014997 OA decomposition NLP0014I 126 OPT 880.2128 12 0.014998 OA decomposition NLP0014I 127 OPT 904.58402 12 0.014998 OA decomposition NLP0014I 128 OPT 886.1337 11 0.013998 OA decomposition NLP0014I 129 OPT 885.45049 11 0.012998 OA decomposition NLP0014I 130 OPT 895.48142 11 0.011998 OA decomposition NLP0014I 131 OPT 908.78018 13 0.013998 OA decomposition NLP0014I 132 OPT 951.63789 13 0.014998 OA decomposition NLP0014I 133 OPT 945.89558 12 0.013998 OA decomposition NLP0014I 134 OPT 917.94907 12 0.014998 OA decomposition NLP0014I 135 OPT 929.58599 11 0.013998 OA decomposition NLP0014I 136 OPT 865.04225 13 0.014997 OA decomposition NLP0014I 137 OPT 921.91363 12 0.013998 OA decomposition NLP0014I 138 OPT 849.96268 12 0.013998 OA decomposition NLP0014I 139 OPT 946.18035 11 0.012998 OA decomposition NLP0014I 140 OPT 941.56334 11 0.012998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 141 OPT 1033.36 11 0.011998 OA decomposition NLP0014I 142 OPT 941.43455 10 0.009999 OA decomposition NLP0014I 143 OPT 923.04968 12 0.013997 OA decomposition NLP0014I 144 OPT 1044.7436 12 0.013998 OA decomposition NLP0014I 145 OPT 936.07597 10 0.011999 OA decomposition NLP0014I 146 OPT 954.78877 11 0.012998 OA decomposition NLP0014I 147 OPT 993.65863 11 0.011998 OA decomposition NLP0014I 148 OPT 924.65107 8 0.009999 OA decomposition NLP0014I 149 OPT 913.59581 12 0.013998 OA decomposition NLP0014I 150 OPT 919.77497 13 0.013998 OA decomposition NLP0014I 151 OPT 961.33614 13 0.013998 OA decomposition NLP0014I 152 OPT 947.82229 12 0.013998 OA decomposition NLP0014I 153 OPT 981.01086 10 0.010998 OA decomposition NLP0014I 154 OPT 917.87342 10 0.011998 OA decomposition NLP0014I 155 OPT 1005.1265 11 0.012998 OA decomposition NLP0014I 156 OPT 932.71357 12 0.012998 OA decomposition NLP0014I 157 OPT 892.63714 11 0.013998 OA decomposition NLP0014I 158 OPT 907.07994 9 0.009999 OA decomposition NLP0014I 159 OPT 974.68076 10 0.010998 OA decomposition NLP0014I 160 OPT 1046.4132 12 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 161 OPT 944.56021 12 0.014997 OA decomposition NLP0014I 162 OPT 876.31825 11 0.012998 OA decomposition NLP0014I 163 OPT 933.10432 12 0.013998 OA decomposition NLP0014I 164 OPT 990.20199 11 0.012998 OA decomposition NLP0014I 165 OPT 935.64823 10 0.012998 OA decomposition NLP0014I 166 OPT 895.53751 12 0.014998 OA decomposition NLP0014I 167 OPT 950.95222 11 0.012998 OA decomposition NLP0014I 168 OPT 1062.8691 12 0.013998 OA decomposition NLP0014I 169 OPT 923.31464 12 0.013998 OA decomposition NLP0014I 170 OPT 977.47813 12 0.014997 OA decomposition NLP0014I 171 OPT 1030.5989 13 0.013998 OA decomposition NLP0014I 172 OPT 1005.3919 10 0.011999 OA decomposition OA0012I After 100.56871.1f seconds, 172 iterations upper bound 669.832860g, lower bound 606.825840g NLP0014I 173 OPT 967.47287 10 0.012998 OA decomposition NLP0014I 174 OPT 877.4028 13 0.013998 OA decomposition NLP0014I 175 OPT 1007.1536 9 0.010998 OA decomposition NLP0014I 176 OPT 907.82992 10 0.009999 OA decomposition NLP0014I 177 OPT 928.59008 13 0.015998 OA decomposition NLP0014I 178 OPT 942.50721 12 0.014998 OA decomposition NLP0014I 179 OPT 991.76455 11 0.012998 OA decomposition NLP0014I 180 OPT 930.88282 11 0.011998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 181 OPT 918.07626 12 0.011998 OA decomposition NLP0014I 182 OPT 1017.889 12 0.013998 OA decomposition NLP0014I 183 OPT 960.32198 13 0.014998 OA decomposition NLP0014I 184 OPT 919.82072 10 0.011998 OA decomposition NLP0014I 185 OPT 921.86241 12 0.013997 OA decomposition NLP0014I 186 OPT 940.67365 12 0.013998 OA decomposition NLP0014I 187 OPT 909.45338 12 0.012998 OA decomposition NLP0014I 188 OPT 1057.8668 12 0.014998 OA decomposition NLP0014I 189 OPT 1110.609 11 0.012998 OA decomposition NLP0014I 190 OPT 963.21341 12 0.013998 OA decomposition NLP0014I 191 OPT 955.81883 12 0.012998 OA decomposition NLP0014I 192 OPT 963.28593 13 0.015997 OA decomposition NLP0014I 193 OPT 1006.7061 11 0.011998 OA decomposition NLP0014I 194 OPT 916.37467 12 0.011998 OA decomposition NLP0014I 195 OPT 1158.3129 13 0.014998 OA decomposition NLP0014I 196 OPT 962.64776 13 0.012998 OA decomposition NLP0014I 197 OPT 1033.968 12 0.013998 OA decomposition NLP0014I 198 OPT 960.97594 13 0.013998 OA decomposition NLP0014I 199 OPT 1040.3755 8 0.008998 OA decomposition NLP0014I 200 OPT 1039.0478 13 0.014997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 201 OPT 994.13996 11 0.013998 OA decomposition NLP0014I 202 OPT 936.15478 12 0.012998 OA decomposition NLP0014I 203 OPT 1078.2596 12 0.014997 OA decomposition NLP0014I 204 OPT 919.37895 13 0.013998 OA decomposition NLP0014I 205 OPT 1030.6304 11 0.012998 OA decomposition NLP0014I 206 OPT 1058.7857 12 0.013998 OA decomposition NLP0014I 207 OPT 968.60384 11 0.012998 OA decomposition NLP0014I 208 OPT 973.43668 12 0.014997 OA decomposition NLP0014I 209 OPT 982.49042 14 0.015998 OA decomposition NLP0014I 210 OPT 1007.7999 12 0.014998 OA decomposition NLP0014I 211 OPT 946.8396 12 0.013997 OA decomposition NLP0014I 212 OPT 942.09505 13 0.012998 OA decomposition NLP0014I 213 OPT 1058.4516 10 0.011998 OA decomposition NLP0014I 214 OPT 960.944 13 0.015997 OA decomposition NLP0014I 215 OPT 983.59495 13 0.015998 OA decomposition NLP0014I 216 OPT 951.83135 11 0.013998 OA decomposition NLP0014I 217 OPT 948.43722 13 0.014998 OA decomposition NLP0014I 218 OPT 1072.169 13 0.015998 OA decomposition NLP0014I 219 OPT 991.37977 13 0.014998 OA decomposition NLP0014I 220 OPT 925.49219 12 0.013998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 221 OPT 990.1576 12 0.013998 OA decomposition NLP0014I 222 OPT 1006.7579 12 0.012998 OA decomposition NLP0014I 223 OPT 992.02061 12 0.014998 OA decomposition NLP0014I 224 OPT 995.35914 13 0.014998 OA decomposition NLP0014I 225 OPT 1053.1657 9 0.010999 OA decomposition NLP0014I 226 OPT 1033.6766 13 0.014998 OA decomposition NLP0014I 227 OPT 969.95658 10 0.012998 OA decomposition NLP0014I 228 OPT 1020.4441 13 0.015998 OA decomposition NLP0014I 229 OPT 988.36929 12 0.014997 OA decomposition NLP0014I 230 OPT 940.04385 12 0.013998 OA decomposition NLP0014I 231 OPT 949.17191 10 0.011998 OA decomposition NLP0014I 232 OPT 939.6037 13 0.013998 OA decomposition NLP0014I 233 OPT 992.57537 12 0.014998 OA decomposition NLP0014I 234 OPT 933.54863 12 0.012998 OA decomposition NLP0014I 235 OPT 992.2173 11 0.012998 OA decomposition NLP0014I 236 OPT 973.6215 13 0.013998 OA decomposition NLP0014I 237 OPT 1000.394 12 0.013998 OA decomposition NLP0014I 238 OPT 1157.1719 13 0.012998 OA decomposition NLP0014I 239 OPT 785.89607 10 0.010998 OA decomposition NLP0014I 240 OPT 1068.7571 12 0.013997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 241 OPT 1017.9867 12 0.013998 OA decomposition NLP0014I 242 OPT 1099.4847 13 0.014998 OA decomposition NLP0014I 243 OPT 1048.351 13 0.014997 OA decomposition NLP0014I 244 OPT 1015.3093 11 0.011998 OA decomposition NLP0014I 245 OPT 1199.4343 12 0.013998 OA decomposition OA0008I OA converged in 176.78912 seconds found solution of value 669.83956 (lower bound 1e+50 ). OA0010I Performed 244 iterations, explored 78493 branch-and-bound nodes in total Cbc0012I Integer solution of 669.83956 found by nonlinear programm after 8 iterations and 0 nodes (176.77 seconds) Cbc0031I 7 added rows had average density of 85.285714 Cbc0013I At root node, 7 cuts changed objective from 298.01662 to 298.01662 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 26 row cuts average 88.1 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 669.8395600025987, took 8 iterations and 0 nodes (176.77 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 26 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 669.84. Best solution: 6.698396e+02 (0 nodes, 177.505 seconds) Best possible: 6.698396e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- uflquad-25-30.gms(2139) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job uflquad-25-30.gms Stop 09/08/12 20:02:03 elapsed 0:02:57.694 @04 1347127323 ----------------------------- Sa 8. Sep 20:02:03 CEST 2012 ----------------------------- =ready= Linux opt217 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/UncapacitatedFacilityLocation/gms/uflquad-25-40.gms =========== ----------------------------- Sa 8. Sep 19:59:06 CEST 2012 ----------------------------- @03 1347127146 --- Job uflquad-25-40.gms Start 09/08/12 19:59:06 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- uflquad-25-40.gms(2840) 2 Mb --- Starting execution: elapsed 0:00:00.014 --- uflquad-25-40.gms(2838) 3 Mb --- Generating MIQCP model m --- uflquad-25-40.gms(2840) 6 Mb --- 1,041 rows 1,026 columns 4,026 non-zeroes --- 4,002 nl-code 1,000 nl-non-zeroes --- 25 discrete-columns --- uflquad-25-40.gms(2840) 3 Mb --- Executing BONMIN: elapsed 0:00:00.019 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1000 Number of nonzeros in inequality constraint Jacobian.: 2000 Number of nonzeros in Lagrangian Hessian.............: 1000 Total number of variables............................: 1025 variables with only lower bounds: 1000 variables with lower and upper bounds: 25 variables with only upper bounds: 0 Total number of equality constraints.................: 40 Total number of inequality constraints...............: 1000 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1000 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.5798629e+01 7.50e-01 2.05e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6150851e+02 4.31e-01 1.20e+00 -2.4 3.76e-02 - 2.30e-01 4.25e-01h 1 2 2.8280577e+02 1.07e-01 5.77e-01 -2.4 6.78e-02 - 5.57e-01 7.52e-01h 1 3 3.0594057e+02 2.59e-02 1.27e-01 -4.0 2.30e-02 - 7.78e-01 7.58e-01h 1 4 3.1469513e+02 1.93e-03 1.22e-02 -5.7 7.61e-03 - 9.11e-01 9.26e-01h 1 5 3.1536080e+02 2.96e-05 1.04e-03 -7.1 2.66e-03 - 9.67e-01 9.85e-01h 1 6 3.1534898e+02 4.44e-16 2.02e-04 -7.8 1.42e-03 - 9.93e-01 1.00e+00h 1 7 3.1534469e+02 5.55e-16 2.30e-05 -8.3 7.41e-04 - 9.99e-01 1.00e+00f 1 8 3.1534413e+02 4.44e-16 2.92e-14 -8.8 3.77e-04 - 1.00e+00 1.00e+00f 1 9 3.1534402e+02 4.44e-16 3.66e-14 -9.2 1.88e-04 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.1534399e+02 4.44e-16 4.45e-14 -9.9 9.23e-05 - 1.00e+00 1.00e+00f 1 11 3.1534399e+02 4.44e-16 4.94e-14 -10.6 4.26e-05 - 1.00e+00 1.00e+00f 1 12 3.1534399e+02 3.33e-16 6.06e-14 -11.0 1.59e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 8.0650636620438732e+01 3.1534398918591540e+02 Dual infeasibility......: 6.0581376077014721e-14 2.3687318046112753e-13 Constraint violation....: 3.3306690738754696e-16 3.3306690738754696e-16 Complementarity.........: 4.8676362575429277e-09 1.9032457766992845e-08 Overall NLP error.......: 4.8676362575429277e-09 1.9032457766992845e-08 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 13 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 13 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 1 Total CPU secs in IPOPT (w/o function evaluations) = 0.018 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 315.34399 12 0.022997 build initial OA NLP0014I 2 OPT 1061.9566 10 0.014998 OA decomposition OA0003I New best feasible of 1061.9566 found after 0.050992 sec and NLP0014I 3 OPT 1251.4949 10 0.014997 OA decomposition NLP0014I 4 OPT 1314.8575 11 0.015998 OA decomposition NLP0014I 5 OPT 1536.2226 10 0.014997 OA decomposition NLP0014I 6 OPT 1346.5696 10 0.014997 OA decomposition NLP0014I 7 OPT 1474.3943 10 0.032995 OA decomposition NLP0014I 8 OPT 1381.9401 10 0.031995 OA decomposition NLP0014I 9 OPT 1410.4749 10 0.032995 OA decomposition NLP0014I 10 OPT 1430.0255 10 0.032995 OA decomposition NLP0014I 11 OPT 1889.4831 11 0.033995 OA decomposition NLP0014I 12 OPT 1434.2495 11 0.015998 OA decomposition NLP0014I 13 OPT 1072.0799 11 0.015997 OA decomposition NLP0014I 14 OPT 1708.6612 10 0.014998 OA decomposition NLP0014I 15 OPT 1327.2172 10 0.014998 OA decomposition NLP0014I 16 OPT 1545.137 10 0.014997 OA decomposition NLP0014I 17 OPT 1444.7513 11 0.014997 OA decomposition NLP0014I 18 OPT 1228.0767 11 0.016997 OA decomposition NLP0014I 19 OPT 1529.0213 10 0.012998 OA decomposition NLP0014I 20 OPT 1169.2973 10 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT 1424.7687 10 0.015997 OA decomposition NLP0014I 22 OPT 1628.8853 9 0.013998 OA decomposition NLP0014I 23 OPT 1572.1924 10 0.014998 OA decomposition NLP0014I 24 OPT 1377.3868 10 0.014998 OA decomposition NLP0014I 25 OPT 1491.1861 10 0.014998 OA decomposition NLP0014I 26 OPT 1532.9725 11 0.015997 OA decomposition NLP0014I 27 OPT 885.22905 12 0.016997 OA decomposition OA0003I New best feasible of 885.22905 found after 2.208664 sec and NLP0014I 28 OPT 916.60982 13 0.017997 OA decomposition NLP0014I 29 OPT 938.85582 13 0.018997 OA decomposition NLP0014I 30 OPT 840.06058 9 0.013998 OA decomposition OA0003I New best feasible of 840.06058 found after 3.776426 sec and NLP0014I 31 OPT 917.20316 12 0.016997 OA decomposition NLP0014I 32 OPT 878.52821 12 0.017997 OA decomposition NLP0014I 33 OPT 866.79697 9 0.013998 OA decomposition NLP0014I 34 OPT 933.21142 13 0.018998 OA decomposition NLP0014I 35 OPT 866.31168 12 0.015997 OA decomposition NLP0014I 36 OPT 922.83526 12 0.017997 OA decomposition NLP0014I 37 OPT 874.23847 12 0.017997 OA decomposition NLP0014I 38 OPT 896.45629 12 0.017997 OA decomposition NLP0014I 39 OPT 930.92122 12 0.017997 OA decomposition NLP0014I 40 OPT 1002.81 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 OPT 828.16452 11 0.015998 OA decomposition OA0003I New best feasible of 828.16452 found after 11.815204 sec and NLP0014I 42 OPT 945.08018 13 0.017997 OA decomposition NLP0014I 43 OPT 949.20845 12 0.017997 OA decomposition NLP0014I 44 OPT 996.87694 12 0.017997 OA decomposition NLP0014I 45 OPT 897.12912 12 0.017997 OA decomposition NLP0014I 46 OPT 934.65085 12 0.016998 OA decomposition NLP0014I 47 OPT 949.18151 12 0.016998 OA decomposition NLP0014I 48 OPT 873.74672 12 0.017997 OA decomposition NLP0014I 49 OPT 910.35077 12 0.017997 OA decomposition NLP0014I 50 OPT 958.74201 13 0.018997 OA decomposition NLP0014I 51 OPT 880.2201 12 0.017997 OA decomposition NLP0014I 52 OPT 940.35111 12 0.017998 OA decomposition NLP0014I 53 OPT 997.68154 13 0.018997 OA decomposition NLP0014I 54 OPT 895.25161 11 0.016998 OA decomposition NLP0014I 55 OPT 993.04394 11 0.015997 OA decomposition NLP0014I 56 OPT 992.53693 12 0.017998 OA decomposition NLP0014I 57 OPT 931.79819 12 0.017997 OA decomposition NLP0014I 58 OPT 900.32983 13 0.018998 OA decomposition NLP0014I 59 OPT 915.80611 12 0.017998 OA decomposition NLP0014I 60 OPT 927.85467 12 0.017998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT 896.19922 12 0.017997 OA decomposition NLP0014I 62 OPT 945.59123 12 0.016997 OA decomposition NLP0014I 63 OPT 1014.7022 12 0.016998 OA decomposition NLP0014I 64 OPT 1000.7747 13 0.018997 OA decomposition NLP0014I 65 OPT 1022.9776 11 0.015997 OA decomposition NLP0014I 66 OPT 1039.8703 12 0.016997 OA decomposition NLP0014I 67 OPT 964.98643 9 0.013997 OA decomposition NLP0014I 68 OPT 999.64957 13 0.018997 OA decomposition NLP0014I 69 OPT 1054.7395 12 0.016997 OA decomposition NLP0014I 70 OPT 925.76939 9 0.013998 OA decomposition NLP0014I 71 OPT 979.38782 13 0.018997 OA decomposition NLP0014I 72 OPT 1002.2331 12 0.017997 OA decomposition NLP0014I 73 OPT 999.14181 12 0.017998 OA decomposition NLP0014I 74 OPT 985.00153 12 0.017997 OA decomposition NLP0014I 75 OPT 1034.095 12 0.017997 OA decomposition NLP0014I 76 OPT 902.1183 12 0.017997 OA decomposition NLP0014I 77 OPT 1030.8202 12 0.016998 OA decomposition NLP0014I 78 OPT 1037.5717 13 0.018997 OA decomposition NLP0014I 79 OPT 970.36006 12 0.016997 OA decomposition NLP0014I 80 OPT 1017.7961 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT 1080.2436 12 0.016997 OA decomposition NLP0014I 82 OPT 1001.8511 13 0.017997 OA decomposition NLP0014I 83 OPT 979.0703 13 0.015997 OA decomposition NLP0014I 84 OPT 959.78988 12 0.017997 OA decomposition NLP0014I 85 OPT 949.20194 12 0.016997 OA decomposition NLP0014I 86 OPT 1028.4862 13 0.017997 OA decomposition NLP0014I 87 OPT 976.45331 13 0.018998 OA decomposition NLP0014I 88 OPT 897.45454 9 0.012998 OA decomposition NLP0014I 89 OPT 1040.0177 12 0.016997 OA decomposition NLP0014I 90 OPT 966.86418 9 0.012998 OA decomposition NLP0014I 91 OPT 937.74892 12 0.017997 OA decomposition NLP0014I 92 OPT 972.93874 12 0.016997 OA decomposition NLP0014I 93 OPT 944.94682 12 0.017997 OA decomposition NLP0014I 94 OPT 988.15657 12 0.017997 OA decomposition NLP0014I 95 OPT 982.193 12 0.016997 OA decomposition NLP0014I 96 OPT 1048.1375 11 0.014998 OA decomposition NLP0014I 97 OPT 1000.0659 13 0.017998 OA decomposition NLP0014I 98 OPT 1028.6917 12 0.017997 OA decomposition NLP0014I 99 OPT 972.41106 12 0.017998 OA decomposition NLP0014I 100 OPT 1059.3056 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT 1003.9111 12 0.017998 OA decomposition NLP0014I 102 OPT 976.30794 13 0.018997 OA decomposition NLP0014I 103 OPT 977.82348 9 0.012998 OA decomposition NLP0014I 104 OPT 968.23374 12 0.017997 OA decomposition NLP0014I 105 OPT 1030.059 12 0.016998 OA decomposition NLP0014I 106 OPT 1105.6685 12 0.015997 OA decomposition NLP0014I 107 OPT 998.53417 9 0.012998 OA decomposition NLP0014I 108 OPT 1034.4169 12 0.016997 OA decomposition NLP0014I 109 OPT 1026.5292 12 0.017998 OA decomposition OA0012I After 101.49957.1f seconds, 109 iterations upper bound 828.156240g, lower bound 552.166150g NLP0014I 110 OPT 965.38649 12 0.016998 OA decomposition NLP0014I 111 OPT 1105.7065 13 0.018997 OA decomposition NLP0014I 112 OPT 1027.1503 13 0.017997 OA decomposition NLP0014I 113 OPT 1067.4512 11 0.016997 OA decomposition NLP0014I 114 OPT 977.16492 13 0.018997 OA decomposition NLP0014I 115 OPT 1091.8804 12 0.016997 OA decomposition NLP0014I 116 OPT 1051.002 12 0.017997 OA decomposition NLP0014I 117 OPT 1063.2729 13 0.016998 OA decomposition NLP0014I 118 OPT 1056.1998 12 0.017997 OA decomposition NLP0014I 119 OPT 1116.9094 12 0.017997 OA decomposition NLP0014I 120 OPT 1068.7214 12 0.017998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 121 OPT 964.86986 12 0.017997 OA decomposition NLP0014I 122 OPT 1120.5637 12 0.016998 OA decomposition NLP0014I 123 OPT 939.92474 11 0.016998 OA decomposition NLP0014I 124 OPT 991.7163 11 0.016997 OA decomposition NLP0014I 125 OPT 1005.1609 13 0.018997 OA decomposition NLP0014I 126 OPT 1136.0565 12 0.017997 OA decomposition NLP0014I 127 OPT 985.8154 12 0.015997 OA decomposition NLP0014I 128 OPT 1066.5432 12 0.016998 OA decomposition NLP0014I 129 OPT 994.7111 12 0.016997 OA decomposition NLP0014I 130 OPT 1067.7825 12 0.017997 OA decomposition NLP0014I 131 OPT 1020.9126 12 0.017998 OA decomposition NLP0014I 132 OPT 1111.3355 11 0.014998 OA decomposition NLP0014I 133 OPT 997.81073 12 0.017998 OA decomposition NLP0014I 134 OPT 1198.115 9 0.012998 OA decomposition NLP0014I 135 OPT 1070.0359 11 0.015998 OA decomposition NLP0014I 136 OPT 1053.2776 13 0.017997 OA decomposition NLP0014I 137 OPT 1049.2944 13 0.017997 OA decomposition NLP0014I 138 OPT 1097.6734 12 0.017997 OA decomposition NLP0014I 139 OPT 1103.5886 13 0.015998 OA decomposition NLP0014I 140 OPT 1074.6799 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 141 OPT 946.5725 12 0.017997 OA decomposition NLP0014I 142 OPT 1104.0164 8 0.011999 OA decomposition NLP0014I 143 OPT 1038.189 11 0.016997 OA decomposition NLP0014I 144 OPT 964.99423 12 0.016998 OA decomposition NLP0014I 145 OPT 1027.0026 11 0.016997 OA decomposition NLP0014I 146 OPT 1076.6104 12 0.017997 OA decomposition NLP0014I 147 OPT 1031.281 12 0.017997 OA decomposition NLP0014I 148 OPT 1083.9632 12 0.016998 OA decomposition NLP0014I 149 OPT 1077.3385 12 0.017997 OA decomposition NLP0014I 150 OPT 1085.7146 14 0.018997 OA decomposition NLP0014I 151 OPT 1128.4357 12 0.017997 OA decomposition NLP0014I 152 OPT 1013.817 11 0.016997 OA decomposition NLP0014I 153 OPT 1059.9366 13 0.018997 OA decomposition NLP0014I 154 OPT 1079.2431 12 0.017997 OA decomposition NLP0014I 155 OPT 969.32142 12 0.016998 OA decomposition NLP0014I 156 OPT 993.37998 13 0.018997 OA decomposition NLP0014I 157 OPT 988.89065 12 0.016998 OA decomposition NLP0014I 158 OPT 1025.4577 13 0.018998 OA decomposition NLP0014I 159 OPT 1039.3636 12 0.017998 OA decomposition NLP0014I 160 OPT 1095.7605 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 161 OPT 1067.3363 12 0.017997 OA decomposition NLP0014I 162 OPT 1041.2112 13 0.018997 OA decomposition NLP0014I 163 OPT 1012.1282 13 0.017998 OA decomposition OA0012I After 203.35308.1f seconds, 163 iterations upper bound 828.156240g, lower bound 581.04490g NLP0014I 164 OPT 1163.5463 13 0.018997 OA decomposition NLP0014I 165 OPT 1064.3697 12 0.016998 OA decomposition NLP0014I 166 OPT 1133.2552 12 0.016997 OA decomposition NLP0014I 167 OPT 1050.6222 12 0.016997 OA decomposition NLP0014I 168 OPT 1109.3776 12 0.016997 OA decomposition NLP0014I 169 OPT 1118.7274 12 0.017997 OA decomposition NLP0014I 170 OPT 1025.2314 12 0.014998 OA decomposition NLP0014I 171 OPT 1018.4655 11 0.015998 OA decomposition NLP0014I 172 OPT 1034.3683 12 0.017997 OA decomposition NLP0014I 173 OPT 1104.1567 13 0.018997 OA decomposition NLP0014I 174 OPT 1104.1147 13 0.019997 OA decomposition NLP0014I 175 OPT 1033.6634 12 0.017997 OA decomposition NLP0014I 176 OPT 1184.6308 12 0.017997 OA decomposition NLP0014I 177 OPT 1173.8488 12 0.016997 OA decomposition NLP0014I 178 OPT 1121.3897 13 0.018997 OA decomposition NLP0014I 179 OPT 1151.7171 11 0.014998 OA decomposition NLP0014I 180 OPT 1122.225 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 181 OPT 1111.3798 9 0.013998 OA decomposition NLP0014I 182 OPT 1118.0938 13 0.018997 OA decomposition NLP0014I 183 OPT 1091.7173 13 0.018997 OA decomposition NLP0014I 184 OPT 1079.1044 12 0.017998 OA decomposition NLP0014I 185 OPT 1049.0352 13 0.018998 OA decomposition NLP0014I 186 OPT 1030.4272 12 0.017998 OA decomposition NLP0014I 187 OPT 1007.9451 12 0.017997 OA decomposition NLP0014I 188 OPT 1091.5139 13 0.018997 OA decomposition NLP0014I 189 OPT 1065.1747 10 0.014998 OA decomposition NLP0014I 190 OPT 1111.3743 11 0.015998 OA decomposition NLP0014I 191 OPT 1033.0738 12 0.015998 OA decomposition NLP0014I 192 OPT 1052.5241 11 0.016997 OA decomposition NLP0014I 193 OPT 1061.6522 12 0.017998 OA decomposition NLP0014I 194 OPT 1056.2701 9 0.013998 OA decomposition NLP0014I 195 OPT 1055.5606 12 0.017998 OA decomposition NLP0014I 196 OPT 1185.8361 12 0.017997 OA decomposition NLP0014I 197 OPT 1133.3159 12 0.017997 OA decomposition NLP0014I 198 OPT 1155.3762 12 0.017997 OA decomposition NLP0014I 199 OPT 1147.149 13 0.018997 OA decomposition NLP0014I 200 OPT 1075.7552 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 201 OPT 1212.8825 13 0.018997 OA decomposition NLP0014I 202 OPT 1172.4079 12 0.016997 OA decomposition NLP0014I 203 OPT 1120.3526 13 0.018997 OA decomposition NLP0014I 204 OPT 1228.9208 12 0.017997 OA decomposition NLP0014I 205 OPT 1108.1919 13 0.017997 OA decomposition NLP0014I 206 OPT 1090.8774 13 0.017997 OA decomposition NLP0014I 207 OPT 1073.7989 12 0.016997 OA decomposition NLP0014I 208 OPT 1071.4998 13 0.018997 OA decomposition OA0012I After 305.53855.1f seconds, 208 iterations upper bound 828.156240g, lower bound 603.06060g NLP0014I 209 OPT 1155.2854 10 0.014997 OA decomposition NLP0014I 210 OPT 1079.5459 14 0.018997 OA decomposition NLP0014I 211 OPT 1069.7723 13 0.018997 OA decomposition NLP0014I 212 OPT 1048.1517 12 0.016997 OA decomposition NLP0014I 213 OPT 1094.9211 13 0.016997 OA decomposition NLP0014I 214 OPT 1141.6793 11 0.016997 OA decomposition NLP0014I 215 OPT 1167.6175 12 0.017998 OA decomposition NLP0014I 216 OPT 1108.9656 12 0.017997 OA decomposition NLP0014I 217 OPT 1085.0062 12 0.017997 OA decomposition NLP0014I 218 OPT 1181.6737 11 0.016997 OA decomposition NLP0014I 219 OPT 1102.5398 13 0.016998 OA decomposition NLP0014I 220 OPT 1155.1854 11 0.015998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 221 OPT 1084.4171 12 0.017997 OA decomposition NLP0014I 222 OPT 1078.3722 13 0.017997 OA decomposition NLP0014I 223 OPT 1075.306 11 0.014998 OA decomposition NLP0014I 224 OPT 1074.4882 12 0.017997 OA decomposition NLP0014I 225 OPT 1119.2405 12 0.016997 OA decomposition NLP0014I 226 OPT 1309.7798 13 0.018997 OA decomposition NLP0014I 227 OPT 1245.0008 13 0.018997 OA decomposition NLP0014I 228 OPT 1110.1954 13 0.017997 OA decomposition NLP0014I 229 OPT 1148.7885 13 0.019997 OA decomposition NLP0014I 230 OPT 1092.0348 14 0.019997 OA decomposition NLP0014I 231 OPT 1089.4505 13 0.018997 OA decomposition NLP0014I 232 OPT 1175.4044 11 0.016998 OA decomposition NLP0014I 233 OPT 1172.4164 14 0.020997 OA decomposition NLP0014I 234 OPT 1074.7748 11 0.014998 OA decomposition NLP0014I 235 OPT 1099.6385 14 0.019997 OA decomposition NLP0014I 236 OPT 1178.1878 11 0.014998 OA decomposition NLP0014I 237 OPT 1113.2084 12 0.016997 OA decomposition NLP0014I 238 OPT 1153.3414 12 0.017997 OA decomposition NLP0014I 239 OPT 1189.5732 10 0.013998 OA decomposition NLP0014I 240 OPT 1154.8971 13 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 241 OPT 1096.2711 11 0.015998 OA decomposition NLP0014I 242 OPT 1133.5475 11 0.016998 OA decomposition NLP0014I 243 OPT 1240.565 12 0.016997 OA decomposition NLP0014I 244 OPT 1208.3256 12 0.017997 OA decomposition NLP0014I 245 OPT 1298.0147 11 0.014998 OA decomposition NLP0014I 246 OPT 1156.1538 11 0.015997 OA decomposition NLP0014I 247 OPT 1068.3168 11 0.016997 OA decomposition NLP0014I 248 OPT 1213.054 14 0.020997 OA decomposition NLP0014I 249 OPT 1228.3991 11 0.016997 OA decomposition NLP0014I 250 OPT 1174.6254 13 0.016997 OA decomposition OA0012I After 405.76232.1f seconds, 250 iterations upper bound 828.156240g, lower bound 629.853570g NLP0014I 251 OPT 1091.8223 12 0.017997 OA decomposition NLP0014I 252 OPT 1174.2645 11 0.016997 OA decomposition NLP0014I 253 OPT 1108.6518 12 0.017997 OA decomposition NLP0014I 254 OPT 1111.1265 13 0.017997 OA decomposition NLP0014I 255 OPT 1151.2329 11 0.015997 OA decomposition NLP0014I 256 OPT 1150.7656 12 0.017998 OA decomposition NLP0014I 257 OPT 1118.8998 12 0.016997 OA decomposition NLP0014I 258 OPT 1069.1356 12 0.016997 OA decomposition NLP0014I 259 OPT 1199.1082 12 0.017997 OA decomposition NLP0014I 260 OPT 1079.0396 12 0.016998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 261 OPT 1061.3415 13 0.017998 OA decomposition NLP0014I 262 OPT 1179.5673 12 0.017997 OA decomposition NLP0014I 263 OPT 1065.6701 12 0.016998 OA decomposition NLP0014I 264 OPT 1208.7926 12 0.017997 OA decomposition NLP0014I 265 OPT 1128.3244 12 0.016997 OA decomposition NLP0014I 266 OPT 1180.7571 10 0.012998 OA decomposition NLP0014I 267 OPT 1159.6895 12 0.017998 OA decomposition NLP0014I 268 OPT 1184.8322 11 0.015998 OA decomposition NLP0014I 269 OPT 1383.5415 12 0.016998 OA decomposition NLP0014I 270 OPT 1219.0803 12 0.017998 OA decomposition NLP0014I 271 OPT 1246.3713 11 0.016997 OA decomposition NLP0014I 272 OPT 1225.351 12 0.014998 OA decomposition NLP0014I 273 OPT 1220.2115 11 0.015998 OA decomposition NLP0014I 274 OPT 1293.872 12 0.017997 OA decomposition NLP0014I 275 OPT 1165.8797 11 0.015997 OA decomposition NLP0014I 276 OPT 1144.5655 12 0.017997 OA decomposition NLP0014I 277 OPT 1172.2135 13 0.019997 OA decomposition NLP0014I 278 OPT 1143.8448 13 0.018997 OA decomposition NLP0014I 279 OPT 1162.0988 12 0.017997 OA decomposition NLP0014I 280 OPT 1199.5711 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 281 OPT 920.18963 11 0.014998 OA decomposition NLP0014I 282 OPT 1111.7549 12 0.017997 OA decomposition NLP0014I 283 OPT 1241.5012 12 0.016997 OA decomposition NLP0014I 284 OPT 1124.9631 11 0.016997 OA decomposition NLP0014I 285 OPT 1088.4402 12 0.017997 OA decomposition NLP0014I 286 OPT 1283.7636 14 0.018997 OA decomposition NLP0014I 287 OPT 1110.7547 12 0.016997 OA decomposition OA0012I After 505.76411.1f seconds, 287 iterations upper bound 828.156240g, lower bound 669.332240g NLP0014I 288 OPT 1228.7885 13 0.018997 OA decomposition NLP0014I 289 OPT 1109.5311 13 0.018997 OA decomposition NLP0014I 290 OPT 1096.4266 12 0.016997 OA decomposition NLP0014I 291 OPT 1182.4473 13 0.018997 OA decomposition NLP0014I 292 OPT 1263.8287 11 0.015998 OA decomposition NLP0014I 293 OPT 1182.9938 12 0.016997 OA decomposition NLP0014I 294 OPT 1106.1413 13 0.016997 OA decomposition NLP0014I 295 OPT 1163.1265 12 0.017997 OA decomposition NLP0014I 296 OPT 902.60311 11 0.015998 OA decomposition NLP0014I 297 OPT 1167.2009 13 0.017998 OA decomposition NLP0014I 298 OPT 1197.0738 12 0.017997 OA decomposition NLP0014I 299 OPT 1284.6755 11 0.015998 OA decomposition NLP0014I 300 OPT 1179.5496 12 0.016997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 301 OPT 1195.2033 13 0.018997 OA decomposition NLP0014I 302 OPT 1276.9113 12 0.017998 OA decomposition NLP0014I 303 OPT 1202.6728 12 0.017998 OA decomposition NLP0014I 304 OPT 1126.355 12 0.017998 OA decomposition NLP0014I 305 OPT 1248.4987 12 0.017997 OA decomposition NLP0014I 306 OPT 924.17021 12 0.017997 OA decomposition NLP0014I 307 OPT 1239.7182 12 0.016997 OA decomposition NLP0014I 308 OPT 1218.8512 12 0.016998 OA decomposition NLP0014I 309 OPT 1219.4044 12 0.017998 OA decomposition NLP0014I 310 OPT 1268.5258 11 0.015997 OA decomposition NLP0014I 311 OPT 1226.028 13 0.018997 OA decomposition NLP0014I 312 OPT 1144.2309 12 0.016998 OA decomposition NLP0014I 313 OPT 960.3229 11 0.016998 OA decomposition NLP0014I 314 OPT 924.15051 11 0.015997 OA decomposition OA0012I After 606.00987.1f seconds, 314 iterations upper bound 828.156240g, lower bound 713.505950g NLP0014I 315 OPT 1408.317 13 0.016998 OA decomposition NLP0014I 316 OPT 937.65849 11 0.016998 OA decomposition NLP0014I 317 OPT 934.83479 11 0.016998 OA decomposition NLP0014I 318 OPT 933.13527 11 0.015998 OA decomposition NLP0014I 319 OPT 1225.1012 12 0.016997 OA decomposition NLP0014I 320 OPT 936.15148 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 321 OPT 1262.5127 13 0.019997 OA decomposition NLP0014I 322 OPT 1315.4007 12 0.017997 OA decomposition NLP0014I 323 OPT 1257.8391 12 0.017997 OA decomposition NLP0014I 324 OPT 1349.4964 12 0.016997 OA decomposition NLP0014I 325 OPT 931.55432 11 0.016998 OA decomposition NLP0014I 326 OPT 917.50769 11 0.016997 OA decomposition NLP0014I 327 OPT 916.22014 11 0.015998 OA decomposition NLP0014I 328 OPT 1269.4926 12 0.016998 OA decomposition NLP0014I 329 OPT 923.26249 11 0.016997 OA decomposition NLP0014I 330 OPT 965.02692 11 0.015997 OA decomposition NLP0014I 331 OPT 1295.7382 11 0.015997 OA decomposition NLP0014I 332 OPT 1272.8555 11 0.015998 OA decomposition NLP0014I 333 OPT 973.51116 12 0.016997 OA decomposition NLP0014I 334 OPT 1243.5114 12 0.017997 OA decomposition NLP0014I 335 OPT 948.93239 11 0.016998 OA decomposition NLP0014I 336 OPT 956.02646 11 0.015997 OA decomposition NLP0014I 337 OPT 1279.3294 12 0.017998 OA decomposition OA0012I After 710.92492.1f seconds, 337 iterations upper bound 828.156240g, lower bound 737.495030g NLP0014I 338 OPT 975.33853 11 0.014997 OA decomposition NLP0014I 339 OPT 924.13826 11 0.015998 OA decomposition NLP0014I 340 OPT 950.15444 11 0.016998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 341 OPT 966.45226 12 0.017997 OA decomposition NLP0014I 342 OPT 942.54717 11 0.016997 OA decomposition NLP0014I 343 OPT 1316.6283 11 0.015997 OA decomposition NLP0014I 344 OPT 1288.4499 12 0.017997 OA decomposition NLP0014I 345 OPT 942.8855 11 0.014998 OA decomposition NLP0014I 346 OPT 966.0915 11 0.016998 OA decomposition NLP0014I 347 OPT 978.62476 11 0.015997 OA decomposition NLP0014I 348 OPT 955.31749 12 0.017997 OA decomposition NLP0014I 349 OPT 1326.88 12 0.016998 OA decomposition NLP0014I 350 OPT 988.83493 12 0.015998 OA decomposition NLP0014I 351 OPT 1292.8189 11 0.016997 OA decomposition NLP0014I 352 OPT 959.7045 11 0.015998 OA decomposition NLP0014I 353 OPT 958.72052 11 0.015997 OA decomposition NLP0014I 354 OPT 959.98056 11 0.015997 OA decomposition NLP0014I 355 OPT 991.28862 11 0.016997 OA decomposition OA0012I After 812.90042.1f seconds, 355 iterations upper bound 828.156240g, lower bound 750.145670g NLP0014I 356 OPT 945.3626 11 0.016998 OA decomposition NLP0014I 357 OPT 964.48606 11 0.016998 OA decomposition NLP0014I 358 OPT 977.24154 12 0.017997 OA decomposition NLP0014I 359 OPT 970.9433 9 0.013997 OA decomposition NLP0014I 360 OPT 1001.4937 11 0.015997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 361 OPT 1006.33 12 0.017997 OA decomposition NLP0014I 362 OPT 991.43752 11 0.015997 OA decomposition NLP0014I 363 OPT 955.64499 11 0.015998 OA decomposition NLP0014I 364 OPT 1349.7688 13 0.018998 OA decomposition NLP0014I 365 OPT 1005.885 11 0.014998 OA decomposition NLP0014I 366 OPT 936.31593 11 0.016998 OA decomposition NLP0014I 367 OPT 952.91905 11 0.015998 OA decomposition NLP0014I 368 OPT 952.74322 11 0.016997 OA decomposition NLP0014I 369 OPT 1002.6925 9 0.013998 OA decomposition NLP0014I 370 OPT 1005.3587 11 0.015997 OA decomposition NLP0014I 371 OPT 978.21508 11 0.016998 OA decomposition OA0012I After 919.73118.1f seconds, 371 iterations upper bound 828.156240g, lower bound 763.062040g NLP0014I 372 OPT 1007.9297 12 0.017998 OA decomposition NLP0014I 373 OPT 968.60646 11 0.015997 OA decomposition NLP0014I 374 OPT 981.31987 11 0.015998 OA decomposition NLP0014I 375 OPT 974.11312 12 0.016997 OA decomposition NLP0014I 376 OPT 975.97619 12 0.014997 OA decomposition NLP0014I 377 OPT 967.27729 12 0.017997 OA decomposition NLP0014I 378 OPT 980.33082 11 0.015998 OA decomposition NLP0014I 379 OPT 980.9802 11 0.016997 OA decomposition NLP0014I 380 OPT 978.11909 12 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 381 OPT 999.74537 12 0.017997 OA decomposition NLP0014I 382 OPT 1332.6426 10 0.013998 OA decomposition NLP0014I 383 OPT 984.28628 12 0.017998 OA decomposition NLP0014I 384 OPT 956.90743 11 0.015998 OA decomposition NLP0014I 385 OPT 1002.7003 11 0.015997 OA decomposition OA0012I After 1020.1339.1f seconds, 385 iterations upper bound 828.156240g, lower bound 772.157980g NLP0014I 386 OPT 962.03413 12 0.016997 OA decomposition NLP0014I 387 OPT 974.17412 12 0.017997 OA decomposition NLP0014I 388 OPT 982.95039 12 0.016997 OA decomposition NLP0014I 389 OPT 1002.3354 12 0.017997 OA decomposition NLP0014I 390 OPT 974.49881 11 0.015998 OA decomposition NLP0014I 391 OPT 991.29381 12 0.017997 OA decomposition NLP0014I 392 OPT 974.12702 10 0.014998 OA decomposition NLP0014I 393 OPT 1001.5075 12 0.016997 OA decomposition NLP0014I 394 OPT 973.23286 12 0.016997 OA decomposition NLP0014I 395 OPT 1004.2994 12 0.015998 OA decomposition NLP0014I 396 OPT 993.42584 11 0.016997 OA decomposition NLP0014I 397 OPT 1002.0313 12 0.015998 OA decomposition NLP0014I 398 OPT 1024.6679 11 0.015998 OA decomposition OA0012I After 1120.2237.1f seconds, 398 iterations upper bound 828.156240g, lower bound 780.317040g NLP0014I 399 OPT 971.47496 11 0.015997 OA decomposition NLP0014I 400 OPT 989.05536 11 0.016997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 401 OPT 982.85433 11 0.016998 OA decomposition NLP0014I 402 OPT 1022.1276 12 0.017997 OA decomposition NLP0014I 403 OPT 1020.2092 11 0.015998 OA decomposition NLP0014I 404 OPT 991.01781 12 0.016997 OA decomposition NLP0014I 405 OPT 985.73321 11 0.014998 OA decomposition NLP0014I 406 OPT 983.60623 11 0.016997 OA decomposition NLP0014I 407 OPT 996.28624 12 0.017997 OA decomposition NLP0014I 408 OPT 987.20655 12 0.017997 OA decomposition NLP0014I 409 OPT 1006.057 12 0.016997 OA decomposition NLP0014I 410 OPT 971.67585 11 0.016997 OA decomposition OA0012I After 1224.3059.1f seconds, 410 iterations upper bound 828.156240g, lower bound 786.216840g NLP0014I 411 OPT 1000.5823 12 0.014998 OA decomposition NLP0014I 412 OPT 1027.5641 11 0.016998 OA decomposition NLP0014I 413 OPT 1001.0532 11 0.016997 OA decomposition NLP0014I 414 OPT 1012.9579 12 0.017998 OA decomposition NLP0014I 415 OPT 979.08433 11 0.016997 OA decomposition NLP0014I 416 OPT 1001.6768 11 0.015998 OA decomposition NLP0014I 417 OPT 1022.3213 12 0.017997 OA decomposition NLP0014I 418 OPT 981.69271 12 0.015998 OA decomposition NLP0014I 419 OPT 1005.2815 11 0.015997 OA decomposition NLP0014I 420 OPT 1004.9025 11 0.016997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 421 OPT 988.13336 11 0.016997 OA decomposition NLP0014I 422 OPT 1026.5708 11 0.015998 OA decomposition OA0012I After 1331.2966.1f seconds, 422 iterations upper bound 828.156240g, lower bound 790.787860g NLP0014I 423 OPT 1008.8092 11 0.014998 OA decomposition NLP0014I 424 OPT 1011.4364 12 0.016998 OA decomposition NLP0014I 425 OPT 995.934 12 0.017997 OA decomposition NLP0014I 426 OPT 979.04757 11 0.016997 OA decomposition NLP0014I 427 OPT 1000.7557 11 0.015998 OA decomposition NLP0014I 428 OPT 1023.2943 12 0.017998 OA decomposition NLP0014I 429 OPT 997.946 12 0.017997 OA decomposition NLP0014I 430 OPT 989.49157 11 0.016997 OA decomposition NLP0014I 431 OPT 1012.7833 11 0.016998 OA decomposition NLP0014I 432 OPT 992.4018 12 0.017997 OA decomposition NLP0014I 433 OPT 1018.4558 9 0.013998 OA decomposition OA0012I After 1433.2931.1f seconds, 433 iterations upper bound 828.156240g, lower bound 797.134110g NLP0014I 434 OPT 1006.6238 11 0.015997 OA decomposition NLP0014I 435 OPT 1027.9259 12 0.017997 OA decomposition NLP0014I 436 OPT 1006.12 11 0.016997 OA decomposition NLP0014I 437 OPT 1010.6043 12 0.017997 OA decomposition NLP0014I 438 OPT 1023.8017 11 0.014997 OA decomposition NLP0014I 439 OPT 1009.8156 11 0.016997 OA decomposition NLP0014I 440 OPT 1024.8144 13 0.018997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 441 OPT 1017.9548 11 0.014998 OA decomposition OA0012I After 1535.6255.1f seconds, 441 iterations upper bound 828.156240g, lower bound 800.390010g NLP0014I 442 OPT 1022.8255 12 0.017997 OA decomposition NLP0014I 443 OPT 1003.5475 11 0.014998 OA decomposition NLP0014I 444 OPT 1030.6812 8 0.011998 OA decomposition NLP0014I 445 OPT 1012.9477 11 0.016997 OA decomposition NLP0014I 446 OPT 976.82108 11 0.015997 OA decomposition NLP0014I 447 OPT 1017.8554 12 0.017998 OA decomposition NLP0014I 448 OPT 1021.1896 11 0.016997 OA decomposition OA0012I After 1641.1355.1f seconds, 448 iterations upper bound 828.156240g, lower bound 803.880180g NLP0014I 449 OPT 1028.9179 11 0.013998 OA decomposition NLP0014I 450 OPT 1019.4165 12 0.017997 OA decomposition NLP0014I 451 OPT 1032.5706 12 0.017997 OA decomposition NLP0014I 452 OPT 1023.1398 11 0.015997 OA decomposition NLP0014I 453 OPT 1052.8671 11 0.015998 OA decomposition NLP0014I 454 OPT 1054.529 11 0.016997 OA decomposition NLP0014I 455 OPT 993.98891 8 0.012998 OA decomposition NLP0014I 456 OPT 1010.7715 12 0.016997 OA decomposition OA0012I After 1753.3664.1f seconds, 456 iterations upper bound 828.156240g, lower bound 806.472870g NLP0014I 457 OPT 1052.5407 9 0.011999 OA decomposition NLP0014I 458 OPT 1021.2255 11 0.015997 OA decomposition NLP0014I 459 OPT 990.4971 11 0.015997 OA decomposition NLP0014I 460 OPT 1017.8103 12 0.014997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 461 OPT 1021.5838 11 0.015997 OA decomposition NLP0014I 462 OPT 1040.1554 13 0.018997 OA decomposition NLP0014I 463 OPT 1013.1856 11 0.016997 OA decomposition OA0012I After 1862.0819.1f seconds, 463 iterations upper bound 828.156240g, lower bound 809.08390g NLP0014I 464 OPT 1029.5341 12 0.017997 OA decomposition NLP0014I 465 OPT 1001.5135 11 0.015997 OA decomposition NLP0014I 466 OPT 1039.0914 9 0.012998 OA decomposition NLP0014I 467 OPT 993.21212 11 0.015998 OA decomposition NLP0014I 468 OPT 1032.3898 11 0.015998 OA decomposition NLP0014I 469 OPT 1046.388 11 0.015998 OA decomposition NLP0014I 470 OPT 1022.2742 12 0.016998 OA decomposition OA0012I After 1970.5274.1f seconds, 470 iterations upper bound 828.156240g, lower bound 810.884690g NLP0014I 471 OPT 1011.7737 11 0.016997 OA decomposition NLP0014I 472 OPT 1004.0703 11 0.015997 OA decomposition NLP0014I 473 OPT 1029.9613 12 0.017997 OA decomposition NLP0014I 474 OPT 1022.4571 11 0.015997 OA decomposition NLP0014I 475 OPT 1054.5322 13 0.018997 OA decomposition NLP0014I 476 OPT 1001.3233 12 0.017997 OA decomposition NLP0014I 477 OPT 1001.0064 12 0.017998 OA decomposition OA0012I After 2079.4099.1f seconds, 477 iterations upper bound 828.156240g, lower bound 813.166580g NLP0014I 478 OPT 1027.2183 8 0.011998 OA decomposition NLP0014I 479 OPT 1028.9249 11 0.015997 OA decomposition NLP0014I 480 OPT 1006.0368 11 0.015998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 481 OPT 1028.5052 12 0.017997 OA decomposition NLP0014I 482 OPT 1053.9854 11 0.015998 OA decomposition NLP0014I 483 OPT 1015.0797 11 0.015998 OA decomposition OA0012I After 2179.6126.1f seconds, 483 iterations upper bound 828.156240g, lower bound 814.343110g NLP0014I 484 OPT 1021.2542 12 0.016998 OA decomposition NLP0014I 485 OPT 1000.4089 11 0.016998 OA decomposition NLP0014I 486 OPT 1023.5795 11 0.015998 OA decomposition NLP0014I 487 OPT 1004.3636 10 0.015998 OA decomposition NLP0014I 488 OPT 1031.1535 12 0.017997 OA decomposition NLP0014I 489 OPT 1017.4911 11 0.016997 OA decomposition NLP0014I 490 OPT 1061.2316 11 0.016997 OA decomposition OA0012I After 2292.3405.1f seconds, 490 iterations upper bound 828.156240g, lower bound 817.08480g NLP0014I 491 OPT 1035.2161 9 0.013998 OA decomposition NLP0014I 492 OPT 1020.096 11 0.015998 OA decomposition NLP0014I 493 OPT 1016.5914 11 0.016997 OA decomposition NLP0014I 494 OPT 1054.377 11 0.016997 OA decomposition NLP0014I 495 OPT 1038.8819 12 0.016997 OA decomposition NLP0014I 496 OPT 1008.3153 11 0.016997 OA decomposition OA0012I After 2396.0147.1f seconds, 496 iterations upper bound 828.156240g, lower bound 819.411970g NLP0014I 497 OPT 1036.3045 11 0.014998 OA decomposition NLP0014I 498 OPT 1005.5726 11 0.015997 OA decomposition NLP0014I 499 OPT 1017.4974 11 0.015998 OA decomposition NLP0014I 500 OPT 1040.9404 12 0.015997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 501 OPT 1019.4257 12 0.017997 OA decomposition NLP0014I 502 OPT 1018.4552 12 0.015997 OA decomposition OA0012I After 2499.932.1f seconds, 502 iterations upper bound 828.156240g, lower bound 822.210780g NLP0014I 503 OPT 1037.0659 12 0.017997 OA decomposition NLP0014I 504 OPT 1034.9722 12 0.016998 OA decomposition NLP0014I 505 OPT 1060.6302 13 0.018997 OA decomposition NLP0014I 506 OPT 1029.8207 12 0.017997 OA decomposition NLP0014I 507 OPT 1068.9564 8 0.011999 OA decomposition NLP0014I 508 OPT 1047.5856 11 0.014997 OA decomposition OA0012I After 2602.2854.1f seconds, 508 iterations upper bound 828.156240g, lower bound 824.305730g NLP0014I 509 OPT 1033.5787 11 0.016998 OA decomposition NLP0014I 510 OPT 1039.6579 11 0.015998 OA decomposition NLP0014I 511 OPT 1035.7872 12 0.015997 OA decomposition NLP0014I 512 OPT 1043.2356 12 0.016997 OA decomposition NLP0014I 513 OPT 1041.0148 12 0.017997 OA decomposition OA0012I After 2705.6817.1f seconds, 513 iterations upper bound 828.156240g, lower bound 825.148820g NLP0014I 514 OPT 1064.2586 10 0.015997 OA decomposition NLP0014I 515 OPT 1035.9033 11 0.016997 OA decomposition NLP0014I 516 OPT 1023.86 12 0.016997 OA decomposition NLP0014I 517 OPT 1048.6616 11 0.015998 OA decomposition NLP0014I 518 OPT 1073.2692 9 0.013998 OA decomposition OA0012I After 2828.438.1f seconds, 518 iterations upper bound 828.156240g, lower bound 826.700490g NLP0014I 519 OPT 1032.3797 11 0.013998 OA decomposition NLP0014I 520 OPT 1029.5561 12 0.018998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 521 OPT 1062.4192 12 0.016998 OA decomposition NLP0014I 522 OPT 1040.848 11 0.016998 OA decomposition OA0012I After 2931.2794.1f seconds, 522 iterations upper bound 828.156240g, lower bound 828.107590g NLP0014I 523 OPT 1015.7511 11 0.016997 OA decomposition OA0008I OA converged in 2959.4491 seconds found solution of value 828.16452 (lower bound 1e+50 ). OA0010I Performed 522 iterations, explored 702990 branch-and-bound nodes in total Cbc0012I Integer solution of 828.16452 found by nonlinear programm after 12 iterations and 0 nodes (2959.44 seconds) Cbc0031I 9 added rows had average density of 135.22222 Cbc0013I At root node, 9 cuts changed objective from 315.34392 to 315.34392 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 87 row cuts average 142.1 elements, 0 column cuts (9 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 828.1645172885031, took 12 iterations and 0 nodes (2959.44 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 87 cuts of which 9 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 828.165. Best solution: 8.281645e+02 (0 nodes, 2968.3 seconds) Best possible: 8.281645e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- uflquad-25-40.gms(2840) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job uflquad-25-40.gms Stop 09/08/12 20:48:34 elapsed 0:49:28.583 @04 1347130114 ----------------------------- Sa 8. Sep 20:48:34 CEST 2012 ----------------------------- =ready= Linux opt210 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/NetworkDesign/gms/nd-10.gms =========== ----------------------------- Sa 8. Sep 19:59:09 CEST 2012 ----------------------------- @03 1347127149 --- Job nd-10.gms Start 09/08/12 19:59:09 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- nd-10.gms(549) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- nd-10.gms(547) 3 Mb --- Generating MINLP model m --- nd-10.gms(549) 5 Mb --- 178 rows 337 columns 1,289 non-zeroes --- 980 nl-code 280 nl-non-zeroes --- 28 discrete-columns --- nd-10.gms(549) 3 Mb --- Executing BONMIN: elapsed 0:00:00.007 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 560 Number of nonzeros in inequality constraint Jacobian.: 700 Number of nonzeros in Lagrangian Hessian.............: 1540 Total number of variables............................: 336 variables with only lower bounds: 308 variables with lower and upper bounds: 28 variables with only upper bounds: 0 Total number of equality constraints.................: 100 Total number of inequality constraints...............: 77 inequality constraints with only lower bounds: 48 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 29 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.2642979e-01 1.67e+02 3.47e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.5009940e-01 1.67e+02 3.34e+00 1.5 1.56e+03 - 2.89e-04 2.45e-04f 1 2 1.2861670e+00 1.66e+02 1.36e+01 1.5 5.21e+03 - 1.97e-04 4.15e-03f 1 3 4.0072649e+01 3.12e+02 5.05e+02 1.5 6.47e+03 - 7.78e-03 3.12e-01f 1 4 3.9590510e+01 2.76e+02 2.64e+03 1.4 4.05e+01 0.0 9.93e-01 1.22e-01h 1 5 3.9681667e+01 1.95e+02 6.47e+02 1.4 6.16e+01 -0.5 7.04e-01 3.55e-01h 1 6 4.0273689e+01 1.71e+02 4.51e+02 1.0 2.10e+02 -1.0 2.91e-01 1.38e-01h 1 7 4.1396998e+01 1.59e+02 4.17e+02 1.2 2.50e+03 - 8.11e-02 6.56e-02f 1 8 4.2361220e+01 1.44e+02 3.65e+02 1.1 7.12e+02 -1.4 1.26e-01 1.16e-01h 1 9 4.8770965e+01 1.60e+02 2.23e+02 1.2 2.22e+03 - 3.72e-01 4.09e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.9913562e+01 1.69e+02 1.78e+02 1.0 6.49e+02 -1.9 2.04e-01 1.89e-01h 1 11 5.1497195e+01 1.24e+02 1.31e+02 0.9 1.27e+03 - 2.58e-01 2.93e-01f 1 12 5.5072126e+01 5.42e+01 6.78e+01 1.0 1.20e+03 - 4.28e-01 5.80e-01f 1 13 5.5193883e+01 5.77e+01 1.62e+01 0.0 4.40e+02 - 6.65e-01 3.51e-01h 1 14 5.5303300e+01 1.16e-07 2.88e+01 0.0 5.20e+02 - 2.08e-01 1.00e+00f 1 15 5.3771961e+01 9.05e-09 4.32e+00 -2.3 1.03e+01 - 8.83e-01 1.00e+00h 1 16 4.0403959e+01 2.12e-11 1.26e+00 -1.3 9.65e+01 - 6.66e-01 1.00e+00f 1 17 3.5011236e+01 2.74e-11 4.66e-01 -1.9 3.68e+01 - 6.17e-01 6.94e-01f 1 18 3.2596433e+01 2.05e+01 1.83e-01 -2.1 1.46e+02 - 5.24e-01 7.67e-01f 1 19 3.1650373e+01 2.05e+01 8.47e-02 -2.3 2.20e+02 - 5.59e-01 5.80e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 3.1183809e+01 1.04e+01 1.41e-01 -2.4 3.31e+02 - 5.84e-01 4.75e-01h 1 21 3.0827812e+01 1.69e+00 9.58e-02 -2.5 3.50e+02 - 4.93e-01 5.97e-01h 1 22 3.0498415e+01 7.32e-12 1.49e-02 -2.5 4.39e+02 - 7.46e-01 7.19e-01h 1 23 3.0241855e+01 4.46e-12 2.52e-02 -2.9 6.95e+02 - 6.09e-01 5.62e-01h 1 24 3.0004235e+01 2.29e-12 5.96e-02 -3.2 6.28e+02 - 3.77e-01 6.38e-01h 1 25 2.9863554e+01 2.35e-12 1.54e-02 -3.4 5.82e+02 - 7.29e-01 7.26e-01h 1 26 2.9774682e+01 1.46e-12 1.55e-02 -4.5 2.67e+02 - 6.54e-01 7.38e-01h 1 27 2.9750411e+01 5.67e-13 5.11e-03 -5.2 1.83e+02 - 7.82e-01 6.15e-01h 1 28 2.9740838e+01 9.06e-13 1.43e-01 -4.7 1.64e+03 - 5.29e-01 9.34e-01h 1 29 2.9735535e+01 4.73e-13 1.63e-02 -5.7 2.96e+02 - 5.40e-01 9.75e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 2.9735336e+01 2.74e-13 1.03e-02 -6.0 3.60e+02 - 6.37e-01 4.19e-01h 1 31 2.9735240e+01 2.03e-13 9.47e-03 -7.8 1.73e+01 - 9.88e-01 2.56e-01h 1 32 2.9734968e+01 2.84e-14 3.36e-04 -10.9 2.31e+00 - 9.80e-01 9.65e-01h 1 33 2.9734958e+01 2.84e-14 7.76e-08 -11.0 3.17e+01 - 9.99e-01 1.00e+00h 1 34 2.9734958e+01 5.68e-14 6.35e-09 -11.0 1.54e-06 -2.4 1.00e+00 1.00e+00h 1 Number of Iterations....: 34 (scaled) (unscaled) Objective...............: 2.9734958491059295e+01 2.9734958491059295e+01 Dual infeasibility......: 6.3454550526152806e-09 6.3454550526152806e-09 Constraint violation....: 5.6843418860808015e-14 5.6843418860808015e-14 Complementarity.........: 1.0000448124072217e-11 1.0000448124072217e-11 Overall NLP error.......: 6.3454550526152806e-09 6.3454550526152806e-09 Number of objective function evaluations = 35 Number of objective gradient evaluations = 35 Number of equality constraint evaluations = 35 Number of inequality constraint evaluations = 35 Number of equality constraint Jacobian evaluations = 35 Number of inequality constraint Jacobian evaluations = 35 Number of Lagrangian Hessian evaluations = 34 Total CPU secs in IPOPT (w/o function evaluations) = 0.135 Total CPU secs in NLP function evaluations = 0.009 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 29.734958 34 0.143979 build initial OA NLP0014I 2 INFEAS 19.956525 34 0.096985 OA decomposition NLP0014I 3 INFEAS 18 46 0.13398 OA decomposition NLP0014I 4 INFEAS 25.64601 43 0.12598 OA decomposition NLP0014I 5 INFEAS 25 44 0.121982 OA decomposition NLP0014I 6 INFEAS 7.6301144 41 0.115982 OA decomposition NLP0014I 7 INFEAS 0.97470518 69 0.219966 OA decomposition NLP0014I 8 INFEAS 1.0559625 39 0.113983 OA decomposition NLP0014I 9 INFEAS 2.9449747 72 0.232965 OA decomposition NLP0014I 10 INFEAS 2.0037567 38 0.111983 OA decomposition NLP0014I 11 OPT 52.461082 23 0.079988 OA decomposition OA0003I New best feasible of 52.461082 found after 34.047824 sec and OA0008I OA converged in 34.047824 seconds found solution of value 52.461082 (lower bound 1e+50 ). OA0010I Performed 10 iterations, explored 18786 branch-and-bound nodes in total Cbc0012I Integer solution of 52.461082 found by nonlinear programm after 0 iterations and 0 nodes (34.04 seconds) Cbc0013I At root node, 0 cuts changed objective from 29.734958 to 29.734958 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 52.461081827, took 0 iterations and 0 nodes (34.04 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 52.4611. Best solution: 5.246108e+01 (0 nodes, 34.293 seconds) Best possible: 5.246108e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- nd-10.gms(549) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job nd-10.gms Stop 09/08/12 19:59:43 elapsed 0:00:34.499 @04 1347127183 ----------------------------- Sa 8. Sep 19:59:43 CEST 2012 ----------------------------- =ready= Linux opt225 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/NetworkDesign/gms/nd-12.gms =========== ----------------------------- Sa 8. Sep 19:59:09 CEST 2012 ----------------------------- @03 1347127149 --- Job nd-12.gms Start 09/08/12 19:59:09 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- nd-12.gms(833) 2 Mb --- Starting execution: elapsed 0:00:00.014 --- nd-12.gms(831) 3 Mb --- Generating MINLP model m --- nd-12.gms(833) 5 Mb --- 250 rows 561 columns 2,161 non-zeroes --- 1,640 nl-code 480 nl-non-zeroes --- 40 discrete-columns --- nd-12.gms(833) 3 Mb --- Executing BONMIN: elapsed 0:00:00.018 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 960 Number of nonzeros in inequality constraint Jacobian.: 1160 Number of nonzeros in Lagrangian Hessian.............: 3120 Total number of variables............................: 560 variables with only lower bounds: 520 variables with lower and upper bounds: 40 variables with only upper bounds: 0 Total number of equality constraints.................: 144 Total number of inequality constraints...............: 105 inequality constraints with only lower bounds: 64 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 41 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0175592e+00 1.79e+02 4.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0318344e+00 1.79e+02 3.90e+00 1.4 2.07e+03 - 1.55e-04 1.19e-04f 1 2 1.1708907e+00 1.79e+02 5.96e+00 1.4 3.93e+03 - 2.12e-04 1.02e-03f 1 3 6.3857731e+01 2.35e+02 8.44e+02 1.4 9.83e+03 - 8.38e-04 3.47e-01f 1 4 6.3416950e+01 2.20e+02 1.65e+03 1.4 7.52e+01 0.0 4.85e-01 6.89e-02h 1 5 6.2572713e+01 1.68e+02 5.83e+02 1.4 1.07e+02 -0.5 9.04e-01 2.62e-01h 1 6 6.6905355e+01 9.35e+01 3.27e+02 0.9 3.03e+03 - 2.38e-01 4.41e-01h 1 7 6.6938735e+01 9.21e+01 3.05e+02 1.1 1.16e+02 -1.0 6.56e-01 1.49e-02h 1 8 7.3453973e+01 1.19e+02 1.12e+02 0.8 2.80e+03 - 2.65e-01 6.08e-01h 1 9 7.3487203e+01 1.17e+02 2.13e+02 0.5 1.23e+02 -1.4 8.69e-01 1.86e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 7.7494893e+01 1.98e+02 8.79e+01 0.3 1.81e+03 - 3.62e-01 9.50e-01h 1 11 7.7317690e+01 1.64e+02 6.92e+01 -1.3 2.13e+01 -1.9 8.59e-01 1.73e-01h 1 12 7.3388909e+01 1.86e+01 3.04e+00 -1.3 1.50e+01 -2.4 8.87e-01 9.53e-01h 1 13 5.7371847e+01 7.13e+00 5.58e+02 -1.0 5.03e+02 - 8.00e-01 2.69e-01f 1 14 4.9985754e+01 7.67e-03 1.73e+02 -2.1 1.07e+02 - 6.21e-01 6.82e-01f 1 15 4.8670711e+01 3.89e-03 1.07e+02 -2.4 7.85e+01 - 6.25e-01 4.93e-01h 1 16 4.7149324e+01 1.44e-03 3.90e+01 -2.4 1.92e+02 - 6.27e-01 6.30e-01h 1 17 4.6285374e+01 8.47e-04 9.74e+01 -2.3 1.60e+03 - 5.00e-01 4.12e-01h 1 18 4.5962741e+01 3.77e-04 4.71e+01 -3.0 2.74e+00 -2.9 5.82e-01 5.55e-01h 1 19 4.5673350e+01 2.04e-04 2.22e+01 -3.0 6.64e+00 -3.3 4.47e-01 4.58e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 4.5063993e+01 8.85e-05 9.70e+01 -2.8 1.68e+01 -3.8 6.86e-01 5.67e-01h 1 21 4.4506321e+01 5.04e-05 1.54e+02 -2.9 3.98e+01 -4.3 6.14e-01 4.30e-01h 1 22 4.4231943e+01 4.23e-05 1.60e+02 -3.0 1.50e+02 -4.8 2.65e-01 1.60e-01h 1 23 4.3868007e+01 7.68e-02 1.04e+02 -3.3 2.28e+01 -4.3 6.57e-01 4.81e-01h 1 24 4.3712095e+01 1.19e-01 1.56e+02 -3.3 5.60e+01 -4.8 6.52e-01 2.15e-01h 1 25 4.3584446e+01 4.33e-01 1.70e+02 -3.4 1.05e+02 -5.3 4.67e-01 1.53e-01h 1 26 4.3418931e+01 1.27e+00 1.30e+02 -3.3 2.16e+02 -5.8 5.56e-02 1.54e-01h 1 27r 4.3418931e+01 1.27e+00 1.00e+03 1.1 0.00e+00 - 0.00e+00 3.28e-06R 9 28r 4.3568978e+01 4.38e-01 1.00e+03 1.1 1.26e+04 - 3.14e-04 2.90e-04f 1 29r 4.4061995e+01 1.38e-01 9.99e+02 1.3 1.45e+04 - 2.99e-04 6.13e-04f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30r 4.5703818e+01 5.30e-01 9.98e+02 1.4 1.53e+04 - 7.65e-04 1.29e-03f 1 31r 5.0237863e+01 2.99e-04 9.95e+02 1.6 1.86e+04 - 2.14e-03 2.47e-03f 1 32 5.2387242e+01 1.58e-04 3.28e+03 1.5 1.97e+04 - 3.42e-02 1.68e-02f 1 33 6.1246284e+01 5.24e+01 5.10e+03 1.5 9.80e+03 - 1.24e-01 1.07e-01f 1 34 8.7906849e+01 6.64e+01 2.85e+03 1.5 7.22e+03 - 4.01e-01 4.87e-01f 1 35 8.5688000e+01 1.59e+01 8.48e+03 1.5 3.51e+03 - 9.61e-01 7.22e-01f 1 36 8.7468138e+01 4.76e-04 1.57e-01 1.5 2.50e+03 - 1.00e+00 1.00e+00f 1 37 8.7437349e+01 7.38e-05 5.31e-02 0.8 6.24e+01 - 1.00e+00 1.00e+00h 1 38 8.6636878e+01 7.58e-07 3.35e+00 -2.4 2.23e+00 - 9.04e-01 9.91e-01f 1 39 7.6101782e+01 1.58e-06 3.06e+02 -1.0 5.56e+01 - 6.37e-01 9.44e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 7.1186672e+01 3.46e-06 4.38e-03 -0.7 1.45e+02 - 1.00e+00 1.00e+00f 1 41 6.4986046e+01 6.82e-07 2.34e+01 -1.4 7.36e+01 - 8.97e-01 1.00e+00f 1 42 5.4505753e+01 6.69e+01 1.49e+01 -1.4 5.26e+02 - 8.40e-01 7.59e-01h 1 43 5.3982502e+01 6.85e-07 2.54e-04 -1.4 1.95e+02 - 1.00e+00 1.00e+00h 1 44 5.3975676e+01 6.84e-07 1.07e-05 -1.4 5.14e+01 - 1.00e+00 1.00e+00h 1 45 5.0326910e+01 4.59e-07 7.43e+00 -2.1 2.02e+02 - 5.70e-01 4.22e-01f 1 46 4.7980592e+01 3.30e-07 2.71e-04 -1.7 1.47e+02 - 1.00e+00 1.00e+00h 1 47 4.8010819e+01 3.30e-07 1.05e-05 -1.7 1.48e+01 - 1.00e+00 1.00e+00h 1 48 4.5645803e+01 1.95e-07 1.70e+00 -2.5 3.01e+02 - 5.68e-01 4.94e-01f 1 49 4.4858496e+01 1.56e-07 1.25e+01 -2.1 1.79e+02 - 1.00e+00 8.27e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 4.4802861e+01 1.47e-07 9.88e-06 -2.1 6.74e+01 - 1.00e+00 1.00e+00h 1 51 4.3897009e+01 9.47e-08 2.43e+00 -2.8 3.60e+02 - 6.25e-01 4.34e-01h 1 52 4.3341969e+01 6.52e-08 1.75e-04 -2.4 2.24e+02 - 1.00e+00 1.00e+00h 1 53 4.2486061e+01 6.99e+01 1.61e+00 -3.3 6.07e+02 - 4.32e-01 7.66e-01h 1 54 4.2040445e+01 2.36e+02 1.70e+00 -3.9 8.97e+02 - 4.66e-01 9.11e-01h 1 55 4.1942284e+01 5.12e+01 6.67e-01 -4.4 7.60e+02 - 7.07e-01 1.00e+00h 1 56 4.1933239e+01 2.64e+01 7.17e-01 -4.3 4.71e+02 - 4.25e-01 7.69e-01h 1 57 4.1918949e+01 1.76e+01 1.62e-01 -5.3 3.84e+02 - 8.71e-01 6.58e-01h 1 58 4.1908227e+01 1.67e+01 1.01e-01 -6.5 3.12e+02 - 7.37e-01 9.11e-01h 1 59 4.1907237e+01 4.61e+00 3.88e-01 -7.4 5.94e+01 - 9.58e-01 7.32e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 4.1906874e+01 4.20e-01 1.95e-01 -9.5 1.72e+01 - 9.80e-01 9.14e-01h 1 61 4.1906846e+01 2.27e-02 4.35e-01 -10.4 1.06e+00 -6.3 9.91e-01 9.47e-01h 1 62 4.1906842e+01 2.88e-03 1.84e+00 -11.0 4.06e-01 - 9.92e-01 8.74e-01h 1 In iteration 62, 6 Slacks too small, adjusting variable bounds 63 4.1906842e+01 2.08e-05 1.73e-01 -11.0 5.64e-03 -6.7 1.00e+00 9.92e-01h 1 In iteration 63, 8 Slacks too small, adjusting variable bounds 64 4.1906842e+01 2.84e-14 6.98e-11 -11.0 1.13e-03 -7.2 1.00e+00 1.00e+00h 1 Number of Iterations....: 64 (scaled) (unscaled) Objective...............: 4.1906842053128138e+01 4.1906842053128138e+01 Dual infeasibility......: 6.9800011949587298e-11 6.9800011949587298e-11 Constraint violation....: 2.8421709430404007e-14 2.8421709430404007e-14 Complementarity.........: 1.0833376900229202e-11 1.0833376900229202e-11 Overall NLP error.......: 4.3424522511962777e-12 6.9800011949587298e-11 Number of objective function evaluations = 74 Number of objective gradient evaluations = 61 Number of equality constraint evaluations = 74 Number of inequality constraint evaluations = 74 Number of equality constraint Jacobian evaluations = 65 Number of inequality constraint Jacobian evaluations = 65 Number of Lagrangian Hessian evaluations = 64 Total CPU secs in IPOPT (w/o function evaluations) = 1.229 Total CPU secs in NLP function evaluations = 0.048 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 41.906842 64 1.276805 build initial OA NLP0014I 2 INFEAS 27.949862 48 0.39394 OA decomposition NLP0014I 3 INFEAS 24.832286 47 0.390941 OA decomposition NLP0014I 4 OPT 56.669621 21 0.177973 OA decomposition OA0003I New best feasible of 56.669621 found after 11.024324 sec and OA0008I OA converged in 11.024324 seconds found solution of value 56.669621 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 2744 branch-and-bound nodes in total Cbc0012I Integer solution of 56.669621 found by nonlinear programm after 5 iterations and 0 nodes (11.01 seconds) Cbc0031I 2 added rows had average density of 13 Cbc0013I At root node, 2 cuts changed objective from 41.906842 to 41.906842 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 8 row cuts average 13.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 56.66962061, took 5 iterations and 0 nodes (11.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 8 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 56.6696. Best solution: 5.666962e+01 (0 nodes, 11.076 seconds) Best possible: 5.666962e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- nd-12.gms(833) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job nd-12.gms Stop 09/08/12 19:59:21 elapsed 0:00:12.472 @04 1347127161 ----------------------------- Sa 8. Sep 19:59:21 CEST 2012 ----------------------------- =ready= Linux opt231 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/NetworkDesign/gms/nd-13.gms =========== ----------------------------- Sa 8. Sep 19:59:10 CEST 2012 ----------------------------- @03 1347127150 --- Job nd-13.gms Start 09/08/12 19:59:10 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- nd-13.gms(932) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- nd-13.gms(930) 3 Mb --- Generating MINLP model m --- nd-13.gms(932) 5 Mb --- 285 rows 661 columns 2,553 non-zeroes --- 1,936 nl-code 572 nl-non-zeroes --- 44 discrete-columns --- nd-13.gms(932) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1144 Number of nonzeros in inequality constraint Jacobian.: 1364 Number of nonzeros in Lagrangian Hessian.............: 4004 Total number of variables............................: 660 variables with only lower bounds: 616 variables with lower and upper bounds: 44 variables with only upper bounds: 0 Total number of equality constraints.................: 169 Total number of inequality constraints...............: 115 inequality constraints with only lower bounds: 70 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 45 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0605539e+00 2.36e+02 3.74e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0896113e+00 2.36e+02 3.61e+00 1.5 2.42e+03 - 2.67e-04 2.21e-04f 1 2 1.2780147e+00 2.36e+02 6.00e+00 1.5 8.43e+03 - 1.65e-04 1.09e-03f 1 3 7.1890335e+01 2.26e+02 8.17e+02 1.5 1.28e+04 - 1.84e-03 3.69e-01f 1 4 7.0657173e+01 1.96e+02 1.10e+03 1.4 3.85e+01 0.0 3.33e-01 1.35e-01h 1 5 6.9507437e+01 1.61e+02 8.26e+02 1.4 2.23e+02 -0.5 2.51e-01 1.91e-01h 1 6 6.8839332e+01 1.44e+02 5.07e+02 1.1 4.53e+01 -0.1 5.22e-01 1.10e-01h 1 7 6.8836357e+01 1.30e+02 4.59e+02 1.2 3.12e+02 -0.5 2.75e-01 9.83e-02h 1 8 6.8710816e+01 1.23e+02 4.43e+02 1.5 1.44e+02 -0.1 5.45e-01 5.33e-02h 1 9 6.8856649e+01 1.14e+02 4.98e+02 1.5 2.56e+02 -0.6 5.77e-01 9.06e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.9488550e+01 1.08e+02 4.34e+02 1.5 7.27e+02 -1.1 1.24e-01 1.28e-01h 1 11 7.9363399e+01 1.33e+02 3.73e+02 1.4 4.58e+03 - 1.95e-01 6.04e-01f 1 12 8.8133927e+01 4.33e+01 1.86e+02 1.5 3.03e+03 - 5.89e-01 1.00e+00f 1 13 8.7687047e+01 1.59e+00 3.95e+01 -0.5 2.22e+01 -1.5 8.32e-01 1.00e+00h 1 14 8.5970318e+01 4.46e-08 3.84e+00 -0.8 4.59e+01 - 9.07e-01 1.00e+00h 1 15 6.7531582e+01 2.15e+00 5.15e-01 -0.6 4.92e+02 - 8.66e-01 1.00e+00f 1 16 5.5094818e+01 2.12e+01 3.77e-01 -1.3 6.16e+02 - 5.54e-01 9.32e-01f 1 17 4.7925711e+01 2.84e+01 2.42e-01 -1.9 2.59e+02 - 5.83e-01 8.72e-01h 1 18 4.4955639e+01 1.23e+01 9.60e-02 -2.0 5.41e+02 - 5.08e-01 6.89e-01h 1 19 4.2603534e+01 1.26e+01 6.85e-02 -2.1 7.16e+02 - 6.53e-01 7.66e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 4.0641900e+01 1.41e+01 2.63e-02 -2.5 5.51e+02 - 5.99e-01 6.15e-01h 1 21 3.9803961e+01 6.11e-12 4.60e-02 -2.5 4.86e+02 - 5.32e-01 5.94e-01h 1 22 3.9204572e+01 3.97e-12 3.30e-02 -2.7 4.45e+02 - 4.84e-01 5.13e-01h 1 23 3.8434152e+01 1.14e+01 6.96e-02 -3.0 5.63e+02 - 4.98e-01 7.17e-01h 1 24 3.8245787e+01 2.37e-12 4.36e-02 -3.2 9.46e+02 - 5.38e-01 3.80e-01h 1 25 3.8047883e+01 2.15e-12 7.68e-02 -3.5 9.98e+02 - 8.34e-01 4.32e-01h 1 26 3.7900439e+01 1.44e-12 5.33e-02 -3.7 4.36e+03 - 6.37e-01 4.60e-01h 1 27 3.7750612e+01 7.99e-13 1.37e-02 -3.9 6.83e+03 - 7.53e-01 7.50e-01h 1 28 3.7709352e+01 5.44e-13 9.40e-03 -4.4 2.71e+03 - 5.08e-01 4.84e-01h 1 29 3.7686474e+01 4.26e-13 5.34e-03 -4.3 7.60e+02 - 6.08e-01 6.01e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 3.7654445e+01 1.48e-13 1.23e-02 -5.4 1.24e+01 - 6.34e-01 8.89e-01h 1 31 3.7649029e+01 5.68e-14 1.38e-02 -6.4 1.14e+01 - 6.34e-01 9.58e-01h 1 32 3.7648856e+01 2.84e-14 2.41e-03 -6.3 1.16e+01 - 9.30e-01 7.10e-01h 1 33 3.7648678e+01 2.84e-14 5.22e-03 -8.5 7.20e-01 - 9.80e-01 6.50e-01h 1 34 3.7648636e+01 7.99e-14 3.31e-02 -7.2 7.06e-03 -2.0 5.15e-01 6.94e-01h 1 35 3.7648600e+01 5.68e-14 1.30e-02 -8.2 5.92e-03 -2.5 1.00e+00 7.91e-01h 1 36 3.7648589e+01 2.84e-14 1.85e-02 -9.3 1.50e-02 -3.0 4.18e-01 7.58e-01h 1 37 3.7648587e+01 5.68e-14 2.28e-02 -9.3 2.87e-02 -3.4 1.00e+00 3.95e-01h 1 38 3.7648586e+01 5.68e-14 2.32e-02 -9.0 8.31e-02 -3.9 1.00e+00 2.39e-01h 1 39 3.7648585e+01 2.84e-14 2.66e-02 -8.9 1.23e-01 -4.4 1.00e+00 3.97e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 3.7648584e+01 2.84e-14 2.57e-02 -9.0 3.62e-01 -4.9 1.00e+00 1.03e-01h 1 41 3.7648583e+01 2.84e-14 1.01e-01 -8.9 4.47e-01 -5.4 1.00e+00 3.76e-02h 1 42 3.7648582e+01 2.84e-14 8.43e-02 -9.1 3.94e-01 -5.8 1.00e+00 1.00e-01h 1 43 3.7648581e+01 5.68e-14 2.18e-02 -10.7 3.87e-03 -5.4 1.00e+00 7.32e-01h 1 44 3.7648580e+01 5.68e-14 1.66e-04 -11.0 2.58e-04 -5.9 1.00e+00 9.92e-01h 1 45 3.7648580e+01 5.68e-14 6.19e-11 -11.0 2.20e-06 -4.5 1.00e+00 1.00e+00h 1 Number of Iterations....: 45 (scaled) (unscaled) Objective...............: 3.7648580363459793e+01 3.7648580363459793e+01 Dual infeasibility......: 6.1928779996633911e-11 6.1928779996633911e-11 Constraint violation....: 5.6843418860808015e-14 5.6843418860808015e-14 Complementarity.........: 1.2770955599495139e-11 1.2770955599495139e-11 Overall NLP error.......: 6.1928779996633911e-11 6.1928779996633911e-11 Number of objective function evaluations = 46 Number of objective gradient evaluations = 46 Number of equality constraint evaluations = 46 Number of inequality constraint evaluations = 46 Number of equality constraint Jacobian evaluations = 46 Number of inequality constraint Jacobian evaluations = 46 Number of Lagrangian Hessian evaluations = 45 Total CPU secs in IPOPT (w/o function evaluations) = 1.097 Total CPU secs in NLP function evaluations = 0.046 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 37.64858 45 1.142827 build initial OA NLP0014I 2 INFEAS 103.36768 50 0.498924 OA decomposition NLP0014I 3 INFEAS 36 54 0.506923 OA decomposition OA0012I After 110.07227.1f seconds, 3 iterations upper bound 1e+500g, lower bound 58.7745350g NLP0014I 4 INFEAS 46.712904 53 0.503923 OA decomposition NLP0014I 5 INFEAS 42.269251 46 0.470928 OA decomposition OA0012I After 222.28021.1f seconds, 5 iterations upper bound 1e+500g, lower bound 61.6583870g NLP0014I 6 INFEAS 20.245898 48 0.520921 OA decomposition NLP0014I 7 INFEAS 24.072 49 0.509923 OA decomposition NLP0014I 8 INFEAS 0.084488706 60 0.688895 OA decomposition OA0012I After 366.57627.1f seconds, 8 iterations upper bound 1e+500g, lower bound 62.0961970g NLP0014I 9 INFEAS 2.6898507 47 0.498924 OA decomposition NLP0014I 10 INFEAS 16.959779 56 0.588911 OA decomposition OA0012I After 500.54291.1f seconds, 10 iterations upper bound 1e+500g, lower bound 62.4562690g NLP0014I 11 INFEAS 10.544181 44 0.445933 OA decomposition NLP0014I 12 INFEAS 0.68641371 45 0.468929 OA decomposition OA0012I After 671.92885.1f seconds, 12 iterations upper bound 1e+500g, lower bound 62.4827510g NLP0014I 13 INFEAS 1.174631 45 0.478927 OA decomposition NLP0014I 14 INFEAS 13.625379 52 0.515922 OA decomposition OA0012I After 849.83781.1f seconds, 14 iterations upper bound 1e+500g, lower bound 62.6910440g NLP0014I 15 INFEAS 6.2945254 41 0.436934 OA decomposition OA0012I After 964.90631.1f seconds, 15 iterations upper bound 1e+500g, lower bound 63.005050g NLP0014I 16 OPT 63.00505 23 0.316952 OA decomposition OA0003I New best feasible of 63.00505 found after 965.22426 sec and OA0008I OA converged in 965.22526 seconds found solution of value 63.00505 (lower bound 1e+50 ). OA0010I Performed 15 iterations, explored 176891 branch-and-bound nodes in total Cbc0012I Integer solution of 63.00505 found by nonlinear programm after 0 iterations and 0 nodes (965.22 seconds) Cbc0013I At root node, 0 cuts changed objective from 37.64858 to 37.64858 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 14.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 63.005050271, took 0 iterations and 0 nodes (965.22 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 3 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 63.0051. Best solution: 6.300505e+01 (0 nodes, 968.012 seconds) Best possible: 6.300505e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- nd-13.gms(932) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job nd-13.gms Stop 09/08/12 20:15:19 elapsed 0:16:09.387 @04 1347128119 ----------------------------- Sa 8. Sep 20:15:19 CEST 2012 ----------------------------- =ready= Linux opt205 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/NetworkDesign/gms/nd-15.gms =========== ----------------------------- Sa 8. Sep 19:59:13 CEST 2012 ----------------------------- @03 1347127153 --- Job nd-15.gms Start 09/08/12 19:59:14 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- nd-15.gms(1199) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- nd-15.gms(1197) 3 Mb --- Generating MINLP model m --- nd-15.gms(1199) 5 Mb --- 357 rows 851 columns 3,301 non-zeroes --- 2,500 nl-code 750 nl-non-zeroes --- 50 discrete-columns --- nd-15.gms(1199) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1500 Number of nonzeros in inequality constraint Jacobian.: 1750 Number of nonzeros in Lagrangian Hessian.............: 6000 Total number of variables............................: 850 variables with only lower bounds: 800 variables with lower and upper bounds: 50 variables with only upper bounds: 0 Total number of equality constraints.................: 225 Total number of inequality constraints...............: 131 inequality constraints with only lower bounds: 80 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 51 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.2964987e+00 2.51e+02 3.89e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.3251980e+00 2.51e+02 3.56e+00 1.5 2.99e+03 - 2.83e-04 1.71e-04f 1 2 1.8201937e+00 2.50e+02 9.38e+00 1.5 1.29e+04 - 1.16e-04 2.22e-03f 1 3 8.2510289e+01 3.36e+02 7.25e+02 1.5 1.76e+04 - 3.58e-03 3.51e-01f 1 4 8.1466883e+01 3.01e+02 3.01e+03 1.5 5.03e+01 0.0 9.91e-01 1.07e-01h 1 5 8.0254121e+01 2.07e+02 4.84e+02 1.5 6.92e+01 -0.5 8.06e-01 3.64e-01h 1 6 8.0669227e+01 1.85e+02 3.73e+02 1.2 1.83e+02 -1.0 4.17e-01 1.19e-01h 1 7 8.2145378e+01 1.81e+02 3.19e+02 1.1 9.18e+02 -1.4 2.32e-01 1.47e-01h 1 8 8.9886629e+01 1.20e+02 2.05e+02 1.3 6.20e+03 - 1.08e-01 3.37e-01f 1 9 9.9048396e+01 4.39e+01 6.89e+01 0.9 4.58e+03 - 4.47e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 9.8179067e+01 2.53e-07 9.90e+00 -1.6 5.73e+02 - 8.78e-01 1.00e+00h 1 11 9.0974006e+01 1.51e-10 2.38e+00 -1.4 2.39e+01 - 7.61e-01 1.00e+00f 1 12 6.8898370e+01 1.70e-11 5.75e-01 -1.3 1.43e+02 - 7.57e-01 1.00e+00f 1 13 6.0060554e+01 4.32e-11 1.86e-01 -2.0 4.05e+01 - 6.76e-01 7.58e-01f 1 14 5.7527847e+01 4.52e+01 3.66e-01 -1.8 4.68e+02 - 4.22e-01 8.00e-01f 1 15 5.6209454e+01 1.18e+02 2.73e-01 -2.1 1.09e+03 - 4.34e-01 6.75e-01h 1 16 5.5851621e+01 1.46e+02 1.82e-01 -2.0 2.20e+03 - 5.40e-01 3.51e-01h 1 17 5.4230651e+01 1.54e+02 6.36e-02 -2.6 1.18e+03 - 5.25e-01 6.06e-01h 1 18 5.2444128e+01 4.66e+02 4.91e-02 -2.9 1.61e+03 - 4.66e-01 7.28e-01h 1 19 5.1896704e+01 2.53e+02 5.16e-02 -2.9 1.79e+03 - 5.95e-01 4.62e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 5.1352640e+01 4.12e+02 1.65e-02 -3.2 1.59e+03 - 3.81e-01 5.11e-01h 1 21 5.0990377e+01 1.56e+02 3.59e-02 -3.1 1.75e+03 - 5.63e-01 7.18e-01h 1 22 5.0715443e+01 3.25e+02 2.31e-02 -3.5 3.42e+03 - 5.76e-01 6.20e-01h 1 23 5.0511668e+01 1.98e+02 3.39e-02 -4.0 2.75e+03 - 4.85e-01 6.71e-01h 1 24 5.0440864e+01 2.83e+02 5.69e-03 -4.4 1.88e+03 - 7.26e-01 5.37e-01h 1 25 5.0381417e+01 3.95e+02 2.89e-03 -5.0 1.76e+03 - 6.66e-01 7.33e-01h 1 26 5.0359697e+01 2.54e+02 1.49e-02 -5.6 1.93e+03 - 6.43e-01 8.50e-01h 1 27 5.0357839e+01 2.51e+02 5.84e-03 -5.7 3.13e+03 - 7.46e-01 4.14e-01h 1 28 5.0354835e+01 3.37e+01 3.25e-04 -6.0 1.12e+03 - 9.12e-01 1.00e+00h 1 29 5.0354272e+01 5.68e-14 1.59e-04 -8.2 4.19e+02 - 7.57e-01 8.98e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 5.0354204e+01 2.84e-14 1.67e-05 -9.1 3.85e+02 - 8.25e-01 1.00e+00h 1 31 5.0354205e+01 5.68e-14 1.44e-01 -7.6 5.89e-02 -1.9 2.12e-02 4.33e-02h 1 32 5.0354220e+01 6.20e-13 1.03e+00 -7.6 5.44e-02 -2.4 1.71e-02 1.00e+00h 1 33 5.0354216e+01 3.30e-13 7.81e-01 -8.6 9.10e-03 -2.9 8.75e-01 2.26e-01h 1 34 5.0354213e+01 1.74e-13 5.57e-01 -8.2 1.43e-02 -3.3 1.00e+00 2.63e-01h 1 35 5.0354209e+01 4.97e-14 3.04e-01 -9.0 9.98e-03 -3.8 1.00e+00 4.61e-01h 1 36 5.0354207e+01 7.11e-14 1.26e-01 -9.2 6.58e-03 -4.3 1.00e+00 4.83e-01h 1 37 5.0354204e+01 4.97e-14 1.38e-02 -11.0 5.12e-03 -4.8 1.00e+00 8.67e-01h 1 38 5.0354204e+01 5.68e-14 1.52e-04 -11.0 1.44e-03 -4.3 1.00e+00 9.90e-01h 1 39 5.0354204e+01 4.09e-14 5.05e-09 -11.0 3.36e-04 -4.8 1.00e+00 1.00e+00h 1 Number of Iterations....: 39 (scaled) (unscaled) Objective...............: 5.0354203683119117e+01 5.0354203683119117e+01 Dual infeasibility......: 5.0546979210543184e-09 5.0546979210543184e-09 Constraint violation....: 4.0856207306205761e-14 4.0856207306205761e-14 Complementarity.........: 1.2701140655867001e-11 1.2701140655867001e-11 Overall NLP error.......: 5.0546979210543184e-09 5.0546979210543184e-09 Number of objective function evaluations = 40 Number of objective gradient evaluations = 40 Number of equality constraint evaluations = 40 Number of inequality constraint evaluations = 40 Number of equality constraint Jacobian evaluations = 40 Number of inequality constraint Jacobian evaluations = 40 Number of Lagrangian Hessian evaluations = 39 Total CPU secs in IPOPT (w/o function evaluations) = 1.968 Total CPU secs in NLP function evaluations = 0.047 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 50.354204 39 2.014694 build initial OA OA0012I After 191.83684.1f seconds, 1 iterations upper bound 1e+500g, lower bound 71.019920g NLP0014I 2 INFEAS 85 70 1.406786 OA decomposition OA0012I After 384.7935.1f seconds, 2 iterations upper bound 1e+500g, lower bound 73.9725080g NLP0014I 3 INFEAS 67.351394 39 0.834873 OA decomposition NLP0014I 4 INFEAS 43.786272 50 1.010846 OA decomposition OA0012I After 569.11948.1f seconds, 4 iterations upper bound 1e+500g, lower bound 78.8438350g NLP0014I 5 INFEAS 9.1081866 47 1.090834 OA decomposition NLP0014I 6 INFEAS 20.434445 101 2.080684 OA decomposition OA0012I After 764.12983.1f seconds, 6 iterations upper bound 1e+500g, lower bound 79.3277140g NLP0014I 7 INFEAS 18.088254 57 1.216815 OA decomposition OA0012I After 894.08708.1f seconds, 7 iterations upper bound 1e+500g, lower bound 79.6588610g NLP0014I 8 INFEAS 10.789217 66 1.342796 OA decomposition NLP0014I 9 INFEAS 1.2623332 39 0.863868 OA decomposition OA0012I After 1085.9719.1f seconds, 9 iterations upper bound 1e+500g, lower bound 79.8169620g NLP0014I 10 INFEAS 9.5743549 46 1.035843 OA decomposition OA0012I After 1250.1909.1f seconds, 10 iterations upper bound 1e+500g, lower bound 80.3479570g NLP0014I 11 INFEAS 6.5713499 44 0.994849 OA decomposition OA0012I After 1406.0133.1f seconds, 11 iterations upper bound 1e+500g, lower bound 80.4102870g NLP0014I 12 INFEAS 5.9070907 47 1.12083 OA decomposition OA0012I After 1561.6956.1f seconds, 12 iterations upper bound 1e+500g, lower bound 80.4145970g NLP0014I 13 INFEAS 17.724007 44 0.892864 OA decomposition OA0012I After 1707.9883.1f seconds, 13 iterations upper bound 1e+500g, lower bound 80.4694170g NLP0014I 14 OPT 80.469417 41 0.819876 OA decomposition OA0003I New best feasible of 80.469417 found after 1708.8082 sec and OA0008I OA converged in 1708.8092 seconds found solution of value 80.469417 (lower bound 1e+50 ). OA0010I Performed 13 iterations, explored 216045 branch-and-bound nodes in total Cbc0012I Integer solution of 80.469417 found by nonlinear programm after 0 iterations and 0 nodes (1708.79 seconds) Cbc0013I At root node, 0 cuts changed objective from 50.354204 to 50.354204 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 16.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 80.46941653699997, took 0 iterations and 0 nodes (1708.79 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 80.4694. Best solution: 8.046942e+01 (0 nodes, 1713.59 seconds) Best possible: 8.046942e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- nd-15.gms(1199) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job nd-15.gms Stop 09/08/12 20:27:49 elapsed 0:28:35.886 @04 1347128869 ----------------------------- Sa 8. Sep 20:27:49 CEST 2012 ----------------------------- =ready= Linux opt211 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/NetworkDesign/gms/nd-16.gms =========== ----------------------------- Sa 8. Sep 19:59:14 CEST 2012 ----------------------------- @03 1347127154 --- Job nd-16.gms Start 09/08/12 19:59:14 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- nd-16.gms(1305) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- nd-16.gms(1303) 3 Mb --- Generating MINLP model m --- nd-16.gms(1305) 6 Mb --- 394 rows 937 columns 3,641 non-zeroes --- 2,756 nl-code 832 nl-non-zeroes --- 52 discrete-columns --- nd-16.gms(1305) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 1664 Number of nonzeros in inequality constraint Jacobian.: 1924 Number of nonzeros in Lagrangian Hessian.............: 7072 Total number of variables............................: 936 variables with only lower bounds: 884 variables with lower and upper bounds: 52 variables with only upper bounds: 0 Total number of equality constraints.................: 256 Total number of inequality constraints...............: 137 inequality constraints with only lower bounds: 84 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 53 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.4274452e+00 2.70e+02 3.90e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4434752e+00 2.70e+02 3.83e+00 1.5 3.21e+03 - 1.08e-04 8.43e-05f 1 2 1.5366420e+00 2.70e+02 4.64e+00 1.5 5.79e+03 - 1.82e-04 4.55e-04f 1 3 7.3211271e+01 3.87e+02 2.61e+03 1.5 1.91e+04 - 2.57e-04 2.56e-01f 1 4 7.5720372e+01 3.70e+02 2.49e+03 1.5 6.48e+03 - 1.14e-01 4.31e-02h 1 5 8.2504542e+01 3.14e+02 2.09e+03 1.5 9.87e+02 -2.0 6.10e-01 1.56e-01h 1 6 8.7813620e+01 2.61e+02 1.73e+03 1.1 5.65e+03 - 2.58e-01 1.68e-01h 1 7 9.1912662e+01 2.28e+02 1.52e+03 1.2 8.18e+03 - 9.58e-02 1.26e-01h 1 8 9.2914076e+01 2.20e+02 1.44e+03 1.3 3.74e+03 -2.5 1.90e-01 3.38e-02h 1 9 9.6101329e+01 1.95e+02 1.29e+03 1.2 1.24e+04 - 1.96e-02 1.13e-01f 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 9.7577248e+01 1.82e+02 1.22e+03 1.3 3.81e+03 -2.1 8.91e-03 5.82e-02h 1 11 9.8087966e+01 1.77e+02 1.18e+03 1.3 1.40e+03 -1.6 6.08e-02 2.83e-02h 1 12 9.8890252e+01 1.66e+02 1.05e+03 1.3 5.54e+02 -1.2 1.75e-01 6.84e-02h 1 13 1.0084215e+02 1.50e+02 9.43e+02 1.2 8.39e+03 - 1.36e-01 9.54e-02f 1 14 1.0112495e+02 1.48e+02 9.16e+02 1.3 1.42e+03 -1.7 5.01e-02 1.73e-02h 1 15 1.0194686e+02 1.42e+02 8.83e+02 1.3 1.01e+04 - 1.49e-02 3.65e-02f 1 16 1.0198375e+02 1.42e+02 8.82e+02 1.4 7.19e+03 -2.2 1.21e-02 1.94e-03h 1 17 1.0245487e+02 1.39e+02 8.63e+02 1.3 1.23e+04 - 5.77e-02 2.08e-02f 1 18 1.0288768e+02 1.35e+02 8.36e+02 1.3 1.37e+03 -1.7 6.08e-02 2.94e-02h 1 19 1.0398718e+02 1.41e+02 7.85e+02 1.3 5.49e+03 - 8.55e-02 6.13e-02f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.0439230e+02 1.34e+02 7.43e+02 1.3 8.11e+02 -1.3 9.16e-02 4.14e-02h 1 21 1.0946779e+02 4.77e+02 4.04e+02 1.2 7.96e+03 - 9.04e-02 4.00e-01f 1 22 1.1090107e+02 4.05e+02 3.34e+02 1.3 1.09e+03 -1.8 4.02e-02 1.87e-01h 1 23 1.1122959e+02 3.87e+02 3.18e+02 1.3 1.38e+03 -2.3 1.48e-01 5.12e-02f 1 24 1.1415020e+02 1.01e+03 1.45e+02 0.8 5.68e+03 - 2.72e-01 9.03e-01f 1 25 1.1363797e+02 1.01e+02 5.35e+01 -0.5 1.72e+03 - 7.46e-01 9.02e-01h 1 26 1.1068911e+02 9.98e-03 8.44e+00 -2.0 1.69e+02 - 8.64e-01 9.64e-01h 1 27 1.0620665e+02 8.31e-03 3.73e+03 -0.9 4.81e+02 - 7.82e-01 1.67e-01f 1 28 7.3882218e+01 1.97e+01 6.12e+02 -1.5 4.49e+02 - 6.70e-01 8.74e-01f 1 29 6.9349113e+01 2.42e+02 1.89e+02 -2.1 1.43e+03 - 5.84e-01 6.81e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 6.8261454e+01 9.74e+02 6.36e+01 -1.8 5.90e+03 - 2.49e-01 2.98e-01h 1 31 6.7432760e+01 6.60e+02 6.91e+01 -1.7 6.97e+03 - 3.80e-01 3.59e-01h 1 32 6.6361276e+01 4.93e+02 5.33e+01 -1.9 3.92e+03 - 2.39e-01 3.59e-01h 1 33 6.5357907e+01 3.55e+02 7.20e+01 -2.1 4.21e+03 - 2.70e-01 3.16e-01h 1 34 6.4592641e+01 2.61e+02 2.49e+00 -2.2 4.16e+03 - 3.39e-01 2.48e-01h 1 35 6.4184839e+01 3.15e+02 3.96e+01 -2.0 8.80e+03 - 1.04e-01 1.46e-01h 1 36 6.3632515e+01 2.88e+02 3.54e+01 -2.3 5.23e+03 - 3.57e-01 2.22e-01h 1 37 6.2375580e+01 4.69e+02 3.01e+01 -2.3 5.88e+03 - 4.32e-01 5.35e-01h 1 38 6.1099647e+01 3.44e+02 1.01e+02 -2.6 3.78e+03 - 3.22e-01 6.24e-01h 1 39 5.9838592e+01 1.55e+02 7.85e+01 -3.0 1.62e+03 - 4.86e-01 7.22e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 5.9594418e+01 6.22e+01 5.35e+01 -2.8 7.94e+02 - 8.78e-01 6.36e-01h 1 41 5.8868627e+01 3.89e+01 1.85e+01 -4.0 6.00e+02 - 6.49e-01 6.67e-01h 1 42 5.8625632e+01 2.91e+01 7.58e+00 -4.2 4.52e+02 - 7.02e-01 5.69e-01h 1 43 5.8449125e+01 2.21e+01 1.96e+00 -4.8 2.91e+02 - 5.94e-01 8.15e-01h 1 44 5.8407146e+01 6.69e+00 3.29e-01 -6.1 9.37e+01 - 8.33e-01 8.16e-01h 1 45 5.8398278e+01 9.30e-01 5.30e-03 -7.6 2.46e+01 - 9.15e-01 8.78e-01h 1 46 5.8397112e+01 4.21e-02 3.10e-02 -9.8 9.87e+00 - 9.37e-01 9.56e-01h 1 47 5.8397060e+01 5.77e-03 8.40e-02 -11.0 5.38e+00 - 9.57e-01 9.71e-01h 1 48 5.8397059e+01 6.22e-04 1.08e+00 -11.0 1.64e-03 -2.7 9.89e-01 8.92e-01h 1 49 5.8397059e+01 1.01e-04 1.74e+00 -11.0 4.57e-04 -3.2 9.91e-01 8.38e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 5.8397059e+01 5.68e-14 1.54e-07 -11.0 7.49e-04 -3.7 1.00e+00 1.00e+00h 1 51 5.8397059e+01 5.68e-14 1.57e-07 -11.0 2.29e-03 -4.2 1.00e+00 1.00e+00h 1 52 5.8397059e+01 2.84e-14 1.57e-07 -11.0 6.87e-03 -4.6 1.00e+00 1.00e+00h 1 53 5.8397059e+01 5.68e-14 1.57e-07 -11.0 2.06e-02 -5.1 1.00e+00 1.00e+00h 1 54 5.8397059e+01 2.79e-07 1.56e-07 -11.0 6.16e-02 -5.6 1.00e+00 1.00e+00h 1 55 5.8397059e+01 5.68e-14 1.56e-07 -11.0 2.31e-02 -5.2 1.00e+00 1.00e+00h 1 56 5.8397059e+01 4.52e-07 1.55e-07 -11.0 6.89e-02 -5.6 1.00e+00 1.00e+00h 1 57 5.8397059e+01 7.13e-06 1.54e-07 -11.0 2.05e-01 -6.1 1.00e+00 1.00e+00h 1 58 5.8397059e+01 6.31e-05 1.49e-07 -11.0 5.94e-01 -6.6 1.00e+00 1.00e+00h 1 59 5.8397059e+01 5.68e-14 1.48e-07 -11.0 2.78e-02 -5.3 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 5.8397059e+01 8.35e-07 1.48e-07 -11.0 8.29e-02 -5.7 1.00e+00 1.00e+00h 1 61 5.8397059e+01 5.68e-14 1.48e-07 -11.0 3.10e-02 -5.3 1.00e+00 1.00e+00h 1 62 5.8397059e+01 1.14e-06 1.47e-07 -11.0 9.26e-02 -5.8 1.00e+00 1.00e+00h 1 63 5.8397059e+01 5.68e-14 1.46e-07 -11.0 3.47e-02 -5.4 1.00e+00 1.00e+00h 1 64 5.8397059e+01 1.52e-06 1.46e-07 -11.0 1.03e-01 -5.9 1.00e+00 1.00e+00h 1 65 5.8397059e+01 5.68e-14 1.45e-07 -11.0 3.87e-02 -5.4 1.00e+00 1.00e+00h 1 66 5.8397059e+01 5.68e-14 1.45e-07 -11.0 1.45e-02 -5.0 1.00e+00 1.00e+00h 1 67 5.8397059e+01 3.20e-14 1.45e-07 -11.0 4.34e-02 -5.5 1.00e+00 1.00e+00h 1 68 5.8397059e+01 2.60e-06 1.44e-07 -11.0 1.29e-01 -6.0 1.00e+00 1.00e+00h 1 69 5.8397059e+01 5.32e-06 6.88e+00 -11.0 3.78e-01 -6.4 1.00e+00 3.89e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 70 5.8397059e+01 5.68e-14 4.10e-08 -11.0 4.14e-02 -6.0 1.00e+00 1.00e+00h 1 71 5.8397059e+01 5.68e-14 6.00e-08 -11.0 2.28e-02 -5.6 1.00e+00 1.00e+00h 1 72 5.8397059e+01 5.68e-14 2.62e+00 -11.0 3.91e-02 -6.1 1.00e+00 7.67e-01h 1 73 5.8397059e+01 5.14e-12 5.44e-09 -11.0 1.86e-02 -6.5 1.00e+00 1.00e+00h 1 Number of Iterations....: 73 (scaled) (unscaled) Objective...............: 5.8397058713378193e+01 5.8397058713378193e+01 Dual infeasibility......: 5.4436463366431850e-09 5.4436463366431850e-09 Constraint violation....: 5.1407766932243248e-12 5.1407766932243248e-12 Complementarity.........: 1.2754540021414357e-11 1.2754540021414357e-11 Overall NLP error.......: 5.4436463366431850e-09 5.4436463366431850e-09 Number of objective function evaluations = 77 Number of objective gradient evaluations = 74 Number of equality constraint evaluations = 77 Number of inequality constraint evaluations = 77 Number of equality constraint Jacobian evaluations = 74 Number of inequality constraint Jacobian evaluations = 74 Number of Lagrangian Hessian evaluations = 73 Total CPU secs in IPOPT (w/o function evaluations) = 3.442 Total CPU secs in NLP function evaluations = 0.079 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 58.397059 73 3.521465 build initial OA NLP0014I 2 INFEAS 68.527386 71 1.436782 OA decomposition OA0012I After 127.44263.1f seconds, 2 iterations upper bound 1e+500g, lower bound 91.6780710g NLP0014I 3 INFEAS 50.964732 60 1.241811 OA decomposition NLP0014I 4 INFEAS 52 61 1.239812 OA decomposition OA0012I After 296.05999.1f seconds, 4 iterations upper bound 1e+500g, lower bound 95.4258430g NLP0014I 5 INFEAS 34.766789 52 1.111831 OA decomposition NLP0014I 6 INFEAS 52.494855 55 1.157824 OA decomposition OA0012I After 487.02996.1f seconds, 6 iterations upper bound 1e+500g, lower bound 96.774340g NLP0014I 7 INFEAS 18 47 1.047841 OA decomposition OA0012I After 612.01496.1f seconds, 7 iterations upper bound 1e+500g, lower bound 97.3919610g NLP0014I 8 INFEAS 15.79087 49 1.166823 OA decomposition OA0012I After 730.87389.1f seconds, 8 iterations upper bound 1e+500g, lower bound 97.4027170g NLP0014I 9 INFEAS 11.633146 45 1.044841 OA decomposition OA0012I After 867.91906.1f seconds, 9 iterations upper bound 1e+500g, lower bound 97.5918910g NLP0014I 10 INFEAS 22 76 1.622753 OA decomposition OA0012I After 1003.4754.1f seconds, 10 iterations upper bound 1e+500g, lower bound 97.7052470g NLP0014I 11 INFEAS 6.110117 75 1.629753 OA decomposition OA0012I After 1132.1359.1f seconds, 11 iterations upper bound 1e+500g, lower bound 97.7366770g NLP0014I 12 INFEAS 4.1874542 42 0.912861 OA decomposition OA0012I After 1245.4827.1f seconds, 12 iterations upper bound 1e+500g, lower bound 97.7518240g NLP0014I 13 INFEAS 2.6967456 81 2.073684 OA decomposition OA0012I After 1384.8285.1f seconds, 13 iterations upper bound 1e+500g, lower bound 97.9694990g NLP0014I 14 INFEAS 8.5494668 44 1.008846 OA decomposition OA0012I After 1503.0505.1f seconds, 14 iterations upper bound 1e+500g, lower bound 97.9792230g NLP0014I 15 OPT 97.979223 23 0.496925 OA decomposition OA0003I New best feasible of 97.979223 found after 1503.5474 sec and OA0008I OA converged in 1503.5484 seconds found solution of value 97.979223 (lower bound 1e+50 ). OA0010I Performed 14 iterations, explored 195622 branch-and-bound nodes in total Cbc0012I Integer solution of 97.979223 found by nonlinear programm after 9 iterations and 0 nodes (1503.52 seconds) Cbc0031I 2 added rows had average density of 17 Cbc0013I At root node, 2 cuts changed objective from 58.397049 to 58.397058 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 22 row cuts average 17.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 97.97922348400002, took 9 iterations and 0 nodes (1503.52 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 22 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 97.9792. Best solution: 9.797922e+01 (0 nodes, 1507.78 seconds) Best possible: 9.797922e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- nd-16.gms(1305) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job nd-16.gms Stop 09/08/12 20:24:26 elapsed 0:25:11.545 @04 1347128666 ----------------------------- Sa 8. Sep 20:24:26 CEST 2012 ----------------------------- =ready= Linux opt216 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo7_2.gms =========== ----------------------------- Sa 8. Sep 19:59:14 CEST 2012 ----------------------------- @03 1347127154 --- Job fo7_2.gms Start 09/08/12 19:59:14 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo7_2.gms(508) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- fo7_2.gms(503) 3 Mb --- Generating MINLP model m --- fo7_2.gms(508) 5 Mb --- 212 rows 115 columns 869 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- fo7_2.gms(508) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 842 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 211 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 211 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.61e+00 7.09e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.0729431e+01 6.85e-01 2.91e+02 0.5 1.48e+01 - 2.01e-02 1.00e+00f 1 2 4.0698170e+01 0.00e+00 2.62e+02 -0.4 2.62e+00 2.0 5.38e-01 1.00e+00h 1 3 2.9765100e+00 0.00e+00 1.03e+01 -3.0 3.65e+00 - 9.15e-01 9.61e-01f 1 4 9.5555870e-01 0.00e+00 2.93e+00 -4.0 6.86e-01 - 9.20e-01 7.16e-01f 1 5 4.0376501e-02 0.00e+00 1.27e-01 -5.5 3.70e-01 - 9.28e-01 9.57e-01f 1 6 6.4418063e-04 0.00e+00 1.97e-03 -10.2 1.11e-02 - 9.86e-01 9.85e-01h 1 7 1.3270260e-06 0.00e+00 4.05e-06 -11.0 1.97e-04 - 9.98e-01 9.98e-01h 1 8 -2.9716895e-10 0.00e+00 5.93e-08 -11.0 1.70e-03 - 1.00e+00 9.99e-01h 1 9 -8.8789037e-10 0.00e+00 7.09e-01 -11.0 7.33e+00 - 5.21e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -9.5950033e-10 0.00e+00 3.04e-03 -11.0 1.53e+01 - 5.80e-01 1.00e+00h 1 11 -9.5980044e-10 0.00e+00 2.50e-03 -11.0 3.64e+01 - 5.87e-01 1.00e+00h 1 12 -9.5980336e-10 0.00e+00 1.05e-03 -11.0 8.81e+01 - 5.86e-01 1.00e+00h 1 13 -9.5980362e-10 0.00e+00 4.32e-04 -11.0 2.12e+02 - 5.87e-01 1.00e+00h 1 14 -9.5980387e-10 0.00e+00 1.78e-04 -11.0 5.11e+02 - 5.88e-01 1.00e+00h 1 15 -9.5980324e-10 0.00e+00 7.30e-05 -11.0 1.22e+03 - 5.90e-01 1.00e+00h 1 16 -9.5980350e-10 0.00e+00 2.95e-05 -11.0 2.90e+03 - 5.97e-01 1.00e+00h 1 17 -9.5980375e-10 0.00e+00 1.14e-05 -11.0 6.68e+03 - 6.12e-01 1.00e+00h 1 18 -9.5980312e-10 0.00e+00 3.99e-06 -11.0 1.44e+04 - 6.51e-01 1.00e+00h 1 19 -9.5980426e-10 0.00e+00 9.87e-07 -11.0 2.65e+04 - 7.52e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.5980452e-10 0.00e+00 1.67e-16 -11.0 3.29e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 20 (scaled) (unscaled) Objective...............: -9.5980452052828015e-10 -9.5980452052828015e-10 Dual infeasibility......: 1.6653345369377348e-16 1.6653345369377348e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.6257374032074917e-11 1.6257374032074917e-11 Overall NLP error.......: 1.6257374032074917e-11 1.6257374032074917e-11 Number of objective function evaluations = 21 Number of objective gradient evaluations = 21 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 21 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 21 Number of Lagrangian Hessian evaluations = 20 Total CPU secs in IPOPT (w/o function evaluations) = 0.010 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9.5980452e-10 20 0.011998 build initial OA NLP0014I 2 OPT 17.749346 22 0.010998 OA decomposition OA0003I New best feasible of 17.749346 found after 3.260504 sec and NLP0014I 3 OPT 18.88362 23 0.010998 OA decomposition OA0008I OA converged in 12.075164 seconds found solution of value 17.749346 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 79920 branch-and-bound nodes in total Cbc0012I Integer solution of 17.749346 found by nonlinear programm after 11 iterations and 0 nodes (12.08 seconds) Cbc0031I 7 added rows had average density of 2 Cbc0013I At root node, 7 cuts changed objective from -1.2e-07 to -1.2e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 7 row cuts average 2.0 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 17.74934568764247, took 11 iterations and 0 nodes (12.08 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 7 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 17.7493. Best solution: 1.774935e+01 (0 nodes, 12.173 seconds) Best possible: 1.774935e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo7_2.gms(508) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo7_2.gms Stop 09/08/12 19:59:27 elapsed 0:00:12.248 @04 1347127167 ----------------------------- Sa 8. Sep 19:59:27 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo7_ar2_1.gms =========== ----------------------------- Sa 8. Sep 19:59:16 CEST 2012 ----------------------------- @03 1347127156 --- Job fo7_ar2_1.gms Start 09/08/12 19:59:16 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo7_ar2_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- fo7_ar2_1.gms(663) 3 Mb --- Generating MINLP model m --- fo7_ar2_1.gms(668) 5 Mb --- 270 rows 113 columns 1,055 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- fo7_ar2_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.12e+00 1.06e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.3229293e+01 0.00e+00 3.27e+02 1.1 4.73e+01 - 2.24e-03 2.68e-01f 1 2 4.4319234e+01 0.00e+00 3.01e+02 1.1 3.99e+00 2.0 1.00e+00 3.72e-01h 1 3 4.2319918e+01 0.00e+00 8.11e+01 -1.1 2.54e+00 - 8.34e-01 1.00e+00h 1 4 2.5171496e+01 0.00e+00 1.29e+01 -1.9 2.25e+00 - 8.47e-01 1.00e+00f 1 5 5.3851816e+00 0.00e+00 4.65e+00 -1.4 4.10e+00 - 6.38e-01 8.52e-01f 1 6 2.0714330e+00 0.00e+00 1.17e+00 -2.4 8.41e-01 - 7.49e-01 6.19e-01f 1 7 4.5887601e-01 0.00e+00 1.66e-01 -2.5 7.16e-01 - 8.59e-01 7.27e-01f 1 8 1.6199527e-01 0.00e+00 1.40e-01 -4.8 1.58e-01 - 9.40e-01 5.79e-01f 1 9 1.9022482e-02 0.00e+00 3.06e-02 -6.6 5.53e-02 - 9.74e-01 8.71e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.3014802e-04 0.00e+00 5.89e-04 -10.8 6.85e-03 - 9.88e-01 9.82e-01h 1 11 2.1627354e-07 0.00e+00 3.93e-07 -11.0 6.53e-04 - 9.99e-01 9.99e-01h 1 12 -7.2918990e-10 0.00e+00 2.30e-06 -11.0 7.91e-08 1.5 1.00e+00 9.99e-01h 1 13 -9.5631853e-10 0.00e+00 7.95e-03 -11.0 6.18e-11 1.0 9.85e-01 1.00e+00h 1 14 -9.5777406e-10 0.00e+00 2.59e-02 -11.0 5.42e+00 - 7.11e-01 1.00e+00h 1 15 -9.5959524e-10 0.00e+00 1.30e-02 -11.0 2.14e+01 - 6.17e-01 1.00e+00h 1 16 -9.5961138e-10 0.00e+00 6.94e-03 -11.0 5.15e+01 - 4.79e-01 1.00e+00h 1 17 -9.5961108e-10 0.00e+00 1.93e-03 -11.0 9.54e+01 - 7.22e-01 1.00e+00h 1 18 -9.5961167e-10 0.00e+00 1.08e-03 -11.0 3.40e+02 - 4.42e-01 1.00e+00h 1 19 -9.5961226e-10 0.00e+00 3.09e-04 -11.0 6.06e+02 - 7.13e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.5961108e-10 0.00e+00 1.69e-04 -11.0 2.07e+03 - 4.55e-01 1.00e+00h 1 21 -9.5961167e-10 0.00e+00 4.57e-05 -11.0 3.64e+03 - 7.29e-01 1.00e+00h 1 22 -9.5961226e-10 0.00e+00 2.45e-05 -11.0 1.18e+04 - 4.64e-01 1.00e+00h 1 23 -9.5961108e-10 0.00e+00 4.47e-06 -11.0 1.73e+04 - 8.17e-01 1.00e+00h 1 24 -9.5961256e-10 0.00e+00 1.85e-06 -11.0 3.82e+04 - 5.87e-01 1.00e+00h 1 25 -9.5961226e-10 0.00e+00 1.11e-16 -11.0 2.49e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 25 (scaled) (unscaled) Objective...............: -9.5961226212268286e-10 -9.5961226212268286e-10 Dual infeasibility......: 1.1102230246251565e-16 1.1102230246251565e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.3805382358516003e-11 1.3805382358516003e-11 Overall NLP error.......: 1.3805382358516003e-11 1.3805382358516003e-11 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of equality constraint evaluations = 26 Number of inequality constraint evaluations = 26 Number of equality constraint Jacobian evaluations = 26 Number of inequality constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Total CPU secs in IPOPT (w/o function evaluations) = 0.017 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9.5961226e-10 25 0.016998 build initial OA NLP0014I 2 INFEAS 0.024414506 63 0.039994 OA decomposition NLP0014I 3 OPT 24.839847 25 0.012998 OA decomposition OA0003I New best feasible of 24.839847 found after 6.416024 sec and OA0008I OA converged in 9.514553 seconds found solution of value 24.839847 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 51128 branch-and-bound nodes in total Cbc0012I Integer solution of 24.839847 found by nonlinear programm after 4 iterations and 0 nodes (9.51 seconds) Cbc0031I 4 added rows had average density of 2 Cbc0013I At root node, 4 cuts changed objective from -1.2e-07 to -1.2e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 4 row cuts average 2.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 24.8398470296549, took 4 iterations and 0 nodes (9.51 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 4 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 24.8398. Best solution: 2.483985e+01 (0 nodes, 9.608 seconds) Best possible: 2.483985e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo7_ar2_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo7_ar2_1.gms Stop 09/08/12 19:59:26 elapsed 0:00:09.689 @04 1347127166 ----------------------------- Sa 8. Sep 19:59:26 CEST 2012 ----------------------------- =ready= Linux opt220 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo7_ar25_1.gms =========== ----------------------------- Sa 8. Sep 19:59:20 CEST 2012 ----------------------------- @03 1347127160 --- Job fo7_ar25_1.gms Start 09/08/12 19:59:20 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo7_ar25_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- fo7_ar25_1.gms(663) 3 Mb --- Generating MINLP model m --- fo7_ar25_1.gms(668) 5 Mb --- 270 rows 113 columns 1,055 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- fo7_ar25_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 5.14e+00 1.02e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.9868405e+01 1.07e-01 3.84e+02 1.1 4.51e+01 - 2.44e-03 3.08e-01f 1 2 5.3000227e+01 0.00e+00 4.62e+02 0.3 4.62e+00 2.0 7.30e-01 1.00e+00h 1 3 2.1014851e+01 0.00e+00 2.01e+00 -2.3 3.51e+00 - 8.98e-01 1.00e+00f 1 4 3.9478119e+00 0.00e+00 4.66e-01 -1.3 3.66e+00 - 7.68e-01 8.25e-01f 1 5 8.8717867e-01 0.00e+00 6.17e-02 -1.7 2.08e+00 - 8.65e-01 7.94e-01f 1 6 2.1466418e-01 0.00e+00 5.75e-02 -3.4 5.39e-01 - 9.20e-01 6.69e-01f 1 7 3.9454039e-02 0.00e+00 4.85e-02 -6.1 6.34e-02 - 9.64e-01 7.85e-01h 1 8 1.2099912e-03 0.00e+00 1.96e-03 -9.3 1.24e-02 - 9.85e-01 9.68e-01h 1 9 2.8889622e-06 0.00e+00 4.92e-06 -11.0 3.93e-04 - 9.98e-01 9.98e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -7.9138387e-10 0.00e+00 3.09e-07 -11.0 7.60e-02 - 9.96e-01 1.00e+00h 1 11 -9.5143338e-10 0.00e+00 2.41e-01 -11.0 1.69e+01 - 4.60e-01 1.00e+00h 1 12 -8.1072672e-10 0.00e+00 7.64e-02 -10.8 4.90e+01 - 4.95e-01 1.00e+00h 1 13 -8.1221447e-10 0.00e+00 2.38e-02 -10.8 9.55e+01 - 6.11e-01 1.00e+00h 1 14 -8.1206652e-10 0.00e+00 1.07e-02 -10.8 2.45e+02 - 5.74e-01 1.00e+00h 1 15 -8.1206729e-10 0.00e+00 4.28e-03 -10.8 5.71e+02 - 5.98e-01 1.00e+00h 1 16 -8.1206714e-10 0.00e+00 1.79e-03 -10.8 1.40e+03 - 5.81e-01 1.00e+00h 1 17 -8.1206787e-10 0.00e+00 7.03e-04 -10.8 3.23e+03 - 6.08e-01 1.00e+00h 1 18 -8.1206772e-10 0.00e+00 2.78e-04 -10.8 7.58e+03 - 6.05e-01 1.00e+00h 1 19 -9.6012976e-10 0.00e+00 1.24e-02 -11.0 9.76e+03 - 7.65e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.5959224e-10 0.00e+00 4.75e-03 -11.0 2.70e+04 - 6.86e-01 1.00e+00h 1 21 -9.5961330e-10 0.00e+00 1.11e-16 -11.0 3.26e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: -9.5961329998515953e-10 -9.5961329998515953e-10 Dual infeasibility......: 1.1102230246251565e-16 1.1102230246251565e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.7171675412333268e-11 1.7171675412333268e-11 Overall NLP error.......: 1.7171675412333268e-11 1.7171675412333268e-11 Number of objective function evaluations = 22 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 22 Number of inequality constraint evaluations = 22 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total CPU secs in IPOPT (w/o function evaluations) = 0.013 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9.596133e-10 21 0.012998 build initial OA NLP0014I 2 INFEAS 0.048695003 66 0.041994 OA decomposition NLP0014I 3 OPT 23.121015 25 0.013998 OA decomposition OA0003I New best feasible of 23.121015 found after 3.714436 sec and NLP0014I 4 INFEAS 0.022054497 62 0.038994 OA decomposition NLP0014I 5 OPT 23.093568 24 0.012998 OA decomposition OA0003I New best feasible of 23.093568 found after 8.012782 sec and NLP0014I 6 OPT 23.29867 24 0.011998 OA decomposition OA0008I OA converged in 12.016174 seconds found solution of value 23.093568 (lower bound 1e+50 ). OA0010I Performed 5 iterations, explored 59908 branch-and-bound nodes in total Cbc0012I Integer solution of 23.093568 found by nonlinear programm after 8 iterations and 0 nodes (12.02 seconds) Cbc0031I 7 added rows had average density of 2 Cbc0013I At root node, 7 cuts changed objective from -1.2e-07 to -1.2e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 2.0 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 23.09356758680698, took 8 iterations and 0 nodes (12.02 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 23.0936. Best solution: 2.309357e+01 (0 nodes, 12.106 seconds) Best possible: 2.309357e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo7_ar25_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo7_ar25_1.gms Stop 09/08/12 19:59:32 elapsed 0:00:12.185 @04 1347127172 ----------------------------- Sa 8. Sep 19:59:32 CEST 2012 ----------------------------- =ready= Linux opt225 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo7_ar3_1.gms =========== ----------------------------- Sa 8. Sep 19:59:21 CEST 2012 ----------------------------- @03 1347127161 --- Job fo7_ar3_1.gms Start 09/08/12 19:59:21 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo7_ar3_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- fo7_ar3_1.gms(663) 3 Mb --- Generating MINLP model m --- fo7_ar3_1.gms(668) 5 Mb --- 270 rows 113 columns 1,055 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- fo7_ar3_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 6.03e+00 9.93e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.3867374e+01 3.59e-01 4.20e+02 1.1 4.35e+01 - 2.63e-03 3.32e-01f 1 2 5.4857531e+01 8.03e-02 2.95e+02 0.4 4.92e+00 2.0 7.04e-01 2.96e-01h 1 3 2.7132707e+01 0.00e+00 3.76e+00 -1.7 4.01e+00 - 8.64e-01 9.99e-01f 1 4 4.8594002e+00 0.00e+00 1.28e+00 -1.4 3.76e+00 - 6.74e-01 9.10e-01f 1 5 1.5669841e+00 0.00e+00 1.04e-01 -2.0 1.72e+00 - 9.20e-01 6.06e-01f 1 6 3.0374257e-01 0.00e+00 4.23e-02 -3.5 6.44e-01 - 7.96e-01 7.03e-01f 1 7 7.2016863e-02 0.00e+00 6.04e-02 -5.0 1.18e-01 - 9.19e-01 7.13e-01f 1 8 3.9825429e-03 0.00e+00 5.55e-03 -7.7 2.77e-02 - 9.74e-01 9.39e-01h 1 9 2.9336878e-05 0.00e+00 4.40e-05 -11.0 1.55e-03 - 9.94e-01 9.92e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.5770785e-10 0.00e+00 1.03e-09 -11.0 1.91e-03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 10 (scaled) (unscaled) Objective...............: 4.5770784557740627e-10 4.5770784557740627e-10 Dual infeasibility......: 1.0282976692366219e-09 1.0282976692366219e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 5.0976959161473785e-10 5.0976959161473785e-10 Overall NLP error.......: 1.0282976692366219e-09 1.0282976692366219e-09 Number of objective function evaluations = 11 Number of objective gradient evaluations = 11 Number of equality constraint evaluations = 11 Number of inequality constraint evaluations = 11 Number of equality constraint Jacobian evaluations = 11 Number of inequality constraint Jacobian evaluations = 11 Number of Lagrangian Hessian evaluations = 10 Total CPU secs in IPOPT (w/o function evaluations) = 0.014 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 4.5770785e-10 10 0.014998 build initial OA NLP0014I 2 OPT 22.517471 52 0.025996 OA decomposition OA0003I New best feasible of 22.517471 found after 6.452019 sec and NLP0014I 3 INFEAS 0.021064892 85 0.051992 OA decomposition NLP0014I 4 OPT 23.093568 46 0.023996 OA decomposition OA0008I OA converged in 15.183692 seconds found solution of value 22.517471 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 78944 branch-and-bound nodes in total Cbc0012I Integer solution of 22.517471 found by nonlinear programm after 10 iterations and 0 nodes (15.18 seconds) Cbc0031I 8 added rows had average density of 2 Cbc0013I At root node, 8 cuts changed objective from -1.2e-07 to -1.2e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 12 row cuts average 2.0 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 22.51747095440897, took 10 iterations and 0 nodes (15.18 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 12 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 22.5175. Best solution: 2.251747e+01 (0 nodes, 15.312 seconds) Best possible: 2.251747e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo7_ar3_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo7_ar3_1.gms Stop 09/08/12 19:59:37 elapsed 0:00:15.426 @04 1347127177 ----------------------------- Sa 8. Sep 19:59:37 CEST 2012 ----------------------------- =ready= Linux opt232 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo7_ar4_1.gms =========== ----------------------------- Sa 8. Sep 19:59:24 CEST 2012 ----------------------------- @03 1347127164 --- Job fo7_ar4_1.gms Start 09/08/12 19:59:24 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo7_ar4_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- fo7_ar4_1.gms(663) 3 Mb --- Generating MINLP model m --- fo7_ar4_1.gms(668) 5 Mb --- 270 rows 113 columns 1,055 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- fo7_ar4_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 7.62e+00 9.63e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.9669184e+01 9.31e-01 4.71e+02 1.1 4.17e+01 - 2.94e-03 3.63e-01f 1 2 6.0042571e+01 7.40e-01 4.20e+02 0.5 5.11e+00 2.0 6.04e-01 9.92e-02h 1 3 6.3363758e+01 0.00e+00 1.67e+02 0.0 5.01e+00 1.5 9.69e-01 1.00e+00h 1 4 1.8219958e+01 0.00e+00 8.94e+01 -1.9 1.13e+01 - 8.00e-01 4.66e-01f 1 5 4.5214054e+00 0.00e+00 3.17e+01 -1.2 6.73e+00 - 6.41e-01 6.46e-01f 1 6 2.0202112e+00 0.00e+00 1.62e+01 -1.9 1.89e+00 - 6.28e-01 4.89e-01f 1 7 5.9853491e-01 0.00e+00 4.59e+00 -1.9 2.78e+00 - 8.76e-01 7.18e-01f 1 8 1.3958385e-01 0.00e+00 1.55e+00 -5.1 2.39e-01 - 9.43e-01 6.64e-01f 1 9 4.2344399e-02 0.00e+00 5.42e-01 -5.9 5.34e-02 - 9.83e-01 6.55e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.4776811e-03 0.00e+00 1.97e-02 -8.9 1.61e-02 - 9.89e-01 9.64e-01h 1 11 1.5580413e-05 0.00e+00 2.08e-04 -11.0 1.83e-03 - 9.90e-01 9.89e-01h 1 12 3.2695531e-09 0.00e+00 2.81e-07 -11.0 1.63e-01 - 9.95e-01 1.00e+00h 1 13 -3.7167590e-10 8.27e-18 8.75e-02 -11.0 3.02e+01 - 3.89e-01 8.50e-01h 1 14 -7.1823828e-10 0.00e+00 1.76e-01 -10.7 9.90e+01 - 4.19e-01 1.00e+00h 1 15 -7.0840351e-10 0.00e+00 1.30e-01 -10.7 1.68e+02 - 6.14e-01 1.00e+00h 1 16 -7.1604639e-10 0.00e+00 2.22e-02 -10.7 4.31e+02 - 5.85e-01 1.00e+00h 1 17 -7.1567746e-10 0.00e+00 1.07e-02 -10.7 1.03e+03 - 5.88e-01 1.00e+00h 1 18 -7.1568568e-10 0.00e+00 4.27e-03 -10.7 2.43e+03 - 5.97e-01 1.00e+00h 1 19 -7.1568493e-10 0.00e+00 1.69e-03 -10.7 5.67e+03 - 6.05e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.1568507e-10 0.00e+00 6.05e-04 -10.7 1.24e+04 - 6.42e-01 1.00e+00h 1 21 -7.1568521e-10 0.00e+00 1.88e-04 -10.7 2.39e+04 - 6.89e-01 1.00e+00h 1 22 -9.6114512e-10 0.00e+00 7.29e-03 -11.0 1.59e+04 - 9.10e-01 1.00e+00h 1 23 -9.5955695e-10 0.00e+00 1.11e-16 -11.0 3.88e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 23 (scaled) (unscaled) Objective...............: -9.5955695201813686e-10 -9.5955695201813686e-10 Dual infeasibility......: 1.1102230246251565e-16 1.1102230246251565e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.7494133057439370e-11 1.7494133057439370e-11 Overall NLP error.......: 1.7494133057439370e-11 1.7494133057439370e-11 Number of objective function evaluations = 24 Number of objective gradient evaluations = 24 Number of equality constraint evaluations = 24 Number of inequality constraint evaluations = 24 Number of equality constraint Jacobian evaluations = 24 Number of inequality constraint Jacobian evaluations = 24 Number of Lagrangian Hessian evaluations = 23 Total CPU secs in IPOPT (w/o function evaluations) = 0.014 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9.5955695e-10 23 0.014998 build initial OA NLP0014I 2 INFEAS 0.14886593 51 0.030996 OA decomposition NLP0014I 3 OPT 20.729825 32 0.016997 OA decomposition OA0003I New best feasible of 20.729825 found after 8.383725 sec and OA0008I OA converged in 11.422263 seconds found solution of value 20.729825 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 54851 branch-and-bound nodes in total Cbc0012I Integer solution of 20.729825 found by nonlinear programm after 6 iterations and 0 nodes (11.42 seconds) Cbc0031I 6 added rows had average density of 2 Cbc0013I At root node, 6 cuts changed objective from -1.2e-07 to -1.2e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 6 row cuts average 2.0 elements, 0 column cuts (6 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 20.72982505384367, took 6 iterations and 0 nodes (11.42 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 6 cuts of which 6 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 20.7298. Best solution: 2.072983e+01 (0 nodes, 11.516 seconds) Best possible: 2.072983e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo7_ar4_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo7_ar4_1.gms Stop 09/08/12 19:59:35 elapsed 0:00:11.595 @04 1347127175 ----------------------------- Sa 8. Sep 19:59:35 CEST 2012 ----------------------------- =ready= Linux opt230 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo7_ar5_1.gms =========== ----------------------------- Sa 8. Sep 19:59:24 CEST 2012 ----------------------------- @03 1347127164 --- Job fo7_ar5_1.gms Start 09/08/12 19:59:24 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo7_ar5_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- fo7_ar5_1.gms(663) 3 Mb --- Generating MINLP model m --- fo7_ar5_1.gms(668) 5 Mb --- 270 rows 113 columns 1,055 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- fo7_ar5_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.61e+00 9.50e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 6.2978129e+01 1.41e+00 5.01e+02 1.1 4.08e+01 - 3.21e-03 3.80e-01f 1 2 6.3285173e+01 1.24e+00 4.58e+02 0.7 5.38e+00 2.0 5.08e-01 7.44e-02h 1 3 6.7067698e+01 0.00e+00 1.75e+02 0.4 5.26e+00 1.5 1.00e+00 1.00e+00h 1 4 1.6813594e+01 0.00e+00 1.63e+01 -2.4 5.89e+00 - 8.84e-01 9.54e-01f 1 5 4.3085284e+00 0.00e+00 6.67e+00 -1.1 6.20e+00 - 6.61e-01 7.70e-01f 1 6 1.7808842e+00 0.00e+00 2.63e+00 -1.8 1.35e+00 - 5.93e-01 5.58e-01f 1 7 4.0987843e-01 0.00e+00 1.06e+00 -2.0 1.91e+00 - 6.52e-01 7.81e-01f 1 8 1.4131582e-01 0.00e+00 1.39e-01 -6.0 1.62e-01 - 9.75e-01 5.86e-01f 1 9 1.1038272e-02 0.00e+00 1.81e-02 -7.5 5.08e-02 - 9.86e-01 9.11e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.5187408e-04 0.00e+00 2.67e-04 -11.0 4.22e-03 - 9.89e-01 9.86e-01h 1 11 4.3468564e-08 0.00e+00 7.79e-08 -11.0 1.33e-03 - 1.00e+00 1.00e+00h 1 12 -7.4362006e-10 5.42e-14 4.12e-05 -11.0 1.71e-08 1.0 1.00e+00 9.93e-01h 1 13 -9.5670006e-10 0.00e+00 8.94e-02 -11.0 1.02e+01 - 7.98e-01 1.00e+00h 1 14 -9.5768270e-10 0.00e+00 8.79e-02 -11.0 5.52e+01 - 4.52e-01 1.00e+00h 1 15 -9.5971361e-10 0.00e+00 2.66e-02 -11.0 9.23e+01 - 6.09e-01 1.00e+00h 1 16 -9.5960837e-10 0.00e+00 1.10e-02 -11.0 2.34e+02 - 6.03e-01 1.00e+00h 1 17 -9.5961166e-10 0.00e+00 4.83e-03 -11.0 5.84e+02 - 5.60e-01 1.00e+00h 1 18 -9.5961225e-10 0.00e+00 1.83e-03 -11.0 1.31e+03 - 6.22e-01 1.00e+00h 1 19 -9.5961196e-10 0.00e+00 8.04e-04 -11.0 3.34e+03 - 5.60e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.5961166e-10 0.00e+00 2.76e-04 -11.0 7.02e+03 - 6.57e-01 1.00e+00h 1 21 -9.5961136e-10 0.00e+00 1.16e-04 -11.0 1.66e+04 - 5.77e-01 1.00e+00h 1 22 -9.5961195e-10 0.00e+00 1.41e-05 -11.0 2.52e+04 - 8.79e-01 1.00e+00h 1 23 -9.5961166e-10 0.00e+00 3.88e-06 -11.0 4.25e+04 - 7.25e-01 1.00e+00h 1 24 -9.5961136e-10 0.00e+00 2.22e-16 -11.0 1.19e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 24 (scaled) (unscaled) Objective...............: -9.5961136142394553e-10 -9.5961136142394553e-10 Dual infeasibility......: 2.2204460492503131e-16 2.2204460492503131e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.1364278387852783e-11 1.1364278387852783e-11 Overall NLP error.......: 1.1364278387852783e-11 1.1364278387852783e-11 Number of objective function evaluations = 25 Number of objective gradient evaluations = 25 Number of equality constraint evaluations = 25 Number of inequality constraint evaluations = 25 Number of equality constraint Jacobian evaluations = 25 Number of inequality constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Total CPU secs in IPOPT (w/o function evaluations) = 0.017 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9.5961136e-10 24 0.016997 build initial OA NLP0014I 2 OPT 17.74933 22 0.012998 OA decomposition OA0003I New best feasible of 17.74933 found after 2.052688 sec and OA0008I OA converged in 4.139371 seconds found solution of value 17.74933 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 22662 branch-and-bound nodes in total Cbc0012I Integer solution of 17.74933 found by nonlinear programm after 3 iterations and 0 nodes (4.14 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.2e-07 to -1.2e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 17.74932953597858, took 3 iterations and 0 nodes (4.14 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 3 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 17.7493. Best solution: 1.774933e+01 (0 nodes, 4.175 seconds) Best possible: 1.774933e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo7_ar5_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo7_ar5_1.gms Stop 09/08/12 19:59:28 elapsed 0:00:04.256 @04 1347127168 ----------------------------- Sa 8. Sep 19:59:28 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo7.gms =========== ----------------------------- Sa 8. Sep 19:59:26 CEST 2012 ----------------------------- @03 1347127166 --- Job fo7.gms Start 09/08/12 19:59:26 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo7.gms(508) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- fo7.gms(503) 3 Mb --- Generating MINLP model m --- fo7.gms(508) 5 Mb --- 212 rows 115 columns 869 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- fo7.gms(508) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 842 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 211 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 211 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 7.62e+00 7.04e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.9762804e+01 1.37e-01 2.82e+02 0.5 1.51e+01 - 2.02e-02 1.00e+00f 1 2 3.9728805e+01 0.00e+00 2.36e+02 -0.6 2.36e+00 2.0 5.96e-01 1.00e+00h 1 3 2.7041074e+00 0.00e+00 3.97e+01 -2.8 4.10e+00 - 8.93e-01 8.32e-01f 1 4 8.8549501e-01 0.00e+00 1.18e+01 -4.0 6.52e-01 - 9.21e-01 7.01e-01f 1 5 3.6025894e-02 0.00e+00 5.25e-01 -4.9 3.60e-01 - 9.01e-01 9.56e-01f 1 6 6.3449416e-04 0.00e+00 8.95e-03 -10.1 9.82e-03 - 9.86e-01 9.83e-01h 1 7 5.7485733e-06 0.00e+00 8.09e-05 -11.0 2.10e-04 - 9.91e-01 9.91e-01h 1 8 2.4553085e-10 0.00e+00 1.80e-08 -11.0 2.30e-04 - 1.00e+00 1.00e+00h 1 9 -4.3462324e-10 8.27e-18 1.50e-01 -11.0 1.72e+00 - 9.31e-01 5.48e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -9.4406172e-10 0.00e+00 4.16e-01 -11.0 2.50e+01 - 2.47e-01 1.00e+00h 1 11 -9.6158580e-10 0.00e+00 8.73e-02 -11.0 3.32e+01 - 6.37e-01 1.00e+00h 1 12 -9.5932959e-10 0.00e+00 4.65e-02 -11.0 9.13e+01 - 5.77e-01 1.00e+00h 1 13 -9.5981742e-10 0.00e+00 1.71e-02 -11.0 2.15e+02 - 5.88e-01 1.00e+00h 1 14 -9.5980579e-10 0.00e+00 7.11e-03 -11.0 5.20e+02 - 5.87e-01 1.00e+00h 1 15 -9.5980605e-10 0.00e+00 2.91e-03 -11.0 1.24e+03 - 5.90e-01 1.00e+00h 1 16 -9.5980630e-10 0.00e+00 1.17e-03 -11.0 2.95e+03 - 5.97e-01 1.00e+00h 1 17 -9.5980567e-10 0.00e+00 4.55e-04 -11.0 6.79e+03 - 6.13e-01 1.00e+00h 1 18 -9.5980593e-10 0.00e+00 1.58e-04 -11.0 1.46e+04 - 6.52e-01 1.00e+00h 1 19 -9.5980618e-10 0.00e+00 3.87e-05 -11.0 2.67e+04 - 7.56e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.5980555e-10 0.00e+00 1.67e-16 -11.0 3.28e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 20 (scaled) (unscaled) Objective...............: -9.5980555098571355e-10 -9.5980555098571355e-10 Dual infeasibility......: 1.6653345369377348e-16 1.6653345369377348e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.6163052991274596e-11 1.6163052991274596e-11 Overall NLP error.......: 1.6163052991274596e-11 1.6163052991274596e-11 Number of objective function evaluations = 21 Number of objective gradient evaluations = 21 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 21 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 21 Number of Lagrangian Hessian evaluations = 20 Total CPU secs in IPOPT (w/o function evaluations) = 0.012 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9.5980555e-10 20 0.012998 build initial OA NLP0014I 2 INFEAS 0.12327049 33 0.020997 OA decomposition NLP0014I 3 OPT 20.729825 20 0.008999 OA decomposition OA0003I New best feasible of 20.729825 found after 10.898343 sec and NLP0014I 4 INFEAS 0.2835294 36 0.021997 OA decomposition OA0008I OA converged in 36.681423 seconds found solution of value 20.729825 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 257268 branch-and-bound nodes in total Cbc0012I Integer solution of 20.729825 found by nonlinear programm after 12 iterations and 0 nodes (36.68 seconds) Cbc0031I 6 added rows had average density of 2 Cbc0013I At root node, 6 cuts changed objective from -1.2e-07 to -1.2e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 10 row cuts average 2.0 elements, 0 column cuts (6 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 20.72982505028621, took 12 iterations and 0 nodes (36.68 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 10 cuts of which 6 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 20.7298. Best solution: 2.072983e+01 (0 nodes, 36.995 seconds) Best possible: 2.072983e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo7.gms(508) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo7.gms Stop 09/08/12 20:00:03 elapsed 0:00:37.075 @04 1347127203 ----------------------------- Sa 8. Sep 20:00:03 CEST 2012 ----------------------------- =ready= Linux opt216 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo8_ar2_1.gms =========== ----------------------------- Sa 8. Sep 19:59:27 CEST 2012 ----------------------------- @03 1347127167 --- Job fo8_ar2_1.gms Start 09/08/12 19:59:27 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo8_ar2_1.gms(850) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- fo8_ar2_1.gms(845) 3 Mb --- Generating MINLP model m --- fo8_ar2_1.gms(850) 5 Mb --- 348 rows 145 columns 1,381 non-zeroes --- 81 nl-code 16 nl-non-zeroes --- 56 discrete-columns --- fo8_ar2_1.gms(850) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1364 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 144 variables with only lower bounds: 0 variables with lower and upper bounds: 72 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 346 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 344 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.17e+00 1.00e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.1543689e+01 0.00e+00 3.43e+02 1.1 3.78e+01 - 2.24e-03 2.63e-01f 1 2 5.3086374e+01 0.00e+00 2.88e+02 1.1 4.35e+00 2.0 1.00e+00 4.17e-01h 1 3 5.0461187e+01 0.00e+00 9.62e+01 -1.0 2.36e+00 - 8.07e-01 1.00e+00h 1 4 3.0900613e+01 0.00e+00 1.91e+01 -1.6 2.22e+00 - 8.08e-01 1.00e+00f 1 5 6.2728051e+00 0.00e+00 7.56e+00 -1.4 3.64e+00 - 6.03e-01 9.18e-01f 1 6 2.6605242e+00 0.00e+00 4.99e-01 -3.8 7.60e-01 - 9.31e-01 6.01e-01f 1 7 3.0493918e-01 0.00e+00 6.57e-02 -4.2 5.89e-01 - 8.67e-01 8.49e-01f 1 8 7.2392600e-02 0.00e+00 6.05e-02 -5.5 1.25e-01 - 9.55e-01 6.88e-01f 1 9 1.7581762e-02 0.00e+00 7.72e-02 -6.2 4.67e-02 - 9.87e-01 7.41e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.3671858e-04 0.00e+00 2.73e-03 -9.5 5.86e-03 - 9.86e-01 9.69e-01h 1 11 1.6961299e-06 0.00e+00 8.74e-06 -11.0 3.06e-03 - 9.97e-01 9.97e-01h 1 12 -8.7607852e-10 0.00e+00 9.79e-06 -11.0 1.02e+00 - 9.27e-01 1.00e+00h 1 13 -1.1167024e-09 0.00e+00 3.25e-01 -11.0 1.63e+01 - 4.25e-01 1.00e+00h 1 14 -7.2750787e-10 0.00e+00 9.07e-02 -10.6 5.85e+01 - 4.33e-01 1.00e+00h 1 15 -7.3260704e-10 0.00e+00 2.37e-02 -10.6 1.03e+02 - 6.10e-01 1.00e+00h 1 16 -7.3223614e-10 0.00e+00 1.04e-02 -10.6 2.59e+02 - 5.85e-01 1.00e+00h 1 17 -7.3224151e-10 0.00e+00 4.29e-03 -10.6 6.19e+02 - 5.86e-01 1.00e+00h 1 18 -7.3223971e-10 0.00e+00 1.74e-03 -10.6 1.47e+03 - 5.94e-01 1.00e+00h 1 19 -1.1226366e-09 0.00e+00 2.30e-02 -11.0 1.48e+03 - 7.76e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.1193638e-09 0.00e+00 1.68e-02 -11.0 6.16e+03 - 5.73e-01 1.00e+00h 1 21 -1.1196141e-09 0.00e+00 5.42e-03 -11.0 1.24e+04 - 6.52e-01 1.00e+00h 1 22 -1.1196111e-09 0.00e+00 1.53e-03 -11.0 2.44e+04 - 7.19e-01 1.00e+00h 1 23 -1.1196117e-09 0.00e+00 5.92e-05 -11.0 3.37e+04 - 9.61e-01 1.00e+00h 1 24 -1.1196123e-09 0.00e+00 1.11e-16 -11.0 2.55e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 24 (scaled) (unscaled) Objective...............: -1.1196123008517811e-09 -1.1196123008517811e-09 Dual infeasibility......: 1.1102230246251565e-16 1.1102230246251565e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2486289974221056e-11 1.2486289974221056e-11 Overall NLP error.......: 1.2486289974221056e-11 1.2486289974221056e-11 Number of objective function evaluations = 25 Number of objective gradient evaluations = 25 Number of equality constraint evaluations = 25 Number of inequality constraint evaluations = 25 Number of equality constraint Jacobian evaluations = 25 Number of inequality constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Total CPU secs in IPOPT (w/o function evaluations) = 0.035 Total CPU secs in NLP function evaluations = 0.006 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.1196123e-09 24 0.040993 build initial OA NLP0014I 2 OPT 30.827537 29 0.018998 OA decomposition OA0003I New best feasible of 30.827537 found after 24.461282 sec and NLP0014I 3 OPT 30.34061 27 0.015998 OA decomposition OA0003I New best feasible of 30.34061 found after 33.618889 sec and NLP0014I 4 OPT 30.662872 22 0.011998 OA decomposition OA0008I OA converged in 51.931106 seconds found solution of value 30.34061 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 246668 branch-and-bound nodes in total Cbc0012I Integer solution of 30.34061 found by nonlinear programm after 9 iterations and 0 nodes (51.93 seconds) Cbc0031I 8 added rows had average density of 2 Cbc0013I At root node, 8 cuts changed objective from -1.4e-07 to -1.4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 14 row cuts average 2.0 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 30.34061038909258, took 9 iterations and 0 nodes (51.93 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 14 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 30.3406. Best solution: 3.034061e+01 (0 nodes, 52.355 seconds) Best possible: 3.034061e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo8_ar2_1.gms(850) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo8_ar2_1.gms Stop 09/08/12 20:00:19 elapsed 0:00:52.490 @04 1347127219 ----------------------------- Sa 8. Sep 20:00:19 CEST 2012 ----------------------------- =ready= Linux opt230 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo8_ar25_1.gms =========== ----------------------------- Sa 8. Sep 19:59:28 CEST 2012 ----------------------------- @03 1347127168 --- Job fo8_ar25_1.gms Start 09/08/12 19:59:28 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo8_ar25_1.gms(850) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- fo8_ar25_1.gms(845) 3 Mb --- Generating MINLP model m --- fo8_ar25_1.gms(850) 5 Mb --- 348 rows 145 columns 1,381 non-zeroes --- 81 nl-code 16 nl-non-zeroes --- 56 discrete-columns --- fo8_ar25_1.gms(850) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1364 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 144 variables with only lower bounds: 0 variables with lower and upper bounds: 72 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 346 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 344 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 5.56e+00 9.55e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.1847672e+01 0.00e+00 5.52e+02 1.2 3.61e+01 - 2.42e-03 4.15e-01f 1 2 8.4570165e+01 0.00e+00 3.77e+02 0.9 5.51e+00 2.0 1.00e+00 7.40e-01h 1 3 6.2141500e+01 0.00e+00 5.21e+00 -2.4 2.18e+00 - 9.35e-01 1.00e+00f 1 4 7.4051085e+00 0.00e+00 1.68e+00 -1.7 6.04e+00 - 6.79e-01 1.00e+00f 1 5 2.3109005e+00 0.00e+00 3.74e-01 -2.6 1.04e+00 - 7.76e-01 6.80e-01f 1 6 6.8779125e-01 0.00e+00 5.71e-02 -4.0 7.20e-01 - 8.92e-01 6.98e-01f 1 7 6.6277515e-02 0.00e+00 1.07e-02 -4.3 4.44e-01 - 8.05e-01 8.15e-01f 1 8 2.7103415e-02 0.00e+00 1.95e-01 -5.9 3.64e-02 - 9.55e-01 5.04e-01h 1 9 3.4026643e-03 0.00e+00 4.02e-02 -7.5 1.37e-02 - 9.83e-01 8.68e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.6501659e-05 0.00e+00 7.09e-04 -11.0 1.35e-03 - 9.89e-01 9.83e-01h 1 11 4.1945968e-08 0.00e+00 4.75e-07 -11.0 1.16e-02 - 9.99e-01 9.99e-01h 1 12 -1.0607813e-09 0.00e+00 8.68e-06 -11.0 4.95e-08 1.5 1.00e+00 9.97e-01h 1 13 -1.1104483e-09 0.00e+00 2.47e-09 -11.0 2.23e-10 1.0 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: -1.1104482773062411e-09 -1.1104482773062411e-09 Dual infeasibility......: 2.4724700369019869e-09 2.4724700369019869e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.7816896346413862e-11 1.7816896346413862e-11 Overall NLP error.......: 2.4724700369019869e-09 2.4724700369019869e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 Number of equality constraint Jacobian evaluations = 14 Number of inequality constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 13 Total CPU secs in IPOPT (w/o function evaluations) = 0.011 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.1104483e-09 13 0.010998 build initial OA NLP0014I 2 INFEAS 0.076597354 86 0.06299 OA decomposition NLP0014I 3 OPT 28.045181 57 0.036995 OA decomposition OA0003I New best feasible of 28.045181 found after 78.522063 sec and OA0008I OA converged in 86.458856 seconds found solution of value 28.045181 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 350864 branch-and-bound nodes in total Cbc0012I Integer solution of 28.045181 found by nonlinear programm after 6 iterations and 0 nodes (86.46 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.4e-07 to -1.4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 4 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 28.04518137732747, took 6 iterations and 0 nodes (86.46 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 4 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 28.0452. Best solution: 2.804518e+01 (0 nodes, 87.043 seconds) Best possible: 2.804518e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo8_ar25_1.gms(850) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo8_ar25_1.gms Stop 09/08/12 20:00:55 elapsed 0:01:27.126 @04 1347127255 ----------------------------- Sa 8. Sep 20:00:55 CEST 2012 ----------------------------- =ready= Linux opt220 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo8_ar3_1.gms =========== ----------------------------- Sa 8. Sep 19:59:32 CEST 2012 ----------------------------- @03 1347127172 --- Job fo8_ar3_1.gms Start 09/08/12 19:59:32 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo8_ar3_1.gms(850) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- fo8_ar3_1.gms(845) 3 Mb --- Generating MINLP model m --- fo8_ar3_1.gms(850) 5 Mb --- 348 rows 145 columns 1,381 non-zeroes --- 81 nl-code 16 nl-non-zeroes --- 56 discrete-columns --- fo8_ar3_1.gms(850) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1364 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 144 variables with only lower bounds: 0 variables with lower and upper bounds: 72 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 346 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 344 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 6.79e+00 9.20e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.6962614e+01 0.00e+00 5.92e+02 1.2 3.47e+01 - 2.60e-03 4.40e-01f 1 2 8.9823671e+01 0.00e+00 4.09e+02 -0.1 6.05e+00 2.0 7.18e-01 7.27e-01h 1 3 1.5237395e+01 0.00e+00 2.81e+01 -2.0 7.12e+00 - 8.76e-01 9.31e-01f 1 4 3.4598308e+00 0.00e+00 6.84e+00 -1.4 2.63e+00 - 7.84e-01 7.57e-01f 1 5 1.0839906e+00 0.00e+00 2.23e+00 -2.5 8.66e-01 - 7.75e-01 6.75e-01f 1 6 2.1993457e-01 0.00e+00 1.80e-01 -2.2 3.01e+00 - 3.89e-01 1.00e+00f 1 7 7.7541716e-02 0.00e+00 1.70e-01 -4.2 1.93e-01 - 9.33e-01 4.62e-01h 1 8 1.9737261e-02 0.00e+00 1.26e-01 -6.9 2.19e-02 - 9.76e-01 7.02e-01h 1 9 1.2033369e-03 0.00e+00 1.07e-02 -8.9 2.63e-03 - 9.89e-01 9.37e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.3929096e-05 0.00e+00 1.26e-04 -11.0 5.03e-04 - 9.90e-01 9.88e-01h 1 11 1.1300630e-09 0.00e+00 7.66e-08 -11.0 4.76e-02 - 9.98e-01 1.00e+00h 1 12 -7.9442518e-10 8.27e-18 1.18e-02 -11.0 1.84e+01 - 7.70e-01 8.38e-01h 1 13 -1.0740107e-09 0.00e+00 2.49e-01 -11.0 8.43e+01 - 4.15e-01 1.00e+00h 1 14 -1.0923247e-09 0.00e+00 5.01e-02 -11.0 1.44e+02 - 5.98e-01 1.00e+00h 1 15 -1.0917735e-09 0.00e+00 2.22e-02 -11.0 3.56e+02 - 5.99e-01 1.00e+00h 1 16 -1.0918851e-09 0.00e+00 9.18e-03 -11.0 8.81e+02 - 5.70e-01 1.00e+00h 1 17 -1.0918849e-09 0.00e+00 3.54e-03 -11.0 2.00e+03 - 6.15e-01 1.00e+00h 1 18 -1.0918856e-09 0.00e+00 1.49e-03 -11.0 4.94e+03 - 5.80e-01 1.00e+00h 1 19 -1.0918855e-09 0.00e+00 5.20e-04 -11.0 1.04e+04 - 6.51e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.0918845e-09 0.00e+00 1.72e-04 -11.0 2.18e+04 - 6.69e-01 1.00e+00h 1 21 -1.1196218e-09 0.00e+00 1.00e-03 -11.0 2.84e+04 - 8.93e-01 1.00e+00h 1 22 -1.1196107e-09 0.00e+00 1.51e-16 -11.0 2.98e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 22 (scaled) (unscaled) Objective...............: -1.1196107447212111e-09 -1.1196107447212111e-09 Dual infeasibility......: 1.5055937574657711e-16 1.5055937574657711e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.4457432224840181e-11 1.4457432224840181e-11 Overall NLP error.......: 1.4457432224840181e-11 1.4457432224840181e-11 Number of objective function evaluations = 23 Number of objective gradient evaluations = 23 Number of equality constraint evaluations = 23 Number of inequality constraint evaluations = 23 Number of equality constraint Jacobian evaluations = 23 Number of inequality constraint Jacobian evaluations = 23 Number of Lagrangian Hessian evaluations = 22 Total CPU secs in IPOPT (w/o function evaluations) = 0.039 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.1196107e-09 22 0.040994 build initial OA NLP0014I 2 OPT 23.910053 23 0.013998 OA decomposition OA0003I New best feasible of 23.910053 found after 9.545549 sec and OA0008I OA converged in 11.856198 seconds found solution of value 23.910053 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 40502 branch-and-bound nodes in total Cbc0012I Integer solution of 23.910053 found by nonlinear programm after 5 iterations and 0 nodes (11.86 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.4e-07 to -1.4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 23.91005345167743, took 5 iterations and 0 nodes (11.86 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 3 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 23.9101. Best solution: 2.391005e+01 (0 nodes, 11.929 seconds) Best possible: 2.391005e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo8_ar3_1.gms(850) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo8_ar3_1.gms Stop 09/08/12 19:59:44 elapsed 0:00:12.067 @04 1347127184 ----------------------------- Sa 8. Sep 19:59:44 CEST 2012 ----------------------------- =ready= Linux opt203 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo8_ar4_1.gms =========== ----------------------------- Sa 8. Sep 19:59:35 CEST 2012 ----------------------------- @03 1347127175 --- Job fo8_ar4_1.gms Start 09/08/12 19:59:35 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo8_ar4_1.gms(850) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- fo8_ar4_1.gms(845) 3 Mb --- Generating MINLP model m --- fo8_ar4_1.gms(850) 5 Mb --- 348 rows 145 columns 1,381 non-zeroes --- 81 nl-code 16 nl-non-zeroes --- 56 discrete-columns --- fo8_ar4_1.gms(850) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1364 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 144 variables with only lower bounds: 0 variables with lower and upper bounds: 72 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 346 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 344 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.67e+00 8.73e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 9.4846095e+01 9.18e-01 6.52e+02 1.2 3.30e+01 - 2.91e-03 4.74e-01f 1 2 9.5712593e+01 5.15e-01 5.27e+02 0.1 6.67e+00 2.0 6.74e-01 1.91e-01h 1 3 9.6512758e+01 1.96e-01 4.06e+02 -0.8 5.75e+00 1.5 8.23e-01 2.34e-01h 1 4 1.8701074e+01 1.83e-01 3.10e+02 -1.1 3.00e+01 - 7.02e-01 2.40e-01f 1 5 3.9724930e+00 1.39e-01 1.39e+02 -1.3 4.65e+00 - 5.97e-01 5.51e-01f 1 6 1.0954068e+00 3.51e-02 5.94e+01 -2.3 1.68e+00 - 8.45e-01 5.72e-01h 1 7 2.9293631e-01 0.00e+00 1.71e+01 -3.1 7.21e-01 - 8.65e-01 7.12e-01h 1 8 1.0339737e-01 7.59e-03 3.99e+00 -4.0 5.00e-01 - 8.12e-01 7.67e-01h 1 9 4.3126942e-02 1.97e-03 1.45e+00 -3.1 1.84e+01 - 3.46e-01 6.36e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.8627291e-02 3.85e-04 7.31e-01 -3.5 1.04e+01 - 7.05e-01 4.97e-01h 1 11 6.2926287e-03 0.00e+00 2.81e-01 -7.4 1.56e-02 - 9.87e-01 6.16e-01h 1 12 3.8886084e-04 8.59e-08 1.78e-02 -8.9 1.35e-02 - 9.89e-01 9.37e-01h 1 13 4.8194867e-06 1.20e-09 2.21e-04 -11.0 8.74e-03 - 9.90e-01 9.88e-01h 1 14 1.2170455e-10 0.00e+00 4.43e-07 -11.0 8.59e-01 - 9.88e-01 1.00e+00h 1 15 -1.0084556e-09 6.22e-14 7.06e-02 -11.0 6.91e+01 - 3.65e-01 8.72e-01h 1 16 3.9291372e-10 0.00e+00 2.32e-01 -10.2 6.67e+02 - 2.13e-01 1.00e+00h 1 17 3.6692489e-10 0.00e+00 5.47e-05 -10.2 8.45e+02 - 9.98e-01 1.00e+00h 1 18 3.6744161e-10 0.00e+00 4.38e-03 -10.2 8.19e+04 - 2.88e-02 1.00e+00h 1 19 3.6744061e-10 0.00e+00 1.48e-11 -10.2 1.62e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 19 (scaled) (unscaled) Objective...............: 3.6744061395022604e-10 3.6744061395022604e-10 Dual infeasibility......: 1.4796205426909724e-11 1.4796205426909724e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.7940666381358034e-11 9.7940666381358034e-11 Overall NLP error.......: 9.7940666381358034e-11 9.7940666381358034e-11 Number of objective function evaluations = 20 Number of objective gradient evaluations = 20 Number of equality constraint evaluations = 20 Number of inequality constraint evaluations = 20 Number of equality constraint Jacobian evaluations = 20 Number of inequality constraint Jacobian evaluations = 20 Number of Lagrangian Hessian evaluations = 19 Total CPU secs in IPOPT (w/o function evaluations) = 0.015 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 3.6744061e-10 19 0.014998 build initial OA NLP0014I 2 OPT 22.381897 25 0.014997 OA decomposition OA0003I New best feasible of 22.381897 found after 4.307345 sec and OA0008I OA converged in 6.871955 seconds found solution of value 22.381897 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 25819 branch-and-bound nodes in total Cbc0012I Integer solution of 22.381897 found by nonlinear programm after 5 iterations and 0 nodes (6.87 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 1 cuts changed objective from -1.4e-07 to -1.4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 2.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 22.38189650941521, took 5 iterations and 0 nodes (6.87 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 22.3819. Best solution: 2.238190e+01 (0 nodes, 6.929 seconds) Best possible: 2.238190e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo8_ar4_1.gms(850) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo8_ar4_1.gms Stop 09/08/12 19:59:42 elapsed 0:00:07.009 @04 1347127182 ----------------------------- Sa 8. Sep 19:59:42 CEST 2012 ----------------------------- =ready= Linux opt232 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo8_ar5_1.gms =========== ----------------------------- Sa 8. Sep 19:59:35 CEST 2012 ----------------------------- @03 1347127175 --- Job fo8_ar5_1.gms Start 09/08/12 19:59:35 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo8_ar5_1.gms(850) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- fo8_ar5_1.gms(845) 3 Mb --- Generating MINLP model m --- fo8_ar5_1.gms(850) 5 Mb --- 348 rows 145 columns 1,381 non-zeroes --- 81 nl-code 16 nl-non-zeroes --- 56 discrete-columns --- fo8_ar5_1.gms(850) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1364 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 144 variables with only lower bounds: 0 variables with lower and upper bounds: 72 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 346 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 344 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 9.66e+00 8.52e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 9.9658062e+01 1.24e+00 6.89e+02 1.2 3.21e+01 - 3.17e-03 4.94e-01f 1 2 1.0020976e+02 9.46e-01 6.11e+02 0.3 6.83e+00 2.0 6.28e-01 1.10e-01h 1 3 1.0104097e+02 5.90e-01 4.94e+02 -0.4 6.58e+00 1.5 7.98e-01 1.96e-01h 1 4 1.0400206e+02 0.00e+00 6.08e+01 -1.6 5.47e+00 1.0 8.25e-01 1.00e+00h 1 5 2.8424564e+01 0.00e+00 5.65e+01 -0.9 1.08e+02 - 4.59e-01 7.08e-02f 1 6 7.7057172e+00 0.00e+00 3.72e+01 -1.1 1.02e+01 - 4.83e-01 3.42e-01f 1 7 3.6280467e+00 0.00e+00 2.42e+01 -1.7 3.56e+00 - 6.71e-01 3.50e-01f 1 8 1.2130834e+00 0.00e+00 8.90e+00 -1.9 5.22e+00 - 8.87e-01 6.34e-01f 1 9 3.8237246e-01 0.00e+00 2.27e+00 -4.5 3.26e-01 - 9.26e-01 7.46e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 8.6690121e-02 0.00e+00 1.24e+00 -4.3 2.51e+00 - 7.16e-01 4.53e-01f 1 11 3.8727078e-02 0.00e+00 7.29e-01 -3.9 2.24e+01 - 4.53e-01 4.11e-01h 1 12 1.3483601e-02 0.00e+00 2.90e-01 -6.4 1.36e-01 - 9.85e-01 6.13e-01h 1 13 3.6040101e-04 0.00e+00 7.93e-03 -9.9 4.18e-03 - 9.88e-01 9.73e-01h 1 14 2.9655069e-06 0.00e+00 6.53e-05 -11.0 1.71e-02 - 9.92e-01 9.92e-01h 1 15 -7.2302049e-10 0.00e+00 2.86e-06 -11.0 2.07e+00 - 9.66e-01 1.00e+00h 1 16 -1.0982012e-09 8.27e-18 1.75e-01 -11.0 6.14e+01 - 4.10e-01 9.13e-01h 1 17 -7.4090035e-10 0.00e+00 1.93e-01 -10.6 2.38e+02 - 2.94e-01 1.00e+00h 1 18 -7.5367821e-10 0.00e+00 3.03e-02 -10.6 3.35e+02 - 6.84e-01 1.00e+00h 1 19 -7.4829439e-10 0.00e+00 1.16e-01 -10.6 3.13e-02 0.6 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.5252775e-10 0.00e+00 2.78e-06 -10.6 2.25e-06 0.1 1.00e+00 1.00e+00h 1 21 -1.1222652e-09 0.00e+00 1.04e-10 -11.0 2.54e-10 -0.4 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: -1.1222652328250997e-09 -1.1222652328250997e-09 Dual infeasibility......: 1.0436625509526250e-10 1.0436625509526250e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.1050494420087108e-11 1.1050494420087108e-11 Overall NLP error.......: 1.0436625509526250e-10 1.0436625509526250e-10 Number of objective function evaluations = 22 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 22 Number of inequality constraint evaluations = 22 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total CPU secs in IPOPT (w/o function evaluations) = 0.035 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.1222652e-09 21 0.039994 build initial OA NLP0014I 2 OPT 22.381897 24 0.014998 OA decomposition OA0003I New best feasible of 22.381897 found after 15.340668 sec and OA0008I OA converged in 21.722697 seconds found solution of value 22.381897 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 91320 branch-and-bound nodes in total Cbc0012I Integer solution of 22.381897 found by nonlinear programm after 3 iterations and 0 nodes (21.72 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 1 cuts changed objective from -1.4e-07 to -1.4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 2.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 22.38189650965421, took 3 iterations and 0 nodes (21.72 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 22.3819. Best solution: 2.238190e+01 (0 nodes, 21.879 seconds) Best possible: 2.238190e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo8_ar5_1.gms(850) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo8_ar5_1.gms Stop 09/08/12 19:59:57 elapsed 0:00:22.020 @04 1347127197 ----------------------------- Sa 8. Sep 19:59:57 CEST 2012 ----------------------------- =ready= Linux opt225 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo8.gms =========== ----------------------------- Sa 8. Sep 19:59:37 CEST 2012 ----------------------------- @03 1347127177 --- Job fo8.gms Start 09/08/12 19:59:37 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo8.gms(643) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- fo8.gms(638) 3 Mb --- Generating MINLP model m --- fo8.gms(643) 5 Mb --- 274 rows 147 columns 1,137 non-zeroes --- 81 nl-code 16 nl-non-zeroes --- 56 discrete-columns --- fo8.gms(643) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1106 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 144 variables with only lower bounds: 0 variables with lower and upper bounds: 72 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 273 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 273 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.67e+00 7.03e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.9816908e+01 6.71e-01 3.15e+02 0.6 1.32e+01 - 1.87e-02 1.00e+00f 1 2 4.9773965e+01 0.00e+00 2.88e+02 -0.9 2.88e+00 2.0 6.86e-01 1.00e+00h 1 3 2.2800858e+00 0.00e+00 1.01e+02 -3.1 5.65e+00 - 9.08e-01 6.49e-01f 1 4 6.9303082e-01 0.00e+00 2.99e+01 -4.2 6.13e-01 - 9.23e-01 7.04e-01f 1 5 2.5397617e-02 0.00e+00 1.21e+00 -6.1 3.35e-01 - 9.47e-01 9.59e-01f 1 6 3.3984566e-04 0.00e+00 1.62e-02 -11.0 7.93e-03 - 9.89e-01 9.87e-01h 1 7 3.4084506e-06 0.00e+00 1.62e-04 -11.0 1.01e-04 - 9.90e-01 9.90e-01h 1 8 -1.9380814e-10 0.00e+00 4.74e-08 -11.0 1.12e-03 - 1.00e+00 1.00e+00h 1 9 -8.5371483e-10 8.27e-18 5.26e-02 -11.0 2.75e+00 - 8.97e-01 6.80e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.1054748e-09 0.00e+00 4.42e-01 -11.0 2.68e+01 - 2.85e-01 1.00e+00h 1 11 -1.1241494e-09 0.00e+00 9.41e-02 -11.0 3.75e+01 - 6.32e-01 1.00e+00h 1 12 -1.1190094e-09 0.00e+00 6.14e-02 -11.0 1.02e+02 - 5.78e-01 1.00e+00h 1 13 -1.1198448e-09 0.00e+00 2.18e-02 -11.0 2.40e+02 - 5.88e-01 1.00e+00h 1 14 -1.1198041e-09 0.00e+00 9.18e-03 -11.0 5.80e+02 - 5.88e-01 1.00e+00h 1 15 -1.1198061e-09 0.00e+00 3.75e-03 -11.0 1.39e+03 - 5.91e-01 1.00e+00h 1 16 -1.1198055e-09 0.00e+00 1.51e-03 -11.0 3.28e+03 - 5.98e-01 1.00e+00h 1 17 -1.1198057e-09 0.00e+00 5.79e-04 -11.0 7.50e+03 - 6.16e-01 1.00e+00h 1 18 -1.1198060e-09 0.00e+00 1.97e-04 -11.0 1.59e+04 - 6.60e-01 1.00e+00h 1 19 -1.1198062e-09 0.00e+00 4.38e-05 -11.0 2.82e+04 - 7.77e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.1198064e-09 0.00e+00 1.53e-16 -11.0 3.19e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 20 (scaled) (unscaled) Objective...............: -1.1198064479039531e-09 -1.1198064479039531e-09 Dual infeasibility......: 1.5276400889874131e-16 1.5276400889874131e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.5569147110384296e-11 1.5569147110384296e-11 Overall NLP error.......: 1.5569147110384296e-11 1.5569147110384296e-11 Number of objective function evaluations = 21 Number of objective gradient evaluations = 21 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 21 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 21 Number of Lagrangian Hessian evaluations = 20 Total CPU secs in IPOPT (w/o function evaluations) = 0.011 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.1198064e-09 20 0.011998 build initial OA NLP0014I 2 INFEAS 0.3551938 32 0.022996 OA decomposition NLP0014I 3 OPT 23.910053 23 0.010998 OA decomposition OA0003I New best feasible of 23.910053 found after 50.78128 sec and NLP0014I 4 OPT 22.381897 27 0.014998 OA decomposition OA0003I New best feasible of 22.381897 found after 94.779592 sec and OA0008I OA converged in 129.24635 seconds found solution of value 22.381897 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 620360 branch-and-bound nodes in total Cbc0012I Integer solution of 22.381897 found by nonlinear programm after 8 iterations and 0 nodes (129.25 seconds) Cbc0031I 8 added rows had average density of 2 Cbc0013I At root node, 8 cuts changed objective from -1.4e-07 to -1.4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 11 row cuts average 2.0 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 22.38189650200419, took 8 iterations and 0 nodes (129.25 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 11 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 22.3819. Best solution: 2.238190e+01 (0 nodes, 130.198 seconds) Best possible: 2.238190e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo8.gms(643) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo8.gms Stop 09/08/12 20:01:47 elapsed 0:02:10.279 @04 1347127307 ----------------------------- Sa 8. Sep 20:01:47 CEST 2012 ----------------------------- =ready= Linux opt203 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo9_ar2_1.gms =========== ----------------------------- Sa 8. Sep 19:59:42 CEST 2012 ----------------------------- @03 1347127182 --- Job fo9_ar2_1.gms Start 09/08/12 19:59:42 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo9_ar2_1.gms(1055) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- fo9_ar2_1.gms(1050) 3 Mb --- Generating MINLP model m --- fo9_ar2_1.gms(1055) 5 Mb --- 436 rows 181 columns 1,751 non-zeroes --- 91 nl-code 18 nl-non-zeroes --- 72 discrete-columns --- fo9_ar2_1.gms(1055) 3 Mb --- Executing BONMIN: elapsed 0:00:00.016 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1732 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 180 variables with only lower bounds: 0 variables with lower and upper bounds: 90 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 434 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 432 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.17e+00 1.06e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.8101615e+01 0.00e+00 3.39e+02 1.2 3.65e+01 - 2.11e-03 2.52e-01f 1 2 5.9853776e+01 0.00e+00 2.80e+02 1.1 4.52e+00 2.0 1.00e+00 4.46e-01h 1 3 5.6827037e+01 0.00e+00 9.97e+01 -0.9 2.26e+00 - 8.06e-01 1.00e+00h 1 4 3.5097563e+01 0.00e+00 2.07e+01 -1.5 2.17e+00 - 8.00e-01 1.00e+00f 1 5 6.5841516e+00 0.00e+00 8.25e+00 -1.3 3.47e+00 - 5.99e-01 9.49e-01f 1 6 2.8186695e+00 0.00e+00 3.99e-01 -4.1 6.99e-01 - 9.46e-01 5.90e-01f 1 7 4.0144217e-01 0.00e+00 3.87e-02 -4.2 5.90e-01 - 8.94e-01 8.11e-01f 1 8 8.8374996e-02 0.00e+00 5.40e-02 -5.8 1.01e-01 - 9.79e-01 7.61e-01f 1 9 2.7210411e-03 0.00e+00 2.06e-03 -9.0 2.32e-02 - 9.86e-01 9.69e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.4664984e-06 0.00e+00 5.01e-06 -11.0 7.16e-04 - 9.98e-01 9.98e-01h 1 11 -9.4967572e-10 0.00e+00 3.12e-07 -11.0 6.23e-02 - 9.92e-01 1.00e+00h 1 12 -1.2776315e-09 0.00e+00 2.96e-01 -11.0 1.01e+01 - 4.81e-01 1.00e+00h 1 13 -1.1851233e-09 0.00e+00 9.83e-02 -10.9 2.27e+01 - 5.60e-01 1.00e+00h 1 14 -1.1871579e-09 0.00e+00 3.62e-02 -10.9 4.88e+01 - 6.00e-01 1.00e+00h 1 15 -1.1870132e-09 0.00e+00 1.48e-02 -10.9 1.22e+02 - 5.83e-01 1.00e+00h 1 16 -1.1870135e-09 0.00e+00 6.11e-03 -10.9 2.91e+02 - 5.88e-01 1.00e+00h 1 17 -1.1870119e-09 0.00e+00 2.52e-03 -10.9 7.01e+02 - 5.87e-01 1.00e+00h 1 18 -1.1870104e-09 0.00e+00 1.03e-03 -10.9 1.67e+03 - 5.93e-01 1.00e+00h 1 19 -1.1870107e-09 0.00e+00 4.11e-04 -10.9 3.93e+03 - 6.00e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.2797147e-09 0.00e+00 8.50e-03 -11.0 6.90e+03 - 6.80e-01 1.00e+00h 1 21 -1.2796076e-09 0.00e+00 3.19e-03 -11.0 1.73e+04 - 6.47e-01 1.00e+00h 1 22 -1.2796109e-09 0.00e+00 6.25e-04 -11.0 2.86e+04 - 8.03e-01 1.00e+00h 1 23 -1.2796105e-09 0.00e+00 1.13e-16 -11.0 3.54e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 23 (scaled) (unscaled) Objective...............: -1.2796105355792182e-09 -1.2796105355792182e-09 Dual infeasibility......: 1.1251426925039513e-16 1.1251426925039513e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.5368669198192909e-11 1.5368669198192909e-11 Overall NLP error.......: 1.5368669198192909e-11 1.5368669198192909e-11 Number of objective function evaluations = 24 Number of objective gradient evaluations = 24 Number of equality constraint evaluations = 24 Number of inequality constraint evaluations = 24 Number of equality constraint Jacobian evaluations = 24 Number of inequality constraint Jacobian evaluations = 24 Number of Lagrangian Hessian evaluations = 23 Total CPU secs in IPOPT (w/o function evaluations) = 0.042 Total CPU secs in NLP function evaluations = 0.006 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.2796105e-09 23 0.047992 build initial OA OA0012I After 196.40814.1f seconds, 1 iterations upper bound 1e+500g, lower bound 32.1079580g NLP0014I 2 OPT 32.625 23 0.015997 OA decomposition OA0003I New best feasible of 32.625 found after 196.42414 sec and NLP0014I 3 OPT 33.630769 23 0.016998 OA decomposition OA0008I OA converged in 275.86906 seconds found solution of value 32.625 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 1148434 branch-and-bound nodes in total Cbc0012I Integer solution of 32.625 found by nonlinear programm after 6 iterations and 0 nodes (275.87 seconds) Cbc0031I 5 added rows had average density of 2 Cbc0013I At root node, 5 cuts changed objective from -1.6e-07 to -1.6e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 5 row cuts average 2.0 elements, 0 column cuts (5 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 32.62499997853094, took 6 iterations and 0 nodes (275.87 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 5 cuts of which 5 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 32.625. Best solution: 3.262500e+01 (0 nodes, 277.732 seconds) Best possible: 3.262500e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo9_ar2_1.gms(1055) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo9_ar2_1.gms Stop 09/08/12 20:04:20 elapsed 0:04:37.890 @04 1347127460 ----------------------------- Sa 8. Sep 20:04:20 CEST 2012 ----------------------------- =ready= Linux opt210 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo9_ar25_1.gms =========== ----------------------------- Sa 8. Sep 19:59:43 CEST 2012 ----------------------------- @03 1347127183 --- Job fo9_ar25_1.gms Start 09/08/12 19:59:43 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo9_ar25_1.gms(1055) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- fo9_ar25_1.gms(1050) 3 Mb --- Generating MINLP model m --- fo9_ar25_1.gms(1055) 5 Mb --- 436 rows 181 columns 1,751 non-zeroes --- 91 nl-code 18 nl-non-zeroes --- 72 discrete-columns --- fo9_ar25_1.gms(1055) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1732 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 180 variables with only lower bounds: 0 variables with lower and upper bounds: 90 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 434 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 432 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 5.56e+00 1.01e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 9.5648744e+01 0.00e+00 5.67e+02 1.2 3.48e+01 - 2.29e-03 4.14e-01f 1 2 9.7299304e+01 0.00e+00 3.02e+02 1.1 5.75e+00 2.0 1.00e+00 4.35e-01h 1 3 8.2618149e+01 0.00e+00 3.16e+01 -2.0 3.55e+00 - 9.17e-01 1.00e+00f 1 4 2.2275606e+01 0.00e+00 8.08e+00 -1.5 5.30e+00 - 7.58e-01 1.00e+00f 1 5 4.8463031e+00 0.00e+00 1.62e+00 -2.2 2.20e+00 - 7.99e-01 7.47e-01f 1 6 1.1225577e+00 0.00e+00 1.95e-01 -2.1 1.46e+00 - 8.84e-01 7.52e-01f 1 7 2.1464797e-01 0.00e+00 3.72e-02 -4.1 3.76e-01 - 9.11e-01 7.14e-01f 1 8 5.9046057e-02 0.00e+00 9.33e-02 -6.1 5.47e-02 - 9.73e-01 6.94e-01f 1 9 2.1823599e-03 0.00e+00 4.12e-03 -8.9 1.63e-02 - 9.85e-01 9.63e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.0095270e-05 0.00e+00 1.93e-05 -11.0 7.71e-04 - 9.96e-01 9.95e-01h 1 11 -9.5131805e-10 0.00e+00 9.24e-08 -11.0 8.33e-02 - 9.95e-01 1.00e+00h 1 12 -1.2918379e-09 0.00e+00 1.55e-01 -11.0 1.77e+01 - 4.80e-01 1.00e+00h 1 13 -1.1103400e-09 0.00e+00 8.93e-02 -10.8 4.88e+01 - 5.04e-01 1.00e+00h 1 14 -1.1156619e-09 0.00e+00 2.54e-02 -10.8 9.71e+01 - 6.12e-01 1.00e+00h 1 15 -1.1152478e-09 0.00e+00 1.18e-02 -10.8 2.49e+02 - 5.71e-01 1.00e+00h 1 16 -1.1152567e-09 0.00e+00 4.68e-03 -10.8 5.77e+02 - 6.01e-01 1.00e+00h 1 17 -1.1152566e-09 0.00e+00 1.97e-03 -10.8 1.43e+03 - 5.78e-01 1.00e+00h 1 18 -1.1152565e-09 0.00e+00 7.68e-04 -10.8 3.27e+03 - 6.11e-01 1.00e+00h 1 19 -1.1152564e-09 0.00e+00 3.05e-04 -10.8 7.71e+03 - 6.02e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.1152572e-09 0.00e+00 9.93e-05 -10.8 1.58e+04 - 6.75e-01 1.00e+00h 1 21 -1.2799643e-09 0.00e+00 7.77e-03 -11.0 1.91e+04 - 8.27e-01 1.00e+00h 1 22 -1.2796032e-09 0.00e+00 7.71e-05 -11.0 3.67e+04 - 9.92e-01 1.00e+00h 1 23 -1.2796126e-09 0.00e+00 2.22e-16 -11.0 1.98e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 23 (scaled) (unscaled) Objective...............: -1.2796126387886590e-09 -1.2796126387886590e-09 Dual infeasibility......: 2.2204460492503131e-16 2.2204460492503131e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2004541140713434e-11 1.2004541140713434e-11 Overall NLP error.......: 1.2004541140713434e-11 1.2004541140713434e-11 Number of objective function evaluations = 24 Number of objective gradient evaluations = 24 Number of equality constraint evaluations = 24 Number of inequality constraint evaluations = 24 Number of equality constraint Jacobian evaluations = 24 Number of inequality constraint Jacobian evaluations = 24 Number of Lagrangian Hessian evaluations = 23 Total CPU secs in IPOPT (w/o function evaluations) = 0.019 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.2796126e-09 23 0.020997 build initial OA OA0012I After 401.37398.1f seconds, 1 iterations upper bound 1e+500g, lower bound 30.6437940g NLP0014I 2 INFEAS 0.024331429 69 0.059991 OA decomposition OA0012I After 692.39474.1f seconds, 2 iterations upper bound 1e+500g, lower bound 31.2014680g NLP0014I 3 OPT 32.625 25 0.018997 OA decomposition OA0003I New best feasible of 32.625 found after 692.41474 sec and NLP0014I 4 OPT 33.725 21 0.015997 OA decomposition OA0012I After 906.59218.1f seconds, 4 iterations upper bound 32.6246740g, lower bound 32.0768950g NLP0014I 5 OPT 32.372686 27 0.022996 OA decomposition OA0003I New best feasible of 32.372686 found after 906.61517 sec and OA0012I After 1049.7844.1f seconds, 5 iterations upper bound 32.3723620g, lower bound 32.0813130g NLP0014I 6 OPT 32.190508 23 0.016997 OA decomposition OA0003I New best feasible of 32.190508 found after 1049.8014 sec and OA0012I After 1180.6515.1f seconds, 6 iterations upper bound 32.1901860g, lower bound 32.1843690g NLP0014I 7 OPT 32.186431 24 0.019997 OA decomposition OA0003I New best feasible of 32.186431 found after 1180.6715 sec and OA0008I OA converged in 1297.9677 seconds found solution of value 32.186431 (lower bound 1e+50 ). OA0010I Performed 6 iterations, explored 5694878 branch-and-bound nodes in total Cbc0012I Integer solution of 32.186431 found by nonlinear programm after 8 iterations and 0 nodes (1297.97 seconds) Cbc0031I 8 added rows had average density of 2 Cbc0013I At root node, 8 cuts changed objective from -1.6e-07 to -1.6e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 2.0 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 32.18643102212663, took 8 iterations and 0 nodes (1297.97 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 32.1864. Best solution: 3.218643e+01 (0 nodes, 1307.14 seconds) Best possible: 3.218643e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo9_ar25_1.gms(1055) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo9_ar25_1.gms Stop 09/08/12 20:21:31 elapsed 0:21:47.241 @04 1347128491 ----------------------------- Sa 8. Sep 20:21:31 CEST 2012 ----------------------------- =ready= Linux opt220 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo9_ar3_1.gms =========== ----------------------------- Sa 8. Sep 19:59:45 CEST 2012 ----------------------------- @03 1347127185 --- Job fo9_ar3_1.gms Start 09/08/12 19:59:45 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo9_ar3_1.gms(1055) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- fo9_ar3_1.gms(1050) 3 Mb --- Generating MINLP model m --- fo9_ar3_1.gms(1055) 5 Mb --- 436 rows 181 columns 1,751 non-zeroes --- 91 nl-code 18 nl-non-zeroes --- 72 discrete-columns --- fo9_ar3_1.gms(1055) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1732 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 180 variables with only lower bounds: 0 variables with lower and upper bounds: 90 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 434 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 432 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 6.79e+00 9.38e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0726764e+02 0.00e+00 6.40e+02 1.2 3.35e+01 - 2.47e-03 4.63e-01f 1 2 1.0966687e+02 0.00e+00 3.27e+02 -0.2 6.48e+00 2.0 7.40e-01 5.85e-01h 1 3 1.6276721e+01 0.00e+00 6.16e+01 -1.8 8.80e+00 - 8.63e-01 8.12e-01f 1 4 3.2156932e+00 0.00e+00 1.62e+01 -1.4 2.60e+00 - 8.02e-01 7.37e-01f 1 5 9.4781355e-01 0.00e+00 5.38e+00 -2.9 7.68e-01 - 7.86e-01 6.69e-01f 1 6 3.8690588e-01 0.00e+00 2.90e-01 -2.1 4.88e+00 - 3.47e-01 9.89e-01f 1 7 1.3603851e-01 0.00e+00 2.57e-01 -4.2 3.83e-01 - 9.27e-01 4.35e-01f 1 8 2.6715058e-02 0.00e+00 9.56e-02 -7.6 1.79e-02 - 9.88e-01 7.86e-01h 1 9 4.8737811e-04 0.00e+00 1.83e-03 -11.0 3.51e-03 - 9.90e-01 9.82e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 9.3475375e-07 0.00e+00 3.52e-06 -11.0 9.69e-04 - 9.98e-01 9.98e-01h 1 11 -8.5022763e-10 0.00e+00 4.01e-06 -11.0 1.24e-07 1.5 1.00e+00 9.99e-01h 1 12 -1.2558951e-09 0.00e+00 6.52e-02 -11.0 1.38e+01 - 8.90e-01 1.00e+00h 1 13 -1.2793670e-09 0.00e+00 7.06e-02 -11.0 1.24e+02 - 2.59e-01 1.00e+00h 1 14 -1.2794998e-09 0.00e+00 1.92e-02 -11.0 1.64e+02 - 7.35e-01 1.00e+00h 1 15 -1.2796103e-09 0.00e+00 1.14e-02 -11.0 6.10e+02 - 4.36e-01 1.00e+00h 1 16 -1.2796100e-09 0.00e+00 3.19e-03 -11.0 1.07e+03 - 7.21e-01 1.00e+00h 1 17 -1.2796096e-09 0.00e+00 1.74e-03 -11.0 3.69e+03 - 4.53e-01 1.00e+00h 1 18 -1.2796093e-09 0.00e+00 4.56e-04 -11.0 6.29e+03 - 7.39e-01 1.00e+00h 1 19 -1.2796099e-09 0.00e+00 2.21e-04 -11.0 1.89e+04 - 5.16e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.2796096e-09 0.00e+00 2.73e-05 -11.0 2.50e+04 - 8.76e-01 1.00e+00h 1 21 -1.2796092e-09 0.00e+00 6.04e-07 -11.0 3.93e+04 - 9.78e-01 1.00e+00h 1 22 -1.2796098e-09 0.00e+00 2.22e-16 -11.0 1.02e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 22 (scaled) (unscaled) Objective...............: -1.2796097940591287e-09 -1.2796097940591287e-09 Dual infeasibility......: 2.2204460492503131e-16 2.2204460492503131e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0879585018828881e-11 1.0879585018828881e-11 Overall NLP error.......: 1.0879585018828881e-11 1.0879585018828881e-11 Number of objective function evaluations = 23 Number of objective gradient evaluations = 23 Number of equality constraint evaluations = 23 Number of inequality constraint evaluations = 23 Number of equality constraint Jacobian evaluations = 23 Number of inequality constraint Jacobian evaluations = 23 Number of Lagrangian Hessian evaluations = 22 Total CPU secs in IPOPT (w/o function evaluations) = 0.018 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.2796098e-09 22 0.019997 build initial OA NLP0014I 2 OPT 24.815476 25 0.019997 OA decomposition OA0003I New best feasible of 24.815476 found after 38.173197 sec and OA0008I OA converged in 41.187739 seconds found solution of value 24.815476 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 122484 branch-and-bound nodes in total Cbc0012I Integer solution of 24.815476 found by nonlinear programm after 2 iterations and 0 nodes (41.19 seconds) Cbc0031I 2 added rows had average density of 2 Cbc0013I At root node, 2 cuts changed objective from -1.6e-07 to -1.6e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 2 row cuts average 2.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 24.81547616438936, took 2 iterations and 0 nodes (41.19 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 2 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 24.8155. Best solution: 2.481548e+01 (0 nodes, 41.437 seconds) Best possible: 2.481548e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo9_ar3_1.gms(1055) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo9_ar3_1.gms Stop 09/08/12 20:00:26 elapsed 0:00:41.528 @04 1347127226 ----------------------------- Sa 8. Sep 20:00:26 CEST 2012 ----------------------------- =ready= Linux opt212 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo9_ar4_1.gms =========== ----------------------------- Sa 8. Sep 19:59:45 CEST 2012 ----------------------------- @03 1347127185 --- Job fo9_ar4_1.gms Start 09/08/12 19:59:45 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo9_ar4_1.gms(1055) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- fo9_ar4_1.gms(1050) 3 Mb --- Generating MINLP model m --- fo9_ar4_1.gms(1055) 5 Mb --- 436 rows 181 columns 1,751 non-zeroes --- 91 nl-code 18 nl-non-zeroes --- 72 discrete-columns --- fo9_ar4_1.gms(1055) 3 Mb --- Executing BONMIN: elapsed 0:00:00.011 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1732 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 180 variables with only lower bounds: 0 variables with lower and upper bounds: 90 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 434 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 432 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.85e+00 8.70e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1643985e+02 9.30e-01 7.02e+02 1.2 3.17e+01 - 2.76e-03 4.96e-01f 1 2 1.1775203e+02 3.33e-01 5.10e+02 0.0 7.33e+00 2.0 7.04e-01 2.75e-01h 1 3 1.9357527e+01 2.93e-01 2.80e+01 -1.9 7.93e+00 - 8.72e-01 9.44e-01f 1 4 3.1934245e+00 9.01e-03 6.61e+00 -1.4 2.91e+00 - 7.11e-01 7.64e-01f 1 5 7.0611590e-01 0.00e+00 2.25e+00 -2.9 8.39e-01 - 8.42e-01 6.65e-01f 1 6 2.1600682e-01 0.00e+00 5.82e-01 -2.5 1.89e+00 - 8.26e-01 7.42e-01h 1 7 3.2789764e-02 0.00e+00 1.06e-01 -6.0 6.42e-02 - 9.49e-01 8.21e-01h 1 8 1.0069912e-03 0.00e+00 3.39e-03 -9.5 1.08e-02 - 9.83e-01 9.68e-01h 1 9 3.8765893e-06 0.00e+00 1.31e-05 -11.0 3.32e-04 - 9.96e-01 9.96e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.0729231e-09 0.00e+00 1.02e-07 -11.0 9.25e-03 - 9.98e-01 1.00e+00h 1 11 -1.2789891e-09 0.00e+00 2.39e-01 -11.0 4.02e+00 - 5.10e-01 1.00e+00h 1 12 -5.1002460e-10 3.17e-02 1.30e-02 -10.5 2.71e+01 - 4.11e-01 1.00e+00h 1 13 -5.1106470e-10 0.00e+00 4.61e-04 -10.5 4.37e+01 - 9.23e-01 1.00e+00h 1 14 -5.1105804e-10 0.00e+00 3.80e-04 -10.5 5.61e+02 - 2.58e-01 1.00e+00h 1 15 -5.1105848e-10 0.00e+00 1.50e-04 -10.5 7.51e+02 - 6.05e-01 1.00e+00h 1 16 -5.1105715e-10 0.00e+00 5.45e-05 -10.5 1.86e+03 - 6.37e-01 1.00e+00h 1 17 -5.1105937e-10 0.00e+00 2.46e-05 -10.5 4.88e+03 - 5.48e-01 1.00e+00h 1 18 -5.1105892e-10 0.00e+00 7.86e-06 -10.5 9.66e+03 - 6.81e-01 1.00e+00h 1 19 -5.1105759e-10 0.00e+00 2.86e-06 -10.5 2.21e+04 - 6.36e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -5.1105892e-10 0.00e+00 2.71e-07 -10.5 3.02e+04 - 9.05e-01 1.00e+00h 1 21 -5.1105670e-10 0.00e+00 4.44e-16 -10.5 2.93e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: -5.1105669925941545e-10 -5.1105669925941545e-10 Dual infeasibility......: 4.4408920985006262e-16 4.4408920985006262e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.8206823180480394e-11 4.8206823180480394e-11 Overall NLP error.......: 4.8206823180480394e-11 4.8206823180480394e-11 Number of objective function evaluations = 22 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 22 Number of inequality constraint evaluations = 22 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total CPU secs in IPOPT (w/o function evaluations) = 0.036 Total CPU secs in NLP function evaluations = 0.004 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -5.110567e-10 21 0.039993 build initial OA NLP0014I 2 OPT 23.464286 22 0.016998 OA decomposition OA0003I New best feasible of 23.464286 found after 24.953207 sec and OA0008I OA converged in 31.447219 seconds found solution of value 23.464286 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 108207 branch-and-bound nodes in total Cbc0012I Integer solution of 23.464286 found by nonlinear programm after 1 iterations and 0 nodes (31.44 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 1 cuts changed objective from -1.6e-07 to -1.6e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 2.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 23.46428572713036, took 1 iterations and 0 nodes (31.45 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 23.4643. Best solution: 2.346429e+01 (0 nodes, 31.652 seconds) Best possible: 2.346429e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo9_ar4_1.gms(1055) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo9_ar4_1.gms Stop 09/08/12 20:00:17 elapsed 0:00:31.785 @04 1347127217 ----------------------------- Sa 8. Sep 20:00:17 CEST 2012 ----------------------------- =ready= Linux opt229 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo9_ar5_1.gms =========== ----------------------------- Sa 8. Sep 19:59:52 CEST 2012 ----------------------------- @03 1347127192 --- Job fo9_ar5_1.gms Start 09/08/12 19:59:52 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo9_ar5_1.gms(1055) 2 Mb --- Starting execution: elapsed 0:00:00.013 --- fo9_ar5_1.gms(1050) 3 Mb --- Generating MINLP model m --- fo9_ar5_1.gms(1055) 5 Mb --- 436 rows 181 columns 1,751 non-zeroes --- 91 nl-code 18 nl-non-zeroes --- 72 discrete-columns --- fo9_ar5_1.gms(1055) 3 Mb --- Executing BONMIN: elapsed 0:00:00.018 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1732 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 180 variables with only lower bounds: 0 variables with lower and upper bounds: 90 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 434 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 432 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 9.84e+00 8.46e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.2235158e+02 1.20e+00 7.42e+02 1.2 3.08e+01 - 3.02e-03 5.17e-01f 1 2 1.2304401e+02 8.71e-01 6.44e+02 0.2 7.44e+00 2.0 6.63e-01 1.31e-01h 1 3 1.2383600e+02 5.62e-01 5.29e+02 -0.7 7.02e+00 1.5 7.65e-01 1.83e-01h 1 4 1.2688306e+02 0.00e+00 6.56e+01 -1.7 5.91e+00 1.0 8.42e-01 1.00e+00h 1 5 3.0628258e+01 0.00e+00 6.21e+01 -0.9 1.50e+02 - 4.46e-01 5.44e-02f 1 6 7.4703897e+00 0.00e+00 4.27e+01 -1.2 1.11e+01 - 4.22e-01 3.14e-01f 1 7 3.2314747e+00 0.00e+00 2.86e+01 -1.8 2.83e+00 - 6.81e-01 3.32e-01f 1 8 8.7945866e-01 0.00e+00 1.06e+01 -2.1 4.12e+00 - 8.15e-01 6.29e-01f 1 9 1.1673950e-01 0.00e+00 2.40e+00 -4.3 2.78e-01 - 9.27e-01 7.75e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.4030590e-02 0.00e+00 1.29e+00 -4.0 3.98e+00 - 5.84e-01 4.62e-01h 1 11 1.2949385e-02 0.00e+00 4.00e-01 -6.9 1.54e-02 - 9.85e-01 6.92e-01h 1 12 2.0321966e-04 0.00e+00 6.32e-03 -11.0 3.34e-03 - 9.88e-01 9.84e-01h 1 13 1.2940266e-06 0.00e+00 4.03e-05 -11.0 4.93e-03 - 9.93e-01 9.94e-01h 1 14 -1.0170204e-09 0.00e+00 6.20e-06 -11.0 7.54e-01 - 9.70e-01 1.00e+00h 1 15 -1.2731334e-09 0.00e+00 2.63e-01 -11.0 2.46e+01 - 3.62e-01 1.00e+00h 1 16 -9.7830866e-10 0.00e+00 3.09e-02 -10.7 8.33e-03 0.6 1.00e+00 1.00e+00h 1 17 -9.8255384e-10 0.00e+00 5.63e-03 -10.7 4.25e+01 - 8.10e-01 1.00e+00h 1 18 -9.8262488e-10 9.97e-01 4.54e-03 -10.7 2.20e+02 - 2.53e-01 5.52e-01h 1 19 -9.8265522e-10 6.28e-01 4.07e-03 -10.7 2.93e+02 - 1.48e-01 5.48e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -9.8268139e-10 2.59e-01 7.08e-04 -10.7 3.43e+02 - 8.35e-01 1.00e+00h 1 21 -9.8268126e-10 0.00e+00 5.71e-04 -10.7 2.04e+03 - 1.94e-01 3.31e-01h 1 22 -9.8267997e-10 0.00e+00 2.12e-04 -10.7 2.51e+03 - 6.29e-01 1.00e+00h 1 23 -9.8268135e-10 0.00e+00 6.52e-06 -10.7 6.31e+03 - 9.69e-01 1.00e+00h 1 24 -9.8268184e-10 0.00e+00 4.99e-06 -10.7 6.25e+04 - 2.35e-01 1.00e+00h 1 25 -9.8268055e-10 0.00e+00 4.93e-15 -10.7 2.41e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 25 (scaled) (unscaled) Objective...............: -9.8268055214685622e-10 -9.8268055214685622e-10 Dual infeasibility......: 4.9305970844561276e-15 4.9305970844561276e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.6375546110178061e-11 2.6375546110178061e-11 Overall NLP error.......: 2.6375546110178061e-11 2.6375546110178061e-11 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of equality constraint evaluations = 26 Number of inequality constraint evaluations = 26 Number of equality constraint Jacobian evaluations = 26 Number of inequality constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Total CPU secs in IPOPT (w/o function evaluations) = 0.043 Total CPU secs in NLP function evaluations = 0.006 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -9.8268055e-10 25 0.048993 build initial OA NLP0014I 2 OPT 23.464286 23 0.018997 OA decomposition OA0003I New best feasible of 23.464286 found after 79.877857 sec and NLP0014I 3 INFEAS 0.033446581 61 0.050993 OA decomposition OA0008I OA converged in 103.34029 seconds found solution of value 23.464286 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 320347 branch-and-bound nodes in total Cbc0012I Integer solution of 23.464286 found by nonlinear programm after 5 iterations and 0 nodes (103.34 seconds) Cbc0031I 4 added rows had average density of 2 Cbc0013I At root node, 4 cuts changed objective from -1.6000001e-07 to -1.6e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 6 row cuts average 2.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 23.46428570562043, took 5 iterations and 0 nodes (103.34 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 6 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 23.4643. Best solution: 2.346429e+01 (0 nodes, 103.99 seconds) Best possible: 2.346429e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo9_ar5_1.gms(1055) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo9_ar5_1.gms Stop 09/08/12 20:01:36 elapsed 0:01:44.153 @04 1347127296 ----------------------------- Sa 8. Sep 20:01:36 CEST 2012 ----------------------------- =ready= Linux opt232 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/fo9.gms =========== ----------------------------- Sa 8. Sep 19:59:58 CEST 2012 ----------------------------- @03 1347127198 --- Job fo9.gms Start 09/08/12 19:59:58 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- fo9.gms(794) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- fo9.gms(789) 3 Mb --- Generating MINLP model m --- fo9.gms(794) 5 Mb --- 344 rows 183 columns 1,441 non-zeroes --- 91 nl-code 18 nl-non-zeroes --- 72 discrete-columns --- fo9.gms(794) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1406 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 180 variables with only lower bounds: 0 variables with lower and upper bounds: 90 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 343 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 343 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.85e+00 7.00e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.8235285e+01 8.74e-01 3.25e+02 0.6 1.26e+01 - 1.77e-02 1.00e+00f 1 2 5.8185200e+01 0.00e+00 3.15e+02 -1.0 3.15e+00 2.0 7.17e-01 1.00e+00h 1 3 2.3192568e+00 0.00e+00 1.31e+02 -3.3 6.37e+00 - 9.18e-01 5.83e-01f 1 4 6.3482925e-01 0.00e+00 3.64e+01 -4.4 5.49e-01 - 9.27e-01 7.23e-01f 1 5 2.2471725e-02 0.00e+00 1.45e+00 -6.2 2.74e-01 - 9.47e-01 9.60e-01f 1 6 2.9335753e-04 0.00e+00 1.88e-02 -11.0 7.17e-03 - 9.89e-01 9.87e-01h 1 7 2.9402885e-06 0.00e+00 1.89e-04 -11.0 1.01e-04 - 9.90e-01 9.90e-01h 1 8 -3.6211151e-10 0.00e+00 6.28e-08 -11.0 1.49e-03 - 1.00e+00 1.00e+00h 1 9 -1.0597550e-09 8.27e-18 4.84e-02 -11.0 3.07e+00 - 9.16e-01 7.32e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.2712833e-09 0.00e+00 3.50e-01 -11.0 3.66e+01 - 2.41e-01 1.00e+00h 1 11 -1.2824082e-09 0.00e+00 8.66e-02 -11.0 4.82e+01 - 6.38e-01 1.00e+00h 1 12 -1.2794643e-09 0.00e+00 4.91e-02 -11.0 1.33e+02 - 5.77e-01 1.00e+00h 1 13 -1.2798221e-09 0.00e+00 1.87e-02 -11.0 3.13e+02 - 5.88e-01 1.00e+00h 1 14 -1.2798061e-09 0.00e+00 7.77e-03 -11.0 7.55e+02 - 5.88e-01 1.00e+00h 1 15 -1.2798063e-09 0.00e+00 3.17e-03 -11.0 1.80e+03 - 5.92e-01 1.00e+00h 1 16 -1.2798065e-09 0.00e+00 1.26e-03 -11.0 4.22e+03 - 6.02e-01 1.00e+00h 1 17 -1.2798059e-09 0.00e+00 4.73e-04 -11.0 9.52e+03 - 6.25e-01 1.00e+00h 1 18 -1.2798061e-09 0.00e+00 1.49e-04 -11.0 1.95e+04 - 6.84e-01 1.00e+00h 1 19 -1.2798063e-09 0.00e+00 2.34e-05 -11.0 3.13e+04 - 8.43e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -1.2798057e-09 0.00e+00 1.76e-16 -11.0 2.79e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 20 (scaled) (unscaled) Objective...............: -1.2798056622067008e-09 -1.2798056622067008e-09 Dual infeasibility......: 1.7588965438882986e-16 1.7588965438882986e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.4122710951536525e-11 1.4122710951536525e-11 Overall NLP error.......: 1.4122710951536525e-11 1.4122710951536525e-11 Number of objective function evaluations = 21 Number of objective gradient evaluations = 21 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 21 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 21 Number of Lagrangian Hessian evaluations = 20 Total CPU secs in IPOPT (w/o function evaluations) = 0.013 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -1.2798057e-09 20 0.014998 build initial OA NLP0014I 2 OPT 24.005494 22 0.013997 OA decomposition OA0003I New best feasible of 24.005494 found after 55.262598 sec and OA0012I After 151.99589.1f seconds, 2 iterations upper bound 24.0052540g, lower bound 22.2753680g NLP0014I 3 OPT 24.815476 27 0.024996 OA decomposition OA0012I After 293.54138.1f seconds, 3 iterations upper bound 24.0052540g, lower bound 23.4130620g NLP0014I 4 OPT 23.464286 21 0.012998 OA decomposition OA0003I New best feasible of 23.464286 found after 293.55537 sec and OA0008I OA converged in 471.27436 seconds found solution of value 23.464286 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 3171460 branch-and-bound nodes in total Cbc0012I Integer solution of 23.464286 found by nonlinear programm after 12 iterations and 0 nodes (471.27 seconds) Cbc0031I 8 added rows had average density of 2 Cbc0013I At root node, 8 cuts changed objective from -1.6e-07 to -1.6e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 15 row cuts average 2.0 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 23.46428571283082, took 12 iterations and 0 nodes (471.28 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 15 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 23.4643. Best solution: 2.346429e+01 (0 nodes, 475.498 seconds) Best possible: 2.346429e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- fo9.gms(794) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job fo9.gms Stop 09/08/12 20:07:53 elapsed 0:07:55.589 @04 1347127673 ----------------------------- Sa 8. Sep 20:07:53 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/m3.gms =========== ----------------------------- Sa 8. Sep 20:00:03 CEST 2012 ----------------------------- @03 1347127203 --- Job m3.gms Start 09/08/12 20:00:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- m3.gms(144) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- m3.gms(139) 3 Mb --- Generating MINLP model m --- m3.gms(144) 5 Mb --- 44 rows 27 columns 157 non-zeroes --- 31 nl-code 6 nl-non-zeroes --- 6 discrete-columns --- m3.gms(144) 3 Mb --- Executing BONMIN: elapsed 0:00:00.006 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 146 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 24 variables with only lower bounds: 0 variables with lower and upper bounds: 12 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 43 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 43 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 3.64e+00 1.42e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.6157885e+01 0.00e+00 1.19e+02 0.2 5.13e+00 - 2.08e-02 9.53e-01f 1 2 3.6046883e+01 0.00e+00 9.15e+01 -1.3 7.76e-01 2.0 7.42e-01 2.39e-01h 1 3 7.7743519e+00 0.00e+00 8.39e+01 -0.7 2.00e+01 - 4.59e-01 8.35e-02f 1 4 2.8052758e+00 0.00e+00 5.47e+01 -2.1 1.05e+00 - 8.45e-01 3.50e-01f 1 5 9.5269941e-02 0.00e+00 5.61e+00 -3.1 5.54e-01 - 9.26e-01 8.97e-01f 1 6 1.1256029e-03 0.00e+00 1.00e-01 -6.2 4.52e-02 - 9.72e-01 9.82e-01h 1 7 1.1344611e-05 0.00e+00 1.03e-03 -11.0 1.16e-03 - 9.89e-01 9.90e-01h 1 8 9.9508839e-09 0.00e+00 1.14e-06 -11.0 2.02e-05 - 9.99e-01 9.99e-01h 1 9 -1.7550088e-09 3.03e-13 1.34e-02 -11.0 1.89e-02 - 9.94e-01 9.32e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.8431353e-09 0.00e+00 3.33e+00 -10.3 1.74e+01 - 1.53e-01 1.00e+00h 1 11 -2.0005616e-09 0.00e+00 6.20e-01 -10.3 2.06e+01 - 6.49e-01 1.00e+00h 1 12 -1.9762108e-09 0.00e+00 3.67e-01 -10.3 5.85e+01 - 5.75e-01 1.00e+00h 1 13 -1.9825858e-09 0.00e+00 1.25e-01 -10.3 1.37e+02 - 5.88e-01 1.00e+00h 1 14 -1.9824559e-09 0.00e+00 5.21e-02 -10.3 3.33e+02 - 5.87e-01 1.00e+00h 1 15 -1.9824600e-09 0.00e+00 2.14e-02 -10.3 7.98e+02 - 5.89e-01 1.00e+00h 1 16 -1.9824587e-09 0.00e+00 8.72e-03 -10.3 1.90e+03 - 5.93e-01 1.00e+00h 1 17 -1.9824627e-09 0.00e+00 3.47e-03 -10.3 4.46e+03 - 6.03e-01 1.00e+00h 1 18 -2.3220198e-09 0.00e+00 4.10e-02 -11.0 1.92e+03 - 8.94e-01 1.00e+00h 1 19 -2.3142208e-09 0.00e+00 2.33e-02 -11.0 1.62e+04 - 5.79e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.3143217e-09 0.00e+00 5.41e-03 -11.0 2.54e+04 - 7.57e-01 1.00e+00h 1 21 -2.3143212e-09 0.00e+00 4.44e-16 -11.0 3.33e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: -2.3143211829053989e-09 -2.3143211829053989e-09 Dual infeasibility......: 4.4408965361145862e-16 4.4408965361145862e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.7695710501863153e-11 1.7695710501863153e-11 Overall NLP error.......: 1.7695710501863153e-11 1.7695710501863153e-11 Number of objective function evaluations = 22 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 22 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total CPU secs in IPOPT (w/o function evaluations) = 0.012 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -2.3143212e-09 21 0.012998 build initial OA NLP0014I 2 OPT 37.8 18 0.009998 OA decomposition OA0003I New best feasible of 37.8 found after 0.022996 sec and OA0008I OA converged in 0.022996 seconds found solution of value 37.8 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 25 branch-and-bound nodes in total Cbc0012I Integer solution of 37.8 found by nonlinear programm after 0 iterations and 0 nodes (0.02 seconds) Cbc0013I At root node, 0 cuts changed objective from -2.4e-07 to -2.4e-07 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 37.79999998978558, took 0 iterations and 0 nodes (0.02 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 37.8. Best solution: 3.780000e+01 (0 nodes, 0.028 seconds) Best possible: 3.780000e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- m3.gms(144) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job m3.gms Stop 09/08/12 20:00:03 elapsed 0:00:00.129 @04 1347127203 ----------------------------- Sa 8. Sep 20:00:03 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/m6.gms =========== ----------------------------- Sa 8. Sep 20:00:04 CEST 2012 ----------------------------- @03 1347127204 --- Job m6.gms Start 09/08/12 20:00:04 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- m6.gms(392) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- m6.gms(387) 3 Mb --- Generating MINLP model m --- m6.gms(392) 5 Mb --- 158 rows 87 columns 635 non-zeroes --- 61 nl-code 12 nl-non-zeroes --- 30 discrete-columns --- m6.gms(392) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 614 Number of nonzeros in Lagrangian Hessian.............: 12 Total number of variables............................: 84 variables with only lower bounds: 0 variables with lower and upper bounds: 42 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 157 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 157 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.85e+00 3.33e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.2037473e+02 2.99e-01 1.71e+02 0.3 5.89e+00 - 1.09e-02 8.77e-01f 1 2 1.1993725e+02 3.02e-02 1.34e+02 -0.4 1.36e+00 2.0 5.26e-01 2.14e-01h 1 3 2.4627626e+01 0.00e+00 1.22e+02 -0.9 1.96e+01 - 6.00e-01 9.80e-02f 1 4 6.7800727e+00 0.00e+00 5.92e+01 -1.5 1.97e+00 - 8.86e-01 5.16e-01f 1 5 2.4448849e-01 0.00e+00 3.69e+00 -2.9 7.76e-01 - 9.15e-01 9.38e-01f 1 6 3.4739080e-03 0.00e+00 6.26e-02 -6.4 5.40e-02 - 9.72e-01 9.83e-01h 1 7 3.5335868e-05 0.00e+00 6.42e-04 -11.0 1.59e-03 - 9.89e-01 9.90e-01h 1 8 1.6957613e-08 0.00e+00 4.25e-07 -11.0 2.17e-05 - 9.99e-01 9.99e-01h 1 9 -5.7808131e-09 7.91e-14 9.87e-04 -11.0 3.08e-02 - 9.95e-01 9.74e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -6.2822031e-09 0.00e+00 5.74e-01 -11.0 5.46e+00 - 5.07e-01 1.00e+00h 1 11 -6.1977468e-09 0.00e+00 7.68e-02 -10.8 1.70e+01 - 4.46e-01 1.00e+00h 1 12 -6.1991881e-09 0.00e+00 2.29e-02 -10.8 2.92e+01 - 6.34e-01 1.00e+00h 1 13 -6.1992147e-09 0.00e+00 9.78e-03 -10.8 7.43e+01 - 5.67e-01 1.00e+00h 1 14 -6.1992135e-09 0.00e+00 4.03e-03 -10.8 1.70e+02 - 5.88e-01 1.00e+00h 1 15 -6.1992166e-09 0.00e+00 1.66e-03 -10.8 4.12e+02 - 5.87e-01 1.00e+00h 1 16 -6.1992196e-09 0.00e+00 6.82e-04 -10.8 9.87e+02 - 5.89e-01 1.00e+00h 1 17 -6.1992210e-09 0.00e+00 2.77e-04 -10.8 2.35e+03 - 5.94e-01 1.00e+00h 1 18 -6.1992102e-09 0.00e+00 1.09e-04 -10.8 5.46e+03 - 6.07e-01 1.00e+00h 1 19 -6.3200515e-09 0.00e+00 1.79e-02 -11.0 6.87e+03 - 7.55e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -6.3199606e-09 0.00e+00 6.40e-03 -11.0 2.10e+04 - 6.59e-01 1.00e+00h 1 21 -6.3199650e-09 0.00e+00 9.16e-04 -11.0 3.11e+04 - 8.56e-01 1.00e+00h 1 22 -6.3199630e-09 0.00e+00 8.88e-16 -11.0 2.76e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 22 (scaled) (unscaled) Objective...............: -6.3199629623716543e-09 -6.3199629623716543e-09 Dual infeasibility......: 8.8817849018556655e-16 8.8817849018556655e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.4027688432267446e-11 1.4027688432267446e-11 Overall NLP error.......: 1.4027688432267446e-11 1.4027688432267446e-11 Number of objective function evaluations = 23 Number of objective gradient evaluations = 23 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 23 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 23 Number of Lagrangian Hessian evaluations = 22 Total CPU secs in IPOPT (w/o function evaluations) = 0.016 Total CPU secs in NLP function evaluations = 0.006 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -6.319963e-09 22 0.021996 build initial OA NLP0014I 2 OPT 82.256877 24 0.021997 OA decomposition OA0003I New best feasible of 82.256877 found after 0.144978 sec and OA0008I OA converged in 0.254961 seconds found solution of value 82.256877 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 720 branch-and-bound nodes in total Cbc0012I Integer solution of 82.256877 found by nonlinear programm after 0 iterations and 0 nodes (0.25 seconds) Cbc0013I At root node, 0 cuts changed objective from -6.4799999e-07 to -6.4799999e-07 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 82.25687686506129, took 0 iterations and 0 nodes (0.25 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Bonmin finished. Found feasible solution. Objective function value = 82.2569. Best solution: 8.225688e+01 (0 nodes, 0.263 seconds) Best possible: 8.225688e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- m6.gms(392) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job m6.gms Stop 09/08/12 20:00:04 elapsed 0:00:00.386 @04 1347127204 ----------------------------- Sa 8. Sep 20:00:04 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/m7_ar2_1.gms =========== ----------------------------- Sa 8. Sep 20:00:04 CEST 2012 ----------------------------- @03 1347127204 --- Job m7_ar2_1.gms Start 09/08/12 20:00:04 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- m7_ar2_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- m7_ar2_1.gms(663) 3 Mb --- Generating MINLP model m --- m7_ar2_1.gms(668) 5 Mb --- 270 rows 113 columns 1,053 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- m7_ar2_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.82e+00 2.63e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.7296335e+02 1.78e+00 2.09e+02 1.1 2.32e+01 - 2.72e-03 1.76e-01f 1 2 1.7454153e+02 1.42e+00 1.68e+02 0.4 2.00e+00 2.0 1.00e+00 1.29e-01h 1 3 1.7812358e+02 4.64e-02 7.22e+01 -0.7 1.79e+00 1.5 5.58e-01 5.64e-01h 1 4 5.3215025e+01 0.00e+00 6.55e+01 -0.2 2.41e+01 - 2.20e-01 1.02e-01f 1 5 1.6527633e+01 0.00e+00 4.84e+01 -0.7 4.76e+00 - 4.42e-01 2.72e-01f 1 6 5.5758899e+00 0.00e+00 2.57e+01 -1.1 4.46e+00 - 7.71e-01 4.91e-01f 1 7 1.0987477e+00 0.00e+00 7.25e+00 -2.6 8.33e-01 - 7.92e-01 7.20e-01f 1 8 2.1829167e-01 6.71e-05 2.27e+00 -4.0 4.94e-01 - 8.96e-01 6.91e-01h 1 9 1.4758357e-02 7.09e-06 2.35e-01 -5.4 8.61e-02 - 9.15e-01 8.97e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.6636607e-04 2.06e-07 6.40e-03 -8.2 5.73e-03 - 9.70e-01 9.73e-01h 1 11 2.5318143e-06 1.45e-09 4.48e-05 -11.0 1.47e-04 - 9.93e-01 9.93e-01h 1 12 -5.3218469e-09 0.00e+00 1.13e-06 -11.0 7.08e-04 - 1.00e+00 9.99e-01h 1 13 -7.5632318e-09 1.05e-13 3.79e-01 -11.0 2.37e+00 - 6.91e-01 9.40e-01h 1 14 -7.5658376e-09 0.00e+00 1.77e-01 -10.8 1.25e+01 - 8.07e-01 1.00e+00h 1 15 -7.5692722e-09 0.00e+00 6.01e-02 -10.8 5.71e+01 - 3.30e-01 1.00e+00h 1 16 -7.5687928e-09 0.00e+00 2.10e-02 -10.8 8.50e+01 - 6.75e-01 1.00e+00h 1 17 -7.5688114e-09 0.00e+00 9.26e-03 -10.8 2.60e+02 - 5.58e-01 1.00e+00h 1 18 -7.5687848e-09 0.00e+00 3.87e-03 -10.8 5.84e+02 - 5.82e-01 1.00e+00h 1 19 -7.5687958e-09 0.00e+00 1.54e-03 -10.8 1.38e+03 - 6.03e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.5688051e-09 0.00e+00 6.40e-04 -10.8 3.35e+03 - 5.84e-01 1.00e+00h 1 21 -7.5687938e-09 0.00e+00 2.36e-04 -10.8 7.41e+03 - 6.32e-01 1.00e+00h 1 22 -7.6800064e-09 0.00e+00 1.51e-02 -11.0 1.05e+04 - 7.22e-01 1.00e+00h 1 23 -7.6799248e-09 0.00e+00 4.28e-03 -11.0 2.53e+04 - 7.25e-01 1.00e+00h 1 24 -7.6799420e-09 0.00e+00 4.00e-04 -11.0 3.43e+04 - 9.06e-01 1.00e+00h 1 25 -7.6799339e-09 0.00e+00 8.88e-16 -11.0 2.57e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 25 (scaled) (unscaled) Objective...............: -7.6799339069589915e-09 -7.6799339069589915e-09 Dual infeasibility......: 8.8817841970012523e-16 8.8817841970012523e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2602478582591895e-11 1.2602478582591895e-11 Overall NLP error.......: 1.2602478582591895e-11 1.2602478582591895e-11 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of equality constraint evaluations = 26 Number of inequality constraint evaluations = 26 Number of equality constraint Jacobian evaluations = 26 Number of inequality constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Total CPU secs in IPOPT (w/o function evaluations) = 0.034 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7.6799339e-09 25 0.033995 build initial OA NLP0014I 2 OPT 190.235 28 0.015998 OA decomposition OA0003I New best feasible of 190.235 found after 1.320799 sec and OA0008I OA converged in 2.30065 seconds found solution of value 190.235 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 13540 branch-and-bound nodes in total Cbc0012I Integer solution of 190.235 found by nonlinear programm after 1 iterations and 0 nodes (2.30 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 1 cuts changed objective from -7.88e-07 to -7.88e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 2.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 190.2349998121899, took 1 iterations and 0 nodes (2.30 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 190.235. Best solution: 1.902350e+02 (0 nodes, 2.321 seconds) Best possible: 1.902350e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- m7_ar2_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job m7_ar2_1.gms Stop 09/08/12 20:00:07 elapsed 0:00:02.457 @04 1347127207 ----------------------------- Sa 8. Sep 20:00:07 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/m7_ar25_1.gms =========== ----------------------------- Sa 8. Sep 20:00:07 CEST 2012 ----------------------------- @03 1347127207 --- Job m7_ar25_1.gms Start 09/08/12 20:00:07 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- m7_ar25_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- m7_ar25_1.gms(663) 3 Mb --- Generating MINLP model m --- m7_ar25_1.gms(668) 5 Mb --- 270 rows 113 columns 1,053 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- m7_ar25_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.83e+00 2.62e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9365924e+02 1.42e+00 2.36e+02 1.1 2.37e+01 - 2.77e-03 1.95e-01f 1 2 1.9523633e+02 1.10e+00 1.90e+02 0.5 2.31e+00 2.0 8.48e-01 1.22e-01h 1 3 2.0103609e+02 0.00e+00 5.78e+01 -0.2 2.08e+00 1.5 5.35e-01 8.01e-01h 1 4 5.9878352e+01 0.00e+00 4.98e+01 0.0 1.86e+01 - 2.96e-01 1.47e-01f 1 5 1.9945759e+01 0.00e+00 3.32e+01 -0.7 3.96e+00 - 5.58e-01 3.40e-01f 1 6 5.3278560e+00 0.00e+00 1.30e+01 -1.0 4.06e+00 - 8.09e-01 6.14e-01f 1 7 1.3897995e+00 0.00e+00 4.96e+00 -2.6 8.73e-01 - 8.26e-01 6.66e-01f 1 8 1.5105850e-01 0.00e+00 1.02e+00 -3.9 4.13e-01 - 8.69e-01 8.06e-01f 1 9 1.6248356e-02 0.00e+00 1.28e-01 -4.5 5.02e-02 - 9.09e-01 8.75e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.9807702e-04 0.00e+00 3.33e-03 -10.3 4.61e-03 - 9.87e-01 9.74e-01h 1 11 1.3906263e-06 0.00e+00 1.18e-05 -11.0 1.14e-04 - 9.97e-01 9.96e-01h 1 12 -4.7299361e-09 0.00e+00 4.42e-06 -11.0 3.55e-03 - 9.99e-01 9.98e-01h 1 13 -7.4497568e-09 2.84e-14 1.02e+00 -11.0 3.89e+00 - 4.78e-01 9.37e-01h 1 14 -7.5197780e-09 8.96e-16 1.66e-01 -10.7 1.31e+01 - 7.95e-01 9.87e-01h 1 15 -7.5127698e-09 0.00e+00 5.80e-02 -10.7 5.69e+01 - 4.17e-01 1.00e+00f 1 16 -7.5116952e-09 0.00e+00 1.48e-02 -10.7 9.69e+01 - 7.69e-01 1.00e+00h 1 17 -7.5116879e-09 0.00e+00 8.24e-03 -10.7 4.18e+02 - 4.51e-01 1.00e+00h 1 18 -7.5117034e-09 0.00e+00 3.20e-03 -10.7 7.55e+02 - 6.12e-01 1.00e+00h 1 19 -7.5117044e-09 0.00e+00 1.33e-03 -10.7 1.91e+03 - 5.84e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.5116666e-09 0.00e+00 5.28e-04 -10.7 4.37e+03 - 6.03e-01 1.00e+00h 1 21 -7.5116800e-09 0.00e+00 2.04e-04 -10.7 9.85e+03 - 6.15e-01 1.00e+00h 1 22 -7.6801400e-09 0.00e+00 1.76e-02 -11.0 1.06e+04 - 7.84e-01 1.00e+00h 1 23 -7.6799025e-09 0.00e+00 5.29e-03 -11.0 2.92e+04 - 7.17e-01 1.00e+00h 1 24 -7.6799467e-09 0.00e+00 1.91e-04 -11.0 3.31e+04 - 9.64e-01 1.00e+00h 1 25 -7.6799361e-09 0.00e+00 8.88e-16 -11.0 1.74e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 25 (scaled) (unscaled) Objective...............: -7.6799360873347558e-09 -7.6799360873347558e-09 Dual infeasibility......: 8.8817841970012523e-16 8.8817841970012523e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2115285075072994e-11 1.2115285075072994e-11 Overall NLP error.......: 1.2115285075072994e-11 1.2115285075072994e-11 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of equality constraint evaluations = 26 Number of inequality constraint evaluations = 26 Number of equality constraint Jacobian evaluations = 26 Number of inequality constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Total CPU secs in IPOPT (w/o function evaluations) = 0.031 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7.6799361e-09 25 0.033995 build initial OA NLP0014I 2 OPT 143.585 25 0.028995 OA decomposition OA0003I New best feasible of 143.585 found after 0.384941 sec and OA0008I OA converged in 0.607907 seconds found solution of value 143.585 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 1474 branch-and-bound nodes in total Cbc0012I Integer solution of 143.585 found by nonlinear programm after 3 iterations and 0 nodes (0.61 seconds) Cbc0031I 2 added rows had average density of 2 Cbc0013I At root node, 2 cuts changed objective from -7.88e-07 to -7.88e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 2 row cuts average 2.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 143.5849998432262, took 3 iterations and 0 nodes (0.61 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 2 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 143.585. Best solution: 1.435850e+02 (0 nodes, 0.617 seconds) Best possible: 1.435850e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- m7_ar25_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job m7_ar25_1.gms Stop 09/08/12 20:00:08 elapsed 0:00:00.755 @04 1347127208 ----------------------------- Sa 8. Sep 20:00:08 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/m7_ar3_1.gms =========== ----------------------------- Sa 8. Sep 20:00:08 CEST 2012 ----------------------------- @03 1347127208 --- Job m7_ar3_1.gms Start 09/08/12 20:00:08 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- m7_ar3_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- m7_ar3_1.gms(663) 3 Mb --- Generating MINLP model m --- m7_ar3_1.gms(668) 5 Mb --- 270 rows 113 columns 1,053 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- m7_ar3_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.011 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.84e+00 2.61e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.1099079e+02 1.13e+00 2.58e+02 1.1 2.45e+01 - 2.82e-03 2.11e-01f 1 2 2.1246921e+02 8.55e-01 2.13e+02 0.6 2.57e+00 2.0 6.82e-01 1.07e-01h 1 3 2.1963111e+02 0.00e+00 6.25e+01 0.1 2.33e+00 1.5 5.68e-01 8.45e-01h 1 4 6.7143950e+01 0.00e+00 5.13e+01 0.1 1.68e+01 - 3.45e-01 1.76e-01f 1 5 2.2836081e+01 0.00e+00 3.19e+01 -0.6 3.88e+00 - 5.94e-01 3.80e-01f 1 6 6.4565077e+00 0.00e+00 1.33e+01 -1.0 3.93e+00 - 8.02e-01 6.28e-01f 1 7 1.8681503e+00 0.00e+00 6.01e+00 -2.2 9.56e-01 - 8.73e-01 6.50e-01f 1 8 1.6947636e-01 0.00e+00 9.75e-01 -3.5 4.85e-01 - 7.98e-01 8.34e-01f 1 9 2.4865271e-02 0.00e+00 1.61e-01 -5.5 4.25e-02 - 9.41e-01 8.36e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.3639041e-04 0.00e+00 3.65e-03 -10.9 6.41e-03 - 9.89e-01 9.77e-01h 1 11 2.0026653e-06 0.00e+00 1.37e-05 -11.0 1.38e-04 - 9.96e-01 9.96e-01h 1 12 -4.0623638e-09 0.00e+00 2.83e-06 -11.0 4.99e-03 - 9.99e-01 9.98e-01h 1 13 -7.3877884e-09 1.69e-14 1.31e+00 -11.0 5.94e+00 - 4.27e-01 9.39e-01h 1 14 -7.5323168e-09 1.78e-15 1.97e-01 -10.8 1.63e+01 - 7.09e-01 9.22e-01h 1 15 -7.5284173e-09 0.00e+00 7.04e-02 -10.8 5.16e+01 - 5.19e-01 1.00e+00f 1 16 -7.5269468e-09 0.00e+00 7.52e-03 -10.8 1.07e+02 - 9.04e-01 1.00e+00h 1 17 -7.5269753e-09 0.00e+00 5.82e-03 -10.8 1.10e+03 - 2.52e-01 1.00e+00h 1 18 -7.5269597e-09 0.00e+00 2.12e-03 -10.8 1.44e+03 - 6.36e-01 1.00e+00h 1 19 -7.5269597e-09 0.00e+00 8.47e-04 -10.8 3.81e+03 - 6.00e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.5269506e-09 0.00e+00 3.31e-04 -10.8 8.65e+03 - 6.09e-01 1.00e+00h 1 21 -7.6801034e-09 0.00e+00 1.63e-02 -11.0 9.96e+03 - 7.81e-01 1.00e+00h 1 22 -7.6799336e-09 0.00e+00 4.83e-03 -11.0 2.83e+04 - 7.19e-01 1.00e+00h 1 23 -7.6799266e-09 0.00e+00 3.52e-04 -11.0 3.38e+04 - 9.27e-01 1.00e+00h 1 24 -7.6799161e-09 0.00e+00 7.53e-16 -11.0 1.86e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 24 (scaled) (unscaled) Objective...............: -7.6799160714094117e-09 -7.6799160714094117e-09 Dual infeasibility......: 7.5271524732533101e-16 7.5271524732533101e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2204102627341386e-11 1.2204102627341386e-11 Overall NLP error.......: 1.2204102627341386e-11 1.2204102627341386e-11 Number of objective function evaluations = 25 Number of objective gradient evaluations = 25 Number of equality constraint evaluations = 25 Number of inequality constraint evaluations = 25 Number of equality constraint Jacobian evaluations = 25 Number of inequality constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Total CPU secs in IPOPT (w/o function evaluations) = 0.038 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7.6799161e-09 24 0.040994 build initial OA NLP0014I 2 OPT 143.585 22 0.012998 OA decomposition OA0003I New best feasible of 143.585 found after 1.111831 sec and OA0008I OA converged in 2.103681 seconds found solution of value 143.585 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 10598 branch-and-bound nodes in total Cbc0012I Integer solution of 143.585 found by nonlinear programm after 2 iterations and 0 nodes (2.10 seconds) Cbc0031I 2 added rows had average density of 2 Cbc0013I At root node, 2 cuts changed objective from -7.8800001e-07 to -7.8800001e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 2 row cuts average 2.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 143.5849999042503, took 2 iterations and 0 nodes (2.10 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 2 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 143.585. Best solution: 1.435850e+02 (0 nodes, 2.131 seconds) Best possible: 1.435850e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- m7_ar3_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job m7_ar3_1.gms Stop 09/08/12 20:00:10 elapsed 0:00:02.267 @04 1347127210 ----------------------------- Sa 8. Sep 20:00:10 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/m7_ar4_1.gms =========== ----------------------------- Sa 8. Sep 20:00:10 CEST 2012 ----------------------------- @03 1347127210 --- Job m7_ar4_1.gms Start 09/08/12 20:00:10 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- m7_ar4_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- m7_ar4_1.gms(663) 3 Mb --- Generating MINLP model m --- m7_ar4_1.gms(668) 5 Mb --- 270 rows 113 columns 1,053 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- m7_ar4_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.007 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.85e+00 2.60e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.3555786e+02 7.55e-01 2.89e+02 1.1 2.57e+01 - 2.97e-03 2.33e-01f 1 2 2.3704342e+02 5.71e-01 2.42e+02 0.7 2.96e+00 2.0 5.19e-01 9.48e-02h 1 3 2.4573768e+02 0.00e+00 6.83e+01 0.5 3.02e+00 1.5 6.60e-01 8.05e-01h 1 4 7.0968237e+01 0.00e+00 5.06e+01 0.1 1.32e+01 - 4.47e-01 2.58e-01f 1 5 2.4900194e+01 0.00e+00 2.71e+01 -0.7 3.41e+00 - 6.43e-01 4.69e-01f 1 6 7.4741342e+00 0.00e+00 9.90e+00 -1.0 3.88e+00 - 7.46e-01 6.62e-01f 1 7 2.5943642e+00 0.00e+00 5.69e+00 -1.6 9.66e-01 - 9.24e-01 6.38e-01f 1 8 2.2913354e-01 0.00e+00 7.96e-01 -3.2 5.88e-01 - 7.50e-01 8.51e-01f 1 9 2.8465527e-02 0.00e+00 1.17e-01 -4.8 5.00e-02 - 9.40e-01 8.53e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.1267802e-04 0.00e+00 2.67e-03 -11.0 6.58e-03 - 9.89e-01 9.77e-01h 1 11 1.7020978e-06 0.00e+00 7.49e-06 -11.0 1.41e-04 - 9.97e-01 9.97e-01h 1 12 -3.6528167e-09 0.00e+00 9.01e-06 -11.0 3.92e-07 1.0 1.00e+00 9.98e-01h 1 13 -7.3629932e-09 7.11e-15 1.04e+00 -11.0 5.10e+00 - 4.78e-01 9.31e-01h 1 14 -7.6753908e-09 4.52e-16 1.45e-01 -11.0 1.05e+01 - 8.52e-01 9.90e-01h 1 15 -7.6802736e-09 0.00e+00 3.85e-02 -11.0 6.40e+01 - 4.32e-01 1.00e+00f 1 16 -7.6799306e-09 0.00e+00 1.86e-02 -11.0 1.12e+02 - 5.49e-01 1.00e+00h 1 17 -7.6799193e-09 0.00e+00 6.41e-03 -11.0 2.47e+02 - 6.57e-01 1.00e+00h 1 18 -7.6799187e-09 0.00e+00 3.08e-03 -11.0 7.13e+02 - 5.19e-01 1.00e+00h 1 19 -7.6799497e-09 0.00e+00 1.07e-03 -11.0 1.46e+03 - 6.54e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.6799236e-09 0.00e+00 5.01e-04 -11.0 4.05e+03 - 5.30e-01 1.00e+00h 1 21 -7.6799248e-09 0.00e+00 1.61e-04 -11.0 7.89e+03 - 6.78e-01 1.00e+00h 1 22 -7.6799273e-09 0.00e+00 6.76e-05 -11.0 1.91e+04 - 5.80e-01 1.00e+00h 1 23 -7.6799498e-09 0.00e+00 1.05e-05 -11.0 2.70e+04 - 8.45e-01 1.00e+00h 1 24 -7.6799237e-09 0.00e+00 6.77e-07 -11.0 3.65e+04 - 9.35e-01 1.00e+00h 1 25 -7.6799167e-09 0.00e+00 8.88e-16 -11.0 1.04e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 25 (scaled) (unscaled) Objective...............: -7.6799166892792163e-09 -7.6799166892792163e-09 Dual infeasibility......: 8.8817841970012523e-16 8.8817841970012523e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.1163825785182864e-11 1.1163825785182864e-11 Overall NLP error.......: 1.1163825785182864e-11 1.1163825785182864e-11 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of equality constraint evaluations = 26 Number of inequality constraint evaluations = 26 Number of equality constraint Jacobian evaluations = 26 Number of inequality constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Total CPU secs in IPOPT (w/o function evaluations) = 0.014 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7.6799167e-09 25 0.016998 build initial OA NLP0014I 2 OPT 106.75688 25 0.028996 OA decomposition OA0003I New best feasible of 106.75688 found after 0.215967 sec and OA0008I OA converged in 0.216967 seconds found solution of value 106.75688 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 401 branch-and-bound nodes in total Cbc0012I Integer solution of 106.75688 found by nonlinear programm after 3 iterations and 0 nodes (0.22 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -7.8800001e-07 to -7.8800001e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 106.7568769164247, took 3 iterations and 0 nodes (0.22 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 3 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 106.757. Best solution: 1.067569e+02 (0 nodes, 0.222 seconds) Best possible: 1.067569e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- m7_ar4_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job m7_ar4_1.gms Stop 09/08/12 20:00:10 elapsed 0:00:00.305 @04 1347127210 ----------------------------- Sa 8. Sep 20:00:10 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/m7_ar5_1.gms =========== ----------------------------- Sa 8. Sep 20:00:11 CEST 2012 ----------------------------- @03 1347127211 --- Job m7_ar5_1.gms Start 09/08/12 20:00:11 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- m7_ar5_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- m7_ar5_1.gms(663) 3 Mb --- Generating MINLP model m --- m7_ar5_1.gms(668) 5 Mb --- 270 rows 113 columns 1,053 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- m7_ar5_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.011 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 6.02e+00 2.60e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.5089949e+02 1.16e+00 3.07e+02 1.1 2.63e+01 - 3.03e-03 2.47e-01f 1 2 2.5229300e+02 9.53e-01 2.65e+02 0.7 3.24e+00 2.0 4.94e-01 7.94e-02h 1 3 2.6304576e+02 0.00e+00 1.01e+02 0.6 3.52e+00 1.5 6.62e-01 8.50e-01h 1 4 7.1045552e+01 0.00e+00 7.43e+01 0.1 1.39e+01 - 4.70e-01 2.68e-01f 1 5 2.5795810e+01 0.00e+00 3.90e+01 -0.7 3.51e+00 - 6.46e-01 4.77e-01f 1 6 7.8061433e+00 0.00e+00 1.42e+01 -1.0 3.86e+00 - 7.09e-01 6.63e-01f 1 7 3.0777007e+00 0.00e+00 7.08e+00 -1.3 1.26e+00 - 9.18e-01 6.27e-01f 1 8 3.0519005e-01 0.00e+00 1.06e+00 -3.3 6.42e-01 - 8.02e-01 8.45e-01f 1 9 3.3386171e-02 0.00e+00 1.42e-01 -4.0 1.33e-01 - 9.54e-01 8.67e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 6.6486851e-04 0.00e+00 3.08e-03 -10.3 7.37e-03 - 9.87e-01 9.79e-01h 1 11 2.1301610e-06 0.00e+00 1.00e-05 -11.0 1.45e-04 - 9.97e-01 9.97e-01h 1 12 -3.7438956e-09 0.00e+00 4.14e-06 -11.0 6.94e-03 - 1.00e+00 9.98e-01h 1 13 -7.3739819e-09 7.11e-15 7.65e-01 -11.0 1.27e+01 - 5.20e-01 9.22e-01h 1 14 -7.6073135e-09 0.00e+00 5.72e-01 -10.9 3.36e+01 - 4.70e-01 1.00e+00h 1 15 -7.6222786e-09 0.00e+00 1.47e-01 -10.9 6.23e+01 - 6.47e-01 1.00e+00h 1 16 -7.6206058e-09 0.00e+00 7.63e-02 -10.9 1.76e+02 - 5.35e-01 1.00e+00h 1 17 -7.6208079e-09 0.00e+00 2.72e-02 -10.9 3.76e+02 - 6.34e-01 1.00e+00h 1 18 -7.6207964e-09 0.00e+00 1.25e-02 -10.9 1.02e+03 - 5.41e-01 1.00e+00h 1 19 -7.6207790e-09 0.00e+00 4.48e-03 -10.9 2.16e+03 - 6.42e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.6207994e-09 0.00e+00 2.02e-03 -10.9 5.69e+03 - 5.50e-01 1.00e+00h 1 21 -7.6207997e-09 0.00e+00 6.07e-04 -10.9 1.11e+04 - 6.99e-01 1.00e+00h 1 22 -7.6207855e-09 0.00e+00 2.40e-04 -10.9 2.52e+04 - 6.04e-01 1.00e+00h 1 23 -7.6799598e-09 0.00e+00 1.78e-15 -11.0 2.27e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 23 (scaled) (unscaled) Objective...............: -7.6799597873566886e-09 -7.6799597873566886e-09 Dual infeasibility......: 1.7763568394002505e-15 1.7763568394002505e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.5599644420844416e-11 1.5599644420844416e-11 Overall NLP error.......: 1.5599644420844416e-11 1.5599644420844416e-11 Number of objective function evaluations = 24 Number of objective gradient evaluations = 24 Number of equality constraint evaluations = 24 Number of inequality constraint evaluations = 24 Number of equality constraint Jacobian evaluations = 24 Number of inequality constraint Jacobian evaluations = 24 Number of Lagrangian Hessian evaluations = 23 Total CPU secs in IPOPT (w/o function evaluations) = 0.032 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7.6799598e-09 23 0.036994 build initial OA NLP0014I 2 OPT 106.46001 24 0.012998 OA decomposition OA0003I New best feasible of 106.46001 found after 1.374791 sec and OA0008I OA converged in 1.374791 seconds found solution of value 106.46001 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 4639 branch-and-bound nodes in total Cbc0012I Integer solution of 106.46001 found by nonlinear programm after 2 iterations and 0 nodes (1.37 seconds) Cbc0031I 2 added rows had average density of 2 Cbc0013I At root node, 2 cuts changed objective from -7.88e-07 to -7.88e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 2 row cuts average 2.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 106.4600057846934, took 2 iterations and 0 nodes (1.37 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 2 cuts of which 2 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 106.46. Best solution: 1.064600e+02 (0 nodes, 1.39 seconds) Best possible: 1.064600e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- m7_ar5_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job m7_ar5_1.gms Stop 09/08/12 20:00:12 elapsed 0:00:01.527 @04 1347127212 ----------------------------- Sa 8. Sep 20:00:12 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/m7.gms =========== ----------------------------- Sa 8. Sep 20:00:12 CEST 2012 ----------------------------- @03 1347127212 --- Job m7.gms Start 09/08/12 20:00:12 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- m7.gms(508) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- m7.gms(503) 3 Mb --- Generating MINLP model m --- m7.gms(508) 5 Mb --- 212 rows 115 columns 867 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- m7.gms(508) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 842 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 211 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 211 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.85e+00 3.33e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.5646186e+02 3.66e-01 1.87e+02 0.4 6.82e+00 - 8.29e-03 7.93e-01f 1 2 1.5602883e+02 9.43e-02 1.50e+02 -0.2 1.49e+00 2.0 4.91e-01 1.92e-01h 1 3 1.4872497e+02 0.00e+00 4.33e+01 -0.8 1.30e+00 1.5 8.20e-01 1.00e+00f 1 4 3.4041827e+01 0.00e+00 4.18e+01 -0.9 5.16e+01 - 4.28e-01 3.63e-02f 1 5 7.5332211e+00 0.00e+00 2.66e+01 -2.5 3.13e+00 - 8.22e-01 3.68e-01f 1 6 2.8152168e-01 0.00e+00 3.34e+00 -4.2 7.06e-01 - 8.78e-01 8.75e-01f 1 7 6.1798527e-03 0.00e+00 1.06e-01 -6.6 3.05e-02 - 9.57e-01 9.68e-01f 1 8 6.3484929e-05 0.00e+00 1.14e-03 -11.0 8.34e-04 - 9.88e-01 9.89e-01h 1 9 6.5209014e-08 0.00e+00 1.31e-06 -11.0 1.37e-05 - 9.99e-01 9.99e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -7.0266849e-09 0.00e+00 1.56e-04 -11.0 9.57e-03 - 9.98e-01 9.90e-01h 1 11 -7.6541382e-09 0.00e+00 4.49e-01 -11.0 5.73e+00 - 4.94e-01 1.00e+00h 1 12 -7.6787037e-09 0.00e+00 8.13e-02 -11.0 9.13e+00 - 6.01e-01 1.00e+00h 1 13 -7.6799062e-09 0.00e+00 3.05e-02 -11.0 2.55e+01 - 5.60e-01 1.00e+00h 1 14 -7.6799536e-09 0.00e+00 1.18e-02 -11.0 5.18e+01 - 6.07e-01 1.00e+00h 1 15 -7.6799659e-09 0.00e+00 4.84e-03 -11.0 1.26e+02 - 5.89e-01 1.00e+00h 1 16 -7.6799753e-09 0.00e+00 1.99e-03 -11.0 3.02e+02 - 5.88e-01 1.00e+00h 1 17 -7.6799652e-09 0.00e+00 8.19e-04 -11.0 7.25e+02 - 5.89e-01 1.00e+00h 1 18 -7.6799544e-09 0.00e+00 3.35e-04 -11.0 1.73e+03 - 5.91e-01 1.00e+00h 1 19 -7.6799656e-09 0.00e+00 1.34e-04 -11.0 4.06e+03 - 6.01e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.6799750e-09 0.00e+00 5.03e-05 -11.0 9.17e+03 - 6.23e-01 1.00e+00h 1 21 -7.6799692e-09 0.00e+00 1.61e-05 -11.0 1.89e+04 - 6.80e-01 1.00e+00h 1 22 -7.6799755e-09 0.00e+00 2.74e-06 -11.0 3.09e+04 - 8.30e-01 1.00e+00h 1 23 -7.6799572e-09 0.00e+00 4.44e-16 -11.0 2.89e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 23 (scaled) (unscaled) Objective...............: -7.6799571576394236e-09 -7.6799571576394236e-09 Dual infeasibility......: 4.4408925825093269e-16 4.4408925825093269e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.4381075566058450e-11 1.4381075566058450e-11 Overall NLP error.......: 1.4381075566058450e-11 1.4381075566058450e-11 Number of objective function evaluations = 24 Number of objective gradient evaluations = 24 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 24 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 24 Number of Lagrangian Hessian evaluations = 23 Total CPU secs in IPOPT (w/o function evaluations) = 0.027 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7.6799572e-09 23 0.029996 build initial OA NLP0014I 2 OPT 106.75688 25 0.025996 OA decomposition OA0003I New best feasible of 106.75688 found after 0.334949 sec and OA0008I OA converged in 0.795879 seconds found solution of value 106.75688 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 2498 branch-and-bound nodes in total Cbc0012I Integer solution of 106.75688 found by nonlinear programm after 2 iterations and 0 nodes (0.79 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 1 cuts changed objective from -7.8800001e-07 to -7.88e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 2.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 106.7568768336483, took 2 iterations and 0 nodes (0.79 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 106.757. Best solution: 1.067569e+02 (0 nodes, 0.808 seconds) Best possible: 1.067569e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- m7.gms(508) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job m7.gms Stop 09/08/12 20:00:13 elapsed 0:00:00.934 @04 1347127213 ----------------------------- Sa 8. Sep 20:00:13 CEST 2012 ----------------------------- =ready= Linux opt227 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/netmod_dol1.gms =========== ----------------------------- Sa 8. Sep 20:00:13 CEST 2012 ----------------------------- @03 1347127213 --- Job netmod_dol1.gms Start 09/08/12 20:00:14 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- netmod_dol1.gms(7154) 3 Mb --- Starting execution: elapsed 0:00:00.022 --- netmod_dol1.gms(7148) 4 Mb --- Generating MINLP model m --- netmod_dol1.gms(7154) 7 Mb --- 3,138 rows 1,999 columns 8,569 non-zeroes --- 27 nl-code 6 nl-non-zeroes --- 462 discrete-columns --- netmod_dol1.gms(7154) 4 Mb --- Executing BONMIN: elapsed 0:00:00.030 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2460 Number of nonzeros in inequality constraint Jacobian.: 6096 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 1998 variables with only lower bounds: 1536 variables with lower and upper bounds: 462 variables with only upper bounds: 0 Total number of equality constraints.................: 89 Total number of inequality constraints...............: 3048 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 3048 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -2.3621815e-04 5.07e+00 3.89e-03 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.5888365e-01 5.33e-14 8.40e+03 -0.2 8.47e+01 - 1.18e-04 1.00e+00f 1 2 1.5886853e-01 2.91e-14 1.20e-02 -8.9 6.40e-04 - 9.88e-01 1.00e+00f 1 3 1.5470751e-01 4.66e-14 5.43e-03 -5.0 1.76e-01 - 6.47e-01 1.00e+00f 1 4 6.1060433e-02 2.93e-14 5.41e-03 -4.2 3.96e+00 - 1.33e-01 1.00e+00f 1 5 -8.4386855e-02 3.69e-14 1.95e-03 -4.2 6.16e+00 - 6.58e-01 1.00e+00f 1 6 -8.2920946e-01 4.23e-14 1.32e-04 -5.0 3.15e+01 - 2.60e-01 1.00e+00f 1 7 -8.3326809e-01 5.47e-14 8.28e-07 -11.0 1.72e-01 - 9.95e-01 1.00e+00f 1 8 -8.3333330e-01 1.15e-13 1.22e-12 -11.0 2.76e-03 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -8.3333330284598639e-01 -8.3333330284598639e-01 Dual infeasibility......: 1.2192344175078148e-12 1.2192344175078148e-12 Constraint violation....: 1.1499134977555059e-13 1.1499134977555059e-13 Complementarity.........: 1.5862321670356748e-11 1.5862321670356748e-11 Overall NLP error.......: 1.5862321670356748e-11 1.5862321670356748e-11 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 9 Number of inequality constraint evaluations = 9 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total CPU secs in IPOPT (w/o function evaluations) = 0.042 Total CPU secs in NLP function evaluations = 0.004 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -0.8333333 8 0.045993 build initial OA NLP0014I 2 OPT 4.9715292e-09 12 0.039994 OA decomposition OA0003I New best feasible of 4.9715292e-09 found after 0.776882 sec and NLP0014I 3 OPT 4.9715293e-09 12 0.040994 OA decomposition NLP0014I 4 OPT 4.9715293e-09 12 0.039994 OA decomposition NLP0014I 5 OPT 4.9715294e-09 12 0.040994 OA decomposition NLP0014I 6 OPT 4.9715293e-09 12 0.038994 OA decomposition NLP0014I 7 OPT 4.9715292e-09 12 0.039994 OA decomposition NLP0014I 8 OPT -0.37609275 12 0.040993 OA decomposition OA0003I New best feasible of -0.37609275 found after 4.583303 sec and NLP0014I 9 OPT -0.41861708 11 0.035994 OA decomposition OA0003I New best feasible of -0.41861708 found after 11.439261 sec and NLP0014I 10 OPT -0.41861708 11 0.036995 OA decomposition NLP0014I 11 OPT -0.37609275 12 0.039994 OA decomposition NLP0014I 12 OPT -0.37609275 12 0.039993 OA decomposition NLP0014I 13 OPT -0.37609275 12 0.039994 OA decomposition NLP0014I 14 OPT -0.37609275 12 0.038994 OA decomposition NLP0014I 15 OPT -0.41861708 11 0.036994 OA decomposition NLP0014I 16 OPT -0.38278876 12 0.037994 OA decomposition NLP0014I 17 OPT -0.38278876 12 0.038994 OA decomposition OA0012I After 108.84145.1f seconds, 17 iterations upper bound -0.418621270g, lower bound -0.723097180g NLP0014I 18 OPT -0.38278876 12 0.039994 OA decomposition NLP0014I 19 OPT -0.37609275 12 0.038994 OA decomposition NLP0014I 20 OPT -0.38278876 12 0.039994 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT -0.41861708 11 0.035994 OA decomposition NLP0014I 22 OPT -0.41861708 11 0.036995 OA decomposition OA0012I After 259.06662.1f seconds, 22 iterations upper bound -0.418621270g, lower bound -0.664042130g NLP0014I 23 OPT -0.43458986 12 0.038994 OA decomposition OA0003I New best feasible of -0.43458986 found after 259.10661 sec and OA0012I After 382.92279.1f seconds, 23 iterations upper bound -0.434594210g, lower bound -0.660105060g NLP0014I 24 OPT -0.45319765 11 0.034995 OA decomposition OA0003I New best feasible of -0.45319765 found after 382.95878 sec and OA0012I After 500.75587.1f seconds, 24 iterations upper bound -0.453202180g, lower bound -0.660105060g NLP0014I 25 OPT -0.45319765 11 0.035995 OA decomposition NLP0014I 26 OPT -0.45319765 11 0.035994 OA decomposition OA0012I After 722.20621.1f seconds, 26 iterations upper bound -0.453202180g, lower bound -0.656168040g NLP0014I 27 OPT -0.48911897 13 0.041994 OA decomposition OA0003I New best feasible of -0.48911897 found after 722.2492 sec and OA0012I After 838.10359.1f seconds, 27 iterations upper bound -0.489123870g, lower bound -0.656168040g NLP0014I 28 OPT -0.49281573 11 0.035995 OA decomposition OA0003I New best feasible of -0.49281573 found after 838.13958 sec and OA0012I After 972.77812.1f seconds, 28 iterations upper bound -0.492820660g, lower bound -0.656168040g NLP0014I 29 OPT -0.48911897 13 0.040994 OA decomposition OA0012I After 1098.1191.1f seconds, 29 iterations upper bound -0.492820660g, lower bound -0.656168040g NLP0014I 30 OPT -0.49281573 11 0.036995 OA decomposition OA0012I After 1231.8017.1f seconds, 30 iterations upper bound -0.492820660g, lower bound -0.656168040g NLP0014I 31 OPT -0.49281573 11 0.036994 OA decomposition OA0012I After 1339.5084.1f seconds, 31 iterations upper bound -0.492820660g, lower bound -0.656168040g NLP0014I 32 OPT -0.48911897 13 0.041993 OA decomposition OA0012I After 1477.2144.1f seconds, 32 iterations upper bound -0.492820660g, lower bound -0.656168040g NLP0014I 33 OPT -0.48911897 13 0.041994 OA decomposition OA0012I After 1609.1284.1f seconds, 33 iterations upper bound -0.492820660g, lower bound -0.656168040g NLP0014I 34 OPT -0.49281573 11 0.035995 OA decomposition OA0012I After 1711.2419.1f seconds, 34 iterations upper bound -0.492820660g, lower bound -0.656168040g NLP0014I 35 OPT -0.48911897 13 0.042993 OA decomposition OA0012I After 1829.1329.1f seconds, 35 iterations upper bound -0.492820660g, lower bound -0.654411380g NLP0014I 36 OPT -0.49280023 13 0.041994 OA decomposition OA0012I After 1952.7291.1f seconds, 36 iterations upper bound -0.492820660g, lower bound -0.6522320g NLP0014I 37 OPT -0.50549476 13 0.042994 OA decomposition OA0003I New best feasible of -0.50549476 found after 1952.7721 sec and OA0012I After 2065.9259.1f seconds, 37 iterations upper bound -0.505499810g, lower bound -0.652231040g NLP0014I 38 OPT -0.51198927 14 0.045993 OA decomposition OA0003I New best feasible of -0.51198927 found after 2065.9719 sec and OA0012I After 2171.8478.1f seconds, 38 iterations upper bound -0.511994390g, lower bound -0.652231040g NLP0014I 39 OPT -0.50549476 13 0.042993 OA decomposition OA0012I After 2309.2829.1f seconds, 39 iterations upper bound -0.511994390g, lower bound -0.652231040g NLP0014I 40 OPT -0.50549476 13 0.041993 OA decomposition OA0012I After 2421.4239.1f seconds, 40 iterations upper bound -0.511994390g, lower bound -0.652231040g NLP0012I Num Status Obj It time Location NLP0014I 41 OPT -0.50549476 13 0.042993 OA decomposition OA0012I After 2521.7956.1f seconds, 41 iterations upper bound -0.511994390g, lower bound -0.652231040g NLP0014I 42 OPT -0.51214427 14 0.045993 OA decomposition OA0003I New best feasible of -0.51214427 found after 2521.8426 sec and OA0012I After 2629.1733.1f seconds, 42 iterations upper bound -0.512149390g, lower bound -0.652231040g NLP0014I 43 OPT -0.51160177 14 0.044993 OA decomposition OA0012I After 2736.696.1f seconds, 43 iterations upper bound -0.512149390g, lower bound -0.652231040g NLP0014I 44 OPT -0.51214427 14 0.043993 OA decomposition NLP0014I 45 OPT -0.50549476 13 0.042994 OA decomposition OA0012I After 2926.3841.1f seconds, 45 iterations upper bound -0.512149390g, lower bound -0.652231040g NLP0014I 46 OPT -0.51214427 14 0.044993 OA decomposition OA0012I After 3486.6919.1f seconds, 46 iterations upper bound -0.512149390g, lower bound -0.616798420g NLP0014I 47 OPT -0.54794934 13 0.040994 OA decomposition OA0003I New best feasible of -0.54794934 found after 3486.7339 sec and OA0012I After 4342.2429.1f seconds, 47 iterations upper bound -0.547954820g, lower bound -0.616798420g NLP0014I 48 OPT -0.54850734 13 0.042993 OA decomposition OA0003I New best feasible of -0.54850734 found after 4342.2859 sec and OA0012I After 5076.0353.1f seconds, 48 iterations upper bound -0.548512830g, lower bound -0.616798260g NLP0014I 49 OPT -0.54794934 13 0.042994 OA decomposition OA0012I After 5487.2678.1f seconds, 49 iterations upper bound -0.548512830g, lower bound -0.616797970g NLP0014I 50 OPT -0.54850734 13 0.042994 OA decomposition OA0012I After 5984.1923.1f seconds, 50 iterations upper bound -0.548512830g, lower bound -0.616797970g NLP0014I 51 OPT -0.54850734 13 0.042993 OA decomposition OA0012I After 6375.9327.1f seconds, 51 iterations upper bound -0.548512830g, lower bound -0.616797970g NLP0014I 52 OPT -0.54794934 13 0.042993 OA decomposition OA0012I After 6792.0345.1f seconds, 52 iterations upper bound -0.548512830g, lower bound -0.616797970g NLP0014I 53 OPT -0.54850734 13 0.041994 OA decomposition OA0012I After 7200.0014.1f seconds, 53 iterations upper bound -0.548512830g, lower bound -0.616797970g NLP0014I 54 OPT -0.54794934 13 0.042993 OA decomposition OA0009I OA interupted after 7200.0474 seconds found solution of value -0.54850734 (lower bound -0.61679797 ). OA0010I Performed 53 iterations, explored 542697 branch-and-bound nodes in total NLP0014I 55 OPT 4.9715292e-09 12 0.039994 check integer sol. OA0003I New best feasible of 4.9715292e-09 found after 7200.0884 sec and Cbc0031I 17 added rows had average density of 9.8235294 Cbc0013I At root node, 17 cuts changed objective from -0.83333339 to -0.83333339 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 16 row cuts average 9.9 elements, 0 column cuts (16 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 1 row cuts average 8.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible -0.83333339), took 59 iterations and 0 nodes (7199.62 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 16 cuts of which 16 were active after adding rounds of cuts Outer Approximation feasibility check. was tried 1 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: -8.333334e-01 (only reliable for convex models) --- Restarting execution --- netmod_dol1.gms(7154) 3 Mb --- Reading solution for model m *** Status: Normal completion --- Job netmod_dol1.gms Stop 09/08/12 22:00:34 elapsed 2:00:20.196 @04 1347134434 ----------------------------- Sa 8. Sep 22:00:34 CEST 2012 ----------------------------- =ready= Linux opt212 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/netmod_dol2.gms =========== ----------------------------- Sa 8. Sep 20:00:17 CEST 2012 ----------------------------- @03 1347127217 --- Job netmod_dol2.gms Start 09/08/12 20:00:17 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- netmod_dol2.gms(8253) 3 Mb --- Starting execution: elapsed 0:00:00.030 --- netmod_dol2.gms(8247) 4 Mb --- Generating MINLP model m --- netmod_dol2.gms(8253) 7 Mb --- 3,081 rows 1,999 columns 18,737 non-zeroes --- 27 nl-code 6 nl-non-zeroes --- 462 discrete-columns --- netmod_dol2.gms(8253) 5 Mb --- Executing BONMIN: elapsed 0:00:00.042 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2802 Number of nonzeros in inequality constraint Jacobian.: 15922 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 1998 variables with only lower bounds: 1330 variables with lower and upper bounds: 462 variables with only upper bounds: 0 Total number of equality constraints.................: 446 Total number of inequality constraints...............: 2634 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2634 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 5.08e+00 1.39e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.7410638e-02 4.81e+00 3.70e+00 -0.9 2.61e+02 - 1.13e-02 5.36e-02f 1 2 -3.0518329e-02 4.62e+00 3.61e+00 -1.0 2.64e+02 - 7.51e-02 3.91e-02f 1 3 -5.7561606e-02 4.19e+00 1.10e+01 -1.0 2.64e+02 - 2.07e-01 9.35e-02f 1 4 -1.0029557e-01 2.49e+00 4.68e+00 -1.1 2.40e+02 - 2.74e-01 4.05e-01f 1 5 -2.9950474e-02 3.12e-02 6.52e+00 -1.7 1.44e+02 - 5.68e-01 9.87e-01h 1 6 -3.3068142e-02 3.58e-04 4.46e-01 -6.3 1.87e+00 - 9.69e-01 9.89e-01h 1 7 -6.6896809e-02 2.25e-04 2.39e+01 -4.3 8.53e+00 - 7.27e-01 3.71e-01h 1 8 -1.1687996e-01 1.58e-04 2.09e+01 -3.9 3.23e+01 - 3.11e-01 2.96e-01f 1 9 -1.8436970e-01 9.83e-05 6.22e+00 -4.1 3.27e+01 - 3.12e-01 3.79e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.0643717e-01 7.91e-05 1.38e+02 -3.7 6.03e+01 - 3.46e-01 1.95e-01f 1 11 -2.8209474e-01 4.11e-05 9.79e+01 -4.0 4.58e+01 - 1.89e-01 4.81e-01f 1 12 -3.4248513e-01 1.88e-05 1.84e+02 -4.0 4.61e+01 - 4.25e-01 5.43e-01f 1 13 -4.0998911e-01 9.51e-06 5.10e+02 -4.2 4.45e+01 - 2.61e-01 4.93e-01f 1 14 -4.7189709e-01 5.07e-06 4.96e+02 -4.4 3.20e+01 - 3.58e-01 4.67e-01f 1 15 -5.2757102e-01 2.53e-06 3.35e+02 -4.6 2.37e+01 - 4.64e-01 5.01e-01f 1 16 -5.6707848e-01 1.07e-06 6.21e+02 -4.7 1.61e+01 - 4.51e-01 5.78e-01f 1 17 -5.8275534e-01 6.45e-07 7.10e+02 -4.8 8.58e+00 - 3.47e-01 3.96e-01f 1 18 -5.9678725e-01 3.26e-07 1.19e+03 -4.9 5.59e+00 - 4.09e-01 4.95e-01f 2 19 -6.1844714e-01 8.03e-08 4.71e+03 -5.1 4.61e+00 - 3.08e-01 7.53e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -6.3853528e-01 1.10e-08 2.46e+03 -5.6 2.94e+00 - 4.60e-01 8.64e-01f 1 21 -6.4496584e-01 4.11e-09 1.47e+03 -6.2 2.23e+00 - 6.91e-01 6.25e-01f 1 22 -6.4478848e-01 3.09e-10 6.25e+03 -5.6 6.32e-01 - 3.71e-01 9.25e-01h 1 23 -6.4502570e-01 1.44e-10 5.16e+03 -5.7 3.77e-01 - 1.00e+00 5.35e-01h 1 24 -6.4762429e-01 6.62e-11 2.51e+03 -6.4 5.89e-01 - 5.22e-01 5.39e-01f 1 25 -6.4907881e-01 3.41e-11 2.75e+03 -6.9 6.87e-01 - 7.48e-01 4.86e-01f 1 26 -6.5061012e-01 2.01e-12 3.50e+02 -7.0 5.01e-01 - 8.09e-01 9.42e-01f 1 27 -6.5090530e-01 5.20e-13 1.18e+02 -8.2 8.92e-02 - 8.71e-01 7.63e-01f 1 28 -6.5100857e-01 4.81e-14 1.63e+01 -10.8 4.03e-02 - 8.71e-01 9.45e-01f 1 29 -6.5101459e-01 4.14e-14 1.73e-01 -11.0 3.40e-03 - 9.91e-01 9.92e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -6.5101463e-01 4.07e-14 1.39e-16 -11.0 3.66e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 30 (scaled) (unscaled) Objective...............: -6.5101463469404464e-01 -6.5101463469404464e-01 Dual infeasibility......: 1.3877787807814457e-16 1.3877787807814457e-16 Constraint violation....: 4.0689673852511987e-14 4.0689673852511987e-14 Complementarity.........: 1.0693039257465231e-11 1.0693039257465231e-11 Overall NLP error.......: 1.0693039257465231e-11 1.0693039257465231e-11 Number of objective function evaluations = 32 Number of objective gradient evaluations = 31 Number of equality constraint evaluations = 32 Number of inequality constraint evaluations = 32 Number of equality constraint Jacobian evaluations = 31 Number of inequality constraint Jacobian evaluations = 31 Number of Lagrangian Hessian evaluations = 30 Total CPU secs in IPOPT (w/o function evaluations) = 0.837 Total CPU secs in NLP function evaluations = 0.048 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -0.65101463 30 0.884865 build initial OA NLP0014I 2 OPT -0.25282875 13 0.044993 OA decomposition OA0003I New best feasible of -0.25282875 found after 0.980851 sec and NLP0014I 3 OPT -0.11927273 14 0.047993 OA decomposition NLP0014I 4 OPT 8.2618803e-09 14 0.046993 OA decomposition NLP0014I 5 OPT -0.24650474 16 0.054991 OA decomposition NLP0014I 6 OPT -0.45510415 13 0.044993 OA decomposition OA0003I New best feasible of -0.45510415 found after 5.59515 sec and NLP0014I 7 OPT -0.47015468 14 0.048992 OA decomposition OA0003I New best feasible of -0.47015468 found after 7.267895 sec and NLP0014I 8 OPT -0.51060201 13 0.044993 OA decomposition OA0003I New best feasible of -0.51060201 found after 8.935642 sec and NLP0014I 9 OPT -0.50194525 13 0.041994 OA decomposition NLP0014I 10 OPT -0.47243319 12 0.042994 OA decomposition NLP0014I 11 OPT -0.5267608 12 0.040994 OA decomposition OA0003I New best feasible of -0.5267608 found after 17.296371 sec and NLP0014I 12 OPT -0.49491598 13 0.042994 OA decomposition NLP0014I 13 OPT -0.53021731 12 0.041994 OA decomposition OA0003I New best feasible of -0.53021731 found after 26.254009 sec and NLP0014I 14 OPT -0.53367381 13 0.043993 OA decomposition OA0003I New best feasible of -0.53367381 found after 30.385381 sec and NLP0014I 15 OPT -0.50086025 14 0.047993 OA decomposition NLP0014I 16 OPT -0.36108097 13 0.043993 OA decomposition NLP0014I 17 OPT -0.51281852 12 0.040994 OA decomposition NLP0014I 18 OPT -0.52974455 13 0.044993 OA decomposition NLP0014I 19 OPT -0.55431985 14 0.048993 OA decomposition OA0003I New best feasible of -0.55431985 found after 62.652476 sec and NLP0014I 20 OPT -0.50361925 12 0.040994 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT -0.53391406 13 0.043993 OA decomposition NLP0014I 22 OPT -0.54684884 14 0.045993 OA decomposition NLP0014I 23 OPT -0.52173879 13 0.042994 OA decomposition OA0012I After 107.82661.1f seconds, 23 iterations upper bound -0.55432540g, lower bound -0.571075460g NLP0014I 24 OPT -0.54853834 13 0.043993 OA decomposition NLP0014I 25 OPT -0.53310806 13 0.043994 OA decomposition NLP0014I 26 OPT -0.5269933 13 0.042993 OA decomposition NLP0014I 27 OPT -0.54737584 13 0.043993 OA decomposition NLP0014I 28 OPT -0.55971387 12 0.041994 OA decomposition OA0003I New best feasible of -0.55971387 found after 152.93275 sec and NLP0014I 29 OPT -0.51331452 14 0.046993 OA decomposition NLP0014I 30 OPT -0.49596998 17 0.056991 OA decomposition NLP0014I 31 OPT -0.54794934 13 0.043993 OA decomposition NLP0014I 32 OPT -0.53480531 13 0.041993 OA decomposition OA0012I After 211.8158.1f seconds, 32 iterations upper bound -0.559719460g, lower bound -0.561139940g NLP0014I 33 OPT -0.55782286 13 0.043994 OA decomposition NLP0014I 34 OPT -0.56000837 15 0.053991 OA decomposition OA0003I New best feasible of -0.56000837 found after 223.13008 sec and OA0008I OA converged in 233.84645 seconds found solution of value -0.56000837 (lower bound 1e+50 ). OA0010I Performed 33 iterations, explored 13329 branch-and-bound nodes in total Cbc0012I Integer solution of -0.56000837 found by nonlinear programm after 1 iterations and 0 nodes (233.59 seconds) Cbc0031I 1 added rows had average density of 13 Cbc0013I At root node, 1 cuts changed objective from -0.65101471 to -0.65101471 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 2 row cuts average 12.5 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -0.5600083661024341, took 1 iterations and 0 nodes (233.60 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 2 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = -0.560008. Best solution: -5.600084e-01 (0 nodes, 234.511 seconds) Best possible: -5.600084e-01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- netmod_dol2.gms(8253) 3 Mb --- Reading solution for model m *** Status: Normal completion --- Job netmod_dol2.gms Stop 09/08/12 20:04:13 elapsed 0:03:55.568 @04 1347127453 ----------------------------- Sa 8. Sep 20:04:13 CEST 2012 ----------------------------- =ready= Linux opt216 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/netmod_kar1.gms =========== ----------------------------- Sa 8. Sep 20:00:19 CEST 2012 ----------------------------- @03 1347127219 --- Job netmod_kar1.gms Start 09/08/12 20:00:19 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- netmod_kar1.gms(1537) 2 Mb --- Starting execution: elapsed 0:00:00.014 --- netmod_kar1.gms(1531) 3 Mb --- Generating MINLP model m --- netmod_kar1.gms(1537) 5 Mb --- 667 rows 457 columns 1,849 non-zeroes --- 19 nl-code 4 nl-non-zeroes --- 136 discrete-columns --- netmod_kar1.gms(1537) 3 Mb --- Executing BONMIN: elapsed 0:00:00.019 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 592 Number of nonzeros in inequality constraint Jacobian.: 1248 Number of nonzeros in Lagrangian Hessian.............: 4 Total number of variables............................: 456 variables with only lower bounds: 255 variables with lower and upper bounds: 136 variables with only upper bounds: 0 Total number of equality constraints.................: 42 Total number of inequality constraints...............: 624 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 624 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.56e+00 1.23e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.1490401e-01 1.34e-14 1.10e+01 -0.9 3.96e+01 - 7.88e-02 1.00e+00f 1 2 -2.1756143e-01 1.25e-14 1.97e-02 -7.0 6.82e-02 - 9.83e-01 1.00e+00f 1 3 -3.3888912e-01 1.47e-14 3.92e-03 -4.1 2.85e+00 - 7.72e-01 1.00e+00f 1 4 -6.0627993e-01 1.29e-14 1.30e-03 -4.6 5.46e+00 - 6.80e-01 1.00e+00f 1 5 -7.1738153e-01 1.23e-14 2.36e-04 -5.7 2.83e+00 - 8.33e-01 8.67e-01f 1 6 -7.4807135e-01 5.72e-15 8.38e-06 -8.2 6.90e-01 - 9.63e-01 9.61e-01f 1 7 -7.4999711e-01 9.58e-15 5.43e-08 -11.0 3.94e-02 - 9.95e-01 9.99e-01f 1 8 -7.4999999e-01 1.21e-14 1.02e-16 -11.0 6.07e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -7.4999999414901730e-01 -7.4999999414901730e-01 Dual infeasibility......: 1.0233918899750072e-16 1.0233918899750072e-16 Constraint violation....: 1.2101430968414206e-14 1.2101430968414206e-14 Complementarity.........: 1.0255791297137641e-11 1.0255791297137641e-11 Overall NLP error.......: 1.0255791297137641e-11 1.0255791297137641e-11 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 9 Number of inequality constraint evaluations = 9 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total CPU secs in IPOPT (w/o function evaluations) = 0.020 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -0.74999999 8 0.020996 build initial OA NLP0014I 2 OPT 2.3273711e-09 8 0.014997 OA decomposition OA0003I New best feasible of 2.3273711e-09 found after 0.083987 sec and NLP0014I 3 OPT 2.0524975e-09 8 0.015998 OA decomposition OA0003I New best feasible of 2.0524975e-09 found after 0.123981 sec and NLP0014I 4 OPT 2.3472569e-09 8 0.015997 OA decomposition NLP0014I 5 OPT 2.0980065e-09 8 0.015998 OA decomposition NLP0014I 6 OPT -0.37179487 7 0.013998 OA decomposition OA0003I New best feasible of -0.37179487 found after 0.588911 sec and NLP0014I 7 OPT -0.37179487 7 0.005999 OA decomposition NLP0014I 8 OPT -0.37179487 7 0.006999 OA decomposition NLP0014I 9 OPT -0.37179487 7 0.006998 OA decomposition NLP0014I 10 OPT -0.37179487 7 0.006999 OA decomposition NLP0014I 11 OPT -0.37179487 7 0.005999 OA decomposition NLP0014I 12 OPT -0.38141025 7 0.006999 OA decomposition OA0003I New best feasible of -0.38141025 found after 1.680745 sec and NLP0014I 13 OPT -0.38141026 7 0.005999 OA decomposition NLP0014I 14 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 15 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 16 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 17 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 18 OPT -0.38141025 7 0.004999 OA decomposition NLP0014I 19 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 20 OPT -0.38141025 7 0.005999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT -0.38141025 7 0.005999 OA decomposition NLP0014I 22 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 23 OPT -0.38141025 7 0.005999 OA decomposition NLP0014I 24 OPT -0.41740631 8 0.006999 OA decomposition OA0003I New best feasible of -0.41740631 found after 6.651989 sec and NLP0014I 25 OPT -0.41740631 8 0.005999 OA decomposition NLP0014I 26 OPT -0.41740631 7 0.005999 OA decomposition NLP0014I 27 OPT -0.41740631 7 0.006998 OA decomposition NLP0014I 28 OPT -0.41740631 7 0.006999 OA decomposition NLP0014I 29 OPT -0.41740631 8 0.006999 OA decomposition NLP0014I 30 OPT -0.4059829 7 0.005999 OA decomposition NLP0014I 31 OPT -0.4059829 7 0.006999 OA decomposition NLP0014I 32 OPT -0.4059829 8 0.005999 OA decomposition NLP0014I 33 OPT -0.4059829 8 0.006998 OA decomposition NLP0014I 34 OPT -0.4059829 7 0.005999 OA decomposition NLP0014I 35 OPT -0.4059829 7 0.006 OA decomposition NLP0014I 36 OPT -0.39653189 8 0.006999 OA decomposition NLP0014I 37 OPT -0.39653189 9 0.007999 OA decomposition NLP0014I 38 OPT -0.4059829 7 0.005999 OA decomposition NLP0014I 39 OPT -0.4059829 7 0.004999 OA decomposition NLP0014I 40 OPT -0.41880342 8 0.006999 OA decomposition OA0003I New best feasible of -0.41880342 found after 18.958118 sec and NLP0012I Num Status Obj It time Location NLP0014I 41 OPT -0.41880342 7 0.006999 OA decomposition NLP0014I 42 OPT -0.41880342 7 0.005999 OA decomposition NLP0014I 43 OPT -0.41880342 7 0.006999 OA decomposition NLP0014I 44 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 45 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 46 OPT -0.41880342 8 0.006998 OA decomposition NLP0014I 47 OPT -0.41880342 8 0.005999 OA decomposition NLP0014I 48 OPT -0.41880342 7 0.005999 OA decomposition NLP0014I 49 OPT -0.41880342 7 0.006999 OA decomposition NLP0014I 50 OPT -0.41880342 7 0.006999 OA decomposition NLP0014I 51 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 52 OPT -0.40203813 7 0.006 OA decomposition NLP0014I 53 OPT -0.40203813 7 0.006 OA decomposition NLP0014I 54 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 55 OPT -0.39907955 7 0.005999 OA decomposition NLP0014I 56 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 57 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 58 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 59 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 60 OPT -0.40203813 7 0.005999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 62 OPT -0.40203813 7 0.006998 OA decomposition NLP0014I 63 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 64 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 65 OPT -0.39907955 7 0.005999 OA decomposition NLP0014I 66 OPT -0.39907955 7 0.006999 OA decomposition NLP0014I 67 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 68 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 69 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 70 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 71 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 72 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 73 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 74 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 75 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 76 OPT -0.41880342 8 0.006998 OA decomposition NLP0014I 77 OPT -0.41880342 8 0.007999 OA decomposition NLP0014I 78 OPT -0.41880342 7 0.006999 OA decomposition NLP0014I 79 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 80 OPT -0.41880342 7 0.004999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT -0.41880342 7 0.006999 OA decomposition NLP0014I 82 OPT -0.41978961 8 0.007998 OA decomposition OA0003I New best feasible of -0.41978961 found after 57.760219 sec and NLP0014I 83 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 84 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 85 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 86 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 87 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 88 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 89 OPT -0.41978961 8 0.006998 OA decomposition NLP0014I 90 OPT -0.41978961 8 0.005999 OA decomposition NLP0014I 91 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 92 OPT -0.41978961 8 0.007998 OA decomposition NLP0014I 93 OPT -0.41978961 8 0.007998 OA decomposition NLP0014I 94 OPT -0.41978961 8 0.005999 OA decomposition NLP0014I 95 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 96 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 97 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 98 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 99 OPT -0.41978961 7 0.006998 OA decomposition NLP0014I 100 OPT -0.41978961 8 0.006999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 102 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 103 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 104 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 105 OPT -0.41978961 8 0.006999 OA decomposition OA0008I OA converged in 79.92185 seconds found solution of value -0.41978961 (lower bound 1e+50 ). OA0010I Performed 104 iterations, explored 47548 branch-and-bound nodes in total Cbc0012I Integer solution of -0.41978961 found by nonlinear programm after 21 iterations and 0 nodes (79.89 seconds) Cbc0031I 3 added rows had average density of 9 Cbc0013I At root node, 3 cuts changed objective from -0.75000004 to -0.75000004 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 33 row cuts average 8.3 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -0.4197896101375982, took 21 iterations and 0 nodes (79.89 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 33 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = -0.41979. Best solution: -4.197896e-01 (0 nodes, 80.23 seconds) Best possible: -4.197896e-01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- netmod_kar1.gms(1537) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job netmod_kar1.gms Stop 09/08/12 20:01:40 elapsed 0:01:20.371 @04 1347127300 ----------------------------- Sa 8. Sep 20:01:40 CEST 2012 ----------------------------- =ready= Linux opt220 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/netmod_kar2.gms =========== ----------------------------- Sa 8. Sep 20:00:26 CEST 2012 ----------------------------- @03 1347127226 --- Job netmod_kar2.gms Start 09/08/12 20:00:26 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- netmod_kar2.gms(1537) 2 Mb --- Starting execution: elapsed 0:00:00.018 --- netmod_kar2.gms(1531) 3 Mb --- Generating MINLP model m --- netmod_kar2.gms(1537) 5 Mb --- 667 rows 457 columns 1,849 non-zeroes --- 19 nl-code 4 nl-non-zeroes --- 136 discrete-columns --- netmod_kar2.gms(1537) 3 Mb --- Executing BONMIN: elapsed 0:00:00.024 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 592 Number of nonzeros in inequality constraint Jacobian.: 1248 Number of nonzeros in Lagrangian Hessian.............: 4 Total number of variables............................: 456 variables with only lower bounds: 255 variables with lower and upper bounds: 136 variables with only upper bounds: 0 Total number of equality constraints.................: 42 Total number of inequality constraints...............: 624 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 624 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.56e+00 1.23e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -2.1490401e-01 1.34e-14 1.10e+01 -0.9 3.96e+01 - 7.88e-02 1.00e+00f 1 2 -2.1756143e-01 1.25e-14 1.97e-02 -7.0 6.82e-02 - 9.83e-01 1.00e+00f 1 3 -3.3888912e-01 1.47e-14 3.92e-03 -4.1 2.85e+00 - 7.72e-01 1.00e+00f 1 4 -6.0627993e-01 1.29e-14 1.30e-03 -4.6 5.46e+00 - 6.80e-01 1.00e+00f 1 5 -7.1738153e-01 1.23e-14 2.36e-04 -5.7 2.83e+00 - 8.33e-01 8.67e-01f 1 6 -7.4807135e-01 5.72e-15 8.38e-06 -8.2 6.90e-01 - 9.63e-01 9.61e-01f 1 7 -7.4999711e-01 9.58e-15 5.43e-08 -11.0 3.94e-02 - 9.95e-01 9.99e-01f 1 8 -7.4999999e-01 1.21e-14 1.02e-16 -11.0 6.07e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 8 (scaled) (unscaled) Objective...............: -7.4999999414901730e-01 -7.4999999414901730e-01 Dual infeasibility......: 1.0233918899750072e-16 1.0233918899750072e-16 Constraint violation....: 1.2101430968414206e-14 1.2101430968414206e-14 Complementarity.........: 1.0255791297137641e-11 1.0255791297137641e-11 Overall NLP error.......: 1.0255791297137641e-11 1.0255791297137641e-11 Number of objective function evaluations = 9 Number of objective gradient evaluations = 9 Number of equality constraint evaluations = 9 Number of inequality constraint evaluations = 9 Number of equality constraint Jacobian evaluations = 9 Number of inequality constraint Jacobian evaluations = 9 Number of Lagrangian Hessian evaluations = 8 Total CPU secs in IPOPT (w/o function evaluations) = 0.022 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -0.74999999 8 0.024997 build initial OA NLP0014I 2 OPT 2.3273711e-09 8 0.015998 OA decomposition OA0003I New best feasible of 2.3273711e-09 found after 0.081988 sec and NLP0014I 3 OPT 2.0524975e-09 8 0.015997 OA decomposition OA0003I New best feasible of 2.0524975e-09 found after 0.120982 sec and NLP0014I 4 OPT 2.3472569e-09 8 0.014998 OA decomposition NLP0014I 5 OPT 2.0980065e-09 8 0.015997 OA decomposition NLP0014I 6 OPT -0.37179487 7 0.014998 OA decomposition OA0003I New best feasible of -0.37179487 found after 0.587911 sec and NLP0014I 7 OPT -0.37179487 7 0.006999 OA decomposition NLP0014I 8 OPT -0.37179487 7 0.005999 OA decomposition NLP0014I 9 OPT -0.37179487 7 0.006998 OA decomposition NLP0014I 10 OPT -0.37179487 7 0.006999 OA decomposition NLP0014I 11 OPT -0.37179487 7 0.005999 OA decomposition NLP0014I 12 OPT -0.38141025 7 0.006999 OA decomposition OA0003I New best feasible of -0.38141025 found after 1.720739 sec and NLP0014I 13 OPT -0.38141026 7 0.006999 OA decomposition NLP0014I 14 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 15 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 16 OPT -0.38141025 7 0.005999 OA decomposition NLP0014I 17 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 18 OPT -0.38141025 7 0.005999 OA decomposition NLP0014I 19 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 20 OPT -0.38141025 7 0.005999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 OPT -0.38141025 7 0.005999 OA decomposition NLP0014I 22 OPT -0.38141025 7 0.005999 OA decomposition NLP0014I 23 OPT -0.38141025 7 0.006999 OA decomposition NLP0014I 24 OPT -0.41740631 8 0.006999 OA decomposition OA0003I New best feasible of -0.41740631 found after 6.675986 sec and NLP0014I 25 OPT -0.41740631 8 0.006999 OA decomposition NLP0014I 26 OPT -0.41740631 7 0.006999 OA decomposition NLP0014I 27 OPT -0.41740631 7 0.005999 OA decomposition NLP0014I 28 OPT -0.41740631 7 0.005999 OA decomposition NLP0014I 29 OPT -0.41740631 8 0.006999 OA decomposition NLP0014I 30 OPT -0.4059829 7 0.005999 OA decomposition NLP0014I 31 OPT -0.4059829 7 0.006999 OA decomposition NLP0014I 32 OPT -0.4059829 8 0.007999 OA decomposition NLP0014I 33 OPT -0.4059829 8 0.006999 OA decomposition NLP0014I 34 OPT -0.4059829 7 0.006999 OA decomposition NLP0014I 35 OPT -0.4059829 7 0.006 OA decomposition NLP0014I 36 OPT -0.39653189 8 0.005999 OA decomposition NLP0014I 37 OPT -0.39653189 9 0.007999 OA decomposition NLP0014I 38 OPT -0.4059829 7 0.005999 OA decomposition NLP0014I 39 OPT -0.4059829 7 0.006999 OA decomposition NLP0014I 40 OPT -0.41880342 8 0.006999 OA decomposition OA0003I New best feasible of -0.41880342 found after 18.94612 sec and NLP0012I Num Status Obj It time Location NLP0014I 41 OPT -0.41880342 7 0.006999 OA decomposition NLP0014I 42 OPT -0.41880342 7 0.006999 OA decomposition NLP0014I 43 OPT -0.41880342 7 0.006998 OA decomposition NLP0014I 44 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 45 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 46 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 47 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 48 OPT -0.41880342 7 0.005999 OA decomposition NLP0014I 49 OPT -0.41880342 7 0.005999 OA decomposition NLP0014I 50 OPT -0.41880342 7 0.006998 OA decomposition NLP0014I 51 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 52 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 53 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 54 OPT -0.40203813 7 0.006998 OA decomposition NLP0014I 55 OPT -0.39907955 7 0.005999 OA decomposition NLP0014I 56 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 57 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 58 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 59 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 60 OPT -0.40203813 7 0.006999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 62 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 63 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 64 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 65 OPT -0.39907955 7 0.005999 OA decomposition NLP0014I 66 OPT -0.39907955 7 0.005999 OA decomposition NLP0014I 67 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 68 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 69 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 70 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 71 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 72 OPT -0.40203813 7 0.005999 OA decomposition NLP0014I 73 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 74 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 75 OPT -0.40203813 7 0.006999 OA decomposition NLP0014I 76 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 77 OPT -0.41880342 8 0.006999 OA decomposition NLP0014I 78 OPT -0.41880342 7 0.006999 OA decomposition NLP0014I 79 OPT -0.41880342 8 0.007999 OA decomposition NLP0014I 80 OPT -0.41880342 7 0.005999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 OPT -0.41880342 7 0.005999 OA decomposition NLP0014I 82 OPT -0.41978961 8 0.006999 OA decomposition OA0003I New best feasible of -0.41978961 found after 57.651236 sec and NLP0014I 83 OPT -0.41978961 8 0.007998 OA decomposition NLP0014I 84 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 85 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 86 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 87 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 88 OPT -0.41978961 8 0.007998 OA decomposition NLP0014I 89 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 90 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 91 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 92 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 93 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 94 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 95 OPT -0.41978961 8 0.005999 OA decomposition NLP0014I 96 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 97 OPT -0.41978961 8 0.005999 OA decomposition NLP0014I 98 OPT -0.41978961 8 0.007999 OA decomposition NLP0014I 99 OPT -0.41978961 7 0.006999 OA decomposition NLP0014I 100 OPT -0.41978961 8 0.006999 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 101 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 102 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 103 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 104 OPT -0.41978961 8 0.006999 OA decomposition NLP0014I 105 OPT -0.41978961 8 0.007999 OA decomposition OA0008I OA converged in 79.764874 seconds found solution of value -0.41978961 (lower bound 1e+50 ). OA0010I Performed 104 iterations, explored 47548 branch-and-bound nodes in total Cbc0012I Integer solution of -0.41978961 found by nonlinear programm after 21 iterations and 0 nodes (79.74 seconds) Cbc0031I 3 added rows had average density of 9 Cbc0013I At root node, 3 cuts changed objective from -0.75000004 to -0.75000004 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 33 row cuts average 8.3 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective -0.4197896101375982, took 21 iterations and 0 nodes (79.74 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 33 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = -0.41979. Best solution: -4.197896e-01 (0 nodes, 80.065 seconds) Best possible: -4.197896e-01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- netmod_kar2.gms(1537) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job netmod_kar2.gms Stop 09/08/12 20:01:47 elapsed 0:01:20.213 @04 1347127307 ----------------------------- Sa 8. Sep 20:01:47 CEST 2012 ----------------------------- =ready= Linux opt230 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/no7_ar2_1.gms =========== ----------------------------- Sa 8. Sep 20:00:55 CEST 2012 ----------------------------- @03 1347127255 --- Job no7_ar2_1.gms Start 09/08/12 20:00:56 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- no7_ar2_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- no7_ar2_1.gms(663) 3 Mb --- Generating MINLP model m --- no7_ar2_1.gms(668) 5 Mb --- 270 rows 113 columns 1,061 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- no7_ar2_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.12e+00 1.34e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4441090e+02 0.00e+00 3.28e+02 1.1 4.73e+01 - 2.25e-03 2.68e-01f 1 2 1.4849062e+02 0.00e+00 3.02e+02 1.1 3.99e+00 2.0 1.00e+00 3.71e-01h 1 3 1.1120394e+02 0.00e+00 9.22e+01 -0.9 3.24e+00 - 8.12e-01 1.00e+00f 1 4 4.4485529e+01 0.00e+00 2.90e+01 -1.0 3.21e+00 - 6.95e-01 1.00e+00f 1 5 1.5574745e+01 0.00e+00 8.70e+00 -1.5 2.84e+00 - 7.00e-01 7.64e-01f 1 6 3.8674546e+00 0.00e+00 2.41e+00 -2.0 1.89e+00 - 7.23e-01 7.25e-01f 1 7 8.0852934e-01 0.00e+00 3.24e-01 -1.8 1.33e+00 - 8.71e-01 8.44e-01f 1 8 2.4168326e-01 0.00e+00 2.13e-01 -5.3 8.76e-02 - 9.64e-01 6.55e-01f 1 9 1.0652839e-02 0.00e+00 1.16e-02 -7.5 2.91e-02 - 9.73e-01 9.51e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.2255135e-04 0.00e+00 1.36e-04 -11.0 1.46e-03 - 9.89e-01 9.88e-01h 1 11 2.2413570e-08 0.00e+00 3.02e-08 -11.0 5.77e-04 - 1.00e+00 1.00e+00h 1 12 5.8679255e-10 8.96e-16 4.90e-02 -11.0 3.33e+00 - 9.12e-01 8.33e-01h 1 13 -3.2033760e-09 4.91e-12 1.55e-02 -10.7 1.86e-04 1.5 1.00e+00 9.77e-01h 1 14 -3.2119075e-09 2.13e-12 6.93e-01 -10.7 4.36e-06 1.0 9.16e-01 1.25e-01f 4 15 -3.2840364e-09 0.00e+00 1.41e-05 -10.7 3.82e-06 0.6 1.00e+00 1.00e+00h 1 16 -3.6403105e-09 0.00e+00 6.51e-11 -11.0 5.27e-11 0.1 1.00e+00 1.00e+00h 1 Number of Iterations....: 16 (scaled) (unscaled) Objective...............: -3.6403104986489990e-09 -3.6403104986489990e-09 Dual infeasibility......: 6.5074548645736467e-11 6.5074548645736467e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0415844961490148e-11 1.0415844961490148e-11 Overall NLP error.......: 6.5074548645736467e-11 6.5074548645736467e-11 Number of objective function evaluations = 20 Number of objective gradient evaluations = 17 Number of equality constraint evaluations = 20 Number of inequality constraint evaluations = 20 Number of equality constraint Jacobian evaluations = 17 Number of inequality constraint Jacobian evaluations = 17 Number of Lagrangian Hessian evaluations = 16 Total CPU secs in IPOPT (w/o function evaluations) = 0.012 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -3.6403105e-09 16 0.014997 build initial OA NLP0014I 2 OPT 107.81531 90 0.047993 OA decomposition OA0003I New best feasible of 107.81531 found after 4.560307 sec and OA0008I OA converged in 7.149913 seconds found solution of value 107.81531 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 33090 branch-and-bound nodes in total Cbc0012I Integer solution of 107.81531 found by nonlinear programm after 1 iterations and 0 nodes (7.15 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 1 cuts changed objective from -4e-07 to -4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 1 row cuts average 2.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 107.815308048931, took 1 iterations and 0 nodes (7.15 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 1 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 107.815. Best solution: 1.078153e+02 (0 nodes, 7.204 seconds) Best possible: 1.078153e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- no7_ar2_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job no7_ar2_1.gms Stop 09/08/12 20:01:03 elapsed 0:00:07.285 @04 1347127263 ----------------------------- Sa 8. Sep 20:01:03 CEST 2012 ----------------------------- =ready= Linux opt230 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/no7_ar25_1.gms =========== ----------------------------- Sa 8. Sep 20:01:03 CEST 2012 ----------------------------- @03 1347127263 --- Job no7_ar25_1.gms Start 09/08/12 20:01:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- no7_ar25_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.005 --- no7_ar25_1.gms(663) 3 Mb --- Generating MINLP model m --- no7_ar25_1.gms(668) 5 Mb --- 270 rows 113 columns 1,061 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- no7_ar25_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.007 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 5.14e+00 1.27e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6674597e+02 1.08e-01 3.84e+02 1.1 4.51e+01 - 2.44e-03 3.08e-01f 1 2 1.7807872e+02 0.00e+00 4.63e+02 0.3 4.62e+00 2.0 7.29e-01 1.00e+00h 1 3 9.1349726e+01 0.00e+00 3.33e+02 -0.9 1.57e+01 - 7.50e-01 2.81e-01f 1 4 2.9723076e+01 0.00e+00 9.27e+01 -0.5 5.69e+00 - 8.26e-01 7.22e-01f 1 5 7.5260504e+00 0.00e+00 2.67e+01 -2.0 3.08e+00 - 7.49e-01 7.12e-01f 1 6 1.6267736e+00 0.00e+00 7.97e+00 -2.5 7.82e-01 - 9.18e-01 7.02e-01f 1 7 4.3996700e-01 0.00e+00 3.08e+00 -3.8 4.65e-01 - 8.97e-01 6.18e-01f 1 8 9.5168750e-02 0.00e+00 9.19e-01 -5.2 1.69e-01 - 9.73e-01 7.14e-01f 1 9 5.1588699e-03 0.00e+00 5.54e-02 -7.8 1.59e-02 - 9.89e-01 9.41e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.7014078e-05 0.00e+00 6.18e-04 -11.0 9.42e-04 - 9.90e-01 9.89e-01h 1 11 6.5760836e-08 0.00e+00 2.65e-04 -11.0 7.95e-06 1.5 9.99e-01 9.99e-01h 1 12 1.1568876e-09 0.00e+00 3.28e-02 -11.0 7.88e+00 - 7.56e-01 9.28e-01h 1 13 -2.9696464e-09 8.27e-18 4.80e-01 -10.7 6.68e+01 - 3.99e-01 9.20e-01h 1 14 -3.2834556e-09 0.00e+00 3.27e-01 -10.7 1.09e+02 - 5.94e-01 1.00e+00f 1 15 -3.2903541e-09 0.00e+00 1.03e-01 -10.7 2.55e+02 - 5.79e-01 1.00e+00h 1 16 -3.2901107e-09 0.00e+00 4.24e-02 -10.7 5.99e+02 - 5.99e-01 1.00e+00h 1 17 -3.2901178e-09 0.00e+00 1.77e-02 -10.7 1.47e+03 - 5.82e-01 1.00e+00h 1 18 -3.2901222e-09 0.00e+00 7.04e-03 -10.7 3.39e+03 - 6.02e-01 1.00e+00h 1 19 -3.2901239e-09 0.00e+00 2.70e-03 -10.7 7.81e+03 - 6.16e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -3.6401990e-09 0.00e+00 2.22e-02 -11.0 8.36e+03 - 7.70e-01 1.00e+00h 1 21 -3.6399331e-09 0.00e+00 5.79e-03 -11.0 2.48e+04 - 7.54e-01 1.00e+00h 1 22 -3.6399493e-09 0.00e+00 1.36e-03 -11.0 3.60e+04 - 7.63e-01 1.00e+00h 1 23 -3.6399487e-09 0.00e+00 8.88e-16 -11.0 2.07e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 23 (scaled) (unscaled) Objective...............: -3.6399487184683387e-09 -3.6399487184683387e-09 Dual infeasibility......: 8.8817841970012523e-16 8.8817841970012523e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2659899211475766e-11 1.2659899211475766e-11 Overall NLP error.......: 1.2659899211475766e-11 1.2659899211475766e-11 Number of objective function evaluations = 24 Number of objective gradient evaluations = 24 Number of equality constraint evaluations = 24 Number of inequality constraint evaluations = 24 Number of equality constraint Jacobian evaluations = 24 Number of inequality constraint Jacobian evaluations = 24 Number of Lagrangian Hessian evaluations = 23 Total CPU secs in IPOPT (w/o function evaluations) = 0.015 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -3.6399487e-09 23 0.016997 build initial OA NLP0014I 2 INFEAS 0.060440593 51 0.031995 OA decomposition NLP0014I 3 OPT 107.81531 23 0.012998 OA decomposition OA0003I New best feasible of 107.81531 found after 17.286372 sec and OA0008I OA converged in 22.845527 seconds found solution of value 107.81531 (lower bound 1e+50 ). OA0010I Performed 2 iterations, explored 103190 branch-and-bound nodes in total Cbc0012I Integer solution of 107.81531 found by nonlinear programm after 7 iterations and 0 nodes (22.85 seconds) Cbc0031I 6 added rows had average density of 2 Cbc0013I At root node, 6 cuts changed objective from -4e-07 to -4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 2.0 elements, 0 column cuts (6 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 107.8153080596417, took 7 iterations and 0 nodes (22.85 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 6 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 107.815. Best solution: 1.078153e+02 (0 nodes, 23.011 seconds) Best possible: 1.078153e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- no7_ar25_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job no7_ar25_1.gms Stop 09/08/12 20:01:26 elapsed 0:00:23.088 @04 1347127286 ----------------------------- Sa 8. Sep 20:01:26 CEST 2012 ----------------------------- =ready= Linux opt230 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/no7_ar3_1.gms =========== ----------------------------- Sa 8. Sep 20:01:26 CEST 2012 ----------------------------- @03 1347127286 --- Job no7_ar3_1.gms Start 09/08/12 20:01:26 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- no7_ar3_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- no7_ar3_1.gms(663) 3 Mb --- Generating MINLP model m --- no7_ar3_1.gms(668) 5 Mb --- 270 rows 113 columns 1,061 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- no7_ar3_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 6.03e+00 1.11e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8026682e+02 3.60e-01 4.20e+02 1.1 4.35e+01 - 2.63e-03 3.32e-01f 1 2 1.8382770e+02 8.14e-02 2.95e+02 0.4 4.92e+00 2.0 7.04e-01 2.97e-01h 1 3 9.0421247e+01 1.77e-01 2.05e+02 -1.0 1.47e+01 - 8.02e-01 3.19e-01f 1 4 2.1944729e+01 3.94e-02 4.20e+01 -0.8 5.92e+00 - 6.67e-01 7.95e-01f 1 5 5.2606291e+00 0.00e+00 1.23e+01 -1.8 2.77e+00 - 7.48e-01 7.06e-01f 1 6 7.3956414e-01 0.00e+00 3.18e+00 -3.6 6.81e-01 - 9.19e-01 7.44e-01f 1 7 1.4586734e-01 0.00e+00 9.03e-01 -5.1 1.17e-01 - 9.55e-01 7.17e-01h 1 8 1.4665411e-02 0.00e+00 1.04e-01 -7.0 2.38e-02 - 9.85e-01 8.85e-01h 1 9 2.2690127e-04 0.00e+00 1.67e-03 -11.0 2.46e-03 - 9.90e-01 9.84e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.8957450e-07 0.00e+00 2.91e-06 -11.0 2.00e-03 - 9.98e-01 9.98e-01h 1 11 9.2664778e-10 5.33e-13 1.54e-03 -11.0 1.11e+00 - 9.45e-01 9.88e-01h 1 12 -3.2061150e-09 2.25e-12 8.40e-02 -11.0 1.76e-09 1.5 1.00e+00 8.94e-01h 1 13 -3.6362974e-09 1.42e-12 2.06e-09 -11.0 1.85e-10 1.0 1.00e+00 1.00e+00h 1 Number of Iterations....: 13 (scaled) (unscaled) Objective...............: -3.6362974361790833e-09 -3.6362974361790833e-09 Dual infeasibility......: 2.0594055551881631e-09 2.0594055551881631e-09 Constraint violation....: 1.4237582808163970e-12 1.4237582808163970e-12 Complementarity.........: 1.3933978847702013e-11 1.3933978847702013e-11 Overall NLP error.......: 2.0594055551881631e-09 2.0594055551881631e-09 Number of objective function evaluations = 14 Number of objective gradient evaluations = 14 Number of equality constraint evaluations = 14 Number of inequality constraint evaluations = 14 Number of equality constraint Jacobian evaluations = 14 Number of inequality constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 13 Total CPU secs in IPOPT (w/o function evaluations) = 0.025 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -3.6362974e-09 13 0.026996 build initial OA NLP0014I 2 INFEAS 0.34010648 109 0.06299 OA decomposition NLP0014I 3 OPT 107.87146 61 0.034995 OA decomposition OA0003I New best feasible of 107.87146 found after 36.76941 sec and NLP0014I 4 OPT 108.22476 67 0.034995 OA decomposition NLP0014I 5 OPT 107.81531 52 0.033995 OA decomposition OA0003I New best feasible of 107.81531 found after 63.495347 sec and OA0008I OA converged in 76.518367 seconds found solution of value 107.81531 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 427246 branch-and-bound nodes in total Cbc0012I Integer solution of 107.81531 found by nonlinear programm after 12 iterations and 0 nodes (76.52 seconds) Cbc0031I 6 added rows had average density of 2 Cbc0013I At root node, 6 cuts changed objective from -4e-07 to -4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 13 row cuts average 2.0 elements, 0 column cuts (6 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 107.8153082781693, took 12 iterations and 0 nodes (76.52 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 13 cuts of which 6 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 107.815. Best solution: 1.078153e+02 (0 nodes, 77.125 seconds) Best possible: 1.078153e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- no7_ar3_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job no7_ar3_1.gms Stop 09/08/12 20:02:44 elapsed 0:01:17.258 @04 1347127364 ----------------------------- Sa 8. Sep 20:02:44 CEST 2012 ----------------------------- =ready= Linux opt229 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/no7_ar4_1.gms =========== ----------------------------- Sa 8. Sep 20:01:36 CEST 2012 ----------------------------- @03 1347127296 --- Job no7_ar4_1.gms Start 09/08/12 20:01:36 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- no7_ar4_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.010 --- no7_ar4_1.gms(663) 3 Mb --- Generating MINLP model m --- no7_ar4_1.gms(668) 5 Mb --- 270 rows 113 columns 1,061 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- no7_ar4_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 7.62e+00 9.84e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.9989232e+02 9.32e-01 4.71e+02 1.1 4.17e+01 - 2.95e-03 3.63e-01f 1 2 2.0121060e+02 7.42e-01 4.20e+02 0.5 5.11e+00 2.0 6.04e-01 9.94e-02h 1 3 2.1214998e+02 0.00e+00 1.67e+02 0.0 5.02e+00 1.5 9.69e-01 1.00e+00h 1 4 1.1759336e+02 0.00e+00 1.50e+02 -0.7 4.87e+01 - 5.78e-01 1.05e-01f 1 5 3.5201971e+01 0.00e+00 7.32e+01 -0.9 8.62e+00 - 4.48e-01 5.12e-01f 1 6 1.3093317e+01 0.00e+00 3.39e+01 -1.0 4.74e+00 - 4.24e-01 5.37e-01f 1 7 4.7490621e+00 0.00e+00 1.55e+01 -1.4 1.84e+00 - 7.69e-01 5.44e-01f 1 8 2.2454137e+00 0.00e+00 8.67e+00 -3.5 4.99e-01 - 9.51e-01 4.47e-01f 1 9 4.6475985e-01 0.00e+00 2.45e+00 -4.3 2.89e-01 - 9.64e-01 7.22e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 9.0709958e-02 0.00e+00 5.62e-01 -5.3 5.84e-01 - 9.70e-01 7.78e-01f 1 11 2.3780589e-03 0.00e+00 1.57e-02 -9.0 1.13e-02 - 9.89e-01 9.72e-01h 1 12 2.4403777e-05 0.00e+00 1.62e-04 -11.0 3.19e-03 - 9.90e-01 9.90e-01h 1 13 7.4551018e-09 0.00e+00 3.36e-05 -11.0 3.03e-06 1.0 1.00e+00 1.00e+00h 1 14 -2.0929871e-09 0.00e+00 4.68e-02 -11.0 9.91e+00 - 7.98e-01 8.53e-01h 1 15 -3.6305406e-09 0.00e+00 4.71e-01 -11.0 5.64e+01 - 4.27e-01 1.00e+00h 1 16 -3.6174507e-09 0.00e+00 2.50e-01 -11.0 9.10e+01 - 6.02e-01 1.00e+00h 1 17 -3.6216050e-09 0.00e+00 8.02e-02 -11.0 2.23e+02 - 6.15e-01 1.00e+00h 1 18 -3.6214818e-09 0.00e+00 3.65e-02 -11.0 5.75e+02 - 5.51e-01 1.00e+00h 1 19 -3.6214906e-09 0.00e+00 1.35e-02 -11.0 1.27e+03 - 6.29e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -3.6214895e-09 0.00e+00 6.08e-03 -11.0 3.29e+03 - 5.52e-01 1.00e+00h 1 21 -3.6214840e-09 0.00e+00 2.04e-03 -11.0 6.81e+03 - 6.63e-01 1.00e+00h 1 22 -3.6214909e-09 0.00e+00 8.85e-04 -11.0 1.65e+04 - 5.67e-01 1.00e+00h 1 23 -3.6399481e-09 0.00e+00 7.37e-04 -11.0 2.36e+04 - 8.76e-01 1.00e+00h 1 24 -3.6399439e-09 0.00e+00 2.23e-04 -11.0 4.28e+04 - 6.99e-01 1.00e+00h 1 25 -3.6399433e-09 0.00e+00 8.88e-16 -11.0 1.36e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 25 (scaled) (unscaled) Objective...............: -3.6399432905857577e-09 -3.6399432905857577e-09 Dual infeasibility......: 8.8817841970012523e-16 8.8817841970012523e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.1597795492695646e-11 1.1597795492695646e-11 Overall NLP error.......: 1.1597795492695646e-11 1.1597795492695646e-11 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of equality constraint evaluations = 26 Number of inequality constraint evaluations = 26 Number of equality constraint Jacobian evaluations = 26 Number of inequality constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Total CPU secs in IPOPT (w/o function evaluations) = 0.030 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -3.6399433e-09 25 0.034995 build initial OA NLP0014I 2 INFEAS 0.15128152 49 0.031996 OA decomposition NLP0014I 3 INFEAS 0.31777272 52 0.033995 OA decomposition NLP0014I 4 INFEAS 0.1241651 59 0.038995 OA decomposition NLP0014I 5 OPT 98.518402 22 0.011998 OA decomposition OA0003I New best feasible of 98.518402 found after 50.791278 sec and NLP0014I 6 OPT 98.744203 23 0.012998 OA decomposition OA0008I OA converged in 73.593812 seconds found solution of value 98.518402 (lower bound 1e+50 ). OA0010I Performed 5 iterations, explored 379355 branch-and-bound nodes in total Cbc0012I Integer solution of 98.518402 found by nonlinear programm after 9 iterations and 0 nodes (73.59 seconds) Cbc0031I 4 added rows had average density of 2 Cbc0013I At root node, 4 cuts changed objective from -4e-07 to -4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 2.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 98.51840216410042, took 9 iterations and 0 nodes (73.59 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 98.5184. Best solution: 9.851840e+01 (0 nodes, 74.127 seconds) Best possible: 9.851840e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- no7_ar4_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job no7_ar4_1.gms Stop 09/08/12 20:02:50 elapsed 0:01:14.274 @04 1347127370 ----------------------------- Sa 8. Sep 20:02:50 CEST 2012 ----------------------------- =ready= Linux opt216 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/no7_ar5_1.gms =========== ----------------------------- Sa 8. Sep 20:01:40 CEST 2012 ----------------------------- @03 1347127300 --- Job no7_ar5_1.gms Start 09/08/12 20:01:40 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- no7_ar5_1.gms(668) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- no7_ar5_1.gms(663) 3 Mb --- Generating MINLP model m --- no7_ar5_1.gms(668) 5 Mb --- 270 rows 113 columns 1,061 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- no7_ar5_1.gms(668) 3 Mb --- Executing BONMIN: elapsed 0:00:00.009 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.61e+00 1.03e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.1114449e+02 1.41e+00 5.01e+02 1.1 4.08e+01 - 3.22e-03 3.80e-01f 1 2 2.1220352e+02 1.24e+00 4.58e+02 0.7 5.38e+00 2.0 5.08e-01 7.46e-02h 1 3 2.2448067e+02 0.00e+00 1.76e+02 0.4 5.27e+00 1.5 1.00e+00 1.00e+00h 1 4 1.2007483e+02 0.00e+00 1.40e+02 -1.0 2.61e+01 - 7.38e-01 2.06e-01f 1 5 3.6776201e+01 0.00e+00 4.85e+01 -0.9 7.10e+00 - 4.11e-01 6.53e-01f 1 6 1.4045107e+01 0.00e+00 1.86e+01 -1.0 4.22e+00 - 4.38e-01 6.16e-01f 1 7 4.6648855e+00 0.00e+00 7.30e+00 -1.5 2.25e+00 - 7.36e-01 6.08e-01f 1 8 1.6874222e+00 0.00e+00 3.72e+00 -3.2 5.57e-01 - 8.82e-01 5.53e-01f 1 9 3.4988327e-01 0.00e+00 1.15e+00 -4.8 1.90e-01 - 9.57e-01 7.28e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.7553587e-02 0.00e+00 1.42e-01 -6.4 4.26e-02 - 9.84e-01 8.79e-01f 1 11 5.3677267e-04 0.00e+00 2.09e-03 -11.0 4.79e-03 - 9.89e-01 9.85e-01h 1 12 1.1424661e-06 0.00e+00 4.47e-06 -11.0 1.43e-03 - 9.98e-01 9.98e-01h 1 13 5.2327514e-10 0.00e+00 2.06e-04 -11.0 6.60e-01 - 9.74e-01 9.96e-01h 1 14 -3.0650269e-09 0.00e+00 4.61e-01 -11.0 2.75e+01 - 4.51e-01 8.52e-01h 1 15 -3.4147488e-09 0.00e+00 5.08e-01 -10.8 7.32e+01 - 4.44e-01 1.00e+00h 1 16 -3.4249344e-09 0.00e+00 1.47e-01 -10.8 1.31e+02 - 6.50e-01 1.00e+00h 1 17 -3.4242362e-09 0.00e+00 7.22e-02 -10.8 3.72e+02 - 5.29e-01 1.00e+00h 1 18 -3.4242741e-09 0.00e+00 2.57e-02 -10.8 7.83e+02 - 6.42e-01 1.00e+00h 1 19 -3.4242751e-09 0.00e+00 1.19e-02 -10.8 2.14e+03 - 5.37e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -3.4242752e-09 0.00e+00 4.06e-03 -10.8 4.42e+03 - 6.59e-01 1.00e+00h 1 21 -3.4242717e-09 0.00e+00 1.76e-03 -10.8 1.13e+04 - 5.67e-01 1.00e+00h 1 22 -3.4242780e-09 0.00e+00 4.65e-04 -10.8 1.98e+04 - 7.36e-01 1.00e+00h 1 23 -3.4242798e-09 0.00e+00 1.18e-04 -10.8 3.36e+04 - 7.46e-01 1.00e+00h 1 24 -3.6400332e-09 0.00e+00 4.44e-16 -11.0 1.78e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 24 (scaled) (unscaled) Objective...............: -3.6400331948679635e-09 -3.6400331948679635e-09 Dual infeasibility......: 4.4408920985006262e-16 4.4408920985006262e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2502711171179536e-11 1.2502711171179536e-11 Overall NLP error.......: 1.2502711171179536e-11 1.2502711171179536e-11 Number of objective function evaluations = 25 Number of objective gradient evaluations = 25 Number of equality constraint evaluations = 25 Number of inequality constraint evaluations = 25 Number of equality constraint Jacobian evaluations = 25 Number of inequality constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Total CPU secs in IPOPT (w/o function evaluations) = 0.013 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -3.6400332e-09 24 0.013998 build initial OA NLP0014I 2 INFEAS 0.0086482866 75 0.051992 OA decomposition NLP0014I 3 INFEAS 0.017050619 59 0.042993 OA decomposition NLP0014I 4 INFEAS 0.0087127793 71 0.049992 OA decomposition NLP0014I 5 OPT 90.796265 28 0.013998 OA decomposition OA0003I New best feasible of 90.796265 found after 46.276965 sec and NLP0014I 6 OPT 90.622675 25 0.013998 OA decomposition OA0003I New best feasible of 90.622675 found after 54.102776 sec and NLP0014I 7 INFEAS 0.035064401 70 0.044993 OA decomposition OA0008I OA converged in 69.623416 seconds found solution of value 90.622675 (lower bound 1e+50 ). OA0010I Performed 6 iterations, explored 351534 branch-and-bound nodes in total Cbc0012I Integer solution of 90.622675 found by nonlinear programm after 8 iterations and 0 nodes (69.62 seconds) Cbc0031I 5 added rows had average density of 2 Cbc0013I At root node, 5 cuts changed objective from -4e-07 to -4e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 12 row cuts average 2.0 elements, 0 column cuts (5 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 90.62267479931722, took 8 iterations and 0 nodes (69.62 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 12 cuts of which 5 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 90.6227. Best solution: 9.062267e+01 (0 nodes, 70.127 seconds) Best possible: 9.062267e+01 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- no7_ar5_1.gms(668) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job no7_ar5_1.gms Stop 09/08/12 20:02:50 elapsed 0:01:10.216 @04 1347127370 ----------------------------- Sa 8. Sep 20:02:50 CEST 2012 ----------------------------- =ready= Linux opt202 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/o7_2.gms =========== ----------------------------- Sa 8. Sep 20:01:45 CEST 2012 ----------------------------- @03 1347127305 --- Job o7_2.gms Start 09/08/12 20:01:45 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- o7_2.gms(509) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- o7_2.gms(504) 3 Mb --- Generating MINLP model m --- o7_2.gms(509) 5 Mb --- 212 rows 115 columns 877 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- o7_2.gms(509) 3 Mb --- Executing BONMIN: elapsed 0:00:00.013 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 842 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 211 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 211 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.61e+00 1.04e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.6237890e+02 6.85e-01 2.91e+02 0.5 1.48e+01 - 2.01e-02 1.00e+00f 1 2 1.6189481e+02 0.00e+00 2.62e+02 -0.4 2.62e+00 2.0 5.38e-01 1.00e+00h 1 3 6.8415500e+01 0.00e+00 2.10e+02 -0.5 1.73e+01 - 5.35e-01 1.99e-01f 1 4 3.4874065e+01 0.00e+00 1.28e+02 -1.8 3.76e+00 - 8.42e-01 3.89e-01f 1 5 5.1645248e+00 0.00e+00 2.12e+01 -2.7 1.95e+00 - 8.53e-01 8.35e-01f 1 6 1.9486380e-01 0.00e+00 8.06e-01 -5.2 5.88e-01 - 9.30e-01 9.62e-01f 1 7 2.3130679e-03 0.00e+00 9.64e-03 -10.5 2.69e-02 - 9.87e-01 9.88e-01f 1 8 2.2309306e-05 0.00e+00 9.30e-05 -11.0 3.22e-04 - 9.90e-01 9.90e-01h 1 9 -3.1323996e-10 0.00e+00 1.78e-08 -11.0 2.14e-04 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -3.1134554e-09 8.96e-16 2.49e-01 -11.0 1.89e+00 - 9.12e-01 6.73e-01h 1 11 -4.3001528e-09 0.00e+00 6.90e-01 -10.9 2.61e+01 - 2.64e-01 1.00e+00h 1 12 -4.3140802e-09 0.00e+00 2.01e-01 -10.9 3.55e+01 - 6.35e-01 1.00e+00h 1 13 -4.3153380e-09 0.00e+00 7.97e-02 -10.9 9.69e+01 - 5.78e-01 1.00e+00h 1 14 -4.3153860e-09 0.00e+00 3.26e-02 -10.9 2.29e+02 - 5.88e-01 1.00e+00h 1 15 -4.3153829e-09 0.00e+00 1.35e-02 -10.9 5.53e+02 - 5.88e-01 1.00e+00h 1 16 -4.3153860e-09 0.00e+00 5.51e-03 -10.9 1.32e+03 - 5.91e-01 1.00e+00h 1 17 -4.3153811e-09 0.00e+00 2.22e-03 -10.9 3.13e+03 - 5.97e-01 1.00e+00h 1 18 -4.3153860e-09 0.00e+00 8.55e-04 -10.9 7.18e+03 - 6.14e-01 1.00e+00h 1 19 -4.3153856e-09 0.00e+00 2.94e-04 -10.9 1.53e+04 - 6.57e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.3999705e-09 0.00e+00 4.25e-03 -11.0 2.28e+04 - 7.99e-01 1.00e+00h 1 21 -4.3999655e-09 0.00e+00 4.44e-16 -11.0 3.44e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: -4.3999655202039777e-09 -4.3999655202039777e-09 Dual infeasibility......: 4.4408920985006262e-16 4.4408920985006262e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.6784040554914700e-11 1.6784040554914700e-11 Overall NLP error.......: 1.6784040554914700e-11 1.6784040554914700e-11 Number of objective function evaluations = 22 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 22 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total CPU secs in IPOPT (w/o function evaluations) = 0.021 Total CPU secs in NLP function evaluations = 0.006 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4.3999655e-09 21 0.026996 build initial OA NLP0014I 2 INFEAS 0.27006899 35 0.020997 OA decomposition OA0012I After 106.79877.1f seconds, 2 iterations upper bound 1e+500g, lower bound 112.411060g NLP0014I 3 OPT 118.85932 34 0.012998 OA decomposition OA0003I New best feasible of 118.85932 found after 106.81276 sec and OA0012I After 260.45941.1f seconds, 3 iterations upper bound 118.858130g, lower bound 112.690610g NLP0014I 4 INFEAS 0.34909819 34 0.019997 OA decomposition OA0012I After 455.33078.1f seconds, 4 iterations upper bound 118.858130g, lower bound 116.335580g NLP0014I 5 OPT 116.94593 24 0.010998 OA decomposition OA0003I New best feasible of 116.94593 found after 455.34178 sec and OA0008I OA converged in 513.86688 seconds found solution of value 116.94593 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 3610496 branch-and-bound nodes in total Cbc0012I Integer solution of 116.94593 found by nonlinear programm after 8 iterations and 0 nodes (513.87 seconds) Cbc0031I 4 added rows had average density of 2 Cbc0013I At root node, 4 cuts changed objective from -4.8000001e-07 to -4.8000001e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 4 row cuts average 2.0 elements, 0 column cuts (4 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 116.9459314633578, took 8 iterations and 0 nodes (513.87 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 4 cuts of which 4 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 116.946. Best solution: 1.169459e+02 (0 nodes, 518.72 seconds) Best possible: 1.169459e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- o7_2.gms(509) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job o7_2.gms Stop 09/08/12 20:10:24 elapsed 0:08:38.867 @04 1347127824 ----------------------------- Sa 8. Sep 20:10:24 CEST 2012 ----------------------------- =ready= Linux opt220 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/o7_ar2_1.gms =========== ----------------------------- Sa 8. Sep 20:01:47 CEST 2012 ----------------------------- @03 1347127307 --- Job o7_ar2_1.gms Start 09/08/12 20:01:47 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- o7_ar2_1.gms(669) 2 Mb --- Starting execution: elapsed 0:00:00.008 --- o7_ar2_1.gms(664) 3 Mb --- Generating MINLP model m --- o7_ar2_1.gms(669) 5 Mb --- 270 rows 113 columns 1,063 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- o7_ar2_1.gms(669) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.12e+00 1.46e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.7327904e+02 0.00e+00 3.28e+02 1.1 4.73e+01 - 2.25e-03 2.68e-01f 1 2 1.7814744e+02 0.00e+00 3.02e+02 1.1 3.99e+00 2.0 1.00e+00 3.71e-01h 1 3 1.3046396e+02 0.00e+00 9.18e+01 -0.9 3.23e+00 - 8.13e-01 1.00e+00f 1 4 4.8587684e+01 0.00e+00 2.92e+01 -1.0 3.21e+00 - 6.92e-01 1.00e+00f 1 5 1.5595338e+01 0.00e+00 8.74e+00 -1.5 2.82e+00 - 7.00e-01 7.75e-01f 1 6 3.7129817e+00 0.00e+00 2.39e+00 -2.1 1.84e+00 - 7.26e-01 7.34e-01f 1 7 8.3973484e-01 0.00e+00 3.11e-01 -1.8 1.21e+00 - 8.80e-01 8.30e-01f 1 8 2.4458452e-01 0.00e+00 2.06e-01 -5.3 8.46e-02 - 9.64e-01 6.68e-01f 1 9 1.0067436e-02 0.00e+00 1.06e-02 -7.8 2.56e-02 - 9.81e-01 9.55e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.1188181e-04 0.00e+00 1.19e-04 -11.0 1.17e-03 - 9.89e-01 9.89e-01h 1 11 1.7510493e-08 0.00e+00 2.40e-08 -11.0 9.26e-04 - 1.00e+00 1.00e+00h 1 12 -7.0414672e-10 8.27e-18 8.46e-02 -11.0 5.12e+00 - 9.46e-01 8.25e-01h 1 13 -3.7847563e-09 0.00e+00 5.88e-01 -10.8 1.44e+02 - 1.26e-01 8.91e-01h 1 14 -4.1368059e-09 0.00e+00 4.30e-01 -10.8 1.62e+02 - 6.14e-01 1.00e+00h 1 15 -4.1454079e-09 0.00e+00 1.28e-01 -10.8 4.17e+02 - 6.04e-01 1.00e+00h 1 16 -4.1459040e-09 0.00e+00 5.49e-02 -10.8 1.04e+03 - 5.62e-01 1.00e+00h 1 17 -4.1459154e-09 0.00e+00 2.07e-02 -10.8 2.33e+03 - 6.21e-01 1.00e+00h 1 18 -4.1459199e-09 0.00e+00 8.86e-03 -10.8 5.78e+03 - 5.73e-01 1.00e+00h 1 19 -4.1459209e-09 0.00e+00 3.02e-03 -10.8 1.17e+04 - 6.60e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.1459191e-09 0.00e+00 1.04e-03 -10.8 2.40e+04 - 6.56e-01 1.00e+00h 1 21 -4.4000350e-09 0.00e+00 3.63e-03 -11.0 1.88e+04 - 9.43e-01 1.00e+00h 1 22 -4.3999420e-09 0.00e+00 4.33e-16 -11.0 3.75e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 22 (scaled) (unscaled) Objective...............: -4.3999419701564073e-09 -4.3999419701564073e-09 Dual infeasibility......: 4.3293976485213072e-16 4.3293976485213072e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.6467711064181812e-11 1.6467711064181812e-11 Overall NLP error.......: 1.6467711064181812e-11 1.6467711064181812e-11 Number of objective function evaluations = 23 Number of objective gradient evaluations = 23 Number of equality constraint evaluations = 23 Number of inequality constraint evaluations = 23 Number of equality constraint Jacobian evaluations = 23 Number of inequality constraint Jacobian evaluations = 23 Number of Lagrangian Hessian evaluations = 22 Total CPU secs in IPOPT (w/o function evaluations) = 0.031 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4.399942e-09 22 0.032995 build initial OA NLP0014I 2 OPT 140.41196 26 0.014998 OA decomposition OA0003I New best feasible of 140.41196 found after 40.289875 sec and OA0008I OA converged in 52.123076 seconds found solution of value 140.41196 (lower bound 1e+50 ). OA0010I Performed 1 iterations, explored 285291 branch-and-bound nodes in total Cbc0012I Integer solution of 140.41196 found by nonlinear programm after 3 iterations and 0 nodes (52.12 seconds) Cbc0031I 3 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -4.8e-07 to -4.8e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 3 row cuts average 2.0 elements, 0 column cuts (3 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 140.4119582966606, took 3 iterations and 0 nodes (52.12 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 3 cuts of which 3 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 140.412. Best solution: 1.404120e+02 (0 nodes, 52.473 seconds) Best possible: 1.404120e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- o7_ar2_1.gms(669) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job o7_ar2_1.gms Stop 09/08/12 20:02:39 elapsed 0:00:52.603 @04 1347127359 ----------------------------- Sa 8. Sep 20:02:39 CEST 2012 ----------------------------- =ready= Linux opt225 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/o7_ar25_1.gms =========== ----------------------------- Sa 8. Sep 20:01:47 CEST 2012 ----------------------------- @03 1347127307 --- Job o7_ar25_1.gms Start 09/08/12 20:01:47 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- o7_ar25_1.gms(669) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- o7_ar25_1.gms(664) 3 Mb --- Generating MINLP model m --- o7_ar25_1.gms(669) 5 Mb --- 270 rows 113 columns 1,063 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- o7_ar25_1.gms(669) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 5.14e+00 1.38e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.0009712e+02 1.08e-01 3.84e+02 1.1 4.51e+01 - 2.44e-03 3.08e-01f 1 2 2.1372132e+02 0.00e+00 4.63e+02 0.3 4.63e+00 2.0 7.29e-01 1.00e+00h 1 3 1.0402304e+02 0.00e+00 3.33e+02 -0.9 1.57e+01 - 7.50e-01 2.81e-01f 1 4 3.1260157e+01 0.00e+00 9.20e+01 -0.6 5.67e+00 - 8.31e-01 7.23e-01f 1 5 8.2236598e+00 0.00e+00 2.82e+01 -1.9 3.09e+00 - 7.48e-01 6.94e-01f 1 6 1.6013046e+00 0.00e+00 7.85e+00 -2.6 8.21e-01 - 9.10e-01 7.22e-01f 1 7 4.4379533e-01 0.00e+00 3.08e+00 -3.7 4.47e-01 - 8.81e-01 6.13e-01f 1 8 9.7584072e-02 0.00e+00 9.31e-01 -5.2 1.35e-01 - 9.78e-01 7.12e-01f 1 9 5.1551578e-03 0.00e+00 5.45e-02 -7.8 1.47e-02 - 9.89e-01 9.42e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.6894398e-05 0.00e+00 6.06e-04 -11.0 8.95e-04 - 9.90e-01 9.89e-01h 1 11 3.4713196e-08 0.00e+00 4.10e-07 -11.0 7.82e-02 - 9.97e-01 9.99e-01h 1 12 -1.0930234e-09 0.00e+00 1.19e-01 -11.0 3.06e+01 - 4.36e-01 9.11e-01h 1 13 -3.4369062e-09 0.00e+00 6.44e-01 -10.5 1.79e+02 - 2.47e-01 1.00e+00h 1 14 -3.4178207e-09 0.00e+00 2.31e-01 -10.5 2.38e+02 - 6.86e-01 1.00e+00h 1 15 -3.4229777e-09 0.00e+00 9.16e-02 -10.5 7.44e+02 - 5.06e-01 1.00e+00h 1 16 -3.4228536e-09 0.00e+00 3.02e-02 -10.5 1.48e+03 - 6.66e-01 1.00e+00h 1 17 -3.4228524e-09 0.00e+00 1.46e-02 -10.5 4.24e+03 - 5.18e-01 1.00e+00h 1 18 -3.4228529e-09 0.00e+00 4.44e-03 -10.5 8.04e+03 - 6.95e-01 1.00e+00h 1 19 -3.4228517e-09 0.00e+00 1.90e-03 -10.5 2.01e+04 - 5.73e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.4022664e-09 0.00e+00 7.75e-03 -11.0 7.95e+03 - 9.65e-01 1.00e+00h 1 21 -4.3998839e-09 0.00e+00 5.56e-03 -11.0 4.79e+04 - 7.17e-01 1.00e+00h 1 22 -4.3999419e-09 0.00e+00 4.44e-16 -11.0 1.23e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 22 (scaled) (unscaled) Objective...............: -4.3999419215583536e-09 -4.3999419215583536e-09 Dual infeasibility......: 4.4408920985006262e-16 4.4408920985006262e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.1407274707074001e-11 1.1407274707074001e-11 Overall NLP error.......: 1.1407274707074001e-11 1.1407274707074001e-11 Number of objective function evaluations = 23 Number of objective gradient evaluations = 23 Number of equality constraint evaluations = 23 Number of inequality constraint evaluations = 23 Number of equality constraint Jacobian evaluations = 23 Number of inequality constraint Jacobian evaluations = 23 Number of Lagrangian Hessian evaluations = 22 Total CPU secs in IPOPT (w/o function evaluations) = 0.034 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4.3999419e-09 22 0.036994 build initial OA NLP0014I 2 INFEAS 0.043188098 62 0.039993 OA decomposition OA0012I After 131.60199.1f seconds, 2 iterations upper bound 1e+500g, lower bound 138.630460g NLP0014I 3 OPT 140.73269 26 0.012998 OA decomposition OA0003I New best feasible of 140.73269 found after 131.61499 sec and NLP0014I 4 OPT 140.41196 27 0.015997 OA decomposition OA0003I New best feasible of 140.41196 found after 165.48684 sec and NLP0014I 5 INFEAS 0.043526039 53 0.035994 OA decomposition OA0008I OA converged in 237.14795 seconds found solution of value 140.41196 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 1207210 branch-and-bound nodes in total Cbc0012I Integer solution of 140.41196 found by nonlinear programm after 9 iterations and 0 nodes (237.15 seconds) Cbc0031I 6 added rows had average density of 2 Cbc0013I At root node, 6 cuts changed objective from -4.8e-07 to -4.8e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 11 row cuts average 2.0 elements, 0 column cuts (6 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 140.4119582540166, took 9 iterations and 0 nodes (237.15 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 11 cuts of which 6 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 140.412. Best solution: 1.404120e+02 (0 nodes, 238.892 seconds) Best possible: 1.404120e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- o7_ar25_1.gms(669) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job o7_ar25_1.gms Stop 09/08/12 20:05:46 elapsed 0:03:59.039 @04 1347127546 ----------------------------- Sa 8. Sep 20:05:46 CEST 2012 ----------------------------- =ready= Linux opt226 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/o7_ar3_1.gms =========== ----------------------------- Sa 8. Sep 20:02:03 CEST 2012 ----------------------------- @03 1347127323 --- Job o7_ar3_1.gms Start 09/08/12 20:02:03 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- o7_ar3_1.gms(669) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- o7_ar3_1.gms(664) 3 Mb --- Generating MINLP model m --- o7_ar3_1.gms(669) 5 Mb --- 270 rows 113 columns 1,063 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- o7_ar3_1.gms(669) 3 Mb --- Executing BONMIN: elapsed 0:00:00.014 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 6.03e+00 1.22e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.1631779e+02 3.60e-01 4.20e+02 1.1 4.35e+01 - 2.63e-03 3.32e-01f 1 2 2.2059741e+02 8.16e-02 2.95e+02 0.4 4.93e+00 2.0 7.04e-01 2.97e-01h 1 3 1.0231503e+02 1.82e-01 2.05e+02 -1.0 1.46e+01 - 8.03e-01 3.20e-01f 1 4 2.3139948e+01 8.45e-02 4.24e+01 -0.8 5.92e+00 - 6.64e-01 7.93e-01f 1 5 5.2220959e+00 0.00e+00 1.21e+01 -1.8 2.78e+00 - 7.47e-01 7.14e-01f 1 6 7.4678323e-01 0.00e+00 3.15e+00 -3.7 6.57e-01 - 9.21e-01 7.42e-01f 1 7 1.5048466e-01 0.00e+00 8.90e-01 -5.1 1.13e-01 - 9.54e-01 7.18e-01h 1 8 1.4729464e-02 0.00e+00 9.92e-02 -7.0 2.35e-02 - 9.85e-01 8.89e-01h 1 9 2.2469045e-04 5.22e-10 1.57e-03 -11.0 2.34e-03 - 9.89e-01 9.84e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.6191017e-07 0.00e+00 2.57e-06 -11.0 1.94e-03 - 9.98e-01 9.98e-01h 1 11 3.1674440e-10 5.23e-13 2.75e-03 -11.0 1.12e+00 - 9.18e-01 9.87e-01h 1 12 -3.8492396e-09 0.00e+00 5.50e-01 -11.0 1.35e+01 - 3.73e-01 8.72e-01h 1 13 -2.8948353e-09 0.00e+00 2.12e-01 -10.3 9.57e+01 - 7.05e-01 1.00e+00h 1 14 -2.9126418e-09 0.00e+00 5.96e-02 -10.3 3.23e+02 - 4.39e-01 1.00e+00h 1 15 -2.9121015e-09 0.00e+00 2.50e-02 -10.3 5.59e+02 - 5.86e-01 1.00e+00h 1 16 -2.9121014e-09 0.00e+00 9.35e-03 -10.3 1.33e+03 - 6.26e-01 1.00e+00h 1 17 -2.9121049e-09 0.00e+00 4.15e-03 -10.3 3.43e+03 - 5.56e-01 1.00e+00h 1 18 -2.9120995e-09 0.00e+00 1.41e-03 -10.3 7.15e+03 - 6.59e-01 1.00e+00h 1 19 -2.9120968e-09 0.00e+00 5.50e-04 -10.3 1.69e+04 - 6.11e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.9121038e-09 0.00e+00 8.85e-05 -10.3 2.68e+04 - 8.39e-01 1.00e+00h 1 21 -4.4063672e-09 0.00e+00 6.08e-16 -11.0 7.84e+03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: -4.4063672444840688e-09 -4.4063672444840688e-09 Dual infeasibility......: 6.0768626039615343e-16 6.0768626039615343e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2786326090089784e-11 1.2786326090089784e-11 Overall NLP error.......: 1.2786326090089784e-11 1.2786326090089784e-11 Number of objective function evaluations = 22 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 22 Number of inequality constraint evaluations = 22 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total CPU secs in IPOPT (w/o function evaluations) = 0.032 Total CPU secs in NLP function evaluations = 0.004 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4.4063672e-09 21 0.035994 build initial OA NLP0014I 2 INFEAS 0.08394006 51 0.034995 OA decomposition OA0012I After 271.0388.1f seconds, 2 iterations upper bound 1e+500g, lower bound 135.676170g NLP0014I 3 INFEAS 0.013475944 54 0.034994 OA decomposition OA0012I After 391.68246.1f seconds, 3 iterations upper bound 1e+500g, lower bound 137.369940g NLP0014I 4 OPT 137.93184 20 0.011998 OA decomposition OA0003I New best feasible of 137.93184 found after 391.69545 sec and OA0008I OA converged in 473.79497 seconds found solution of value 137.93184 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 2691535 branch-and-bound nodes in total Cbc0012I Integer solution of 137.93184 found by nonlinear programm after 8 iterations and 0 nodes (473.79 seconds) Cbc0031I 7 added rows had average density of 2 Cbc0013I At root node, 7 cuts changed objective from -4.8e-07 to -4.8e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 11 row cuts average 2.0 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 137.9318389451172, took 8 iterations and 0 nodes (473.79 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 11 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 137.932. Best solution: 1.379318e+02 (0 nodes, 477.602 seconds) Best possible: 1.379318e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- o7_ar3_1.gms(669) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job o7_ar3_1.gms Stop 09/08/12 20:10:01 elapsed 0:07:57.754 @04 1347127801 ----------------------------- Sa 8. Sep 20:10:01 CEST 2012 ----------------------------- =ready= Linux opt206 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/o7_ar4_1.gms =========== ----------------------------- Sa 8. Sep 20:02:13 CEST 2012 ----------------------------- @03 1347127333 --- Job o7_ar4_1.gms Start 09/08/12 20:02:13 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- o7_ar4_1.gms(669) 2 Mb --- Starting execution: elapsed 0:00:00.030 --- o7_ar4_1.gms(664) 3 Mb --- Generating MINLP model m --- o7_ar4_1.gms(669) 5 Mb --- 270 rows 113 columns 1,063 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- o7_ar4_1.gms(669) 3 Mb --- Executing BONMIN: elapsed 0:00:00.031 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 7.62e+00 9.90e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.3986280e+02 9.33e-01 4.71e+02 1.1 4.17e+01 - 2.95e-03 3.63e-01f 1 2 2.4144197e+02 7.42e-01 4.20e+02 0.5 5.11e+00 2.0 6.04e-01 9.95e-02h 1 3 2.5444149e+02 0.00e+00 1.67e+02 0.0 5.02e+00 1.5 9.69e-01 1.00e+00h 1 4 1.3501035e+02 0.00e+00 1.50e+02 -0.6 4.87e+01 - 5.80e-01 1.05e-01f 1 5 3.8227845e+01 0.00e+00 7.39e+01 -0.9 8.62e+00 - 4.46e-01 5.07e-01f 1 6 1.3775602e+01 0.00e+00 3.42e+01 -1.1 4.87e+00 - 4.29e-01 5.37e-01f 1 7 5.0514086e+00 0.00e+00 1.58e+01 -1.5 1.86e+00 - 7.66e-01 5.40e-01f 1 8 2.3420296e+00 0.00e+00 8.69e+00 -3.4 5.10e-01 - 9.52e-01 4.57e-01f 1 9 4.9611646e-01 0.00e+00 2.47e+00 -4.3 3.08e-01 - 9.65e-01 7.21e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 9.6404850e-02 0.00e+00 5.59e-01 -5.2 6.66e-01 - 9.68e-01 7.81e-01f 1 11 2.5773865e-03 0.00e+00 1.59e-02 -9.0 1.11e-02 - 9.89e-01 9.72e-01h 1 12 2.6454518e-05 0.00e+00 1.63e-04 -11.0 3.17e-03 - 9.90e-01 9.90e-01h 1 13 6.5461577e-09 0.00e+00 5.49e-06 -11.0 3.10e-01 - 9.91e-01 1.00e+00h 1 14 -2.9902338e-09 8.27e-18 4.26e-01 -11.0 3.18e+01 - 3.52e-01 8.64e-01h 1 15 -2.7513935e-09 0.00e+00 5.24e-01 -10.3 2.54e+02 - 2.31e-01 9.20e-01h 1 16 -2.7490620e-09 0.00e+00 2.04e-01 -10.3 3.32e+02 - 6.21e-01 4.91e-01f 2 17 -2.7451634e-09 0.00e+00 9.59e-02 -10.3 8.52e+02 - 5.08e-01 1.00e+00h 1 18 -2.7447950e-09 0.00e+00 3.97e-02 -10.3 1.70e+03 - 6.00e-01 1.00e+00h 1 19 -2.7447999e-09 0.00e+00 1.56e-02 -10.3 4.07e+03 - 6.07e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -2.7448011e-09 0.00e+00 6.01e-03 -10.3 9.31e+03 - 6.15e-01 1.00e+00h 1 21 -2.7447935e-09 0.00e+00 1.85e-03 -10.3 1.88e+04 - 6.91e-01 1.00e+00h 1 22 -2.7448027e-09 0.00e+00 4.88e-04 -10.3 3.14e+04 - 7.37e-01 1.00e+00h 1 23 -4.4082341e-09 0.00e+00 2.73e-15 -11.0 6.26e+03 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 23 (scaled) (unscaled) Objective...............: -4.4082341422606855e-09 -4.4082341422606855e-09 Dual infeasibility......: 2.7275294556601840e-15 2.7275294556601840e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.3596413070556311e-11 1.3596413070556311e-11 Overall NLP error.......: 1.3596413070556311e-11 1.3596413070556311e-11 Number of objective function evaluations = 27 Number of objective gradient evaluations = 24 Number of equality constraint evaluations = 27 Number of inequality constraint evaluations = 27 Number of equality constraint Jacobian evaluations = 24 Number of inequality constraint Jacobian evaluations = 24 Number of Lagrangian Hessian evaluations = 23 Total CPU secs in IPOPT (w/o function evaluations) = 0.015 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4.4082341e-09 23 0.016997 build initial OA NLP0014I 2 INFEAS 0.15609361 57 0.035995 OA decomposition OA0012I After 209.73012.1f seconds, 2 iterations upper bound 1e+500g, lower bound 122.783710g NLP0014I 3 INFEAS 0.1241651 58 0.037994 OA decomposition OA0012I After 348.73998.1f seconds, 3 iterations upper bound 1e+500g, lower bound 125.153890g NLP0014I 4 INFEAS 0.018265351 52 0.034995 OA decomposition OA0012I After 663.7271.1f seconds, 4 iterations upper bound 1e+500g, lower bound 125.326690g NLP0014I 5 INFEAS 0.1560936 56 0.037994 OA decomposition OA0012I After 902.41281.1f seconds, 5 iterations upper bound 1e+500g, lower bound 129.29960g NLP0014I 6 INFEAS 0.26865603 50 0.034994 OA decomposition OA0012I After 1194.2354.1f seconds, 6 iterations upper bound 1e+500g, lower bound 129.690550g NLP0014I 7 INFEAS 0.017294196 50 0.033995 OA decomposition OA0012I After 1503.3155.1f seconds, 7 iterations upper bound 1e+500g, lower bound 130.987650g NLP0014I 8 OPT 131.65314 25 0.012998 OA decomposition OA0003I New best feasible of 131.65314 found after 1503.3295 sec and OA0008I OA converged in 1618.8689 seconds found solution of value 131.65314 (lower bound 1e+50 ). OA0010I Performed 7 iterations, explored 9371200 branch-and-bound nodes in total Cbc0012I Integer solution of 131.65314 found by nonlinear programm after 8 iterations and 0 nodes (1618.87 seconds) Cbc0031I 7 added rows had average density of 2 Cbc0013I At root node, 7 cuts changed objective from -4.8e-07 to -4.8e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 12 row cuts average 2.0 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 131.6531380071023, took 8 iterations and 0 nodes (1618.87 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 12 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 131.653. Best solution: 1.316531e+02 (0 nodes, 1631.85 seconds) Best possible: 1.316531e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- o7_ar4_1.gms(669) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job o7_ar4_1.gms Stop 09/08/12 20:29:25 elapsed 0:27:12.107 @04 1347128965 ----------------------------- Sa 8. Sep 20:29:25 CEST 2012 ----------------------------- =ready= Linux opt220 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/o7_ar5_1.gms =========== ----------------------------- Sa 8. Sep 20:02:39 CEST 2012 ----------------------------- @03 1347127359 --- Job o7_ar5_1.gms Start 09/08/12 20:02:39 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- o7_ar5_1.gms(669) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- o7_ar5_1.gms(664) 3 Mb --- Generating MINLP model m --- o7_ar5_1.gms(669) 5 Mb --- 270 rows 113 columns 1,063 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- o7_ar5_1.gms(669) 3 Mb --- Executing BONMIN: elapsed 0:00:00.007 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1040 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 268 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 266 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.61e+00 1.11e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.5336361e+02 1.41e+00 5.01e+02 1.1 4.08e+01 - 3.22e-03 3.80e-01f 1 2 2.5462684e+02 1.24e+00 4.58e+02 0.7 5.38e+00 2.0 5.08e-01 7.46e-02h 1 3 2.6916190e+02 0.00e+00 1.76e+02 0.4 5.27e+00 1.5 1.00e+00 1.00e+00h 1 4 1.3741916e+02 0.00e+00 1.40e+02 -1.0 2.62e+01 - 7.38e-01 2.05e-01f 1 5 3.9400581e+01 0.00e+00 4.90e+01 -0.9 7.11e+00 - 4.06e-01 6.49e-01f 1 6 1.4869795e+01 0.00e+00 1.90e+01 -1.1 4.36e+00 - 4.42e-01 6.11e-01f 1 7 4.9530820e+00 0.00e+00 7.55e+00 -1.5 2.31e+00 - 7.26e-01 6.04e-01f 1 8 1.7613222e+00 0.00e+00 3.72e+00 -3.2 5.68e-01 - 8.77e-01 5.60e-01f 1 9 3.7498595e-01 0.00e+00 1.18e+00 -4.8 1.90e-01 - 9.59e-01 7.25e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.0376516e-02 0.00e+00 1.45e-01 -6.3 4.29e-02 - 9.84e-01 8.79e-01f 1 11 5.8173230e-04 0.00e+00 2.14e-03 -11.0 4.79e-03 - 9.89e-01 9.85e-01h 1 12 1.2703592e-06 0.00e+00 4.71e-06 -11.0 1.41e-03 - 9.98e-01 9.98e-01h 1 13 7.8117586e-11 0.00e+00 1.98e-04 -11.0 6.35e-01 - 9.75e-01 9.96e-01h 1 14 -3.7781009e-09 0.00e+00 4.47e-01 -11.0 2.70e+01 - 4.51e-01 8.52e-01h 1 15 -4.1407002e-09 0.00e+00 5.06e-01 -10.8 7.28e+01 - 4.42e-01 1.00e+00h 1 16 -4.1507596e-09 0.00e+00 1.47e-01 -10.8 1.29e+02 - 6.49e-01 1.00e+00h 1 17 -4.1500260e-09 0.00e+00 7.19e-02 -10.8 3.67e+02 - 5.31e-01 1.00e+00h 1 18 -4.1500660e-09 0.00e+00 2.57e-02 -10.8 7.76e+02 - 6.41e-01 1.00e+00h 1 19 -4.1500673e-09 0.00e+00 1.18e-02 -10.8 2.11e+03 - 5.39e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.1500667e-09 0.00e+00 4.07e-03 -10.8 4.38e+03 - 6.57e-01 1.00e+00h 1 21 -4.1500716e-09 0.00e+00 1.74e-03 -10.8 1.12e+04 - 5.71e-01 1.00e+00h 1 22 -4.1500666e-09 0.00e+00 4.62e-04 -10.8 1.98e+04 - 7.35e-01 1.00e+00h 1 23 -4.1500599e-09 0.00e+00 1.18e-04 -10.8 3.36e+04 - 7.44e-01 1.00e+00h 1 24 -4.4000330e-09 0.00e+00 5.60e-16 -11.0 1.76e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 24 (scaled) (unscaled) Objective...............: -4.4000329987483073e-09 -4.4000329987483073e-09 Dual infeasibility......: 5.5951873806250190e-16 5.5951873806250190e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2480212760145033e-11 1.2480212760145033e-11 Overall NLP error.......: 1.2480212760145033e-11 1.2480212760145033e-11 Number of objective function evaluations = 25 Number of objective gradient evaluations = 25 Number of equality constraint evaluations = 25 Number of inequality constraint evaluations = 25 Number of equality constraint Jacobian evaluations = 25 Number of inequality constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Total CPU secs in IPOPT (w/o function evaluations) = 0.014 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4.400033e-09 24 0.016998 build initial OA OA0012I After 104.62809.1f seconds, 1 iterations upper bound 1e+500g, lower bound 111.889860g NLP0014I 2 INFEAS 0.035019002 69 0.042993 OA decomposition NLP0014I 3 OPT 116.94585 28 0.014997 OA decomposition OA0003I New best feasible of 116.94585 found after 199.9526 sec and OA0012I After 243.28701.1f seconds, 3 iterations upper bound 116.944680g, lower bound 116.059360g NLP0014I 4 INFEAS 0.058080571 72 0.046993 OA decomposition NLP0014I 5 INFEAS 0.0082589628 75 0.048992 OA decomposition OA0008I OA converged in 330.90969 seconds found solution of value 116.94585 (lower bound 1e+50 ). OA0010I Performed 4 iterations, explored 2012499 branch-and-bound nodes in total Cbc0012I Integer solution of 116.94585 found by nonlinear programm after 9 iterations and 0 nodes (330.91 seconds) Cbc0031I 7 added rows had average density of 2 Cbc0013I At root node, 7 cuts changed objective from -4.8e-07 to -4.8e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 10 row cuts average 2.0 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 116.9458469717838, took 9 iterations and 0 nodes (330.91 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 10 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 116.946. Best solution: 1.169458e+02 (0 nodes, 333.731 seconds) Best possible: 1.169458e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- o7_ar5_1.gms(669) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job o7_ar5_1.gms Stop 09/08/12 20:08:13 elapsed 0:05:33.824 @04 1347127693 ----------------------------- Sa 8. Sep 20:08:13 CEST 2012 ----------------------------- =ready= Linux opt230 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/o7.gms =========== ----------------------------- Sa 8. Sep 20:02:44 CEST 2012 ----------------------------- @03 1347127364 --- Job o7.gms Start 09/08/12 20:02:44 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- o7.gms(509) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- o7.gms(504) 3 Mb --- Generating MINLP model m --- o7.gms(509) 5 Mb --- 212 rows 115 columns 877 non-zeroes --- 71 nl-code 14 nl-non-zeroes --- 42 discrete-columns --- o7.gms(509) 3 Mb --- Executing BONMIN: elapsed 0:00:00.012 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 842 Number of nonzeros in Lagrangian Hessian.............: 14 Total number of variables............................: 112 variables with only lower bounds: 0 variables with lower and upper bounds: 56 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 211 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 211 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 7.62e+00 1.04e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.5851257e+02 1.37e-01 2.82e+02 0.5 1.51e+01 - 2.02e-02 1.00e+00f 1 2 1.5801748e+02 0.00e+00 2.36e+02 -0.6 2.36e+00 2.0 5.96e-01 1.00e+00h 1 3 6.6567778e+01 0.00e+00 1.95e+02 -0.4 1.92e+01 - 4.60e-01 1.74e-01f 1 4 3.3708434e+01 0.00e+00 1.26e+02 -1.8 3.95e+00 - 8.23e-01 3.54e-01f 1 5 5.2390227e+00 0.00e+00 2.34e+01 -2.6 1.93e+00 - 8.36e-01 8.15e-01f 1 6 2.2435911e-01 0.00e+00 1.06e+00 -4.9 6.01e-01 - 9.21e-01 9.55e-01f 1 7 2.8225006e-03 0.00e+00 1.37e-02 -10.0 3.14e-02 - 9.87e-01 9.87e-01f 1 8 2.8262180e-05 0.00e+00 1.37e-04 -11.0 3.99e-04 - 9.90e-01 9.90e-01h 1 9 1.4726972e-09 0.00e+00 2.93e-08 -11.0 1.38e-04 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -2.9638475e-09 8.27e-18 1.42e-01 -11.0 9.22e-01 - 9.41e-01 7.43e-01h 1 11 -4.2580057e-09 0.00e+00 8.68e-01 -10.9 2.04e+01 - 2.84e-01 1.00e+00h 1 12 -4.2754297e-09 0.00e+00 2.55e-01 -10.9 2.85e+01 - 6.32e-01 1.00e+00h 1 13 -4.2765823e-09 0.00e+00 1.03e-01 -10.9 7.73e+01 - 5.78e-01 1.00e+00h 1 14 -4.2767067e-09 0.00e+00 4.19e-02 -10.9 1.83e+02 - 5.88e-01 1.00e+00h 1 15 -4.2767019e-09 0.00e+00 1.73e-02 -10.9 4.41e+02 - 5.87e-01 1.00e+00h 1 16 -4.2766988e-09 0.00e+00 7.10e-03 -10.9 1.06e+03 - 5.90e-01 1.00e+00h 1 17 -4.2766985e-09 0.00e+00 2.88e-03 -10.9 2.51e+03 - 5.95e-01 1.00e+00h 1 18 -4.2767016e-09 0.00e+00 1.13e-03 -10.9 5.83e+03 - 6.08e-01 1.00e+00h 1 19 -4.2766986e-09 0.00e+00 4.03e-04 -10.9 1.28e+04 - 6.42e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.3999805e-09 0.00e+00 6.86e-03 -11.0 1.86e+04 - 7.77e-01 1.00e+00h 1 21 -4.3999772e-09 0.00e+00 7.44e-04 -11.0 3.44e+04 - 8.93e-01 1.00e+00h 1 22 -4.3999696e-09 0.00e+00 8.90e-16 -11.0 2.24e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 22 (scaled) (unscaled) Objective...............: -4.3999695507394969e-09 -4.3999695507394969e-09 Dual infeasibility......: 8.8989793348750446e-16 8.8989793348750446e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2952111778710764e-11 1.2952111778710764e-11 Overall NLP error.......: 1.2952111778710764e-11 1.2952111778710764e-11 Number of objective function evaluations = 23 Number of objective gradient evaluations = 23 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 23 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 23 Number of Lagrangian Hessian evaluations = 22 Total CPU secs in IPOPT (w/o function evaluations) = 0.025 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -4.3999696e-09 22 0.027995 build initial OA NLP0014I 2 INFEAS 0.26694913 38 0.022996 OA decomposition OA0012I After 127.21966.1f seconds, 2 iterations upper bound 1e+500g, lower bound 117.160570g NLP0014I 3 INFEAS 0.26694913 37 0.021997 OA decomposition OA0012I After 380.26319.1f seconds, 3 iterations upper bound 1e+500g, lower bound 121.495650g NLP0014I 4 INFEAS 0.11552565 36 0.022997 OA decomposition OA0012I After 880.54614.1f seconds, 4 iterations upper bound 1e+500g, lower bound 125.078080g NLP0014I 5 INFEAS 0.06842079 33 0.018997 OA decomposition OA0012I After 1157.623.1f seconds, 5 iterations upper bound 1e+500g, lower bound 128.050570g NLP0014I 6 INFEAS 0.18268124 31 0.019997 OA decomposition OA0012I After 1441.7668.1f seconds, 6 iterations upper bound 1e+500g, lower bound 129.359570g NLP0014I 7 INFEAS 0.020297735 31 0.019997 OA decomposition OA0012I After 1673.3846.1f seconds, 7 iterations upper bound 1e+500g, lower bound 129.873850g NLP0014I 8 INFEAS 0.12417113 36 0.022997 OA decomposition OA0012I After 2065.674.1f seconds, 8 iterations upper bound 1e+500g, lower bound 131.012960g NLP0014I 9 OPT 131.65314 22 0.009998 OA decomposition OA0003I New best feasible of 131.65314 found after 2065.685 sec and OA0008I OA converged in 2443.2916 seconds found solution of value 131.65314 (lower bound 1e+50 ). OA0010I Performed 8 iterations, explored 13613743 branch-and-bound nodes in total Cbc0012I Integer solution of 131.65314 found by nonlinear programm after 13 iterations and 0 nodes (2443.29 seconds) Cbc0031I 7 added rows had average density of 2 Cbc0013I At root node, 7 cuts changed objective from -4.8000001e-07 to -4.8e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 14 row cuts average 2.0 elements, 0 column cuts (7 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 131.6531380155528, took 13 iterations and 0 nodes (2443.29 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 14 cuts of which 7 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 131.653. Best solution: 1.316531e+02 (0 nodes, 2462.63 seconds) Best possible: 1.316531e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- o7.gms(509) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job o7.gms Stop 09/08/12 20:43:47 elapsed 0:41:02.856 @04 1347129827 ----------------------------- Sa 8. Sep 20:43:47 CEST 2012 ----------------------------- =ready= Linux opt216 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/o8_ar4_1.gms =========== ----------------------------- Sa 8. Sep 20:02:50 CEST 2012 ----------------------------- @03 1347127370 --- Job o8_ar4_1.gms Start 09/08/12 20:02:50 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- o8_ar4_1.gms(852) 2 Mb --- Starting execution: elapsed 0:00:00.011 --- o8_ar4_1.gms(847) 3 Mb --- Generating MINLP model m --- o8_ar4_1.gms(852) 5 Mb --- 348 rows 145 columns 1,397 non-zeroes --- 81 nl-code 16 nl-non-zeroes --- 56 discrete-columns --- o8_ar4_1.gms(852) 3 Mb --- Executing BONMIN: elapsed 0:00:00.015 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1364 Number of nonzeros in Lagrangian Hessian.............: 16 Total number of variables............................: 144 variables with only lower bounds: 0 variables with lower and upper bounds: 72 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 346 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 344 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.67e+00 9.40e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.5786147e+02 9.19e-01 6.52e+02 1.2 3.30e+01 - 2.91e-03 4.74e-01f 1 2 5.6319947e+02 5.17e-01 5.27e+02 0.1 6.67e+00 2.0 6.74e-01 1.91e-01h 1 3 5.6783332e+02 1.98e-01 4.05e+02 -0.8 5.76e+00 1.5 8.23e-01 2.36e-01h 1 4 2.5315056e+02 2.04e-01 3.85e+02 -0.2 1.33e+02 - 5.43e-01 5.18e-02f 1 5 7.1269142e+01 2.43e-01 2.30e+02 -0.6 1.20e+01 - 6.15e-01 4.03e-01f 1 6 1.6978110e+01 2.21e-01 1.02e+02 -1.4 4.80e+00 - 7.38e-01 5.55e-01f 1 7 2.1748150e+00 5.90e-02 3.09e+01 -2.8 1.42e+00 - 8.56e-01 6.99e-01f 1 8 2.1323513e-01 0.00e+00 3.78e+00 -2.6 3.92e+00 - 8.12e-01 8.78e-01h 1 9 1.0725078e-02 0.00e+00 2.74e-01 -6.6 3.88e-02 - 9.75e-01 9.28e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.3480707e-04 0.00e+00 3.67e-03 -11.0 2.76e-03 - 9.89e-01 9.87e-01h 1 11 4.9581356e-07 0.00e+00 1.37e-05 -11.0 3.17e-04 - 9.96e-01 9.96e-01h 1 12 -1.9211666e-09 1.27e-12 5.54e-04 -11.0 8.54e-02 - 9.96e-01 9.88e-01h 1 13 -7.2567368e-09 4.97e-14 7.05e-01 -11.0 2.31e+01 - 6.11e-01 9.44e-01h 1 14 -6.4221316e-09 0.00e+00 4.67e-01 -10.5 1.73e+02 - 1.84e-01 1.00e+00h 1 15 -6.4337135e-09 0.00e+00 5.36e-02 -10.5 4.82e-03 1.0 1.00e+00 1.00e+00h 1 16 -6.4343452e-09 0.00e+00 8.44e-04 -10.5 2.10e+02 - 7.88e-01 1.00e+00h 1 17 -7.6008531e-09 0.00e+00 8.60e-03 -11.0 3.33e+02 - 9.54e-01 1.00e+00h 1 18 -7.5999599e-09 0.00e+00 9.15e-03 -11.0 6.78e+03 - 2.53e-01 1.00e+00h 1 19 -7.5999766e-09 0.00e+00 3.80e-03 -11.0 8.26e+03 - 5.82e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.5999764e-09 0.00e+00 7.39e-04 -11.0 1.60e+04 - 8.05e-01 1.00e+00h 1 21 -7.5999683e-09 0.00e+00 3.06e-04 -11.0 3.73e+04 - 5.86e-01 1.00e+00h 1 22 -7.5999726e-09 0.00e+00 8.88e-16 -11.0 2.67e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 22 (scaled) (unscaled) Objective...............: -7.5999725682132306e-09 -7.5999725682132306e-09 Dual infeasibility......: 8.8817841970012523e-16 8.8817841970012523e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.4023530033002375e-11 1.4023530033002375e-11 Overall NLP error.......: 1.4023530033002375e-11 1.4023530033002375e-11 Number of objective function evaluations = 23 Number of objective gradient evaluations = 23 Number of equality constraint evaluations = 23 Number of inequality constraint evaluations = 23 Number of equality constraint Jacobian evaluations = 23 Number of inequality constraint Jacobian evaluations = 23 Number of Lagrangian Hessian evaluations = 22 Total CPU secs in IPOPT (w/o function evaluations) = 0.034 Total CPU secs in NLP function evaluations = 0.003 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7.5999726e-09 22 0.036994 build initial OA OA0012I After 3578.9499.1f seconds, 1 iterations upper bound 1e+500g, lower bound 231.359670g NLP0014I 2 OPT 243.07075 25 0.016997 OA decomposition OA0003I New best feasible of 243.07075 found after 3578.9679 sec and OA0012I After 4059.4609.1f seconds, 2 iterations upper bound 243.068320g, lower bound 236.403980g NLP0014I 3 INFEAS 0.26470587 56 0.042993 OA decomposition OA0012I After 4638.9218.1f seconds, 3 iterations upper bound 243.068320g, lower bound 240.58180g NLP0014I 4 INFEAS 0.42529411 56 0.042993 OA decomposition OA0008I OA converged in 5389.3697 seconds found solution of value 243.07075 (lower bound 1e+50 ). OA0010I Performed 3 iterations, explored 22001263 branch-and-bound nodes in total Cbc0012I Integer solution of 243.07075 found by nonlinear programm after 9 iterations and 0 nodes (5389.37 seconds) Cbc0031I 8 added rows had average density of 2 Cbc0013I At root node, 8 cuts changed objective from -8.2e-07 to -8.2e-07 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 12 row cuts average 2.0 elements, 0 column cuts (8 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 243.0707483571312, took 9 iterations and 0 nodes (5389.37 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 12 cuts of which 8 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 243.071. Best solution: 2.430707e+02 (0 nodes, 5426.07 seconds) Best possible: 2.430707e+02 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- o8_ar4_1.gms(852) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job o8_ar4_1.gms Stop 09/08/12 21:33:17 elapsed 1:30:26.387 @04 1347132797 ----------------------------- Sa 8. Sep 21:33:17 CEST 2012 ----------------------------- =ready= Linux opt229 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/o9_ar4_1.gms =========== ----------------------------- Sa 8. Sep 20:02:50 CEST 2012 ----------------------------- @03 1347127370 --- Job o9_ar4_1.gms Start 09/08/12 20:02:50 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- o9_ar4_1.gms(1057) 2 Mb --- Starting execution: elapsed 0:00:00.047 --- o9_ar4_1.gms(1052) 3 Mb --- Generating MINLP model m --- o9_ar4_1.gms(1057) 5 Mb --- 436 rows 181 columns 1,765 non-zeroes --- 91 nl-code 18 nl-non-zeroes --- 72 discrete-columns --- o9_ar4_1.gms(1057) 3 Mb --- Executing BONMIN: elapsed 0:00:00.051 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 2 Number of nonzeros in inequality constraint Jacobian.: 1732 Number of nonzeros in Lagrangian Hessian.............: 18 Total number of variables............................: 180 variables with only lower bounds: 0 variables with lower and upper bounds: 90 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 434 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 432 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 8.85e+00 1.06e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.9897022e+02 9.31e-01 7.02e+02 1.2 3.17e+01 - 2.77e-03 4.96e-01f 1 2 6.0632776e+02 3.35e-01 5.09e+02 0.0 7.33e+00 2.0 7.04e-01 2.75e-01h 1 3 2.4233320e+02 3.47e-01 4.10e+02 -0.7 3.66e+01 - 7.76e-01 2.02e-01f 1 4 6.9266447e+01 3.69e-01 1.60e+02 -0.7 8.19e+00 - 7.62e-01 6.08e-01f 1 5 1.4781137e+01 3.08e-01 4.14e+01 -0.9 7.48e+00 - 2.55e-01 7.41e-01f 1 6 1.8671554e+00 5.76e-02 1.26e+01 -3.0 1.02e+00 - 8.85e-01 6.97e-01f 1 7 1.4249143e-01 0.00e+00 1.88e+00 -4.8 1.71e-01 - 9.43e-01 8.51e-01h 1 8 3.7239726e-03 8.45e-08 6.38e-02 -8.1 1.97e-02 - 9.82e-01 9.66e-01h 1 9 3.9147221e-05 1.15e-09 6.82e-04 -11.0 6.61e-04 - 9.90e-01 9.89e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.5417301e-08 0.00e+00 1.62e-06 -11.0 6.36e-04 - 9.99e-01 9.99e-01h 1 11 2.0124433e-09 1.21e-12 2.93e-01 -11.0 8.96e-01 - 9.68e-01 7.74e-01h 1 12 -6.0869701e-09 0.00e+00 3.84e-01 -10.4 9.40e+01 - 3.76e-01 1.00e+00h 1 13 -6.0195437e-09 0.00e+00 3.65e-01 -10.4 1.45e+02 - 6.66e-01 1.00e+00h 1 14 -6.0357557e-09 0.00e+00 9.71e-02 -10.4 4.26e+02 - 5.21e-01 1.00e+00h 1 15 -6.0355766e-09 0.00e+00 3.72e-02 -10.4 8.77e+02 - 6.25e-01 1.00e+00h 1 16 -6.0355745e-09 0.00e+00 1.63e-02 -10.4 2.29e+03 - 5.60e-01 1.00e+00h 1 17 -6.0355805e-09 0.00e+00 5.93e-03 -10.4 4.92e+03 - 6.37e-01 1.00e+00h 1 18 -6.0355686e-09 0.00e+00 2.37e-03 -10.4 1.18e+04 - 6.01e-01 1.00e+00h 1 19 -7.6014846e-09 0.00e+00 2.39e-02 -11.0 5.98e+03 - 9.04e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -7.5999121e-09 0.00e+00 9.63e-03 -11.0 3.37e+04 - 6.97e-01 1.00e+00h 1 21 -7.5999803e-09 0.00e+00 7.19e-16 -11.0 3.03e+04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: -7.5999803352445948e-09 -7.5999803352445948e-09 Dual infeasibility......: 7.1899455374434588e-16 7.1899455374434588e-16 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.4709230750771627e-11 1.4709230750771627e-11 Overall NLP error.......: 1.4709230750771627e-11 1.4709230750771627e-11 Number of objective function evaluations = 22 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 22 Number of inequality constraint evaluations = 22 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total CPU secs in IPOPT (w/o function evaluations) = 0.040 Total CPU secs in NLP function evaluations = 0.006 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT -7.5999803e-09 21 0.045993 build initial OA OA0012I After 1691.8018.1f seconds, 1 iterations upper bound 1e+500g, lower bound 217.929140g NLP0014I 2 INFEAS 0.029663592 71 0.061991 OA decomposition OA0012I After 3241.2303.1f seconds, 2 iterations upper bound 1e+500g, lower bound 226.968050g NLP0014I 3 INFEAS 0.49999999 55 0.048993 OA decomposition OA0012I After 6454.4648.1f seconds, 3 iterations upper bound 1e+500g, lower bound 228.445940g NLP0014I 4 INFEAS 0.091715126 53 0.045993 OA decomposition OA0012I After 7200.4024.1f seconds, 4 iterations upper bound 1e+500g, lower bound 228.445940g NLP0014I 5 INFEAS 0.017103651 66 0.058991 OA decomposition OA0009I OA interupted after 7200.4614 seconds found solution of value 1e+50 (lower bound 228.44594 ). OA0010I Performed 4 iterations, explored 22787421 branch-and-bound nodes in total Cbc0031I 9 added rows had average density of 2 Cbc0013I At root node, 9 cuts changed objective from -8.2000001e-07 to -8.2000001e-07 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 2.0 elements, 0 column cuts (9 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible -8.2000001e-07), took 11 iterations and 0 nodes (7200.46 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 9 cuts of which 9 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: -8.200000e-07 (only reliable for convex models) --- Restarting execution --- o9_ar4_1.gms(1057) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job o9_ar4_1.gms Stop 09/08/12 22:03:36 elapsed 2:00:45.847 @04 1347134616 ----------------------------- Sa 8. Sep 22:03:36 CEST 2012 ----------------------------- =ready= Linux opt212 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/tls12.gms =========== ----------------------------- Sa 8. Sep 20:04:13 CEST 2012 ----------------------------- @03 1347127453 --- Job tls12.gms Start 09/08/12 20:04:13 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- tls12.gms(1941) 2 Mb --- Starting execution: elapsed 0:00:00.026 --- tls12.gms(1936) 3 Mb --- Generating MINLP model m --- tls12.gms(1941) 6 Mb --- 385 rows 813 columns 7,205 non-zeroes --- 601 nl-code 288 nl-non-zeroes --- 668 discrete-columns --- tls12.gms(1941) 3 Mb --- Executing BONMIN: elapsed 0:00:00.035 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 800 Number of nonzeros in inequality constraint Jacobian.: 6132 Number of nonzeros in Lagrangian Hessian.............: 300 Total number of variables............................: 812 variables with only lower bounds: 144 variables with lower and upper bounds: 668 variables with only upper bounds: 0 Total number of equality constraints.................: 156 Total number of inequality constraints...............: 228 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 228 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 3.9728000e+01 1.60e+03 2.09e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.9362137e+01 1.58e+03 4.54e+00 0.2 8.64e+01 - 2.59e-02 9.44e-03f 1 2 3.8188324e+01 1.54e+03 3.09e+00 0.2 8.11e+01 - 2.28e-02 2.46e-02f 1 3 3.7912075e+01 1.27e+03 3.49e+01 0.2 7.77e+01 - 2.07e-02 1.66e-01f 1 4 3.6843876e+01 1.22e+03 2.23e+01 0.1 3.69e+01 0.0 1.27e-01 6.56e-02f 1 5 3.5789992e+01 1.04e+03 4.53e+01 0.1 5.85e+01 -0.5 3.58e-01 1.47e-01f 1 6 2.6796721e+01 4.74e+02 5.61e+01 -0.2 4.96e+01 -1.0 1.99e-01 5.43e-01f 1 7 2.1842589e+01 2.15e+02 6.13e+01 -0.5 2.27e+01 - 4.59e-01 5.44e-01f 1 8 2.0691203e+01 1.31e+02 6.70e+01 -0.6 1.21e+01 - 5.32e-01 3.85e-01f 1 9 1.4756811e+01 1.78e-01 8.85e+01 -1.3 7.36e+00 - 5.53e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.0893734e+01 2.23e-01 5.63e+01 -2.5 4.50e+00 - 8.00e-01 8.72e-01f 1 11 7.2779968e+00 5.73e-01 8.86e+00 -1.9 8.33e+00 - 8.66e-01 1.00e+00f 1 12 5.2550952e+00 5.13e-01 2.48e+00 -2.1 1.04e+01 - 8.59e-01 1.00e+00h 1 13 4.7428047e+00 2.50e-01 1.97e+00 -2.3 8.60e+00 - 8.92e-01 4.97e-01h 1 14 3.9544938e+00 2.47e-01 8.04e-01 -2.9 9.43e+00 - 5.31e-01 4.84e-01h 1 15 3.4531235e+00 1.97e-01 4.56e-01 -2.9 6.88e+00 - 7.74e-01 5.08e-01h 1 16 2.5963632e+00 3.60e-01 1.99e-01 -3.5 9.22e+00 - 6.47e-01 9.73e-01h 1 17 2.4080412e+00 1.36e-01 1.49e-01 -4.2 5.81e+00 - 7.05e-01 9.23e-01h 1 18 2.3291629e+00 3.75e-02 1.32e-01 -5.0 3.09e+00 - 6.56e-01 1.00e+00h 1 19 2.3148735e+00 8.75e-03 2.63e-02 -6.3 1.26e+00 - 8.62e-01 9.52e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 2.3120721e+00 1.31e-03 2.74e-03 -8.7 4.87e-01 - 9.38e-01 9.70e-01h 1 21 2.3118735e+00 2.02e-05 3.61e-05 -11.0 6.59e-02 - 9.93e-01 9.96e-01h 1 22 2.3118715e+00 4.39e-07 8.72e-05 -11.0 8.42e-04 - 1.00e+00 9.78e-01h 1 23 2.3118715e+00 1.06e-08 6.26e-02 -10.7 1.78e-05 - 7.88e-01 9.70e-01h 1 24 2.3118715e+00 2.94e-09 1.15e-01 -11.0 9.05e-07 - 9.08e-01 6.43e-01h 1 25 2.3118715e+00 7.11e-15 9.99e-15 -11.0 3.21e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 25 (scaled) (unscaled) Objective...............: 2.3118714529761117e+00 2.3118714529761117e+00 Dual infeasibility......: 9.9911779092256300e-15 9.9911779092256300e-15 Constraint violation....: 1.3322676295501878e-15 7.1054273576010019e-15 Complementarity.........: 1.7205347582199662e-11 1.7205347582199662e-11 Overall NLP error.......: 1.7205347582199662e-11 1.7205347582199662e-11 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of equality constraint evaluations = 26 Number of inequality constraint evaluations = 26 Number of equality constraint Jacobian evaluations = 26 Number of inequality constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Total CPU secs in IPOPT (w/o function evaluations) = 0.080 Total CPU secs in NLP function evaluations = 0.018 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 2.3118715 25 0.097985 build initial OA NLP0014I 2 INFEAS 36.000007 29 0.061991 OA decomposition NLP0014I 3 INFEAS 26.999981 37 0.076988 OA decomposition NLP0014I 4 INFEAS 26.999979 39 0.080988 OA decomposition NLP0014I 5 INFEAS 26.999982 38 0.078988 OA decomposition NLP0014I 6 INFEAS 25.000002 40 0.084988 OA decomposition NLP0014I 7 INFEAS 19.249997 37 0.078988 OA decomposition OA0012I After 100.85367.1f seconds, 7 iterations upper bound 1e+500g, lower bound 8.69999910g NLP0014I 8 INFEAS 19.500002 41 0.086987 OA decomposition OA0012I After 581.11666.1f seconds, 8 iterations upper bound 1e+500g, lower bound 11.20g NLP0014I 9 INFEAS 23.999996 40 0.083987 OA decomposition OA0012I After 1220.2885.1f seconds, 9 iterations upper bound 1e+500g, lower bound 11.30g NLP0014I 10 INFEAS 20.999996 39 0.080987 OA decomposition OA0012I After 1398.6184.1f seconds, 10 iterations upper bound 1e+500g, lower bound 11.30g NLP0014I 11 INFEAS 20.000001 42 0.088987 OA decomposition NLP0014I 12 INFEAS 19.500001 40 0.085986 OA decomposition OA0012I After 1600.5097.1f seconds, 12 iterations upper bound 1e+500g, lower bound 120g NLP0014I 13 INFEAS 14.999998 38 0.078988 OA decomposition OA0012I After 1789.215.1f seconds, 13 iterations upper bound 1e+500g, lower bound 130g NLP0014I 14 INFEAS 14.000006 38 0.078988 OA decomposition OA0012I After 1928.6268.1f seconds, 14 iterations upper bound 1e+500g, lower bound 13.10g NLP0014I 15 INFEAS 13.5 38 0.080988 OA decomposition OA0012I After 2196.1951.1f seconds, 15 iterations upper bound 1e+500g, lower bound 13.10g NLP0014I 16 INFEAS 13.5 41 0.083988 OA decomposition OA0012I After 7200.0134.1f seconds, 16 iterations upper bound 1e+500g, lower bound 13.10g NLP0014I 17 INFEAS 14.999998 40 0.083988 OA decomposition OA0009I OA interupted after 7200.1014 seconds found solution of value 1e+50 (lower bound 13.1 ). OA0010I Performed 16 iterations, explored 1417932 branch-and-bound nodes in total Cbc0031I 2 added rows had average density of 320 Cbc0013I At root node, 2 cuts changed objective from 2.3118715 to 2.3118715 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 2 row cuts average 320.0 elements, 0 column cuts (2 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 2.3118715), took 4 iterations and 0 nodes (7200.09 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 2 cuts of which 2 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 2.311871e+00 (only reliable for convex models) --- Restarting execution --- tls12.gms(1941) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job tls12.gms Stop 09/08/12 22:04:34 elapsed 2:00:21.185 @04 1347134674 ----------------------------- Sa 8. Sep 22:04:34 CEST 2012 ----------------------------- =ready= Linux opt203 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/tls2.gms =========== ----------------------------- Sa 8. Sep 20:04:20 CEST 2012 ----------------------------- @03 1347127460 --- Job tls2.gms Start 09/08/12 20:04:20 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- tls2.gms(120) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- tls2.gms(115) 3 Mb --- Generating MINLP model m --- tls2.gms(120) 5 Mb --- 25 rows 38 columns 210 non-zeroes --- 21 nl-code 8 nl-non-zeroes --- 33 discrete-columns --- tls2.gms(120) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 35 Number of nonzeros in inequality constraint Jacobian.: 157 Number of nonzeros in Lagrangian Hessian.............: 10 Total number of variables............................: 37 variables with only lower bounds: 4 variables with lower and upper bounds: 33 variables with only upper bounds: 0 Total number of equality constraints.................: 6 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 18 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.4299999e-01 1.62e+03 1.23e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.2988464e-01 1.60e+03 1.49e+00 0.7 1.03e+02 - 7.97e-03 1.09e-02f 1 2 9.5859981e-01 1.58e+03 4.12e+00 0.7 9.28e+01 - 1.86e-02 1.15e-02f 1 3 1.2472887e+00 1.37e+03 6.87e+01 0.7 9.42e+01 - 1.83e-02 1.19e-01f 1 4 1.4273741e+00 1.32e+03 4.63e+01 0.5 4.59e+01 0.0 2.46e-01 6.36e-02f 1 5 1.7455101e+00 9.56e+02 9.01e+01 0.5 7.24e+01 -0.5 7.74e-02 2.73e-01f 1 6 1.8695479e+00 9.12e+02 8.66e+01 0.5 5.27e+01 - 4.62e-02 4.59e-02f 1 7 1.9518275e+00 7.71e+02 6.59e+01 0.2 4.84e+01 -0.1 5.23e-01 1.58e-01h 1 8 1.9024646e+00 7.50e+02 6.53e+01 0.4 1.02e+02 -0.5 3.21e-02 2.72e-02h 1 9 2.2656410e+00 1.01e+02 2.97e+01 -0.1 4.08e+01 -0.1 7.06e-01 8.64e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.2095253e+00 1.33e-15 1.20e+01 -1.9 5.53e+00 - 8.23e-01 1.00e+00h 1 11 2.1438201e+00 4.44e-16 9.58e+00 -1.0 1.37e+01 - 2.23e-01 1.95e-01f 1 12 1.5900499e+00 1.78e-15 2.26e+00 -2.1 1.41e+00 - 7.42e-01 1.00e+00f 1 13 1.1720369e+00 5.75e-02 9.96e-01 -2.3 9.67e-01 - 6.59e-01 9.26e-01h 1 14 8.5597134e-01 3.47e-02 1.62e-01 -2.6 1.45e+00 - 5.83e-01 1.00e+00h 1 15 7.9444305e-01 1.30e-02 2.53e-02 -3.7 9.62e-01 - 8.44e-01 7.54e-01h 1 16 7.6982624e-01 3.53e-03 3.49e-03 -5.3 4.34e-01 - 8.62e-01 8.39e-01h 1 17 7.6718278e-01 3.55e-15 1.56e-02 -4.1 3.38e-01 - 1.86e-01 1.00e+00h 1 18 7.3791061e-01 1.10e-02 2.61e-02 -3.9 5.29e+01 - 5.71e-01 1.96e-01f 1 19 7.1877510e-01 1.56e-02 1.65e-02 -4.0 3.96e+01 - 9.81e-03 2.66e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 7.1855820e-01 1.47e-02 2.04e-03 -5.3 1.94e+00 - 9.85e-01 5.43e-02h 1 21 7.1829596e-01 7.04e-04 1.09e-04 -9.2 6.64e-02 - 9.84e-01 9.53e-01h 1 22 7.1830645e-01 9.16e-07 1.47e-07 -11.0 1.01e-03 - 9.99e-01 9.99e-01h 1 23 7.1830647e-01 1.78e-15 1.33e-15 -11.0 7.41e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 23 (scaled) (unscaled) Objective...............: 7.1830647464458852e-01 7.1830647464458852e-01 Dual infeasibility......: 1.3334848583788716e-15 1.3334848583788716e-15 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 1.0000575242802131e-11 1.0000575242802131e-11 Overall NLP error.......: 1.0000575242802131e-11 1.0000575242802131e-11 Number of objective function evaluations = 24 Number of objective gradient evaluations = 24 Number of equality constraint evaluations = 24 Number of inequality constraint evaluations = 24 Number of equality constraint Jacobian evaluations = 24 Number of inequality constraint Jacobian evaluations = 24 Number of Lagrangian Hessian evaluations = 23 Total CPU secs in IPOPT (w/o function evaluations) = 0.014 Total CPU secs in NLP function evaluations = 0.000 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 0.71830647 23 0.013998 build initial OA NLP0014I 2 INFEAS 3.9999997 24 0.018997 OA decomposition NLP0014I 3 INFEAS 3.9999998 27 0.023996 OA decomposition NLP0014I 4 INFEAS 3.9999998 29 0.025996 OA decomposition NLP0014I 5 INFEAS 3.0000002 27 0.023997 OA decomposition NLP0014I 6 INFEAS 2.4999995 21 0.017997 OA decomposition NLP0014I 7 INFEAS 0.77777777 22 0.018997 OA decomposition NLP0014I 8 INFEAS 0.77777777 21 0.017997 OA decomposition NLP0014I 9 OPT 5.3 13 0.006999 OA decomposition OA0003I New best feasible of 5.3 found after 0.25996 sec and OA0008I OA converged in 0.25996 seconds found solution of value 5.3 (lower bound 1e+50 ). OA0010I Performed 8 iterations, explored 45 branch-and-bound nodes in total Cbc0012I Integer solution of 5.3 found by nonlinear programm after 1 iterations and 0 nodes (0.26 seconds) Cbc0031I 1 added rows had average density of 25 Cbc0013I At root node, 1 cuts changed objective from 0.71830644 to 0.71830644 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 2 row cuts average 25.0 elements, 0 column cuts (1 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 5.299999998778432, took 1 iterations and 0 nodes (0.26 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 2 cuts of which 1 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 5.3. Best solution: 5.300000e+00 (0 nodes, 0.275 seconds) Best possible: 5.300000e+00 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- tls2.gms(120) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job tls2.gms Stop 09/08/12 20:04:21 elapsed 0:00:00.387 @04 1347127461 ----------------------------- Sa 8. Sep 20:04:21 CEST 2012 ----------------------------- =ready= Linux opt203 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/tls4.gms =========== ----------------------------- Sa 8. Sep 20:04:21 CEST 2012 ----------------------------- @03 1347127461 --- Job tls4.gms Start 09/08/12 20:04:21 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- tls4.gms(255) 2 Mb --- Starting execution: elapsed 0:00:00.006 --- tls4.gms(250) 3 Mb --- Generating MINLP model m --- tls4.gms(255) 5 Mb --- 65 rows 106 columns 614 non-zeroes --- 73 nl-code 32 nl-non-zeroes --- 89 discrete-columns --- tls4.gms(255) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 101 Number of nonzeros in inequality constraint Jacobian.: 487 Number of nonzeros in Lagrangian Hessian.............: 36 Total number of variables............................: 105 variables with only lower bounds: 16 variables with lower and upper bounds: 89 variables with only upper bounds: 0 Total number of equality constraints.................: 20 Total number of inequality constraints...............: 44 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 44 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 7.7999999e-01 1.56e+03 1.37e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.9483804e-01 1.54e+03 3.26e+00 0.6 1.02e+02 - 6.49e-03 1.43e-02f 1 2 1.2215807e+00 1.51e+03 3.64e+00 0.6 9.44e+01 - 1.92e-02 1.41e-02f 1 3 1.5637054e+00 1.46e+03 8.92e+00 0.5 8.83e+01 - 4.33e-02 3.12e-02f 1 4 3.0085750e+00 1.18e+03 4.00e+01 0.5 8.63e+01 - 8.63e-02 1.81e-01f 1 5 7.4945948e+00 1.33e-15 5.11e+01 0.2 6.65e+01 - 2.24e-01 1.00e+00f 1 6 7.1733981e+00 1.33e-15 1.27e+01 -1.8 9.70e-01 - 8.30e-01 1.00e+00h 1 7 5.1554941e+00 1.78e-15 2.29e-01 -1.2 1.92e+00 - 9.75e-01 1.00e+00f 1 8 2.5698338e+00 1.10e+00 3.58e-01 -2.4 4.52e+00 - 6.45e-01 1.00e+00f 1 9 1.9651014e+00 1.68e-01 1.37e-01 -2.5 2.59e+00 - 6.65e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 1.7989509e+00 8.69e-02 2.57e-02 -3.3 2.21e+00 - 8.37e-01 6.96e-01h 1 11 1.7226440e+00 2.75e-02 7.18e-03 -3.8 2.28e+00 - 8.67e-01 8.18e-01h 1 12 1.7117153e+00 9.00e-03 6.07e-03 -5.5 9.64e-01 - 8.49e-01 7.01e-01h 1 13 1.7097981e+00 1.97e-03 2.06e-03 -7.3 1.52e-01 - 9.57e-01 7.83e-01h 1 14 1.7093370e+00 2.99e-05 3.16e-05 -11.0 2.37e-02 - 9.90e-01 9.85e-01h 1 15 1.7093311e+00 2.02e-09 1.92e-09 -11.0 3.85e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: 1.7093310505898947e+00 1.7093310505898947e+00 Dual infeasibility......: 1.9214937351510448e-09 1.9214937351510448e-09 Constraint violation....: 2.0222525876079089e-09 2.0222525876079089e-09 Complementarity.........: 6.2333458912015867e-11 6.2333458912015867e-11 Overall NLP error.......: 2.0222525876079089e-09 2.0222525876079089e-09 Number of objective function evaluations = 16 Number of objective gradient evaluations = 16 Number of equality constraint evaluations = 16 Number of inequality constraint evaluations = 16 Number of equality constraint Jacobian evaluations = 16 Number of inequality constraint Jacobian evaluations = 16 Number of Lagrangian Hessian evaluations = 15 Total CPU secs in IPOPT (w/o function evaluations) = 0.011 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 1.7093311 15 0.011998 build initial OA NLP0014I 2 INFEAS 6.9999999 30 0.034995 OA decomposition NLP0014I 3 INFEAS 5.2500003 29 0.035994 OA decomposition NLP0014I 4 INFEAS 5.4999994 26 0.031995 OA decomposition NLP0014I 5 INFEAS 7.9999911 31 0.037994 OA decomposition NLP0014I 6 INFEAS 5.4999997 27 0.014998 OA decomposition NLP0014I 7 INFEAS 7.9999734 31 0.017997 OA decomposition NLP0014I 8 INFEAS 7.9999929 33 0.018997 OA decomposition NLP0014I 9 INFEAS 7.0277778 29 0.014997 OA decomposition NLP0014I 10 INFEAS 5.2500001 30 0.017998 OA decomposition NLP0014I 11 INFEAS 3.4999999 32 0.016997 OA decomposition NLP0014I 12 INFEAS 5.2500001 34 0.018997 OA decomposition NLP0014I 13 INFEAS 6.4999998 34 0.018997 OA decomposition NLP0014I 14 INFEAS 6.3673469 23 0.011998 OA decomposition NLP0014I 15 INFEAS 4.1632653 30 0.016998 OA decomposition NLP0014I 16 INFEAS 3.9999997 34 0.018997 OA decomposition NLP0014I 17 INFEAS 3.6944444 32 0.017997 OA decomposition NLP0014I 18 INFEAS 2.24999 36 0.019997 OA decomposition NLP0014I 19 INFEAS 3.8659161 25 0.013998 OA decomposition NLP0014I 20 INFEAS 3 31 0.014998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 21 INFEAS 5.25 28 0.016997 OA decomposition NLP0014I 22 INFEAS 3.84 28 0.015997 OA decomposition NLP0014I 23 INFEAS 2.25 34 0.018997 OA decomposition NLP0014I 24 INFEAS 5.25 29 0.015998 OA decomposition NLP0014I 25 INFEAS 3.84 40 0.019997 OA decomposition NLP0014I 26 INFEAS 3.8659169 27 0.014998 OA decomposition NLP0014I 27 INFEAS 1.5 41 0.022997 OA decomposition NLP0014I 28 INFEAS 2.515625 24 0.012998 OA decomposition NLP0014I 29 INFEAS 2.890625 31 0.016998 OA decomposition NLP0014I 30 INFEAS 2.515625 29 0.017997 OA decomposition NLP0014I 31 INFEAS 2.25 22 0.012998 OA decomposition NLP0014I 32 INFEAS 0.84 31 0.016997 OA decomposition NLP0014I 33 INFEAS 2.8072571 22 0.010998 OA decomposition NLP0014I 34 INFEAS 1.56 25 0.011999 OA decomposition NLP0014I 35 INFEAS 1.4444444 34 0.019996 OA decomposition NLP0014I 36 INFEAS 1.25 28 0.015997 OA decomposition NLP0014I 37 INFEAS 0.84 32 0.016998 OA decomposition NLP0014I 38 INFEAS 1.7777778 24 0.012998 OA decomposition NLP0014I 39 INFEAS 2.8072573 33 0.015998 OA decomposition NLP0014I 40 INFEAS 2.0625 29 0.015998 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 41 INFEAS 1.9387755 23 0.012998 OA decomposition NLP0014I 42 INFEAS 0.84 31 0.015997 OA decomposition NLP0014I 43 INFEAS 0.84 28 0.015997 OA decomposition NLP0014I 44 INFEAS 1.7507435 30 0.016997 OA decomposition NLP0014I 45 INFEAS 0.84 26 0.014998 OA decomposition NLP0014I 46 INFEAS 3.5918367 27 0.011998 OA decomposition NLP0014I 47 INFEAS 1.8979592 24 0.012998 OA decomposition NLP0014I 48 INFEAS 1.7777778 30 0.016998 OA decomposition NLP0014I 49 INFEAS 3.551111 34 0.019997 OA decomposition NLP0014I 50 INFEAS 1.25 25 0.012998 OA decomposition NLP0014I 51 INFEAS 1.56 28 0.014998 OA decomposition NLP0014I 52 INFEAS 0.84 33 0.018997 OA decomposition NLP0014I 53 INFEAS 1.7777778 35 0.018997 OA decomposition NLP0014I 54 INFEAS 1.56 26 0.014998 OA decomposition NLP0014I 55 INFEAS 0.77777777 28 0.015997 OA decomposition NLP0014I 56 INFEAS 1.56 28 0.014998 OA decomposition NLP0014I 57 INFEAS 1.4444444 32 0.018997 OA decomposition NLP0014I 58 INFEAS 1 31 0.016998 OA decomposition NLP0014I 59 INFEAS 0.95999999 27 0.012998 OA decomposition NLP0014I 60 INFEAS 2.0975999 32 0.017997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 61 INFEAS 0.77777777 31 0.017997 OA decomposition NLP0014I 62 INFEAS 1.2500003 24 0.012998 OA decomposition NLP0014I 63 INFEAS 1.9999793 31 0.016997 OA decomposition NLP0014I 64 INFEAS 1.56 25 0.012998 OA decomposition NLP0014I 65 INFEAS 2.0975996 28 0.015997 OA decomposition NLP0014I 66 INFEAS 1.25 33 0.019997 OA decomposition NLP0014I 67 INFEAS 1.56 29 0.015998 OA decomposition OA0012I After 104.40613.1f seconds, 67 iterations upper bound 1e+500g, lower bound 7.80g NLP0014I 68 INFEAS 1.5599999 30 0.015997 OA decomposition NLP0014I 69 INFEAS 1.5599999 32 0.017997 OA decomposition NLP0014I 70 INFEAS 1 34 0.016997 OA decomposition NLP0014I 71 INFEAS 0.77777777 37 0.020997 OA decomposition NLP0014I 72 INFEAS 1.56 24 0.012998 OA decomposition NLP0014I 73 INFEAS 1 35 0.016998 OA decomposition NLP0014I 74 INFEAS 1.9999886 32 0.015998 OA decomposition NLP0014I 75 INFEAS 1.2499937 27 0.015997 OA decomposition NLP0014I 76 INFEAS 0.77777777 40 0.021996 OA decomposition NLP0014I 77 INFEAS 2.24 24 0.013997 OA decomposition NLP0014I 78 INFEAS 1.25 27 0.014997 OA decomposition NLP0014I 79 INFEAS 1.25 36 0.020997 OA decomposition NLP0014I 80 INFEAS 0.99999797 44 0.022997 OA decomposition NLP0012I Num Status Obj It time Location NLP0014I 81 INFEAS 1.4444444 22 0.012998 OA decomposition NLP0014I 82 INFEAS 0.5625 30 0.014997 OA decomposition NLP0014I 83 INFEAS 0.5625 30 0.017997 OA decomposition NLP0014I 84 INFEAS 0.3611111 25 0.012998 OA decomposition OA0012I After 210.87994.1f seconds, 84 iterations upper bound 1e+500g, lower bound 8.30g NLP0014I 85 INFEAS 0.59183673 35 0.018997 OA decomposition NLP0014I 86 INFEAS 0.5625 30 0.017998 OA decomposition NLP0014I 87 INFEAS 0.3611111 26 0.014997 OA decomposition NLP0014I 88 OPT 8.3 15 0.005 OA decomposition OA0003I New best feasible of 8.3 found after 235.44621 sec and OA0008I OA converged in 235.44721 seconds found solution of value 8.3 (lower bound 1e+50 ). OA0010I Performed 87 iterations, explored 350270 branch-and-bound nodes in total Cbc0012I Integer solution of 8.3 found by nonlinear programm after 20 iterations and 0 nodes (235.45 seconds) Cbc0031I 9 added rows had average density of 45.444444 Cbc0013I At root node, 9 cuts changed objective from 1.709331 to 1.709331 in 2 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 54 row cuts average 46.3 elements, 0 column cuts (9 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0001I Search completed - best objective 8.299999999243756, took 20 iterations and 0 nodes (235.45 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 2 times and created 54 cuts of which 9 were active after adding rounds of cuts Bonmin finished. Found feasible solution. Objective function value = 8.3. Best solution: 8.300000e+00 (0 nodes, 236.596 seconds) Best possible: 8.300000e+00 (only reliable for convex models) Absolute gap: 0.000000e+00 (absolute tolerance optca: 0) Relative gap: 0.000000e+00 (relative tolerance optcr: 1e-06) --- Restarting execution --- tls4.gms(255) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job tls4.gms Stop 09/08/12 20:08:18 elapsed 0:03:56.711 @04 1347127698 ----------------------------- Sa 8. Sep 20:08:18 CEST 2012 ----------------------------- =ready= Linux opt214 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/tls5.gms =========== ----------------------------- Sa 8. Sep 20:04:43 CEST 2012 ----------------------------- @03 1347127483 --- Job tls5.gms Start 09/08/12 20:04:43 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- tls5.gms(357) 2 Mb --- Starting execution: elapsed 0:00:00.009 --- tls5.gms(352) 3 Mb --- Generating MINLP model m --- tls5.gms(357) 5 Mb --- 91 rows 162 columns 956 non-zeroes --- 111 nl-code 50 nl-non-zeroes --- 136 discrete-columns --- tls5.gms(357) 3 Mb --- Executing BONMIN: elapsed 0:00:00.010 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 156 Number of nonzeros in inequality constraint Jacobian.: 768 Number of nonzeros in Lagrangian Hessian.............: 55 Total number of variables............................: 161 variables with only lower bounds: 25 variables with lower and upper bounds: 136 variables with only upper bounds: 0 Total number of equality constraints.................: 30 Total number of inequality constraints...............: 60 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 60 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 9.7499999e-01 1.60e+03 1.26e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0710808e+00 1.58e+03 1.68e+00 0.5 1.01e+02 - 7.60e-03 1.24e-02f 1 2 1.4999686e+00 1.55e+03 2.04e+00 0.5 9.43e+01 - 1.94e-02 1.61e-02f 1 3 1.8772123e+00 1.51e+03 1.64e+01 0.5 8.78e+01 - 5.15e-02 2.81e-02f 1 4 3.0105076e+00 1.31e+03 5.63e+00 0.4 8.68e+01 - 1.01e-01 1.21e-01f 1 5 9.6165251e+00 3.55e-15 1.21e+02 0.3 7.30e+01 - 1.31e-01 1.00e+00f 1 6 9.8027956e+00 2.22e-15 1.91e+02 -0.1 3.55e+02 - 2.30e-02 8.12e-03f 2 7 8.5565908e+00 2.22e-15 3.71e+01 0.3 1.33e+00 0.0 1.00e+00 6.11e-01f 1 8 8.0069459e+00 2.00e-15 1.11e+01 -2.7 1.22e+00 - 8.96e-01 1.00e+00h 1 9 4.8724996e+00 1.33e-15 4.54e+00 -1.8 3.98e+00 - 6.42e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.0394499e+00 5.76e-01 1.81e+00 -2.3 4.65e+00 - 6.49e-01 7.28e-01f 1 11 2.0340767e+00 4.47e-01 1.66e+00 -2.4 2.94e+00 - 5.61e-01 1.00e+00h 1 12 1.8946329e+00 1.68e-01 1.37e+00 -2.1 1.39e+00 - 1.00e+00 5.23e-01h 1 13 1.3665689e+00 2.88e-01 5.00e-01 -3.4 2.49e+00 - 6.06e-01 1.00e+00h 1 14 1.3255598e+00 1.99e-01 1.72e-01 -3.6 1.38e+00 - 7.05e-01 3.37e-01h 1 15 1.2749815e+00 1.15e-01 7.18e-02 -3.6 1.19e+00 - 6.08e-01 4.79e-01h 1 16 1.1967175e+00 2.85e-02 5.97e-02 -4.0 1.13e+00 - 4.79e-01 1.00e+00h 1 17 1.1825722e+00 9.00e-03 1.34e-02 -5.3 8.37e-01 - 7.24e-01 9.36e-01h 1 18 1.1790773e+00 1.51e-03 2.99e-03 -6.6 7.29e-01 - 8.51e-01 1.00e+00h 1 19 1.1788809e+00 1.53e-04 1.55e-04 -9.6 1.44e-01 - 9.70e-01 9.87e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.1788685e+00 2.58e-06 7.91e-07 -11.0 1.11e-02 - 9.98e-01 9.99e-01h 1 21 1.1788683e+00 1.78e-15 3.00e-11 -10.4 1.71e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 1.1788683378912375e+00 1.1788683378912375e+00 Dual infeasibility......: 2.9983266955574444e-11 2.9983266955574444e-11 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 8.3974675344681482e-11 8.3974675344681482e-11 Overall NLP error.......: 8.3974675344681482e-11 8.3974675344681482e-11 Number of objective function evaluations = 24 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 24 Number of inequality constraint evaluations = 24 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total CPU secs in IPOPT (w/o function evaluations) = 0.010 Total CPU secs in NLP function evaluations = 0.001 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 1.1788683 21 0.010999 build initial OA NLP0014I 2 INFEAS 10.499999 32 0.020997 OA decomposition NLP0014I 3 INFEAS 13.5 33 0.049992 OA decomposition NLP0014I 4 INFEAS 11.999993 33 0.049993 OA decomposition NLP0014I 5 INFEAS 11 29 0.018997 OA decomposition NLP0014I 6 INFEAS 11 30 0.019997 OA decomposition NLP0014I 7 INFEAS 7.4999997 28 0.019997 OA decomposition NLP0014I 8 INFEAS 5.2500003 30 0.019997 OA decomposition NLP0014I 9 INFEAS 5.2500002 29 0.020997 OA decomposition NLP0014I 10 INFEAS 7.4999995 28 0.018997 OA decomposition NLP0014I 11 INFEAS 7.4999998 30 0.020997 OA decomposition NLP0014I 12 INFEAS 5.2500002 30 0.020997 OA decomposition NLP0014I 13 INFEAS 10.999993 32 0.022996 OA decomposition NLP0014I 14 INFEAS 12 33 0.020997 OA decomposition NLP0014I 15 INFEAS 5.0000002 34 0.021996 OA decomposition OA0012I After 118.25402.1f seconds, 15 iterations upper bound 1e+500g, lower bound 5.20g NLP0014I 16 INFEAS 8.0000001 33 0.022997 OA decomposition NLP0014I 17 INFEAS 5.25 37 0.024997 OA decomposition NLP0014I 18 INFEAS 3.4999998 34 0.023997 OA decomposition OA0012I After 222.72414.1f seconds, 18 iterations upper bound 1e+500g, lower bound 5.30g NLP0014I 19 INFEAS 8.0000001 33 0.021997 OA decomposition NLP0014I 20 INFEAS 3.9999999 33 0.022996 OA decomposition OA0012I After 323.76478.1f seconds, 20 iterations upper bound 1e+500g, lower bound 5.60g NLP0012I Num Status Obj It time Location NLP0014I 21 INFEAS 3.0000001 37 0.025996 OA decomposition OA0012I After 436.52564.1f seconds, 21 iterations upper bound 1e+500g, lower bound 5.70g NLP0014I 22 INFEAS 3 37 0.024997 OA decomposition NLP0014I 23 INFEAS 9.4999997 32 0.022996 OA decomposition OA0012I After 611.30607.1f seconds, 23 iterations upper bound 1e+500g, lower bound 5.90g NLP0014I 24 INFEAS 4.9999998 35 0.022996 OA decomposition OA0012I After 751.70472.1f seconds, 24 iterations upper bound 1e+500g, lower bound 6.10g NLP0014I 25 INFEAS 4.2244898 29 0.020997 OA decomposition OA0012I After 869.05688.1f seconds, 25 iterations upper bound 1e+500g, lower bound 6.10g NLP0014I 26 INFEAS 8.877551 25 0.017997 OA decomposition OA0012I After 1081.6736.1f seconds, 26 iterations upper bound 1e+500g, lower bound 6.20g NLP0014I 27 INFEAS 2.755102 32 0.022997 OA decomposition OA0012I After 1257.4158.1f seconds, 27 iterations upper bound 1e+500g, lower bound 6.20g NLP0014I 28 INFEAS 2.755102 30 0.020997 OA decomposition OA0012I After 1444.8214.1f seconds, 28 iterations upper bound 1e+500g, lower bound 6.30g NLP0014I 29 INFEAS 3.2387542 31 0.020997 OA decomposition OA0012I After 1596.6533.1f seconds, 29 iterations upper bound 1e+500g, lower bound 6.30g NLP0014I 30 INFEAS 2.755102 33 0.021997 OA decomposition OA0012I After 1800.2713.1f seconds, 30 iterations upper bound 1e+500g, lower bound 6.30g NLP0014I 31 INFEAS 8.877551 22 0.013997 OA decomposition OA0012I After 1944.8693.1f seconds, 31 iterations upper bound 1e+500g, lower bound 6.40g NLP0014I 32 INFEAS 5.2500002 32 0.022997 OA decomposition OA0012I After 2069.2094.1f seconds, 32 iterations upper bound 1e+500g, lower bound 6.40g NLP0014I 33 INFEAS 3.2387542 32 0.022996 OA decomposition OA0012I After 2281.3742.1f seconds, 33 iterations upper bound 1e+500g, lower bound 6.40g NLP0014I 34 INFEAS 6.1111111 31 0.021997 OA decomposition OA0012I After 2496.3825.1f seconds, 34 iterations upper bound 1e+500g, lower bound 6.50g NLP0014I 35 INFEAS 3.2387541 30 0.020996 OA decomposition OA0012I After 2718.6437.1f seconds, 35 iterations upper bound 1e+500g, lower bound 6.50g NLP0014I 36 INFEAS 4.9999878 31 0.021997 OA decomposition OA0012I After 2931.8573.1f seconds, 36 iterations upper bound 1e+500g, lower bound 6.50g NLP0014I 37 INFEAS 5.9999996 30 0.020996 OA decomposition OA0012I After 3293.3503.1f seconds, 37 iterations upper bound 1e+500g, lower bound 6.60g NLP0014I 38 INFEAS 3.2387542 40 0.026996 OA decomposition OA0012I After 3584.0991.1f seconds, 38 iterations upper bound 1e+500g, lower bound 6.60g NLP0014I 39 INFEAS 5.9999996 31 0.019996 OA decomposition OA0012I After 3981.3347.1f seconds, 39 iterations upper bound 1e+500g, lower bound 6.60g NLP0014I 40 INFEAS 3.2387542 32 0.021996 OA decomposition OA0012I After 4393.93.1f seconds, 40 iterations upper bound 1e+500g, lower bound 6.70g NLP0012I Num Status Obj It time Location NLP0014I 41 INFEAS 3 33 0.020996 OA decomposition OA0012I After 4695.9941.1f seconds, 41 iterations upper bound 1e+500g, lower bound 6.70g NLP0014I 42 INFEAS 2.9999999 31 0.020997 OA decomposition OA0012I After 5212.5966.1f seconds, 42 iterations upper bound 1e+500g, lower bound 6.70g NLP0014I 43 INFEAS 3.0000001 29 0.019997 OA decomposition OA0012I After 5717.1619.1f seconds, 43 iterations upper bound 1e+500g, lower bound 6.80g NLP0014I 44 INFEAS 3.2387542 33 0.021996 OA decomposition OA0012I After 7052.6798.1f seconds, 44 iterations upper bound 1e+500g, lower bound 70g NLP0014I 45 INFEAS 6.4999997 35 0.023997 OA decomposition OA0012I After 7200.0214.1f seconds, 45 iterations upper bound 1e+500g, lower bound 70g NLP0014I 46 INFEAS 2.0625 28 0.018997 OA decomposition OA0009I OA interupted after 7200.0424 seconds found solution of value 1e+50 (lower bound 7 ). OA0010I Performed 45 iterations, explored 4978438 branch-and-bound nodes in total Cbc0031I 40 added rows had average density of 59 Cbc0013I At root node, 40 cuts changed objective from 1.1788683 to 1.1788683 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 40 row cuts average 59.0 elements, 0 column cuts (40 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 1.1788683), took 16 iterations and 0 nodes (7200.04 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 40 cuts of which 40 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 1.178868e+00 (only reliable for convex models) --- Restarting execution --- tls5.gms(357) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job tls5.gms Stop 09/08/12 22:05:09 elapsed 2:00:25.854 @04 1347134709 ----------------------------- Sa 8. Sep 22:05:09 CEST 2012 ----------------------------- =ready= Linux opt225 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/tls6.gms =========== ----------------------------- Sa 8. Sep 20:05:47 CEST 2012 ----------------------------- @03 1347127547 --- Job tls6.gms Start 09/08/12 20:05:47 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- tls6.gms(485) 2 Mb --- Starting execution: elapsed 0:00:00.007 --- tls6.gms(480) 3 Mb --- Generating MINLP model m --- tls6.gms(485) 5 Mb --- 121 rows 216 columns 1,370 non-zeroes --- 157 nl-code 72 nl-non-zeroes --- 179 discrete-columns --- tls6.gms(485) 3 Mb --- Executing BONMIN: elapsed 0:00:00.008 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 209 Number of nonzeros in inequality constraint Jacobian.: 1107 Number of nonzeros in Lagrangian Hessian.............: 78 Total number of variables............................: 215 variables with only lower bounds: 36 variables with lower and upper bounds: 179 variables with only upper bounds: 0 Total number of equality constraints.................: 42 Total number of inequality constraints...............: 78 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 78 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.6210000e+00 1.90e+03 1.34e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.6456482e+00 1.87e+03 1.34e+00 0.5 1.02e+02 - 9.56e-03 1.12e-02f 1 2 3.3969557e+00 1.82e+03 7.17e+00 0.4 9.35e+01 - 1.04e-02 2.94e-02f 1 3 3.9814515e+00 1.75e+03 5.47e+00 0.4 8.83e+01 - 4.43e-02 3.23e-02f 1 4 4.9921035e+00 1.59e+03 3.02e+01 0.3 8.50e+01 - 1.47e-01 9.18e-02f 1 5 7.5174498e+00 7.75e+02 1.64e+02 0.2 7.53e+01 - 9.82e-02 5.02e-01f 1 6 7.5537018e+00 5.65e+02 1.62e+02 0.0 3.89e+01 - 8.10e-02 2.68e-01f 1 7 8.8956828e+00 1.89e+01 3.65e+02 -0.3 2.66e+01 - 1.77e-01 9.66e-01f 1 8 9.4508071e+00 3.33e-15 2.36e+01 -0.7 3.91e+00 - 8.31e-01 1.00e+00f 1 9 9.3803625e+00 4.88e-15 1.22e+01 -0.6 1.07e+01 - 6.24e-01 5.58e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.5430288e+00 5.54e-01 4.83e+00 -1.9 8.41e+00 - 6.74e-01 1.00e+00f 1 11 4.6904830e+00 7.24e-01 6.35e-01 -1.9 5.30e+00 - 6.15e-01 3.24e-01h 1 12 3.6803642e+00 6.12e-01 2.07e+00 -1.8 4.66e+00 - 9.89e-01 4.83e-01h 1 13 2.6706074e+00 5.79e-01 9.35e-01 -2.6 5.67e+00 - 5.62e-01 5.56e-01h 1 14 1.6831096e+00 2.77e-01 3.09e-01 -2.7 3.77e+00 - 5.53e-01 1.00e+00h 1 15 1.4652396e+00 1.07e-01 8.98e-02 -3.8 2.71e+00 - 7.13e-01 8.37e-01h 1 16 1.3841718e+00 1.30e-01 3.00e-02 -4.1 2.02e+00 - 7.42e-01 6.19e-01h 1 17 1.3329946e+00 2.19e-02 8.20e-02 -4.0 4.90e-01 - 5.90e-01 8.90e-01h 1 18 1.3111270e+00 1.89e-02 1.82e-02 -4.6 8.59e-01 - 7.15e-01 1.00e+00h 1 19 1.3060648e+00 4.42e-03 9.22e-03 -5.9 5.71e-01 - 7.14e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 1.3056930e+00 5.79e-04 1.12e-03 -7.9 2.06e-01 - 9.04e-01 9.44e-01h 1 21 1.3056552e+00 2.47e-05 1.14e-05 -11.0 2.95e-02 - 9.87e-01 9.86e-01h 1 22 1.3056541e+00 3.08e-07 3.94e-05 -11.0 1.37e-03 - 1.00e+00 9.89e-01h 1 23 1.3056540e+00 1.78e-15 6.36e-02 -10.8 1.68e-05 - 8.65e-01 1.00e+00h 1 24 1.3056540e+00 1.78e-15 1.93e-15 -10.9 2.45e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 24 (scaled) (unscaled) Objective...............: 1.3056540459277819e+00 1.3056540459277819e+00 Dual infeasibility......: 1.9266651553291975e-15 1.9266651553291975e-15 Constraint violation....: 1.7763568394002505e-15 1.7763568394002505e-15 Complementarity.........: 1.9481933580380463e-11 1.9481933580380463e-11 Overall NLP error.......: 1.9481933580380463e-11 1.9481933580380463e-11 Number of objective function evaluations = 25 Number of objective gradient evaluations = 25 Number of equality constraint evaluations = 25 Number of inequality constraint evaluations = 25 Number of equality constraint Jacobian evaluations = 25 Number of inequality constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Total CPU secs in IPOPT (w/o function evaluations) = 0.014 Total CPU secs in NLP function evaluations = 0.002 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 1.305654 24 0.015997 build initial OA NLP0014I 2 INFEAS 12 32 0.024996 OA decomposition NLP0014I 3 INFEAS 9.4999996 29 0.022996 OA decomposition NLP0014I 4 INFEAS 8.4999999 29 0.023997 OA decomposition NLP0014I 5 INFEAS 7.9999998 32 0.025996 OA decomposition NLP0014I 6 INFEAS 8 29 0.024996 OA decomposition NLP0014I 7 INFEAS 8 31 0.025996 OA decomposition NLP0014I 8 INFEAS 7.9999997 30 0.025996 OA decomposition NLP0014I 9 INFEAS 6.4999905 31 0.024996 OA decomposition NLP0014I 10 INFEAS 8 30 0.021997 OA decomposition NLP0014I 11 INFEAS 9.7959184 26 0.020997 OA decomposition OA0012I After 145.90482.1f seconds, 11 iterations upper bound 1e+500g, lower bound 6.40g NLP0014I 12 INFEAS 9.7959184 28 0.021997 OA decomposition NLP0014I 13 INFEAS 6.9999992 28 0.022996 OA decomposition OA0012I After 373.76118.1f seconds, 13 iterations upper bound 1e+500g, lower bound 7.10g NLP0014I 14 INFEAS 8 23 0.018997 OA decomposition OA0012I After 479.63708.1f seconds, 14 iterations upper bound 1e+500g, lower bound 7.10g NLP0014I 15 INFEAS 8.4999922 33 0.026996 OA decomposition NLP0014I 16 INFEAS 6.5625 29 0.023997 OA decomposition OA0012I After 696.5851.1f seconds, 16 iterations upper bound 1e+500g, lower bound 7.20g NLP0014I 17 INFEAS 6.5625 27 0.020997 OA decomposition NLP0014I 18 INFEAS 8 30 0.022997 OA decomposition OA0012I After 1005.1412.1f seconds, 18 iterations upper bound 1e+500g, lower bound 7.40g NLP0014I 19 INFEAS 8 26 0.020997 OA decomposition OA0012I After 1176.6581.1f seconds, 19 iterations upper bound 1e+500g, lower bound 7.40g NLP0014I 20 INFEAS 6.5625 28 0.021997 OA decomposition OA0012I After 1336.9108.1f seconds, 20 iterations upper bound 1e+500g, lower bound 7.60g NLP0012I Num Status Obj It time Location NLP0014I 21 INFEAS 5.2499999 35 0.024996 OA decomposition OA0012I After 1814.5931.1f seconds, 21 iterations upper bound 1e+500g, lower bound 7.70g NLP0014I 22 INFEAS 5.2500001 32 0.025996 OA decomposition OA0012I After 2356.4738.1f seconds, 22 iterations upper bound 1e+500g, lower bound 7.90g NLP0014I 23 INFEAS 6.4999853 31 0.024996 OA decomposition OA0012I After 3106.8377.1f seconds, 23 iterations upper bound 1e+500g, lower bound 8.10g NLP0014I 24 INFEAS 5.5308642 28 0.022996 OA decomposition OA0012I After 3893.5231.1f seconds, 24 iterations upper bound 1e+500g, lower bound 8.20g NLP0014I 25 INFEAS 6.7160494 22 0.016998 OA decomposition OA0012I After 5057.1162.1f seconds, 25 iterations upper bound 1e+500g, lower bound 8.30g NLP0014I 26 INFEAS 5.25 29 0.021996 OA decomposition OA0012I After 5738.7766.1f seconds, 26 iterations upper bound 1e+500g, lower bound 8.30g NLP0014I 27 INFEAS 4.4444444 25 0.020997 OA decomposition OA0012I After 6424.0524.1f seconds, 27 iterations upper bound 1e+500g, lower bound 8.30g NLP0014I 28 INFEAS 5.2500002 31 0.022996 OA decomposition OA0012I After 7065.7098.1f seconds, 28 iterations upper bound 1e+500g, lower bound 8.39999990g NLP0014I 29 INFEAS 5 34 0.026996 OA decomposition OA0012I After 7200.0194.1f seconds, 29 iterations upper bound 1e+500g, lower bound 8.39999990g NLP0014I 30 INFEAS 4.76 32 0.025996 OA decomposition OA0009I OA interupted after 7200.0454 seconds found solution of value 1e+50 (lower bound 8.3999999 ). OA0010I Performed 29 iterations, explored 3565212 branch-and-bound nodes in total Cbc0031I 20 added rows had average density of 78.8 Cbc0013I At root node, 20 cuts changed objective from 1.305654 to 1.305654 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 20 row cuts average 78.8 elements, 0 column cuts (20 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 1.305654), took 15 iterations and 0 nodes (7200.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 20 cuts of which 20 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 1.305654e+00 (only reliable for convex models) --- Restarting execution --- tls6.gms(485) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job tls6.gms Stop 09/08/12 22:06:11 elapsed 2:00:23.987 @04 1347134771 ----------------------------- Sa 8. Sep 22:06:11 CEST 2012 ----------------------------- =ready= Linux opt232 3.1.10-1.16-desktop #1 SMP PREEMPT Wed Jun 27 05:21:40 UTC 2012 (d016078) x86_64 x86_64 x86_64 GNU/Linux @01 MINLP/instances/MINLPLib/gms/tls7.gms =========== ----------------------------- Sa 8. Sep 20:07:53 CEST 2012 ----------------------------- @03 1347127673 --- Job tls7.gms Start 09/08/12 20:07:53 LEX-LEG 23.9.2 x86_64/Linux GAMS Rev 239 Copyright (C) 1987-2012 GAMS Development. All rights reserved Licensee: Stefan Vigerske G120724/0001AV-GEN GAMS Development Corp DC7303 License for teaching and research at degree granting institutions --- Starting compilation --- tls7.gms(678) 2 Mb --- Starting execution: elapsed 0:00:00.014 --- tls7.gms(673) 3 Mb --- Generating MINLP model m --- tls7.gms(678) 5 Mb --- 155 rows 346 columns 2,258 non-zeroes --- 211 nl-code 98 nl-non-zeroes --- 296 discrete-columns --- tls7.gms(678) 3 Mb --- Executing BONMIN: elapsed 0:00:00.018 COIN-OR Bonmin Jul 4, 2012 23.9.2 LEX 34973.35015 LEG x86_64/Linux COIN-OR Bonmin (Bonmin Library 1.6) written by P. Bonami List of user-set options: Name Value used bonmin.algorithm = B-OA yes bonmin.solvefinal = no no milp_solver = cplex yes number_cpx_threads = 1 no ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version trunk, running with linear solver ma27. Number of nonzeros in equality constraint Jacobian...: 338 Number of nonzeros in inequality constraint Jacobian.: 1847 Number of nonzeros in Lagrangian Hessian.............: 105 Total number of variables............................: 345 variables with only lower bounds: 49 variables with lower and upper bounds: 296 variables with only upper bounds: 0 Total number of equality constraints.................: 56 Total number of inequality constraints...............: 98 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 98 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 3.7480000e+00 2.61e+03 1.26e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.7479428e+00 2.57e+03 2.16e+00 0.3 8.62e+01 - 2.11e-02 1.38e-02f 1 2 4.9056298e+00 2.50e+03 1.21e+01 0.3 8.07e+01 - 8.66e-03 2.29e-02f 1 3 5.5557817e+00 2.41e+03 1.36e+01 0.3 7.52e+01 - 6.21e-02 3.76e-02f 1 4 6.4955390e+00 2.21e+03 5.59e+01 0.2 7.38e+01 - 1.77e-01 8.00e-02f 1 5 8.4417936e+00 1.38e+03 1.24e+02 0.2 6.81e+01 - 8.50e-02 3.62e-01f 1 6 7.4475587e+00 7.04e+02 1.77e+02 -0.2 4.08e+01 - 1.18e-01 4.92e-01f 1 7 6.4918110e+00 8.46e+01 5.82e+01 -1.0 2.07e+01 - 4.91e-01 8.84e-01h 1 8 5.3936773e+00 1.55e-15 4.29e+01 -2.0 2.51e+00 - 8.08e-01 1.00e+00h 1 9 3.1161816e+00 2.98e-01 8.49e+00 -2.3 2.53e+00 - 7.55e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 3.0531280e+00 1.33e-15 1.43e+01 -1.5 6.25e+00 - 4.87e-01 1.00e+00f 1 11 1.9762009e+00 5.24e-01 3.60e-01 -2.0 5.43e+00 - 7.51e-01 8.84e-01h 1 12 1.4404780e+00 3.04e-01 1.04e+00 -2.3 2.48e+00 - 8.01e-01 1.00e+00h 1 13 1.1734177e+00 2.69e-01 7.81e-02 -3.0 2.79e+00 - 6.78e-01 5.13e-01h 1 14 9.2147643e-01 2.57e-01 3.25e-02 -3.2 2.76e+00 - 6.20e-01 6.25e-01h 1 15 7.7933787e-01 2.15e-01 3.02e-02 -3.6 2.54e+00 - 6.63e-01 5.76e-01h 1 16 7.0642052e-01 1.60e-01 4.69e-02 -4.0 2.15e+00 - 6.57e-01 4.77e-01h 1 17 6.6960608e-01 1.10e-01 5.40e-02 -4.1 2.01e+00 - 6.97e-01 4.18e-01h 1 18 6.0629539e-01 5.94e-02 1.67e-02 -4.4 1.77e+00 - 5.74e-01 9.71e-01h 1 19 5.9556056e-01 7.96e-03 9.51e-03 -5.8 6.26e-01 - 6.96e-01 9.35e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 5.9359196e-01 1.41e-03 2.41e-03 -7.3 1.65e-01 - 8.41e-01 9.94e-01h 1 21 5.9349713e-01 1.29e-04 9.78e-05 -10.0 1.92e-02 - 9.66e-01 9.94e-01h 1 22 5.9349630e-01 1.01e-05 3.54e-03 -11.0 2.93e-03 - 9.97e-01 9.41e-01h 1 23 5.9349627e-01 1.30e-06 1.81e-02 -10.8 2.30e-04 - 8.50e-01 8.73e-01h 1 24 5.9349626e-01 6.69e-09 9.63e-03 -11.0 2.94e-05 - 9.64e-01 9.94e-01h 1 25 5.9349626e-01 2.66e-15 4.04e-15 -11.0 1.87e-07 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 25 (scaled) (unscaled) Objective...............: 5.9349626468104544e-01 5.9349626468104544e-01 Dual infeasibility......: 4.0394965201696715e-15 4.0394965201696715e-15 Constraint violation....: 1.7763568394002505e-15 2.6645352591003757e-15 Complementarity.........: 1.1599180653663279e-11 1.1599180653663279e-11 Overall NLP error.......: 1.1599180653663279e-11 1.1599180653663279e-11 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of equality constraint evaluations = 26 Number of inequality constraint evaluations = 26 Number of equality constraint Jacobian evaluations = 26 Number of inequality constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Total CPU secs in IPOPT (w/o function evaluations) = 0.037 Total CPU secs in NLP function evaluations = 0.005 EXIT: Optimal Solution Found. NLP0012I Num Status Obj It time Location NLP0014I 1 OPT 0.59349626 25 0.041993 build initial OA NLP0014I 2 INFEAS 10.5 32 0.032995 OA decomposition NLP0014I 3 INFEAS 13.5 30 0.029995 OA decomposition NLP0014I 4 INFEAS 11 32 0.030995 OA decomposition NLP0014I 5 INFEAS 7.9999999 32 0.033995 OA decomposition OA0012I After 180.08562.1f seconds, 5 iterations upper bound 1e+500g, lower bound 3.30g NLP0014I 6 INFEAS 11 35 0.035994 OA decomposition OA0012I After 418.58337.1f seconds, 6 iterations upper bound 1e+500g, lower bound 3.39999990g NLP0014I 7 INFEAS 11 28 0.026996 OA decomposition OA0012I After 710.73095.1f seconds, 7 iterations upper bound 1e+500g, lower bound 3.40g NLP0014I 8 INFEAS 7.9999999 31 0.031996 OA decomposition OA0012I After 933.70706.1f seconds, 8 iterations upper bound 1e+500g, lower bound 3.50g NLP0014I 9 INFEAS 7.9999999 31 0.032995 OA decomposition OA0012I After 1969.5356.1f seconds, 9 iterations upper bound 1e+500g, lower bound 4.10g NLP0014I 10 INFEAS 7.4999997 36 0.032995 OA decomposition OA0012I After 2609.3153.1f seconds, 10 iterations upper bound 1e+500g, lower bound 4.10g NLP0014I 11 INFEAS 7.4999997 34 0.033995 OA decomposition OA0012I After 4252.4465.1f seconds, 11 iterations upper bound 1e+500g, lower bound 4.20g NLP0014I 12 INFEAS 7.4999997 33 0.033995 OA decomposition OA0012I After 6564.0471.1f seconds, 12 iterations upper bound 1e+500g, lower bound 4.30g NLP0014I 13 INFEAS 5.2500001 29 0.029996 OA decomposition OA0012I After 7200.0544.1f seconds, 13 iterations upper bound 1e+500g, lower bound 4.30g NLP0014I 14 INFEAS 7.9999925 32 0.032995 OA decomposition OA0009I OA interupted after 7200.0884 seconds found solution of value 1e+50 (lower bound 4.3 ). OA0010I Performed 13 iterations, explored 2158184 branch-and-bound nodes in total Cbc0031I 14 added rows had average density of 111.5 Cbc0013I At root node, 14 cuts changed objective from 0.59349624 to 0.59349624 in 1 passes Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 14 row cuts average 111.5 elements, 0 column cuts (14 active) Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) Cbc0020I Exiting on maximum time Cbc0005I Partial search - best objective 1e+50 (best possible 0.59349624), took 21 iterations and 0 nodes (7200.08 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Outer Approximation decomposition. was tried 1 times and created 14 cuts of which 14 were active after adding rounds of cuts Bonmin finished. No feasible solution found. Best possible: 5.934962e-01 (only reliable for convex models) --- Restarting execution --- tls7.gms(678) 2 Mb --- Reading solution for model m *** Status: Normal completion --- Job tls7.gms Stop 09/08/12 22:08:18 elapsed 2:00:24.876 @04 1347134898 ----------------------------- Sa 8. Sep 22:08:18 CEST 2012 ----------------------------- =ready=