Package evaluation to test MultiObjectiveAlgorithms on Julia 1.14.0-DEV.1613 (8dab3f0623*) started at 2026-01-25T17:25:37.752 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 10.39s ################################################################################ # Installation # Installing MultiObjectiveAlgorithms... Resolving package versions... 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.30+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.18s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 7403.6 ms ✓ MathOptIIS 8243.7 ms ✓ MultiObjectiveAlgorithms 14641.2 ms ✓ Polyhedra 48640.3 ms ✓ Ipopt → IpoptMathOptInterfaceExt 33039.2 ms ✓ HiGHS 7946.0 ms ✓ MultiObjectiveAlgorithms → MultiObjectiveAlgorithmsPolyhedraExt 6 dependencies successfully precompiled in 121 seconds. 84 already precompiled. Precompilation completed after 140.71s ################################################################################ # Testing # Testing MultiObjectiveAlgorithms Status `/tmp/jl_6ktNrh/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_6ktNrh/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.30+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.30+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.42359e+00 Time spent in subproblems: 3.57916e+00 (81%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 5.47382e+00 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.47398e+00 Time spent in subproblems: 5.16487e+00 (94%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 1.09772e-01 2 -5.77797e+01 -6.19322e+01 2.09763e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 1 Total solve time: 2.09878e-01 Time spent in subproblems: 2.08689e-01 (99%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 3.17152e-01 2 -5.77797e+01 -6.19322e+01 4.65009e-01 3 -6.88750e+01 -5.72500e+01 6.19620e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 1 Total solve time: 6.19736e-01 Time spent in subproblems: 6.18933e-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.1s ****************************************************************************** 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: 5.57911e-01 Time spent in subproblems: 1.10438e-02 (2%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 3.09681e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 3.09751e-01 Time spent in subproblems: 3.07971e-01 (99%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 1.99455e-01 2 5.77797e+01 6.19322e+01 3.72503e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 2 Total solve time: 3.72643e-01 Time spent in subproblems: 3.72058e-01 (100%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 3.15220e-01 2 5.77797e+01 6.19322e+01 5.17208e-01 3 6.80000e+01 5.90000e+01 7.14240e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 3 Total solve time: 7.14301e-01 Time spent in subproblems: 7.13694e-01 (100%) Number of subproblems: 4 ---------------------------------------------- Test Summary: | Pass Total Time Dichotomy.jl | 126 126 1m15.5s Test Summary: | Pass Total Time DominguezRios.jl | 1171 1171 9m52.0s 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.37722e+00 Time spent in subproblems: 1.06130e-02 (1%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 4.06463e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.06608e-01 Time spent in subproblems: 3.79970e-01 (93%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.79370e-01 2 -6.88750e+01 -5.72500e+01 5.07812e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.07923e-01 Time spent in subproblems: 3.60969e-01 (71%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.64621e-01 2 -6.88750e+01 -5.72500e+01 4.22270e-01 3 -5.77797e+01 -6.19322e+01 5.90959e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.91097e-01 Time spent in subproblems: 5.90290e-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 3m25.1s Test Summary: | Pass Total Time Hierarchical.jl | 21 21 4.6s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.42843e-01 Time spent in subproblems: 1.06721e-02 (2%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.60734e-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.25278e+00 Time spent in subproblems: 3.59840e-01 (29%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 1.95658e-01 2 -3.67843e+01 -4.93137e+01 4.00904e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.00988e-01 Time spent in subproblems: 3.98694e-01 (99%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.90829e-01 2 -3.67843e+01 -4.93137e+01 4.27169e-01 3 -5.77797e+01 -6.19322e+01 5.92743e-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: 5.93004e-01 Time spent in subproblems: 5.91465e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.45876e-01 2 -3.67843e+01 -4.93137e+01 4.97775e-01 3 -5.77797e+01 -6.19322e+01 6.32844e-01 4 -4.92857e+01 -4.27143e+01 7.83063e-01 5 auxillary subproblem 9.12771e-01 ---------------------------------------------- termination_status: OPTIMAL result_count: 0 Total solve time: 9.13063e-01 Time spent in subproblems: 7.82043e-01 (86%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.11871e-01 2 -3.67843e+01 -4.93137e+01 3.81187e-01 3 -5.77797e+01 -6.19322e+01 5.73126e-01 4 -4.92857e+01 -4.27143e+01 7.96830e-01 5 auxillary subproblem 9.35665e-01 6 subproblem not optimal 1.13897e+00 ---------------------------------------------- termination_status: OPTIMAL result_count: 0 Total solve time: 1.30395e+00 Time spent in subproblems: 9.06661e-01 (70%) Number of subproblems: 6 ---------------------------------------------- Test Summary: | Pass Total Time KirlikSayin.jl | 697 697 3m19.5s Test Summary: | Pass Total Time Lexicographic.jl | 48 48 12.5s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: RandomWeighting ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- Test Summary: | Pass Total Time RandomWeighting.jl | 24 24 6.3s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Sandwiching ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 2.26464e+00 Time spent in subproblems: 3.23088e-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.20206e+00 Time spent in subproblems: 1.20063e+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: 5.05889e-01 Time spent in subproblems: 3.32781e-01 (66%) 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.63196e-01 Time spent in subproblems: 5.62347e-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.89932e+00 Time spent in subproblems: 7.62304e-01 (40%) Number of subproblems: 5 ---------------------------------------------- Test Summary: | Pass Total Time Sandwiching.jl | 40 40 54.9s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 8.71992e-01 Time spent in subproblems: 1.28069e-02 (1%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.64813e-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: 3.65334e-01 Time spent in subproblems: 3.62974e-01 (99%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.16172e-01 2 -3.67843e+01 -4.93137e+01 3.60868e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 3.60945e-01 Time spent in subproblems: 3.59989e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.41467e-01 2 -3.67843e+01 -4.93137e+01 5.62261e-01 3 -5.77797e+01 -6.19322e+01 8.28112e-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: 8.28357e-01 Time spent in subproblems: 8.13000e-01 (98%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.16226e-01 2 -3.67843e+01 -4.93137e+01 4.10744e-01 3 -5.77797e+01 -6.19322e+01 5.77550e-01 4 -4.92857e+01 -4.27143e+01 7.27739e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 7.27878e-01 Time spent in subproblems: 7.26832e-01 (100%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.58309e-01 2 -3.67843e+01 -4.93137e+01 5.84556e-01 3 -5.77797e+01 -6.19322e+01 7.33567e-01 4 -4.92857e+01 -4.27143e+01 8.84514e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.03635e+00 Time spent in subproblems: 1.01991e+00 (98%) Number of subproblems: 6 ---------------------------------------------- Test Summary: | Pass Total Time TambyVanderpooten.jl | 697 697 3m58.5s 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 14m24.4s Test Summary: | Pass Total Time test_utilities.jl | 40 40 2.6s 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 2371.44s PkgEval succeeded after 2543.82s