Package evaluation to test MultiObjectiveAlgorithms on Julia 1.14.0-DEV.2265 (73323c5146*) started at 2026-06-02T20:37:47.692 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 11.26s ################################################################################ # Installation # Installing MultiObjectiveAlgorithms... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [0327d340] + MultiObjectiveAlgorithms v1.11.0 Updating `~/.julia/environments/v1.14/Manifest.toml` [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.1.0 [bbf7d656] + CommonSubexpressions v0.3.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.3.3 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.0 ⌅ [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.1 [0327d340] + MultiObjectiveAlgorithms v1.11.0 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.3 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.4 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [276daf66] + SpecialFunctions v2.8.0 [1e83bf80] + StaticArraysCore v1.4.4 [ec057cc2] + StructUtils v2.8.2 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.2+0 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [8e850b90] + libblastrampoline_jll v5.15.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 3.75s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... 1.6 s ✓ ASL_jll 1.5 s ✓ SPRAL_jll 5.4 s ✓ MathOptIIS 6.1 s ✓ MultiObjectiveAlgorithms 9.9 s ✓ Polyhedra 1.8 s ✓ Ipopt_jll 27.6 s ✓ HiGHS 6.4 s ✓ MultiObjectiveAlgorithms → MultiObjectiveAlgorithmsPolyhedraExt 1.1 s ✓ Ipopt 38.0 s ✓ Ipopt → IpoptMathOptInterfaceExt 10 dependencies successfully precompiled in 100 seconds. 80 already precompiled. Precompilation completed after 119.04s ################################################################################ # Testing # Testing MultiObjectiveAlgorithms Status `/tmp/jl_UORI4m/Project.toml` [861a8166] Combinatorics v1.1.0 [87dc4568] HiGHS v1.23.0 [b6b21f68] Ipopt v1.14.3 [682c06a0] JSON v1.6.0 [b8f27783] MathOptInterface v1.51.1 [0327d340] MultiObjectiveAlgorithms v1.11.0 [d3525ed8] ParallelTestRunner v2.6.1 [67491407] Polyhedra v0.8.1 [de0858da] Printf v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_UORI4m/Manifest.toml` [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.1.0 [bbf7d656] CommonSubexpressions v0.3.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.3.3 ⌅ [14197337] GenericLinearAlgebra v0.3.19 [87dc4568] HiGHS v1.23.0 [b5f81e59] IOCapture v1.0.0 [b6b21f68] Ipopt v1.14.3 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.6.0 ⌅ [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [36869731] Malt v1.4.1 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.1 [0327d340] MultiObjectiveAlgorithms v1.11.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.3 ⌅ [bac558e1] OrderedCollections v1.8.2 [d3525ed8] ParallelTestRunner v2.6.1 [69de0a69] Parsers v2.8.4 [67491407] Polyhedra v0.8.1 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [05181044] RelocatableFolders v1.0.1 [6c6a2e73] Scratch v1.3.0 [276daf66] SpecialFunctions v2.8.0 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [ec057cc2] StructUtils v2.8.2 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.14.0+0 [e33a78d0] Hwloc_jll v2.13.0+1 ⌅ [9cc047cb] Ipopt_jll v300.1400.1901+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.200+0 [656ef2d0] OpenBLAS32_jll v0.3.33+1 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [319450e9] SPRAL_jll v2025.9.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.19.0+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.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [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.5.2+0 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.3+0 [29816b5a] LibSSH2_jll v1.11.101+0 [14a3606d] MozillaCACerts_jll v2026.5.14 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.6+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.69.0+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Running 12 tests using 1 parallel jobs. If this is too many concurrent jobs, specify the `--jobs=N` argument to the tests, or set the `JULIA_CPU_THREADS` environment variable. │ Test │ ──────────────── CPU ──────────────── │ Test (Worker) │ time (s) │ GC (s) │ GC % │ Alloc (MB) │ RSS (MB) │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Hierarchical.jl (1) │ 57.19 │ 0.63 │ 1.1 │ 1628.55 │ 664.88 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Dichotomy.jl (1) │ 83.64 │ 0.52 │ 0.6 │ 1586.44 │ 726.93 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Lexicographic.jl (1) │ 14.26 │ 0.05 │ 0.3 │ 404.80 │ 761.68 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Chalmet.jl (1) │ 10.52 │ 0.00 │ 0.0 │ 275.45 │ 768.30 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_RandomWeighting.jl (1) │ 4.59 │ 0.00 │ 0.0 │ 82.38 │ 768.30 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/test_model.jl (1) │ 949.60 │ 6.72 │ 0.7 │ 19653.42 │ 1581.00 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_DominguezRios.jl (1) │ 392.93 │ 0.86 │ 0.2 │ 1760.12 │ 1581.00 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_EpsilonConstraint.jl (1) │ 154.82 │ 0.33 │ 0.2 │ 995.62 │ 1581.00 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_KirlikSayin.jl (1) │ 129.40 │ 0.00 │ 0.0 │ 419.61 │ 1581.00 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_TambyVanderpooten.jl (1) │ 155.95 │ 0.00 │ 0.0 │ 486.85 │ 1581.00 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Sandwiching.jl (1) │ 43.89 │ 0.44 │ 1.0 │ 1778.28 │ 1646.42 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/test_utilities.jl (1) │ 3.47 │ 0.00 │ 0.0 │ 51.26 │ 1646.42 │ Output generated during execution of '/home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Dichotomy.jl': ┌ │ ****************************************************************************** │ 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 │ ****************************************************************************** │ │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Dichotomy │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 2.28214e+00 │ Time spent in subproblems: 1.65939e+00 (73%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Dichotomy │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 6.88750e+01 5.72500e+01 5.56808e+00 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 5.56821e+00 │ Time spent in subproblems: 5.30028e+00 (95%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Dichotomy │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 6.88750e+01 5.72500e+01 7.26149e-02 │ 2 5.77797e+01 6.19322e+01 2.33851e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 2 │ │ Total solve time: 3.39194e-01 │ Time spent in subproblems: 1.74722e-01 (52%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Dichotomy │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 6.88750e+01 5.72500e+01 6.75340e-02 │ 2 5.77797e+01 6.19322e+01 2.24771e-01 │ 3 6.80000e+01 5.90000e+01 4.31635e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 3 │ │ Total solve time: 4.35565e-01 │ Time spent in subproblems: 3.43613e-01 (79%) │ Number of subproblems: 4 └ ---------------------------------------------- Output generated during execution of '/home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Chalmet.jl': ┌ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Chalmet │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 6.96399e-01 │ Time spent in subproblems: 7.23410e-03 (1%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Chalmet │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -5.77797e+01 -6.19322e+01 4.25722e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 4.25925e-01 │ Time spent in subproblems: 1.59658e-01 (37%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Chalmet │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -5.77797e+01 -6.19322e+01 3.95098e-02 │ 2 -5.77797e+01 -6.19322e+01 1.42473e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 1 │ │ Total solve time: 1.42592e-01 │ Time spent in subproblems: 1.12754e-01 (79%) │ Number of subproblems: 5 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Chalmet │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -5.77797e+01 -6.19322e+01 3.11651e-01 │ 2 -5.77797e+01 -6.19322e+01 5.41173e-01 │ 3 -6.88750e+01 -5.72500e+01 7.37309e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 1 │ │ Total solve time: 7.37452e-01 │ Time spent in subproblems: 6.60913e-01 (90%) │ Number of subproblems: 6 │ ---------------------------------------------- │ ------------------------------------------------------------------------ │ MultiObjectiveAlgorithms.jl │ ------------------------------------------------------------------------ │ Algorithm: Chalmet │ ------------------------------------------------------------------------ │ solve # Obj. 1 Obj. 2 Obj. 3 Obj. 4 Time └ ------------------------------------------------------------------------ Output generated during execution of '/home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_RandomWeighting.jl': ┌ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: RandomWeighting │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time └ ---------------------------------------------- Output generated during execution of '/home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_EpsilonConstraint.jl': ┌ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: EpsilonConstraint │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 1.52626e+00 │ Time spent in subproblems: 7.63488e-03 (1%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: EpsilonConstraint │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.22643e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 2.22777e-01 │ Time spent in subproblems: 2.21741e-01 (100%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: EpsilonConstraint │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 1.87731e-02 │ 2 -6.88750e+01 -5.72500e+01 1.98087e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 1.98219e-01 │ Time spent in subproblems: 1.96956e-01 (99%) │ Number of subproblems: 5 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: EpsilonConstraint │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.50708e-01 │ 2 -6.88750e+01 -5.72500e+01 4.74386e-01 │ 3 -5.77797e+01 -6.19322e+01 6.70841e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 6.70983e-01 │ Time spent in subproblems: 6.19439e-01 (92%) │ Number of subproblems: 6 │ ---------------------------------------------- │ ------------------------------------------------------------------------ │ MultiObjectiveAlgorithms.jl │ ------------------------------------------------------------------------ │ Algorithm: EpsilonConstraint │ ------------------------------------------------------------------------ │ solve # Obj. 1 Obj. 2 Obj. 3 Obj. 4 Time └ ------------------------------------------------------------------------ Output generated during execution of '/home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_KirlikSayin.jl': ┌ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 7.31962e-01 │ Time spent in subproblems: 7.66778e-03 (1%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 1.68538e-01 │ ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.KirlikSayin` algorithm because the anti-ideal point of objective 1 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 1 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. │ └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/q0fOk/src/MultiObjectiveAlgorithms.jl:1087 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 1.24745e+00 │ Time spent in subproblems: 1.67698e-01 (13%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.05630e-01 │ 2 -3.67843e+01 -4.93137e+01 2.84704e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 2.84796e-01 │ Time spent in subproblems: 9.65691e-02 (34%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 3.85544e-01 │ 2 -3.67843e+01 -4.93137e+01 5.82640e-01 │ 3 -5.77797e+01 -6.19322e+01 7.55600e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 7.55901e-01 │ Time spent in subproblems: 3.74210e-01 (50%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.KirlikSayin` algorithm because the anti-ideal point of objective 2 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 2 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. │ └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/q0fOk/src/MultiObjectiveAlgorithms.jl:1087 │ 1 -6.88750e+01 -5.72500e+01 2.88707e-01 │ 2 -3.67843e+01 -4.93137e+01 4.85111e-01 │ 3 -5.77797e+01 -6.19322e+01 6.76250e-01 │ 4 -4.92857e+01 -4.27143e+01 8.70406e-01 │ ---------------------------------------------- │ termination_status: OPTIMAL │ result_count: 0 │ │ Total solve time: 8.70553e-01 │ Time spent in subproblems: 6.81155e-01 (78%) │ Number of subproblems: 5 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.66551e-01 │ 2 -3.67843e+01 -4.93137e+01 4.40566e-01 │ 3 -5.77797e+01 -6.19322e+01 6.37489e-01 │ 4 -4.92857e+01 -4.27143e+01 8.32753e-01 │ 6 subproblem not optimal 1.15748e+00 │ ---------------------------------------------- │ termination_status: OPTIMAL │ result_count: 0 │ │ Total solve time: 1.19902e+00 │ Time spent in subproblems: 5.25657e-01 (44%) │ Number of subproblems: 6 └ ---------------------------------------------- Output generated during execution of '/home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_TambyVanderpooten.jl': ┌ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 1.01016e+00 │ Time spent in subproblems: 8.43477e-03 (1%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 3.04649e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 3.05015e-01 │ Time spent in subproblems: 2.33890e-01 (77%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.TambyVanderpooten` algorithm because the anti-ideal point of objective 1 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 1 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. │ └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/q0fOk/src/MultiObjectiveAlgorithms.jl:1087 │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.05502e-01 │ 2 -3.67843e+01 -4.93137e+01 3.69646e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 3.69751e-01 │ Time spent in subproblems: 1.81213e-01 (49%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.64721e-01 │ 2 -3.67843e+01 -4.93137e+01 4.46294e-01 │ 3 -5.77797e+01 -6.19322e+01 6.41376e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 6.41690e-01 │ Time spent in subproblems: 4.51435e-01 (70%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.TambyVanderpooten` algorithm because the anti-ideal point of objective 2 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 2 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. │ └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/q0fOk/src/MultiObjectiveAlgorithms.jl:1087 │ 1 -6.88750e+01 -5.72500e+01 2.63723e-01 │ 2 -3.67843e+01 -4.93137e+01 4.45384e-01 │ 3 -5.77797e+01 -6.19322e+01 6.18390e-01 │ 4 -4.92857e+01 -4.27143e+01 8.03346e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 8.03467e-01 │ Time spent in subproblems: 8.02592e-01 (100%) │ Number of subproblems: 5 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.63558e-01 │ 2 -3.67843e+01 -4.93137e+01 4.40738e-01 │ 3 -5.77797e+01 -6.19322e+01 6.27501e-01 │ 4 -4.92857e+01 -4.27143e+01 8.09561e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 9.67970e-01 │ Time spent in subproblems: 9.67036e-01 (100%) │ Number of subproblems: 6 └ ---------------------------------------------- Output generated during execution of '/home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Sandwiching.jl': ┌ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Sandwiching │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 1.92872e+00 │ Time spent in subproblems: 2.96236e-01 (15%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Sandwiching │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.Sandwiching` algorithm because the anti-ideal point of objective 1 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 1 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. │ └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/q0fOk/src/MultiObjectiveAlgorithms.jl:1087 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 1.85187e-01 │ Time spent in subproblems: 1.68057e-01 (91%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Sandwiching │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 3.34850e-01 │ Time spent in subproblems: 1.81647e-01 (54%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Sandwiching │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.Sandwiching` algorithm because the anti-ideal point of objective 2 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 2 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. │ └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/q0fOk/src/MultiObjectiveAlgorithms.jl:1087 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 5.66852e-01 │ Time spent in subproblems: 5.65830e-01 (100%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Sandwiching │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 1.93688e+00 │ Time spent in subproblems: 8.06997e-01 (42%) │ Number of subproblems: 5 └ ---------------------------------------------- Test Summary: | Pass Broken Total Time Overall | 9346 1 9347 33m55.6s SUCCESS Testing MultiObjectiveAlgorithms tests passed Testing completed after 2055.6s PkgEval succeeded after 2200.0s