Package evaluation to test MultiObjectiveAlgorithms on Julia 1.14.0-DEV.1601 (79ea5eb99c*) started at 2026-01-24T14:14:52.097 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 9.96s ################################################################################ # 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.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.04s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 7382.8 ms ✓ MathOptIIS 8343.9 ms ✓ MultiObjectiveAlgorithms 13443.5 ms ✓ Polyhedra 46590.5 ms ✓ Ipopt → IpoptMathOptInterfaceExt 32080.7 ms ✓ HiGHS 8107.4 ms ✓ MultiObjectiveAlgorithms → MultiObjectiveAlgorithmsPolyhedraExt 6 dependencies successfully precompiled in 118 seconds. 84 already precompiled. Precompilation completed after 136.83s ################################################################################ # Testing # Testing MultiObjectiveAlgorithms Status `/tmp/jl_Js80pg/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_Js80pg/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.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.12639e+00 Time spent in subproblems: 3.33448e+00 (81%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 5.77366e+00 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.77377e+00 Time spent in subproblems: 5.62298e+00 (97%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 1.80382e-01 2 -5.77797e+01 -6.19322e+01 2.99988e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 1 Total solve time: 3.00120e-01 Time spent in subproblems: 2.99453e-01 (100%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 3.77072e-01 2 -5.77797e+01 -6.19322e+01 5.12388e-01 3 -6.88750e+01 -5.72500e+01 6.43386e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 1 Total solve time: 6.43481e-01 Time spent in subproblems: 6.42053e-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 1m43.3s ****************************************************************************** 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.94021e-01 Time spent in subproblems: 1.08879e-02 (3%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 2.02864e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 2.02933e-01 Time spent in subproblems: 2.01560e-01 (99%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 1.99920e-01 2 5.77797e+01 6.19322e+01 3.70124e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 2 Total solve time: 3.70254e-01 Time spent in subproblems: 3.68482e-01 (100%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 3.15604e-01 2 5.77797e+01 6.19322e+01 3.21297e-01 3 6.80000e+01 5.90000e+01 5.66321e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 3 Total solve time: 5.66388e-01 Time spent in subproblems: 5.65651e-01 (100%) Number of subproblems: 4 ---------------------------------------------- Test Summary: | Pass Total Time Dichotomy.jl | 126 126 1m14.9s Test Summary: | Pass Total Time DominguezRios.jl | 1171 1171 9m46.6s 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.24201e+00 Time spent in subproblems: 1.03660e-02 (1%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.53099e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 3.53217e-01 Time spent in subproblems: 3.52766e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 1.93424e-01 2 -6.88750e+01 -5.72500e+01 3.84434e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 3.84583e-01 Time spent in subproblems: 3.29190e-01 (86%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.74992e-01 2 -6.88750e+01 -5.72500e+01 4.26987e-01 3 -5.77797e+01 -6.19322e+01 5.71856e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.71994e-01 Time spent in subproblems: 5.70470e-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 3m15.9s Test Summary: | Pass Total Time Hierarchical.jl | 21 21 4.5s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.93826e-01 Time spent in subproblems: 1.15409e-02 (2%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.13061e-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.27040e+00 Time spent in subproblems: 3.11659e-01 (25%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.07660e-01 2 -3.67843e+01 -4.93137e+01 3.98692e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 3.98797e-01 Time spent in subproblems: 3.97786e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.28154e-01 2 -3.67843e+01 -4.93137e+01 4.69522e-01 3 -5.77797e+01 -6.19322e+01 6.09439e-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: 6.09775e-01 Time spent in subproblems: 6.08018e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.77978e-01 2 -3.67843e+01 -4.93137e+01 5.72341e-01 3 -5.77797e+01 -6.19322e+01 7.45684e-01 4 -4.92857e+01 -4.27143e+01 9.22493e-01 5 auxillary subproblem 1.02406e+00 ---------------------------------------------- termination_status: OPTIMAL result_count: 0 Total solve time: 1.02420e+00 Time spent in subproblems: 9.21572e-01 (90%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.31602e-01 2 -3.67843e+01 -4.93137e+01 3.77267e-01 3 -5.77797e+01 -6.19322e+01 5.67155e-01 4 -4.92857e+01 -4.27143e+01 7.29234e-01 5 auxillary subproblem 8.67256e-01 6 subproblem not optimal 1.06955e+00 ---------------------------------------------- termination_status: OPTIMAL result_count: 0 Total solve time: 1.21937e+00 Time spent in subproblems: 8.65912e-01 (71%) Number of subproblems: 6 ---------------------------------------------- Test Summary: | Pass Total Time KirlikSayin.jl | 697 697 3m24.6s Test Summary: | Pass Total Time Lexicographic.jl | 48 48 12.8s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: RandomWeighting ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- Test Summary: | Pass Total Time RandomWeighting.jl | 24 24 4.1s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Sandwiching ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 2.40051e+00 Time spent in subproblems: 3.29677e-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.00628e+00 Time spent in subproblems: 1.00446e+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: 6.18829e-01 Time spent in subproblems: 3.99704e-01 (65%) 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: 4.71256e-01 Time spent in subproblems: 4.70631e-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: 2.26282e+00 Time spent in subproblems: 1.00623e+00 (44%) Number of subproblems: 5 ---------------------------------------------- Test Summary: | Pass Total Time Sandwiching.jl | 40 40 59.9s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 9.20596e-01 Time spent in subproblems: 1.15898e-02 (1%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.21266e-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.21556e-01 Time spent in subproblems: 3.19828e-01 (99%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 1.75721e-01 2 -3.67843e+01 -4.93137e+01 2.86291e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 2.86388e-01 Time spent in subproblems: 2.84467e-01 (99%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.74128e-01 2 -3.67843e+01 -4.93137e+01 4.53828e-01 3 -5.77797e+01 -6.19322e+01 5.87219e-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: 5.87516e-01 Time spent in subproblems: 5.86503e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.50659e-01 2 -3.67843e+01 -4.93137e+01 6.19480e-01 3 -5.77797e+01 -6.19322e+01 7.85666e-01 4 -4.92857e+01 -4.27143e+01 9.42042e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 9.42206e-01 Time spent in subproblems: 7.67135e-01 (81%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.29340e-01 2 -3.67843e+01 -4.93137e+01 5.93159e-01 3 -5.77797e+01 -6.19322e+01 8.56135e-01 4 -4.92857e+01 -4.27143e+01 1.03053e+00 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.18644e+00 Time spent in subproblems: 9.83846e-01 (83%) Number of subproblems: 6 ---------------------------------------------- Test Summary: | Pass Total Time TambyVanderpooten.jl | 697 697 4m02.1s 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 11m53.1s 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 2214.58s PkgEval succeeded after 2379.84s