--- Job polygon100 Start 09/21/08 05:44:54 LNX-LX3 22.9.0 x86/Linux GAMS Rev 229 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** ************* ALFA release *** GAMS Base Module ALFA 10Sep08 22.9.0 LNX 6574.6578 LX3 x86/Linux *** ************* ALFA release Licensee: Stefan Vigerske G080908/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- polygon100.gms(11045) 3 Mb --- Starting execution: elapsed 0:00:00.210 --- polygon100.gms(11041) 4 Mb --- Generating NLP model m --- polygon100.gms(11045) 7 Mb --- 5,050 rows 201 columns 20,199 non-zeroes --- 190,582 nl-code 20,000 nl-non-zeroes --- polygon100.gms(11045) 5 Mb --- Executing IPOPT: elapsed 0:00:00.482 GAMS/Ipopt NLP Solver (IPOPT Library 3.5) written by A. Waechter List of user-set options: Name Value used acceptable_tol = 1e-08 yes compl_inf_tol = 0.0001 yes constr_viol_tol = 0.0001 yes linear_solver = mumps yes tol = 1e-08 yes ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Common Public License (CPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.5stable, running with linear solver mumps. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 19799 Number of nonzeros in Lagrangian Hessian.............: 19701 Total number of variables............................: 198 variables with only lower bounds: 0 variables with lower and upper bounds: 198 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 5049 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 5049 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -8.4342232e-01 1.59e-01 1.34e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -8.2486730e-01 1.02e-01 2.19e+00 -2.2 1.10e-01 - 1.44e-01 3.60e-01h 1 2 -7.5682298e-01 5.32e-03 1.32e+00 -1.4 1.04e-01 - 5.33e-01 1.00e+00f 1 3 -7.5495465e-01 7.90e-06 4.57e-02 -6.6 2.15e-03 - 9.83e-01 1.00e+00h 1 4 -7.5589230e-01 2.28e-05 1.39e-03 -4.5 6.14e-03 - 9.74e-01 1.00e+00h 1 5 -7.7183020e-01 2.63e-04 3.38e-04 -5.4 3.38e-02 -2.0 1.00e+00 1.00e+00h 1 6 -7.7845141e-01 6.14e-05 4.30e-04 -5.2 1.60e-02 -1.6 1.00e+00 9.63e-01h 1 7 -7.8012749e-01 2.59e-04 3.44e-03 -4.9 2.68e-02 -2.1 1.00e+00 5.89e-01h 1 8 -7.8278860e-01 5.05e-05 5.36e-04 -5.2 7.14e-03 -1.6 1.00e+00 9.45e-01h 1 9 -7.8451184e-01 4.14e-05 3.51e-03 -5.7 1.49e-02 -2.1 9.96e-01 5.08e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -7.8483893e-01 1.35e-04 1.39e-03 -5.8 1.40e-02 -2.6 1.00e+00 8.06e-01h 1 11 -7.8485874e-01 1.43e-04 5.30e-04 -5.8 9.77e-03 -3.1 1.00e+00 8.31e-01h 1 12 -7.8496105e-01 2.68e-05 1.12e-05 -6.2 4.51e-03 -2.6 1.00e+00 9.95e-01h 1 13 -7.8501464e-01 2.59e-06 1.53e-05 -7.1 1.32e-03 -2.2 1.00e+00 9.86e-01h 1 14 -7.8501477e-01 3.82e-06 3.91e-03 -6.8 2.04e-02 -2.7 1.00e+00 1.02e-01h 1 15 -7.8503492e-01 8.11e-05 5.94e-03 -7.0 9.84e-02 - 1.00e+00 1.27e-01h 1 16 -7.8573745e-01 3.48e-03 1.51e-04 -7.4 8.53e-02 - 1.00e+00 1.00e+00h 1 17 -7.8507061e-01 1.28e-04 4.81e-06 -8.2 1.15e-02 - 1.00e+00 1.00e+00h 1 18 -7.8505632e-01 1.12e-06 3.23e-08 -10.2 1.29e-03 - 1.00e+00 1.00e+00h 1 19 -7.8505614e-01 3.04e-10 8.78e-12 -11.0 3.11e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 19 (scaled) (unscaled) Objective...............: -7.8505613657844109e-01 -7.8505613657844109e-01 Dual infeasibility......: 8.7766748661835132e-12 8.7766748661835132e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0856246389427674e-11 1.0856246389427674e-11 Overall NLP error.......: 1.0856246389427674e-11 1.0856246389427674e-11 Number of objective function evaluations = 20 Number of objective gradient evaluations = 20 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 20 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 20 Number of Lagrangian Hessian evaluations = 19 Total CPU secs in IPOPT (w/o function evaluations) = 2.432 Total CPU secs in NLP function evaluations = 5.332 EXIT: Optimal Solution Found. GAMS/Ipopt finished. --- Restarting execution --- polygon100.gms(11045) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job polygon100.gms Stop 09/21/08 05:45:03 elapsed 0:00:09.041