Package evaluation to test MultiObjectiveAlgorithms on Julia 1.14.0-DEV.2435 (e1b2c72e96*) started at 2026-06-28T16:59:58.059 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 10.91s ################################################################################ # 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.4.1 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.1 [2ab3a3ac] + LogExpFunctions v1.0.1 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.1 [0327d340] + MultiObjectiveAlgorithms v1.11.0 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.4 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.6 [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.5+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.95s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... 1.5 s ✓ ASL_jll 1.4 s ✓ SPRAL_jll 6.8 s ✓ MathOptIIS 7.4 s ✓ MultiObjectiveAlgorithms 11.6 s ✓ Polyhedra 1.5 s ✓ Ipopt_jll 33.7 s ✓ HiGHS 7.9 s ✓ MultiObjectiveAlgorithms → MultiObjectiveAlgorithmsPolyhedraExt 1.4 s ✓ Ipopt 41.4 s ✓ Ipopt → IpoptMathOptInterfaceExt 10 dependencies successfully precompiled in 115 seconds. 80 already precompiled. Precompilation completed after 134.0s ################################################################################ # Testing # Testing MultiObjectiveAlgorithms Status `/tmp/jl_mNAfZY/Project.toml` [861a8166] Combinatorics v1.1.0 [87dc4568] HiGHS v1.23.0 [b6b21f68] Ipopt v1.15.0 [682c06a0] JSON v1.6.1 [b8f27783] MathOptInterface v1.51.1 [0327d340] MultiObjectiveAlgorithms v1.11.0 [d3525ed8] ParallelTestRunner v2.6.2 [67491407] Polyhedra v0.8.1 [de0858da] Printf v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_mNAfZY/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.4.1 ⌅ [14197337] GenericLinearAlgebra v0.3.19 [87dc4568] HiGHS v1.23.0 [b5f81e59] IOCapture v1.0.0 [b6b21f68] Ipopt v1.15.0 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.6.1 [2ab3a3ac] LogExpFunctions v1.0.1 [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.4 ⌅ [bac558e1] OrderedCollections v1.8.2 [d3525ed8] ParallelTestRunner v2.6.2 [69de0a69] Parsers v2.8.6 [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.14.0+0 [9cc047cb] Ipopt_jll v300.1400.1902+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.900.0+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.2.0 [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.5+0 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.4+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.7+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/test_model.jl (1) │ 1022.86 │ 8.09 │ 0.8 │ 20086.44 │ 1451.78 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_TambyVanderpooten.jl (1) │ 218.86 │ 0.65 │ 0.3 │ 2396.38 │ 1451.78 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Dichotomy.jl (1) │ 90.08 │ 0.14 │ 0.2 │ 923.47 │ 1451.78 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_EpsilonConstraint.jl (1) │ 157.97 │ 0.40 │ 0.3 │ 1173.03 │ 1451.78 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Chalmet.jl (1) │ 9.97 │ 0.00 │ 0.0 │ 178.86 │ 1451.78 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Lexicographic.jl (1) │ 11.32 │ 0.00 │ 0.0 │ 235.74 │ 1451.78 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Sandwiching.jl (1) │ 28.38 │ 0.00 │ 0.0 │ 621.93 │ 1496.61 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_KirlikSayin.jl (1) │ 143.88 │ 0.00 │ 0.0 │ 737.58 │ 1608.58 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_Hierarchical.jl (1) │ 4.21 │ 0.00 │ 0.0 │ 102.82 │ 1608.58 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_DominguezRios.jl (1) │ 384.92 │ 0.00 │ 0.0 │ 751.83 │ 1673.55 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/algorithms/test_RandomWeighting.jl (1) │ 5.46 │ 0.00 │ 0.0 │ 90.34 │ 1673.55 │ /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/q0fOk/test/test_utilities.jl (1) │ 3.59 │ 0.00 │ 0.0 │ 49.70 │ 1673.55 │ 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: 3.66777e+00 │ Time spent in subproblems: 1.96167e+00 (53%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 6.44488e+00 │ ┌ 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 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 7.25653e+00 │ Time spent in subproblems: 6.21853e+00 (86%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 9.32560e-02 │ 2 -3.67843e+01 -4.93137e+01 2.41735e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 2.41812e-01 │ Time spent in subproblems: 1.66390e-01 (69%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.97591e-01 │ 2 -3.67843e+01 -4.93137e+01 4.48681e-01 │ 3 -5.77797e+01 -6.19322e+01 5.94706e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 5.94982e-01 │ Time spent in subproblems: 5.94079e-01 (100%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 3.23999e-01 │ 2 -3.67843e+01 -4.93137e+01 4.79348e-01 │ 3 -5.77797e+01 -6.19322e+01 6.23468e-01 │ 4 -4.92857e+01 -4.27143e+01 7.72409e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 9.74386e-01 │ Time spent in subproblems: 7.71658e-01 (79%) │ Number of subproblems: 5 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: TambyVanderpooten │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.02378e-01 │ 2 -3.67843e+01 -4.93137e+01 3.44692e-01 │ ┌ 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 │ 3 -5.77797e+01 -6.19322e+01 4.98558e-01 │ 4 -4.92857e+01 -4.27143e+01 6.63462e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 9.62500e-01 │ Time spent in subproblems: 8.24491e-01 (86%) │ Number of subproblems: 6 └ ---------------------------------------------- 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: 4.13295e-01 │ Time spent in subproblems: 8.15582e-03 (2%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Dichotomy │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 6.88750e+01 5.72500e+01 3.04504e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 3.04567e-01 │ Time spent in subproblems: 3.03758e-01 (100%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Dichotomy │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 6.88750e+01 5.72500e+01 2.03240e-01 │ 2 5.77797e+01 6.19322e+01 3.55601e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 2 │ │ Total solve time: 3.55721e-01 │ Time spent in subproblems: 3.54715e-01 (100%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Dichotomy │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 6.88750e+01 5.72500e+01 2.91370e-01 │ 2 5.77797e+01 6.19322e+01 4.95162e-01 │ 3 6.80000e+01 5.90000e+01 6.92666e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 3 │ │ Total solve time: 6.92731e-01 │ Time spent in subproblems: 6.58229e-01 (95%) │ Number of subproblems: 4 └ ---------------------------------------------- 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.03477e+00 │ Time spent in subproblems: 7.41696e-03 (1%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: EpsilonConstraint │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 3.43457e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 3.43569e-01 │ Time spent in subproblems: 3.42647e-01 (100%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: EpsilonConstraint │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 1.83690e-02 │ 2 -6.88750e+01 -5.72500e+01 2.14164e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 2.14268e-01 │ Time spent in subproblems: 2.13112e-01 (99%) │ Number of subproblems: 5 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: EpsilonConstraint │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.64901e-01 │ 2 -6.88750e+01 -5.72500e+01 4.31546e-01 │ 3 -5.77797e+01 -6.19322e+01 5.98318e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 5.98435e-01 │ Time spent in subproblems: 5.97668e-01 (100%) │ 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_Chalmet.jl': ┌ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Chalmet │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 5.89764e-01 │ Time spent in subproblems: 8.34990e-03 (1%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Chalmet │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -5.77797e+01 -6.19322e+01 2.13596e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 2.13679e-01 │ Time spent in subproblems: 1.75340e-01 (82%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Chalmet │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -5.77797e+01 -6.19322e+01 5.60071e-02 │ 2 -5.77797e+01 -6.19322e+01 2.04488e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 1 │ │ Total solve time: 2.04571e-01 │ Time spent in subproblems: 1.63153e-01 (80%) │ Number of subproblems: 5 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Chalmet │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -5.77797e+01 -6.19322e+01 2.86607e-01 │ 2 -5.77797e+01 -6.19322e+01 4.65138e-01 │ 3 -6.88750e+01 -5.72500e+01 6.48251e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 1 │ │ Total solve time: 6.48334e-01 │ Time spent in subproblems: 6.08170e-01 (94%) │ 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_Sandwiching.jl': ┌ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: Sandwiching │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 1.92755e+00 │ Time spent in subproblems: 3.10585e-01 (16%) │ 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.69006e-01 │ Time spent in subproblems: 1.67632e-01 (99%) │ 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.23419e-01 │ Time spent in subproblems: 1.64153e-01 (51%) │ 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.83192e-01 │ Time spent in subproblems: 5.41776e-01 (93%) │ 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.78011e+00 │ Time spent in subproblems: 6.68622e-01 (38%) │ Number of subproblems: 5 └ ---------------------------------------------- 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.59924e-01 │ Time spent in subproblems: 7.82895e-03 (1%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 1.91641e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 1.91927e-01 │ Time spent in subproblems: 1.72119e-01 (90%) │ Number of subproblems: 3 │ ---------------------------------------------- │ ┌ 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 │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 6.65510e-02 │ 2 -3.67843e+01 -4.93137e+01 2.01210e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 2.01271e-01 │ Time spent in subproblems: 1.50071e-01 (75%) │ Number of subproblems: 4 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.79607e-01 │ 2 -3.67843e+01 -4.93137e+01 4.63060e-01 │ 3 -5.77797e+01 -6.19322e+01 6.52141e-01 │ ---------------------------------------------- │ termination_status: NUMERICAL_ERROR │ result_count: 0 │ │ Total solve time: 6.52387e-01 │ Time spent in subproblems: 6.06130e-01 (93%) │ 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 1.52381e-01 │ 2 -3.67843e+01 -4.93137e+01 3.06930e-01 │ 3 -5.77797e+01 -6.19322e+01 5.02344e-01 │ 4 -4.92857e+01 -4.27143e+01 6.91429e-01 │ ---------------------------------------------- │ termination_status: OPTIMAL │ result_count: 0 │ │ Total solve time: 6.91525e-01 │ Time spent in subproblems: 5.72656e-01 (83%) │ Number of subproblems: 5 │ ---------------------------------------------- │ ---------------------------------------------- │ MultiObjectiveAlgorithms.jl │ ---------------------------------------------- │ Algorithm: KirlikSayin │ ---------------------------------------------- │ solve # Obj. 1 Obj. 2 Time │ ---------------------------------------------- │ 1 -6.88750e+01 -5.72500e+01 2.75092e-01 │ 2 -3.67843e+01 -4.93137e+01 4.56698e-01 │ 3 -5.77797e+01 -6.19322e+01 6.02102e-01 │ 4 -4.92857e+01 -4.27143e+01 7.46038e-01 │ 6 subproblem not optimal 1.02513e+00 │ ---------------------------------------------- │ termination_status: OPTIMAL │ result_count: 0 │ │ Total solve time: 1.06907e+00 │ Time spent in subproblems: 9.37522e-01 (88%) │ Number of subproblems: 6 └ ---------------------------------------------- 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 └ ---------------------------------------------- Test Summary: | Pass Broken Total Time Overall | 9346 1 9347 35m21.2s SUCCESS Testing MultiObjectiveAlgorithms tests passed Testing completed after 2142.49s PkgEval succeeded after 2301.77s