Package evaluation of MathOptSymbolicAD on Julia 1.11.4 (a71dd056e0*) started at 2025-04-08T19:07:38.808 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.04s ################################################################################ # Installation # Installing MathOptSymbolicAD... Resolving package versions... Updating `~/.julia/environments/v1.11/Project.toml` [309f4015] + MathOptSymbolicAD v0.2.2 Updating `~/.julia/environments/v1.11/Manifest.toml` [47edcb42] + ADTypes v1.14.0 [1520ce14] + AbstractTrees v0.4.5 [7d9f7c33] + Accessors v0.1.42 [79e6a3ab] + Adapt v4.3.0 [66dad0bd] + AliasTables v1.1.3 [4fba245c] + ArrayInterface v7.18.0 [6e4b80f9] + BenchmarkTools v1.6.0 [e2ed5e7c] + Bijections v0.1.9 [d360d2e6] + ChainRulesCore v1.25.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.0.2 [38540f10] + CommonSolve v0.2.4 [bbf7d656] + CommonSubexpressions v0.3.1 [f70d9fcc] + CommonWorldInvalidations v1.0.0 [34da2185] + Compat v4.16.0 [b152e2b5] + CompositeTypes v0.1.4 [a33af91c] + CompositionsBase v0.1.2 [187b0558] + ConstructionBase v1.5.8 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [31c24e10] + Distributions v0.25.118 [ffbed154] + DocStringExtensions v0.9.4 [5b8099bc] + DomainSets v0.7.15 [7c1d4256] + DynamicPolynomials v0.6.1 [4e289a0a] + EnumX v1.0.5 [e2ba6199] + ExprTools v0.1.10 [55351af7] + ExproniconLite v0.10.14 [1a297f60] + FillArrays v1.13.0 [1fa38f19] + Format v1.3.7 [f6369f11] + ForwardDiff v1.0.1 [069b7b12] + FunctionWrappers v1.1.3 [77dc65aa] + FunctionWrappersWrappers v0.1.3 [46192b85] + GPUArraysCore v0.2.0 [34004b35] + HypergeometricFunctions v0.3.28 [18e54dd8] + IntegerMathUtils v0.1.2 [8197267c] + IntervalSets v0.7.10 [3587e190] + InverseFunctions v0.1.17 [92d709cd] + IrrationalConstants v0.2.4 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.2 [ae98c720] + Jieko v0.2.1 [b964fa9f] + LaTeXStrings v1.4.0 [23fbe1c1] + Latexify v0.16.7 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [b8f27783] + MathOptInterface v1.38.1 [309f4015] + MathOptSymbolicAD v0.2.2 [e1d29d7a] + Missings v1.2.0 [2e0e35c7] + Moshi v0.3.5 [102ac46a] + MultivariatePolynomials v0.5.7 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [6fe1bfb0] + OffsetArrays v1.16.0 [bac558e1] + OrderedCollections v1.8.0 [90014a1f] + PDMats v0.11.33 [69de0a69] + Parsers v2.8.1 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [27ebfcd6] + Primes v0.5.7 [43287f4e] + PtrArrays v1.3.0 [1fd47b50] + QuadGK v2.11.2 [3cdcf5f2] + RecipesBase v1.3.4 [731186ca] + RecursiveArrayTools v3.31.2 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [79098fc4] + Rmath v0.8.0 [7e49a35a] + RuntimeGeneratedFunctions v0.5.13 [0bca4576] + SciMLBase v2.82.1 [c0aeaf25] + SciMLOperators v0.3.13 [53ae85a6] + SciMLStructures v1.7.0 [efcf1570] + Setfield v1.1.2 [a2af1166] + SortingAlgorithms v1.2.1 [276daf66] + SpecialFunctions v2.5.0 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.0 [2913bbd2] + StatsBase v0.34.4 [4c63d2b9] + StatsFuns v1.4.0 [856f2bd8] + StructTypes v1.11.0 [2efcf032] + SymbolicIndexingInterface v0.3.38 [19f23fe9] + SymbolicLimits v0.2.2 [d1185830] + SymbolicUtils v3.25.1 [0c5d862f] + Symbolics v6.37.1 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.0 [ed4db957] + TaskLocalValues v0.1.2 [8ea1fca8] + TermInterface v2.0.0 [a759f4b9] + TimerOutputs v0.5.28 [3bb67fe8] + TranscodingStreams v0.11.3 [a7c27f48] + Unityper v0.1.6 [897b6980] + WeakValueDicts v0.1.0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f50d1b31] + Rmath_jll v0.5.1+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.11.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.11.0 [4607b0f0] + SuiteSparse [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [4536629a] + OpenBLAS_jll v0.3.27+1 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.7.0+0 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 4.65s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 232.82s ################################################################################ # Testing # Testing MathOptSymbolicAD Status `/tmp/jl_i0lvwn/Project.toml` [b6b21f68] Ipopt v1.8.0 [4076af6c] JuMP v1.25.0 [b8f27783] MathOptInterface v1.38.1 [309f4015] MathOptSymbolicAD v0.2.2 [c36e90e8] PowerModels v0.21.3 [276daf66] SpecialFunctions v2.5.0 [37e2e46d] LinearAlgebra v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_i0lvwn/Manifest.toml` [47edcb42] ADTypes v1.14.0 [1520ce14] AbstractTrees v0.4.5 [7d9f7c33] Accessors v0.1.42 [79e6a3ab] Adapt v4.3.0 [66dad0bd] AliasTables v1.1.3 [4fba245c] ArrayInterface v7.18.0 [6e4b80f9] BenchmarkTools v1.6.0 [e2ed5e7c] Bijections v0.1.9 [d360d2e6] ChainRulesCore v1.25.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.2 [38540f10] CommonSolve v0.2.4 [bbf7d656] CommonSubexpressions v0.3.1 [f70d9fcc] CommonWorldInvalidations v1.0.0 [34da2185] Compat v4.16.0 [b152e2b5] CompositeTypes v0.1.4 [a33af91c] CompositionsBase v0.1.2 [187b0558] ConstructionBase v1.5.8 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [a0c0ee7d] DifferentiationInterface v0.6.50 [b4f34e82] Distances v0.10.12 [31c24e10] Distributions v0.25.118 [ffbed154] DocStringExtensions v0.9.4 [5b8099bc] DomainSets v0.7.15 [7c1d4256] DynamicPolynomials v0.6.1 [4e289a0a] EnumX v1.0.5 [e2ba6199] ExprTools v0.1.10 [55351af7] ExproniconLite v0.10.14 [1a297f60] FillArrays v1.13.0 [6a86dc24] FiniteDiff v2.27.0 [1fa38f19] Format v1.3.7 [f6369f11] ForwardDiff v1.0.1 [069b7b12] FunctionWrappers v1.1.3 [77dc65aa] FunctionWrappersWrappers v0.1.3 [46192b85] GPUArraysCore v0.2.0 [34004b35] HypergeometricFunctions v0.3.28 [2030c09a] InfrastructureModels v0.7.8 [18e54dd8] IntegerMathUtils v0.1.2 [8197267c] IntervalSets v0.7.10 [3587e190] InverseFunctions v0.1.17 [b6b21f68] Ipopt v1.8.0 [92d709cd] IrrationalConstants v0.2.4 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.2 [ae98c720] Jieko v0.2.1 [4076af6c] JuMP v1.25.0 [b964fa9f] LaTeXStrings v1.4.0 [23fbe1c1] Latexify v0.16.7 [d3d80556] LineSearches v7.3.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [b8f27783] MathOptInterface v1.38.1 [309f4015] MathOptSymbolicAD v0.2.2 [f28f55f0] Memento v1.4.1 [e1d29d7a] Missings v1.2.0 [2e0e35c7] Moshi v0.3.5 [102ac46a] MultivariatePolynomials v0.5.7 [d8a4904e] MutableArithmetics v1.6.4 [d41bc354] NLSolversBase v7.9.1 [2774e3e8] NLsolve v4.5.1 [77ba4419] NaNMath v1.1.3 [6fe1bfb0] OffsetArrays v1.16.0 [bac558e1] OrderedCollections v1.8.0 [90014a1f] PDMats v0.11.33 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.1 [c36e90e8] PowerModels v0.21.3 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [27ebfcd6] Primes v0.5.7 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [3cdcf5f2] RecipesBase v1.3.4 [731186ca] RecursiveArrayTools v3.31.2 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.8.0 [7e49a35a] RuntimeGeneratedFunctions v0.5.13 [0bca4576] SciMLBase v2.82.1 [c0aeaf25] SciMLOperators v0.3.13 [53ae85a6] SciMLStructures v1.7.0 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.1 [276daf66] SpecialFunctions v2.5.0 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.0 [2913bbd2] StatsBase v0.34.4 [4c63d2b9] StatsFuns v1.4.0 [856f2bd8] StructTypes v1.11.0 [2efcf032] SymbolicIndexingInterface v0.3.38 [19f23fe9] SymbolicLimits v0.2.2 [d1185830] SymbolicUtils v3.25.1 [0c5d862f] Symbolics v6.37.1 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.0 [ed4db957] TaskLocalValues v0.1.2 [8ea1fca8] TermInterface v2.0.0 [a759f4b9] TimerOutputs v0.5.28 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [a7c27f48] Unityper v0.1.6 [897b6980] WeakValueDicts v0.1.0 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [e33a78d0] Hwloc_jll v2.12.0+0 [9cc047cb] Ipopt_jll v300.1400.1700+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.700.301+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f50d1b31] Rmath_jll v0.5.1+0 ⌅ [319450e9] SPRAL_jll v2024.5.8+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.11.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.6.0+0 [e37daf67] LibGit2_jll v1.7.2+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.6+0 [14a3606d] MozillaCACerts_jll v2023.12.12 [4536629a] OpenBLAS_jll v0.3.27+1 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.7.0+0 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.59.0+0 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling PowerModels... 2623.6 ms ✓ NLSolversBase 5182.4 ms ✓ LineSearches 3459.8 ms ✓ NLsolve 33439.8 ms ✓ PowerModels 4 dependencies successfully precompiled in 47 seconds. 78 already precompiled. Precompiling DifferentiationInterfaceSymbolicsExt... 10519.0 ms ✓ DifferentiationInterface → DifferentiationInterfaceSymbolicsExt 1 dependency successfully precompiled in 14 seconds. 151 already precompiled. [info | PowerModels]: extending matpower format with data: areas 1x3 [info | PowerModels]: removing 1 cost terms from generator 4: [4000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 1: [1400.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 5: [1000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 2: [1500.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 3: [3000.0, 0.0] [ Info: Solving with SparseReverseMode ****************************************************************************** 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 https://github.com/coin-or/Ipopt ****************************************************************************** This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 264 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 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.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.35e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 1.82e-14 6.53e-10 -5.7 5.20e-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.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 4.15e-14 1.75e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486897e+02 1.7551890838594758e+04 Dual infeasibility......: 1.7531755993180977e-12 7.0127023972723909e-11 Constraint violation....: 2.6840041300602028e-14 4.1522341120980855e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302142944e-09 1.0023630520857177e-07 Overall NLP error.......: 2.5059076302142944e-09 1.0023630520857177e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 16.544 EXIT: Optimal Solution Found. Timing statistics - 0.001542806625366211 - 0.00037169456481933594 - 3.036228656768799 [ Info: Solving with serial MathOptSymbolicAD This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 63 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 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.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.35e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 6.08e-14 6.53e-10 -5.7 5.20e-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.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 1.81e-14 3.57e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486926e+02 1.7551890838594769e+04 Dual infeasibility......: 3.5721650023047801e-12 1.4288660009219120e-10 Constraint violation....: 1.8145207558717402e-14 1.8145207558717402e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302143490e-09 1.0023630520857396e-07 Overall NLP error.......: 2.5059076302143490e-09 1.0023630520857396e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 6.305 EXIT: Optimal Solution Found. Timing statistics - 0.4682748317718506 - 2.1045093536376953 - 2.9588141441345215 [ Info: Solving with threaded MathOptSymbolicAD This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 240 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 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.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.35e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 3.24e-14 6.53e-10 -5.7 5.20e-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.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 3.52e-14 2.72e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486886e+02 1.7551890838594754e+04 Dual infeasibility......: 2.7181378035088960e-12 1.0872551214035584e-10 Constraint violation....: 2.4619195571062846e-14 3.5166314305001833e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302143697e-09 1.0023630520857479e-07 Overall NLP error.......: 2.5059076302143697e-09 1.0023630520857479e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 1.445 EXIT: Optimal Solution Found. Timing statistics - 0.19374561309814453 - 0.33852338790893555 - 0.25498318672180176 [ Info: Validating solutions Errors = (-4.884981308350689e-14, 2.2870594307278225e-14) Test Summary: | Pass Total Time test_case5_pjm_solution | 2 2 3m39.3s [ Info: Constructing oracles 0.028527 seconds (5.41 k allocations: 266.945 KiB, 96.95% compilation time) [ Info: MOI.initialize 2.103593 seconds (892.28 k allocations: 48.203 MiB, 93.59% compilation time) [ Info: MOI.eval_objective 0.787537 seconds (186.16 k allocations: 8.771 MiB, 99.99% compilation time) 0.000013 seconds (2 allocations: 32 bytes) [ Info: MOI.eval_objective_gradient 1.349828 seconds (238.65 k allocations: 11.423 MiB, 100.00% compilation time) 0.000010 seconds (1 allocation: 16 bytes) [ Info: MOI.eval_constraint 0.063294 seconds (12.17 k allocations: 711.812 KiB, 99.88% compilation time) 0.000005 seconds (20 allocations: 320 bytes) [ Info: MOI.jacobian_structure 0.000003 seconds (3 allocations: 928 bytes) [ Info: MOI.eval_constraint_jacobian 0.084641 seconds (15.16 k allocations: 863.602 KiB, 99.91% compilation time) 0.000007 seconds (10 allocations: 160 bytes) [ Info: MOI.hessian_lagrangian_structure 0.000028 seconds (13 allocations: 5.062 KiB) [ Info: MOI.eval_hessian_lagrangian 1.186803 seconds (222.72 k allocations: 10.996 MiB, 99.98% compilation time) 0.000017 seconds (11 allocations: 176 bytes) [ Info: Constructing oracles 0.000010 seconds (11 allocations: 1.750 KiB) [ Info: MOI.initialize 0.000300 seconds (970 allocations: 105.078 KiB) [ Info: MOI.eval_objective 0.000051 seconds 0.000001 seconds [ Info: MOI.eval_objective_gradient 0.000008 seconds 0.000001 seconds [ Info: MOI.eval_constraint 0.000001 seconds 0.000001 seconds [ Info: MOI.jacobian_structure 0.000002 seconds (3 allocations: 928 bytes) [ Info: MOI.eval_constraint_jacobian 0.000004 seconds 0.000003 seconds [ Info: MOI.hessian_lagrangian_structure 0.000000 seconds [ Info: MOI.eval_hessian_lagrangian 0.000045 seconds 0.000022 seconds Error = -3.0517578125e-5 Error = 0.0 Error = 0.0 Error = 0.0 Error = 0.0 [ Info: Solving with SparseReverseMode This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 42 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.051 EXIT: Optimal Solution Found. Timing statistics - 3.814697265625e-6 - 2.193450927734375e-5 - 0.0001461505889892578 [ Info: Solving with serial MathOptSymbolicAD This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 42 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.004 EXIT: Optimal Solution Found. Timing statistics - 5.0067901611328125e-6 - 2.2411346435546875e-5 - 0.00012373924255371094 [ Info: Solving with threaded MathOptSymbolicAD This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 42 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.004 EXIT: Optimal Solution Found. Timing statistics - 3.0994415283203125e-6 - 2.1219253540039062e-5 - 0.0001163482666015625 [ Info: Validating solutions Errors = (0.0, 0.0) [ Info: Constructing oracles 0.003734 seconds (21.88 k allocations: 1015.383 KiB) [ Info: MOI.initialize 2.629266 seconds (3.80 M allocations: 165.587 MiB, 8.61% gc time, 8.89% compilation time) [ Info: MOI.eval_objective 26.601257 seconds (2.00 M allocations: 90.665 MiB, 100.00% compilation time) 0.000070 seconds (2 allocations: 32 bytes) [ Info: MOI.eval_objective_gradient 21.618255 seconds (2.51 M allocations: 116.548 MiB, 1.33% gc time, 100.00% compilation time) 0.000053 seconds (1 allocation: 16 bytes) [ Info: MOI.eval_constraint 0.000137 seconds (200 allocations: 3.125 KiB) 0.000027 seconds (200 allocations: 3.125 KiB) [ Info: MOI.jacobian_structure 0.001390 seconds (7 allocations: 14.797 KiB) [ Info: MOI.eval_constraint_jacobian 0.000097 seconds (100 allocations: 1.562 KiB) 0.000040 seconds (100 allocations: 1.562 KiB) [ Info: MOI.hessian_lagrangian_structure 0.000087 seconds (29 allocations: 56.055 KiB) [ Info: MOI.eval_hessian_lagrangian 18.876416 seconds (2.22 M allocations: 104.290 MiB, 0.55% gc time, 100.00% compilation time) 0.000076 seconds (101 allocations: 1.578 KiB) [ Info: Constructing oracles 0.001665 seconds (16 allocations: 15.164 KiB) [ Info: MOI.initialize 0.001786 seconds (8.40 k allocations: 946.461 KiB) [ Info: MOI.eval_objective 0.000268 seconds 0.000001 seconds [ Info: MOI.eval_objective_gradient 0.000016 seconds 0.000010 seconds [ Info: MOI.eval_constraint 0.000007 seconds 0.000003 seconds [ Info: MOI.jacobian_structure 0.000021 seconds (7 allocations: 14.797 KiB) [ Info: MOI.eval_constraint_jacobian 0.000024 seconds 0.000021 seconds [ Info: MOI.hessian_lagrangian_structure 0.000000 seconds [ Info: MOI.eval_hessian_lagrangian 0.000293 seconds 0.000216 seconds Error = -6.103515625e-5 Error = 0.0 Error = 0.0 Error = 0.0 Error = 0.0 [ Info: Solving with SparseReverseMode This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 800 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 402 Total number of variables............................: 303 variables with only lower bounds: 0 variables with lower and upper bounds: 202 variables with only upper bounds: 0 Total number of equality constraints.................: 200 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 2.0 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.5 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.0 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.010 EXIT: Optimal Solution Found. Timing statistics - 3.981590270996094e-5 - 0.0002009868621826172 - 0.0010688304901123047 [ Info: Solving with serial MathOptSymbolicAD This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 800 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 402 Total number of variables............................: 303 variables with only lower bounds: 0 variables with lower and upper bounds: 202 variables with only upper bounds: 0 Total number of equality constraints.................: 200 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 2.0 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.5 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.0 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.010 EXIT: Optimal Solution Found. Timing statistics - 3.5762786865234375e-5 - 0.0001952648162841797 - 0.001117706298828125 [ Info: Solving with threaded MathOptSymbolicAD This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 800 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 402 Total number of variables............................: 303 variables with only lower bounds: 0 variables with lower and upper bounds: 202 variables with only upper bounds: 0 Total number of equality constraints.................: 200 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 2.0 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.5 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.0 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.010 EXIT: Optimal Solution Found. Timing statistics - 2.9087066650390625e-5 - 0.00017023086547851562 - 0.0010645389556884766 [ Info: Validating solutions Errors = (0.0, 0.0) Test Summary: | Pass Total Time test_clnlbeam | 16 16 1m32.8s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 2.4502501e-01 0.00e+00 9.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2159585e-01 0.00e+00 4.38e-01 -1.7 2.43e-02 - 5.35e-01 1.00e+00f 1 2 9.3033792e-05 0.00e+00 1.11e-16 -1.7 4.61e-01 - 1.00e+00 1.00e+00f 1 3 1.8860159e-03 0.00e+00 5.55e-17 -1.7 3.38e-02 - 1.00e+00 1.00e+00f 1 4 1.4999530e-03 0.00e+00 9.71e-17 -2.5 4.70e-03 - 1.00e+00 1.00e+00f 1 5 4.3793932e-04 0.00e+00 6.25e-17 -3.8 1.78e-02 - 1.00e+00 1.00e+00f 1 6 1.1024717e-04 0.00e+00 6.25e-17 -5.7 1.04e-02 - 1.00e+00 1.00e+00f 1 7 2.8016680e-05 0.00e+00 3.12e-17 -5.7 5.21e-03 - 1.00e+00 1.00e+00f 1 8 7.4703892e-06 0.00e+00 7.81e-17 -5.7 2.56e-03 - 1.00e+00 1.00e+00f 1 9 1.8694878e-06 0.00e+00 3.79e-06 -8.6 1.37e-03 - 9.99e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.6864064e-07 0.00e+00 7.35e-17 -8.6 6.83e-04 - 1.00e+00 1.00e+00f 1 11 1.1778532e-07 0.00e+00 3.46e-17 -8.6 3.41e-04 - 1.00e+00 1.00e+00f 1 12 3.0075043e-08 0.00e+00 8.57e-18 -8.6 1.70e-04 - 1.00e+00 1.00e+00f 1 13 8.1576980e-09 0.00e+00 3.26e-17 -8.6 8.31e-05 - 1.00e+00 1.00e+00f 1 14 2.2727905e-09 0.00e+00 6.41e-17 -9.0 4.26e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 2.2727904632420086e-09 2.2727904632420086e-09 Dual infeasibility......: 6.4130558502517587e-17 6.4130558502517587e-17 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.5466210953947614e-09 4.5466210953947614e-09 Overall NLP error.......: 4.5466210953947614e-09 4.5466210953947614e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 14 Total seconds in IPOPT = 0.135 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_constant_subexpressions | 2 2 6.6s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 2.4502501e-01 0.00e+00 9.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2159585e-01 0.00e+00 4.38e-01 -1.7 2.43e-02 - 5.35e-01 1.00e+00f 1 2 9.3033792e-05 0.00e+00 1.11e-16 -1.7 4.61e-01 - 1.00e+00 1.00e+00f 1 3 1.8860159e-03 0.00e+00 5.55e-17 -1.7 3.38e-02 - 1.00e+00 1.00e+00f 1 4 1.4999530e-03 0.00e+00 9.71e-17 -2.5 4.70e-03 - 1.00e+00 1.00e+00f 1 5 4.3793932e-04 0.00e+00 6.25e-17 -3.8 1.78e-02 - 1.00e+00 1.00e+00f 1 6 1.1024717e-04 0.00e+00 6.25e-17 -5.7 1.04e-02 - 1.00e+00 1.00e+00f 1 7 2.8016680e-05 0.00e+00 3.12e-17 -5.7 5.21e-03 - 1.00e+00 1.00e+00f 1 8 7.4703892e-06 0.00e+00 7.81e-17 -5.7 2.56e-03 - 1.00e+00 1.00e+00f 1 9 1.8694878e-06 0.00e+00 3.79e-06 -8.6 1.37e-03 - 9.99e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.6864064e-07 0.00e+00 7.35e-17 -8.6 6.83e-04 - 1.00e+00 1.00e+00f 1 11 1.1778532e-07 0.00e+00 3.46e-17 -8.6 3.41e-04 - 1.00e+00 1.00e+00f 1 12 3.0075043e-08 0.00e+00 8.57e-18 -8.6 1.70e-04 - 1.00e+00 1.00e+00f 1 13 8.1576981e-09 0.00e+00 3.26e-17 -8.6 8.31e-05 - 1.00e+00 1.00e+00f 1 14 2.2727905e-09 0.00e+00 6.41e-17 -9.0 4.26e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 2.2727905113484326e-09 2.2727905113484326e-09 Dual infeasibility......: 6.4130558502517587e-17 6.4130558502517587e-17 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.5466210953947614e-09 4.5466210953947614e-09 Overall NLP error.......: 4.5466210953947614e-09 4.5466210953947614e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.006 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_constant_subexpressions_expr | 2 2 0.9s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.1880998e-02 0.00e+00 2.18e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.5963933e-02 0.00e+00 0.00e+00 -1.7 1.73e-02 - 1.00e+00 1.00e+00f 1 2 1.3251897e-02 0.00e+00 6.94e-18 -2.5 1.12e-02 - 1.00e+00 1.00e+00f 1 3 1.0497181e-02 0.00e+00 1.47e-17 -3.8 1.27e-02 - 1.00e+00 1.00e+00f 1 4 1.0013553e-02 0.00e+00 1.58e-17 -5.7 2.39e-03 - 1.00e+00 1.00e+00f 1 5 1.0000010e-02 0.00e+00 7.94e-18 -8.6 6.77e-05 - 1.00e+00 1.00e+00f 1 6 9.9999989e-03 0.00e+00 1.47e-18 -9.0 5.44e-08 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: 9.9999989090969899e-03 9.9999989090969899e-03 Dual infeasibility......: 1.4669405030701686e-18 1.4669405030701686e-18 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 5.4545152006202358e-09 5.4545152006202358e-09 Complementarity.........: 9.0909691382780763e-10 9.0909691382780763e-10 Overall NLP error.......: 9.0909691382780763e-10 9.0909691382780763e-10 Number of objective function evaluations = 7 Number of objective gradient evaluations = 7 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 6 Total seconds in IPOPT = 0.050 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_default_parameter | 3 3 6.9s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 7.8537938e-01 0.00e+00 9.55e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 7.6300033e-01 0.00e+00 3.31e-01 -1.7 2.62e-02 - 5.88e-01 1.00e+00f 1 2 6.9477235e-01 0.00e+00 5.05e-01 -1.7 1.82e-01 - 1.00e+00 1.00e+00f 1 3 6.9244519e-01 0.00e+00 4.38e-03 -1.7 3.50e-02 - 1.00e+00 1.00e+00f 1 4 6.9220133e-01 0.00e+00 6.43e-04 -3.8 1.51e-02 - 1.00e+00 1.00e+00f 1 5 6.9220063e-01 0.00e+00 1.93e-06 -5.7 8.66e-04 - 1.00e+00 1.00e+00f 1 6 6.9220063e-01 0.00e+00 1.16e-13 -8.6 2.13e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: 6.9220062755534639e-01 6.9220062755534639e-01 Dual infeasibility......: 1.1648783676478265e-13 1.1648783676478265e-13 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5073294875845220e-09 2.5073294875845220e-09 Overall NLP error.......: 2.5073294875845220e-09 2.5073294875845220e-09 Number of objective function evaluations = 7 Number of objective gradient evaluations = 7 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 6 Total seconds in IPOPT = 0.319 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_default_x_to_x | 2 2 2.9s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.0000000e+00 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0000000e+00 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 1.0000000e+00 0.00e+00 0.00e+00 -3.8 0.00e+00 - 1.00e+00 1.00e+00T 0 3 1.0000000e+00 0.00e+00 0.00e+00 -5.7 0.00e+00 - 1.00e+00 1.00e+00T 0 4 1.0000000e+00 0.00e+00 0.00e+00 -8.6 0.00e+00 - 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: -1.0000000000000000e+00 1.0000000000000000e+00 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596800808e-09 2.5059035596800808e-09 Overall NLP error.......: 2.5059035596800808e-09 2.5059035596800808e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.157 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_logic_comparison_expr | 1 1 6.0s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 1.0000000e+00 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0000000e+00 0.00e+00 0.00e+00 -1.7 0.00e+00 - 1.00e+00 1.00e+00 0 2 1.0000000e+00 0.00e+00 0.00e+00 -3.8 0.00e+00 - 1.00e+00 1.00e+00T 0 3 1.0000000e+00 0.00e+00 0.00e+00 -5.7 0.00e+00 - 1.00e+00 1.00e+00T 0 4 1.0000000e+00 0.00e+00 0.00e+00 -8.6 0.00e+00 - 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: -1.0000000000000000e+00 1.0000000000000000e+00 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596800808e-09 2.5059035596800808e-09 Overall NLP error.......: 2.5059035596800808e-09 2.5059035596800808e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.151 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_logic_comparison_or_expr | 1 1 0.8s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 2.4502501e-01 0.00e+00 9.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2159585e-01 0.00e+00 4.38e-01 -1.7 2.43e-02 - 5.35e-01 1.00e+00f 1 2 9.3033792e-05 0.00e+00 1.11e-16 -1.7 4.61e-01 - 1.00e+00 1.00e+00f 1 3 1.8860159e-03 0.00e+00 5.55e-17 -1.7 3.38e-02 - 1.00e+00 1.00e+00f 1 4 1.4999530e-03 0.00e+00 9.71e-17 -2.5 4.70e-03 - 1.00e+00 1.00e+00f 1 5 4.3793932e-04 0.00e+00 6.25e-17 -3.8 1.78e-02 - 1.00e+00 1.00e+00f 1 6 1.1024717e-04 0.00e+00 6.25e-17 -5.7 1.04e-02 - 1.00e+00 1.00e+00f 1 7 2.8016680e-05 0.00e+00 3.12e-17 -5.7 5.21e-03 - 1.00e+00 1.00e+00f 1 8 7.4703892e-06 0.00e+00 7.81e-17 -5.7 2.56e-03 - 1.00e+00 1.00e+00f 1 9 1.8694878e-06 0.00e+00 3.79e-06 -8.6 1.37e-03 - 9.99e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.6864064e-07 0.00e+00 7.35e-17 -8.6 6.83e-04 - 1.00e+00 1.00e+00f 1 11 1.1778532e-07 0.00e+00 3.46e-17 -8.6 3.41e-04 - 1.00e+00 1.00e+00f 1 12 3.0075043e-08 0.00e+00 8.57e-18 -8.6 1.70e-04 - 1.00e+00 1.00e+00f 1 13 8.1576980e-09 0.00e+00 3.26e-17 -8.6 8.31e-05 - 1.00e+00 1.00e+00f 1 14 2.2727905e-09 0.00e+00 6.41e-17 -9.0 4.26e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 2.2727904632420086e-09 2.2727904632420086e-09 Dual infeasibility......: 6.4130558502517587e-17 6.4130558502517587e-17 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.5466210953947614e-09 4.5466210953947614e-09 Overall NLP error.......: 4.5466210953947614e-09 4.5466210953947614e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 14 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_nested_subexpressions | 2 2 0.3s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 2.4502501e-01 0.00e+00 9.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2159585e-01 0.00e+00 4.38e-01 -1.7 2.43e-02 - 5.35e-01 1.00e+00f 1 2 9.3033792e-05 0.00e+00 1.11e-16 -1.7 4.61e-01 - 1.00e+00 1.00e+00f 1 3 1.8860159e-03 0.00e+00 5.55e-17 -1.7 3.38e-02 - 1.00e+00 1.00e+00f 1 4 1.4999530e-03 0.00e+00 9.71e-17 -2.5 4.70e-03 - 1.00e+00 1.00e+00f 1 5 4.3793932e-04 0.00e+00 6.25e-17 -3.8 1.78e-02 - 1.00e+00 1.00e+00f 1 6 1.1024717e-04 0.00e+00 6.25e-17 -5.7 1.04e-02 - 1.00e+00 1.00e+00f 1 7 2.8016680e-05 0.00e+00 3.12e-17 -5.7 5.21e-03 - 1.00e+00 1.00e+00f 1 8 7.4703892e-06 0.00e+00 7.81e-17 -5.7 2.56e-03 - 1.00e+00 1.00e+00f 1 9 1.8694878e-06 0.00e+00 3.79e-06 -8.6 1.37e-03 - 9.99e-01 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.6864064e-07 0.00e+00 7.35e-17 -8.6 6.83e-04 - 1.00e+00 1.00e+00f 1 11 1.1778532e-07 0.00e+00 3.46e-17 -8.6 3.41e-04 - 1.00e+00 1.00e+00f 1 12 3.0075043e-08 0.00e+00 8.57e-18 -8.6 1.70e-04 - 1.00e+00 1.00e+00f 1 13 8.1576981e-09 0.00e+00 3.26e-17 -8.6 8.31e-05 - 1.00e+00 1.00e+00f 1 14 2.2727905e-09 0.00e+00 6.41e-17 -9.0 4.26e-05 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 14 (scaled) (unscaled) Objective...............: 2.2727905113484326e-09 2.2727905113484326e-09 Dual infeasibility......: 6.4130558502517587e-17 6.4130558502517587e-17 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.5466210953947614e-09 4.5466210953947614e-09 Overall NLP error.......: 4.5466210953947614e-09 4.5466210953947614e-09 Number of objective function evaluations = 15 Number of objective gradient evaluations = 15 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_nested_subexpressions_expr | 2 2 0.1s [info | PowerModels]: extending matpower format with data: areas 1x3 [info | PowerModels]: removing 1 cost terms from generator 4: [4000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 1: [1400.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 5: [1000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 2: [1500.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 3: [3000.0, 0.0] This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 63 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 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.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.35e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 6.08e-14 6.53e-10 -5.7 5.20e-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.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 1.81e-14 3.57e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486926e+02 1.7551890838594769e+04 Dual infeasibility......: 3.5721650023047801e-12 1.4288660009219120e-10 Constraint violation....: 1.8145207558717402e-14 1.8145207558717402e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302143490e-09 1.0023630520857396e-07 Overall NLP error.......: 2.5059076302143490e-09 1.0023630520857396e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 0.014 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 155 Number of nonzeros in inequality constraint Jacobian.: 36 Number of nonzeros in Lagrangian Hessian.............: 63 Total number of variables............................: 44 variables with only lower bounds: 0 variables with lower and upper bounds: 39 variables with only upper bounds: 0 Total number of equality constraints.................: 35 Total number of inequality constraints...............: 18 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 6 inequality constraints with only upper bounds: 12 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0059989e+02 3.99e+00 2.88e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 8.3066346e+03 2.47e+00 1.01e+02 -1.0 2.78e+00 - 4.11e-03 3.82e-01h 1 2 6.7182484e+03 2.36e+00 9.62e+01 -1.0 1.60e+01 - 7.37e-02 4.44e-02f 1 3 6.6691211e+03 2.30e+00 9.34e+01 -1.0 1.30e+01 - 4.95e-01 2.40e-02f 1 4 6.5744238e+03 2.04e+00 8.25e+01 -1.0 1.29e+01 - 3.67e-01 1.12e-01f 2 5 6.8265929e+03 1.80e+00 7.10e+01 -1.0 1.23e+01 - 8.72e-01 1.20e-01h 2 6 8.8541540e+03 1.08e+00 4.20e+01 -1.0 9.14e+00 - 5.92e-01 4.00e-01h 1 7 1.0572759e+04 8.62e-01 3.58e+01 -1.0 2.94e+00 - 4.94e-01 2.00e-01h 1 8 1.7308372e+04 3.63e-02 1.47e+01 -1.0 2.41e+00 - 7.66e-01 9.58e-01h 1 9 1.7572883e+04 1.33e-02 1.10e+00 -1.0 2.11e+00 - 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.7590632e+04 1.69e-03 1.61e-01 -1.0 5.03e-01 - 1.00e+00 1.00e+00h 1 11 1.7558725e+04 5.24e-03 5.03e-01 -2.5 6.03e-01 - 8.35e-01 9.36e-01f 1 12 1.7553111e+04 3.34e-03 4.11e+00 -2.5 2.84e-01 - 1.00e+00 8.20e-01h 1 13 1.7552956e+04 3.24e-05 1.26e-02 -2.5 6.35e-02 - 1.00e+00 1.00e+00h 1 14 1.7551990e+04 1.35e-05 1.09e+00 -3.8 2.53e-02 - 1.00e+00 9.25e-01h 1 15 1.7551938e+04 4.46e-08 1.23e-02 -3.8 7.00e-03 - 1.00e+00 1.00e+00f 1 16 1.7551940e+04 2.35e-10 2.06e-04 -3.8 3.84e-04 - 1.00e+00 1.00e+00h 1 17 1.7551892e+04 1.75e-07 2.11e-01 -5.7 2.49e-03 - 1.00e+00 9.68e-01f 1 18 1.7551891e+04 6.82e-11 3.10e-05 -5.7 2.38e-04 - 1.00e+00 1.00e+00f 1 19 1.7551891e+04 6.08e-14 6.53e-10 -5.7 5.20e-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.7551891e+04 6.34e-12 3.03e-07 -8.6 3.52e-05 - 1.00e+00 1.00e+00f 1 21 1.7551891e+04 1.81e-14 3.57e-12 -8.6 3.34e-08 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 21 (scaled) (unscaled) Objective...............: 4.3879727096486926e+02 1.7551890838594769e+04 Dual infeasibility......: 3.5721650023047801e-12 1.4288660009219120e-10 Constraint violation....: 1.8145207558717402e-14 1.8145207558717402e-14 Variable bound violation: 2.9463905093507492e-08 2.9463905093507492e-08 Complementarity.........: 2.5059076302143490e-09 1.0023630520857396e-07 Overall NLP error.......: 2.5059076302143490e-09 1.0023630520857396e-07 Number of objective function evaluations = 28 Number of objective gradient evaluations = 22 Number of equality constraint evaluations = 28 Number of inequality constraint evaluations = 28 Number of equality constraint Jacobian evaluations = 22 Number of inequality constraint Jacobian evaluations = 22 Number of Lagrangian Hessian evaluations = 21 Total seconds in IPOPT = 0.015 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_optimizer_case5_pjm | 1 1 0.4s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 22 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 0.003 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_optimizer_clnlbeam | 2 2 1.4s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 80 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 22 Total number of variables............................: 33 variables with only lower bounds: 0 variables with lower and upper bounds: 22 variables with only upper bounds: 0 Total number of equality constraints.................: 20 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 3.5000000e+02 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5000000e+02 0.00e+00 0.00e+00 -1.7 0.00e+00 2.0 1.00e+00 1.00e+00 0 2 3.5000000e+02 0.00e+00 0.00e+00 -3.8 0.00e+00 1.5 1.00e+00 1.00e+00T 0 3 3.5000000e+02 0.00e+00 0.00e+00 -5.7 0.00e+00 1.9 1.00e+00 1.00e+00T 0 4 3.5000000e+02 0.00e+00 0.00e+00 -8.6 0.00e+00 1.5 1.00e+00 1.00e+00T 0 Number of Iterations....: 4 (scaled) (unscaled) Objective...............: 3.5000000000000000e+02 3.5000000000000000e+02 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035596802450e-09 2.5059035596802450e-09 Overall NLP error.......: 2.5059035596802450e-09 2.5059035596802450e-09 Number of objective function evaluations = 5 Number of objective gradient evaluations = 5 Number of equality constraint evaluations = 5 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 5 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 4 Total seconds in IPOPT = 2.272 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_optimizer_clnlbeam_expr | 2 2 4.6s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 2 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.0000000e+00 0.00e+00 1.50e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.8024487e-01 0.00e+00 9.01e-01 -1.0 2.72e-01 - 8.44e-01 1.00e+00f 1 2 7.0052662e-02 0.00e+00 3.51e-01 -1.7 2.13e-01 - 1.00e+00 1.00e+00f 1 3 1.8685826e-02 0.00e+00 1.15e-01 -1.7 1.45e-01 - 1.00e+00 1.00e+00h 1 4 5.0051391e-03 0.00e+00 4.24e-02 -2.5 1.04e-01 - 1.00e+00 1.00e+00h 1 5 1.5721643e-03 0.00e+00 1.30e-02 -2.5 6.69e-02 - 1.00e+00 1.00e+00h 1 6 4.4160278e-04 0.00e+00 6.29e-03 -3.8 5.42e-02 - 1.00e+00 1.00e+00h 1 7 1.3012324e-04 0.00e+00 2.31e-03 -3.8 3.82e-02 - 1.00e+00 1.00e+00h 1 8 5.2832674e-05 0.00e+00 5.55e-04 -3.8 2.15e-02 - 1.00e+00 1.00e+00h 1 9 1.5630227e-05 0.00e+00 4.65e-04 -5.7 2.24e-02 - 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.3201506e-06 0.00e+00 2.05e-04 -5.7 1.73e-02 - 1.00e+00 1.00e+00h 1 11 1.3080517e-06 0.00e+00 6.93e-05 -5.7 1.18e-02 - 1.00e+00 1.00e+00h 1 12 5.8470874e-07 0.00e+00 1.45e-05 -5.7 6.17e-03 - 1.00e+00 1.00e+00h 1 13 1.7450415e-07 0.00e+00 1.56e-05 -8.6 7.21e-03 - 9.98e-01 1.00e+00h 1 14 4.6552429e-08 0.00e+00 7.35e-06 -8.6 5.75e-03 - 1.00e+00 1.00e+00h 1 15 1.1934456e-08 0.00e+00 2.86e-06 -8.6 4.24e-03 - 1.00e+00 1.00e+00h 1 16 3.1922881e-09 0.00e+00 9.80e-07 -8.6 2.94e-03 - 1.00e+00 1.00e+00h 1 17 1.0945020e-09 0.00e+00 2.59e-07 -8.6 1.76e-03 - 1.00e+00 1.00e+00h 1 18 6.6576204e-10 0.00e+00 3.00e-08 -8.6 6.72e-04 - 1.00e+00 1.00e+00h 1 19 6.2669252e-10 0.00e+00 3.52e-10 -8.6 7.62e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 19 (scaled) (unscaled) Objective...............: 6.2669251831336228e-10 6.2669251831336228e-10 Dual infeasibility......: 3.5235889036493309e-10 3.5235889036493309e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059035564989435e-09 2.5059035564989435e-09 Overall NLP error.......: 2.5059035564989435e-09 2.5059035564989435e-09 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 seconds in IPOPT = 0.195 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_threaded_objective | 2 2 3.0s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 -2.7118055e-02 0.00e+00 2.41e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8685804e-01 0.00e+00 9.26e-01 -1.0 1.06e-01 - 4.56e-01 1.00e+00f 1 2 3.9327121e-01 0.00e+00 1.35e-01 -1.7 2.05e-01 - 1.00e+00 1.00e+00f 1 3 4.0670875e-01 0.00e+00 6.68e-03 -2.5 4.81e-02 - 9.09e-01 1.00e+00f 1 4 4.0877211e-01 0.00e+00 1.13e-03 -3.8 2.32e-02 - 1.00e+00 1.00e+00f 1 5 4.0884988e-01 0.00e+00 5.26e-05 -3.8 5.06e-03 - 1.00e+00 1.00e+00f 1 6 4.0885036e-01 0.00e+00 3.73e-07 -5.7 4.27e-04 - 1.00e+00 1.00e+00f 1 7 4.0885036e-01 0.00e+00 4.11e-11 -8.6 4.48e-06 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: -4.0885036218644277e-01 4.0885036218644277e-01 Dual infeasibility......: 4.1105109658080353e-11 4.1105109658080353e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.6275883296809451e-09 2.6275883296809451e-09 Overall NLP error.......: 2.6275883296809451e-09 2.6275883296809451e-09 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 7 Total seconds in IPOPT = 0.177 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_user_defined_functions | 1 1 7.3s This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 1 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 variables with only upper bounds: 0 Total number of equality constraints.................: 0 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 -2.7118055e-02 0.00e+00 2.41e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.8685804e-01 0.00e+00 9.26e-01 -1.0 1.06e-01 - 4.56e-01 1.00e+00f 1 2 3.9327121e-01 0.00e+00 1.35e-01 -1.7 2.05e-01 - 1.00e+00 1.00e+00f 1 3 4.0670875e-01 0.00e+00 6.68e-03 -2.5 4.81e-02 - 9.09e-01 1.00e+00f 1 4 4.0877211e-01 0.00e+00 1.13e-03 -3.8 2.32e-02 - 1.00e+00 1.00e+00f 1 5 4.0884988e-01 0.00e+00 5.26e-05 -3.8 5.06e-03 - 1.00e+00 1.00e+00f 1 6 4.0885036e-01 0.00e+00 3.73e-07 -5.7 4.27e-04 - 1.00e+00 1.00e+00f 1 7 4.0885036e-01 0.00e+00 4.11e-11 -8.6 4.48e-06 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 7 (scaled) (unscaled) Objective...............: -4.0885036218644277e-01 4.0885036218644277e-01 Dual infeasibility......: 4.1105109658080353e-11 4.1105109658080353e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.6275883296809451e-09 2.6275883296809451e-09 Overall NLP error.......: 2.6275883296809451e-09 2.6275883296809451e-09 Number of objective function evaluations = 8 Number of objective gradient evaluations = 8 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 7 Total seconds in IPOPT = 0.003 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time test_user_defined_functions_expr | 1 1 2.0s Test Summary: | Pass Total Time test_SymbolicAD_DAG | 2 2 4.1s Test Summary: | Pass Total Time test_SymbolicAD_Evaluator | 7 7 11.8s Test Summary: | Pass Total Time test_SymbolicAD_Evaluator_comparison | 13 13 0.5s Test Summary: | Pass Total Time test_SymbolicAD_Evaluator_ifelse | 5 5 0.3s Test Summary: | Pass Total Time test_SymbolicAD_Evaluator_squared | 5 5 0.9s Test Summary: | Pass Total Time test_SymbolicAD_parameters | 1 1 0.1s Test Summary: | Pass Total Time test_SymbolicAD_show | 4 4 0.6s Test Summary: | Pass Total Time test_SymbolicAD_subexpressions | 1 1 0.2s Test Summary: | Pass Total Time test_SymbolicAD_univariate_registered | 1 1 0.8s Test Summary: | Pass Total Time test_derivative | 44 44 11.1s Test Summary: | Pass Total Time test_derivative_error | 1 1 0.1s Test Summary: | Pass Total Time test_gradient_and_hessian | 12 12 4.4s Test Summary: | Pass Total Time test_gradient_and_hessian_filter | 8 8 1.1s Test Summary: | Pass Total Time test_packed_operator_bit_fiddling | 360 360 1.6s Test Summary: | Pass Total Time test_simplify_ScalarAffineFunction | 4 4 0.2s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction | 2 2 0.2s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_addition | 7 7 0.9s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_ifelse | 4 4 0.2s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_multiplication | 8 8 1.0s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_power | 5 5 0.3s Test Summary: | Pass Total Time test_simplify_ScalarNonlinearFunction_subtraction | 7 7 0.4s Test Summary: | Pass Total Time test_simplify_ScalarQuadraticFunction | 4 4 0.3s Test Summary: | Pass Total Time test_simplify_VariableIndex | 2 2 0.1s Test Summary: | Pass Total Time test_simplify_VectorAffineFunction | 2 2 1.6s Test Summary: | Pass Total Time test_simplify_VectorNonlinearFunction | 1 1 1.1s Test Summary: | Pass Total Time test_simplify_VectorQuadraticFunction | 3 3 3.0s Test Summary: | Pass Total Time test_simplify_deep | 1 1 4.0s Test Summary: | Pass Total Time test_simplify_shared_false | 1 1 0.1s Test Summary: | Pass Total Time test_simplify_shared_node | 1 1 0.2s Test Summary: | Pass Total Time test_variable | 19 19 1.7s Testing MathOptSymbolicAD tests passed Testing completed after 516.83s PkgEval succeeded after 777.95s