Package evaluation to test MultiObjectiveAlgorithms on Julia 1.14.0-DEV.1584 (ac5fadde9b*) started at 2026-01-18T17:26:28.076 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 10.25s ################################################################################ # Installation # Installing MultiObjectiveAlgorithms... Resolving package versions... Installed MultiObjectiveAlgorithms ─ v1.8.2 Updating `~/.julia/environments/v1.14/Project.toml` [0327d340] + MultiObjectiveAlgorithms v1.8.2 Updating `~/.julia/environments/v1.14/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.3 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.1.0 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.3.1 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.48.0 [0327d340] + MultiObjectiveAlgorithms v1.8.2 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [276daf66] + SpecialFunctions v2.6.1 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.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.13.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 v1.0.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.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 5.61s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 6870.8 ms ✓ MathOptIIS 7637.9 ms ✓ MultiObjectiveAlgorithms 12675.1 ms ✓ Polyhedra 45669.7 ms ✓ Ipopt → IpoptMathOptInterfaceExt 32264.4 ms ✓ HiGHS 7864.2 ms ✓ MultiObjectiveAlgorithms → MultiObjectiveAlgorithmsPolyhedraExt 6 dependencies successfully precompiled in 114 seconds. 84 already precompiled. Precompilation completed after 133.85s ################################################################################ # Testing # Testing MultiObjectiveAlgorithms Status `/tmp/jl_l2yQ4Q/Project.toml` [861a8166] Combinatorics v1.1.0 [87dc4568] HiGHS v1.20.1 [b6b21f68] Ipopt v1.14.0 [682c06a0] JSON v1.4.0 [b8f27783] MathOptInterface v1.48.0 [0327d340] MultiObjectiveAlgorithms v1.8.2 [67491407] Polyhedra v0.8.1 [de0858da] Printf v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_l2yQ4Q/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.3 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.1.0 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.3.1 [14197337] GenericLinearAlgebra v0.3.19 [87dc4568] HiGHS v1.20.1 [b6b21f68] Ipopt v1.14.0 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.48.0 [0327d340] MultiObjectiveAlgorithms v1.8.2 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [67491407] Polyhedra v0.8.1 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [276daf66] SpecialFunctions v2.6.1 [90137ffa] StaticArrays v1.9.16 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.2 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.12.0+0 [e33a78d0] Hwloc_jll v2.12.2+0 [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.29+0 [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.18.1+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates 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.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization 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.3.0+1 [deac9b47] LibCURL_jll v8.18.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.75910e+00 Time spent in subproblems: 3.86379e+00 (81%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 5.79442e+00 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.79456e+00 Time spent in subproblems: 5.56728e+00 (96%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 1.28204e-01 2 -5.77797e+01 -6.19322e+01 2.09741e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 1 Total solve time: 2.09846e-01 Time spent in subproblems: 2.08642e-01 (99%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 2.98396e-01 2 -5.77797e+01 -6.19322e+01 4.29184e-01 3 -6.88750e+01 -5.72500e+01 5.60200e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 1 Total solve time: 5.60321e-01 Time spent in subproblems: 5.59493e-01 (100%) Number of subproblems: 6 ---------------------------------------------- ------------------------------------------------------------------------ MultiObjectiveAlgorithms.jl ------------------------------------------------------------------------ Algorithm: Chalmet ------------------------------------------------------------------------ solve # Obj. 1 Obj. 2 Obj. 3 Obj. 4 Time ------------------------------------------------------------------------ Test Summary: | Pass Total Time Chalmet.jl | 43 43 1m46.8s ****************************************************************************** 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: 3.66032e-01 Time spent in subproblems: 1.14880e-02 (3%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 2.60604e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 2.60678e-01 Time spent in subproblems: 2.59676e-01 (100%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 1.42386e-01 2 5.77797e+01 6.19322e+01 4.22384e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 2 Total solve time: 4.22524e-01 Time spent in subproblems: 4.21713e-01 (100%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 1.79558e-01 2 5.77797e+01 6.19322e+01 3.10391e-01 3 6.80000e+01 5.90000e+01 4.35840e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 3 Total solve time: 4.36134e-01 Time spent in subproblems: 4.34860e-01 (100%) Number of subproblems: 4 ---------------------------------------------- Test Summary: | Pass Total Time Dichotomy.jl | 126 126 1m16.3s Test Summary: | Pass Total Time DominguezRios.jl | 1171 1171 9m57.8s HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.38192e+00 Time spent in subproblems: 1.13139e-02 (1%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 4.45489e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.45648e-01 Time spent in subproblems: 4.44904e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 9.53321e-02 2 -6.88750e+01 -5.72500e+01 1.78303e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.78420e-01 Time spent in subproblems: 1.76824e-01 (99%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.18124e-01 2 -6.88750e+01 -5.72500e+01 4.13322e-01 3 -5.77797e+01 -6.19322e+01 5.43194e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.43317e-01 Time spent in subproblems: 5.42340e-01 (100%) Number of subproblems: 6 ---------------------------------------------- ------------------------------------------------------------------------ MultiObjectiveAlgorithms.jl ------------------------------------------------------------------------ Algorithm: EpsilonConstraint ------------------------------------------------------------------------ solve # Obj. 1 Obj. 2 Obj. 3 Obj. 4 Time ------------------------------------------------------------------------ Test Summary: | Pass Broken Total Time EpsilonConstraint.jl | 582 1 583 3m22.1s Test Summary: | Pass Total Time Hierarchical.jl | 21 21 4.8s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.87019e-01 Time spent in subproblems: 1.26829e-02 (2%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.78212e-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/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.28769e+00 Time spent in subproblems: 3.77323e-01 (29%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 1.30500e-01 2 -3.67843e+01 -4.93137e+01 2.22465e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 2.22536e-01 Time spent in subproblems: 2.21834e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.85659e-01 2 -3.67843e+01 -4.93137e+01 3.70702e-01 3 -5.77797e+01 -6.19322e+01 4.62649e-01 ┌ 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/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.62957e-01 Time spent in subproblems: 4.61939e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.19622e-01 2 -3.67843e+01 -4.93137e+01 4.21974e-01 3 -5.77797e+01 -6.19322e+01 5.29890e-01 4 -4.92857e+01 -4.27143e+01 6.52936e-01 5 auxillary subproblem 8.08030e-01 ---------------------------------------------- termination_status: OPTIMAL result_count: 0 Total solve time: 8.08142e-01 Time spent in subproblems: 4.84275e-01 (60%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 1.55101e-01 2 -3.67843e+01 -4.93137e+01 2.53585e-01 3 -5.77797e+01 -6.19322e+01 3.66452e-01 4 -4.92857e+01 -4.27143e+01 4.94333e-01 5 auxillary subproblem 5.75089e-01 6 subproblem not optimal 8.42995e-01 ---------------------------------------------- termination_status: OPTIMAL result_count: 0 Total solve time: 1.01621e+00 Time spent in subproblems: 5.74103e-01 (56%) Number of subproblems: 6 ---------------------------------------------- Test Summary: | Pass Total Time KirlikSayin.jl | 697 697 3m19.4s Test Summary: | Pass Total Time Lexicographic.jl | 48 48 13.1s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: RandomWeighting ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- Test Summary: | Pass Total Time RandomWeighting.jl | 24 24 4.6s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Sandwiching ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 2.31728e+00 Time spent in subproblems: 3.35396e-01 (14%) 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/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.12771e+00 Time spent in subproblems: 1.12574e+00 (100%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Sandwiching ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.89226e-01 Time spent in subproblems: 2.58995e-01 (53%) 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/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.50638e-01 Time spent in subproblems: 3.94984e-01 (72%) 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.66799e+00 Time spent in subproblems: 6.21485e-01 (37%) Number of subproblems: 5 ---------------------------------------------- Test Summary: | Pass Total Time Sandwiching.jl | 40 40 56.2s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 9.21101e-01 Time spent in subproblems: 1.21467e-02 (1%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.45376e-01 ┌ 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/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 2.45673e-01 Time spent in subproblems: 2.43869e-01 (99%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.81812e-01 2 -3.67843e+01 -4.93137e+01 4.32715e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.32802e-01 Time spent in subproblems: 3.13296e-01 (72%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.01402e-01 2 -3.67843e+01 -4.93137e+01 4.13137e-01 3 -5.77797e+01 -6.19322e+01 4.99168e-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/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.99433e-01 Time spent in subproblems: 4.98426e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.25094e-01 2 -3.67843e+01 -4.93137e+01 3.99633e-01 3 -5.77797e+01 -6.19322e+01 5.01354e-01 4 -4.92857e+01 -4.27143e+01 6.10094e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 6.10238e-01 Time spent in subproblems: 6.09212e-01 (100%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.99578e-01 2 -3.67843e+01 -4.93137e+01 6.07956e-01 3 -5.77797e+01 -6.19322e+01 7.40416e-01 4 -4.92857e+01 -4.27143e+01 8.63700e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 9.39115e-01 Time spent in subproblems: 9.37962e-01 (100%) Number of subproblems: 6 ---------------------------------------------- Test Summary: | Pass Total Time TambyVanderpooten.jl | 697 697 4m02.7s Test Summary: | Total Time algorithms | 0 0.0s Test Summary: | Total Time mock_optimizer.jl | 0 0.0s Test Summary: | Total Time problems.jl | 0 0.0s Test Summary: | Total Time runtests.jl | 0 0.0s Test Summary: | Pass Total Time test_model.jl | 5616 5616 13m14.2s Test Summary: | Pass Total Time test_utilities.jl | 40 40 2.1s Test Summary: | Total Time vOptLib.jl | 0 0.0s HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); Testing MultiObjectiveAlgorithms tests passed Testing completed after 2308.14s PkgEval succeeded after 2473.47s