Total number of variables 103 variables with only lower bounds 82 variables with lower and upper bounds 2 variables with only u

The total number of variables in the problem is 103. Out of these, 82 variables have only lower bounds, 2 variables have both lower and upper bounds, and 4 variables have only upper bounds. The total number of equality constraints is 102, and the total number of inequality constraints is 78. All 78 inequality constraints have only lower bounds.

The optimization algorithm took 124 iterations to find the optimal solution.

The objective value of the optimal solution is -6.4471160590976481e+001.

The dual infeasibility and constraint violation are both very small, on the order of 1e-012 and 1e-017 respectively.

The complementarity, which measures the satisfaction of the KKT conditions, is also very small, on the order of 1e-011.

The overall NLP error, which combines all the error measures, is also on the order of 1e-011.

During the optimization process, the objective function was evaluated 242 times, the objective gradient was evaluated 108 times, the equality constraints were evaluated 242 times, and the inequality constraints were evaluated 242 times.

The Jacobians of the equality and inequality constraints were evaluated 131 times each.

The Lagrangian Hessian, which measures the curvature of the objective and constraint functions, was not evaluated in this problem.

The total CPU time used by the IPOPT optimization algorithm, excluding the function evaluations, was 0.26 seconds. The total CPU time used for the function evaluations was 0.76 seconds.

The optimization algorithm exited with the message "Optimal Solution Found.