--- Job catmix200 Start 09/21/08 04:14:42 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 --- catmix200.gms(1724) 2 Mb --- Starting execution: elapsed 0:00:00.028 --- catmix200.gms(1720) 3 Mb --- Generating NLP model m --- catmix200.gms(1724) 5 Mb --- 401 rows 604 columns 2,403 non-zeroes --- 23,201 nl-code 2,400 nl-non-zeroes --- catmix200.gms(1724) 3 Mb --- Executing IPOPT: elapsed 0:00:00.068 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...: 2396 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 400 Total number of variables............................: 601 variables with only lower bounds: 0 variables with lower and upper bounds: 201 variables with only upper bounds: 0 Total number of equality constraints.................: 400 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 5.00e-05 2.05e-03 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.9422954e-03 1.93e-06 3.56e-05 -2.4 1.34e-02 - 9.95e-01 1.00e+00f 1 2 -2.8872435e-02 1.32e-04 8.28e-04 -3.1 7.94e-02 - 9.96e-01 1.00e+00f 1 3 -4.9487745e-02 3.22e-04 5.02e-03 -4.0 4.79e-01 - 9.98e-01 1.00e+00h 1 4 -4.6898850e-02 1.06e-04 1.23e-03 -4.3 1.03e+00 - 9.63e-01 7.78e-01h 1 5 -4.7803888e-02 1.54e-04 3.40e-04 -5.0 2.89e-01 - 9.97e-01 1.00e+00h 1 6 -4.7922671e-02 3.52e-05 7.55e-05 -5.9 1.68e-01 - 9.93e-01 1.00e+00h 1 7 -4.8016554e-02 1.55e-05 1.14e-04 -6.5 1.29e-01 - 1.00e+00 1.00e+00h 1 8 -4.8047489e-02 8.50e-06 1.03e-04 -7.0 1.92e-01 - 1.00e+00 1.00e+00h 1 9 -4.8056256e-02 4.25e-06 4.55e-05 -7.6 2.34e-01 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.8058592e-02 2.05e-06 4.08e-05 -8.3 3.26e-01 - 1.00e+00 1.00e+00h 1 11 -4.8059048e-02 1.86e-07 3.41e-06 -9.1 7.53e-02 - 1.00e+00 1.00e+00h 1 12 -4.8059120e-02 3.13e-08 5.06e-07 -9.7 8.32e-02 - 1.00e+00 1.00e+00h 1 13 -4.8059131e-02 3.68e-08 4.36e-07 -10.2 9.60e-02 - 1.00e+00 1.00e+00h 1 14 -4.8059135e-02 8.39e-12 5.01e-08 -11.0 5.01e-04 -4.0 1.00e+00 1.00e+00h 1 15 -4.8059136e-02 2.75e-11 4.21e-08 -11.0 1.26e-03 -4.5 1.00e+00 1.00e+00h 1 16 -4.8059136e-02 3.07e-11 1.38e-08 -11.0 1.25e-03 -5.0 1.00e+00 1.00e+00h 1 17 -4.8059136e-02 1.57e-10 1.05e-08 -11.0 2.83e-03 -5.4 1.00e+00 1.00e+00h 1 18 -4.8059136e-02 5.04e-10 9.19e-09 -11.0 5.07e-03 -5.9 1.00e+00 1.00e+00h 1 Number of Iterations....: 18 (scaled) (unscaled) Objective...............: -4.8059135768418138e-02 -4.8059135768418138e-02 Dual infeasibility......: 9.1861096370663559e-09 9.1861096370663559e-09 Constraint violation....: 5.0372250814945119e-10 5.0372250814945119e-10 Complementarity.........: 1.0000000004923236e-11 1.0000000004923236e-11 Overall NLP error.......: 9.1861096370663559e-09 9.1861096370663559e-09 Number of objective function evaluations = 19 Number of objective gradient evaluations = 19 Number of equality constraint evaluations = 19 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 19 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 18 Total CPU secs in IPOPT (w/o function evaluations) = 0.136 Total CPU secs in NLP function evaluations = 0.044 EXIT: Optimal Solution Found. GAMS/Ipopt finished. --- Restarting execution --- catmix200.gms(1724) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job catmix200.gms Stop 09/21/08 04:14:42 elapsed 0:00:00.312