Package evaluation to test Boscia on Julia 1.14.0-DEV.65 (b05afe0f25*) started at 2025-11-11T19:54:30.308 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.96s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.1 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.3 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.2.1 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 ⌅ [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.15.0 [f6369f11] + ForwardDiff v1.2.2 [f55ce6ea] + FrankWolfe v0.6.1 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.2.1 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.46.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [92933f4c] + ProgressMeter v1.11.0 [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.6.1 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.6.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.1+1 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.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.13.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 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.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.16.0+0 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.11.4 [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. To see why use `status --outdated -m` Installation completed after 6.23s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Error: Failed to use TestEnv.jl; test dependencies will not be precompiled │ exception = │ UndefVarError: `project_rel_path` not defined in `TestEnv` │ Suggestion: this global was defined as `Pkg.Operations.project_rel_path` but not assigned a value. │ Stacktrace: │ [1] get_test_dir(ctx::Pkg.Types.Context, pkgspec::PackageSpec) │ @ TestEnv ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/common.jl:75 │ [2] test_dir_has_project_file │ @ ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/common.jl:52 [inlined] │ [3] maybe_gen_project_override! │ @ ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/common.jl:83 [inlined] │ [4] activate(pkg::String; allow_reresolve::Bool) │ @ TestEnv ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/activate_set.jl:12 │ [5] activate(pkg::String) │ @ TestEnv ~/.julia/packages/TestEnv/nGMfF/src/julia-1.11/activate_set.jl:9 │ [6] top-level scope │ @ /PkgEval.jl/scripts/precompile.jl:24 │ [7] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [8] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:344 │ [9] _start() │ @ Base ./client.jl:577 └ @ Main /PkgEval.jl/scripts/precompile.jl:26 Precompiling package dependencies... Precompiling packages... 1517.8 ms ✓ Bonobo 84918.7 ms ✓ MathOptInterface 10893.5 ms ✓ MathOptSetDistances 41499.2 ms ✓ FrankWolfe 14532.3 ms ✓ Boscia 5 dependencies successfully precompiled in 156 seconds. 95 already precompiled. Precompilation completed after 168.91s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_tB87Cw/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.1 [31c24e10] Distributions v0.25.122 [497a8b3b] DoubleFloats v1.5.0 [f55ce6ea] FrankWolfe v0.6.1 [87dc4568] HiGHS v1.20.1 [e91730f6] Hungarian v0.7.0 [b8f27783] MathOptInterface v1.46.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_tB87Cw/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.3 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.2.1 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.122 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.5.0 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.15.0 [f6369f11] ForwardDiff v1.2.2 [f55ce6ea] FrankWolfe v0.6.1 [14197337] GenericLinearAlgebra v0.3.19 [c145ed77] GenericSchur v0.5.6 [87dc4568] HiGHS v1.20.1 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.2.1 [0f8b85d8] JSON3 v1.14.3 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.46.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.36 [69de0a69] Parsers v2.8.3 [f27b6e38] Polynomials v4.1.0 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [92933f4c] ProgressMeter v1.11.0 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.7 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.6.1 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.8 [4c63d2b9] StatsFuns v1.5.2 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.6.0 [fd094767] Suppressor v0.2.8 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [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.1400+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.200+0 [e5ac4fe4] SCIP_jll v900.200.200+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [1317d2d5] oneTBB_jll v2022.0.0+1 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [4af54fe1] LazyArtifacts v1.11.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.13.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 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [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 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.11.4 [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... Interface Tests seed = 0x9af7c7a153a930e3 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution LMO Tests seed = 0xfd177684b410f9f3 Indicator Tests Heuristics Tests seed = 0x82ee8c44bac27f4d [ Info: Polish solution Sparse Regression Tests seed = 0x851a89f6065a439d Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.303178e+00 2.424683e+00 1.215047e-01 5.275522e-02 1.913800e+01 1.567562e-01 7723 41 10 12 3 0 13 4 2.406269e+00 2.424683e+00 1.841421e-02 7.652599e-03 2.279700e+01 7.457122e-01 8 6 81 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.609788e+00 1.183778e+00 3.426010e+00 0.000000e+00 Inf 1 LD 2 2.424683e+00 2.424683e+00 0.000000e+00 2.104129e+00 9.505122e-01 1 Last 2 2.424683e+00 2.424683e+00 0.000000e+00 2.274485e+00 8.793201e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.424683e+00 2.424683e+00 0.000000e+00 2.279141e+00 8.775238e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.424683035548092 Dual Bound: 2.406268824887885 Dual Gap (relative): 0.007652599106862035 Search Statistics. Total number of nodes processed: 17 Total number of lmo calls: 86 Total time (s): 26.922 LMO calls / sec: 3.1944134908253474 Nodes / sec: 0.6314538295817547 LMO calls / node: 5.0588235294117645 Total number of global tightenings: 43 Global tightenings / node: 3.31 Total number of local tightenings: 49 Local tightenings / node: 3.77 Total number of potential local tightenings: 49 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.080823e+00 3.755994e+00 1.675171e+00 8.050518e-01 1.591200e+01 1.885370e-01 7344 219 38 96 23 1 * 3 4 2.105906e+00 3.726387e+00 1.620480e+00 7.694930e-01 1.623600e+01 4.311407e-01 113 87 83 36 16 0 100 67 3.027795e+00 3.726387e+00 6.985914e-01 2.307261e-01 2.582300e+01 6.467103e+00 45 33 1417 23 16 0 200 67 3.143717e+00 3.726387e+00 5.826691e-01 1.853440e-01 2.855500e+01 9.350376e+00 32 23 1857 24 15 0 300 69 3.220624e+00 3.726387e+00 5.057622e-01 1.570386e-01 3.150900e+01 1.171094e+01 26 19 2346 15 7 0 400 69 3.288237e+00 3.726387e+00 4.381492e-01 1.332475e-01 3.441700e+01 1.362699e+01 26 19 2831 12 5 0 500 69 3.346202e+00 3.726387e+00 3.801848e-01 1.136168e-01 3.726200e+01 1.527025e+01 41 30 3337 30 11 0 600 69 3.409746e+00 3.726387e+00 3.166409e-01 9.286350e-02 4.007300e+01 1.669453e+01 67 48 3858 56 15 5 700 69 3.481085e+00 3.726387e+00 2.453014e-01 7.046694e-02 4.296000e+01 1.790037e+01 27 19 4419 11 3 0 800 69 3.534605e+00 3.726387e+00 1.917816e-01 5.425828e-02 4.651800e+01 1.868094e+01 37 26 5070 35 8 1 900 63 3.596394e+00 3.726387e+00 1.299927e-01 3.614529e-02 5.006500e+01 1.923499e+01 39 29 5697 19 6 0 1000 41 3.671107e+00 3.726387e+00 5.527997e-02 1.505812e-02 5.323000e+01 1.955664e+01 28 21 6285 16 4 2 1023 32 3.691940e+00 3.726387e+00 3.444632e-02 9.330141e-03 5.395500e+01 1.955333e+01 15 10 6424 2 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.021271e+00 -6.954767e-01 9.716748e+00 0.000000e+00 Inf 1 LD 2 3.726387e+00 3.726387e+00 0.000000e+00 1.577218e-01 1.268055e+01 1 Last 2 3.726387e+00 3.726387e+00 0.000000e+00 3.234831e-01 6.182702e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.726387e+00 3.726387e+00 0.000000e+00 3.282267e-01 6.093349e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.726386508996546 Dual Bound: 3.6919401876044278 Dual Gap (relative): 0.009330140696149592 Search Statistics. Total number of nodes processed: 1055 Total number of lmo calls: 6429 Total time (s): 56.072 LMO calls / sec: 114.65615637038093 Nodes / sec: 18.81509487801398 LMO calls / node: 6.093838862559242 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 8 Non zero entries: 9th entry: 0.1681431541262299 26th entry: 0.1681431541262299 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.225348e+00 3.755994e+00 1.530646e+00 6.878232e-01 3.240000e-01 9.259259e+00 318 259 38 96 23 1 * 3 4 2.249840e+00 3.726387e+00 1.476546e+00 6.562892e-01 6.990000e-01 1.001431e+01 149 91 83 36 16 0 100 43 3.098014e+00 3.726387e+00 6.283723e-01 2.028307e-01 9.152000e+00 1.562500e+01 27 20 1379 16 15 0 200 33 3.240904e+00 3.726387e+00 4.854827e-01 1.497986e-01 1.196300e+01 1.947672e+01 27 20 1888 24 10 0 300 34 3.384094e+00 3.726387e+00 3.422929e-01 1.011476e-01 1.613800e+01 2.069649e+01 28 20 2596 22 8 0 400 34 3.527593e+00 3.726387e+00 1.987935e-01 5.635388e-02 2.015800e+01 2.152991e+01 30 22 3308 21 7 0 500 27 3.654985e+00 3.726387e+00 7.140197e-02 1.953551e-02 2.542800e+01 2.072518e+01 61 43 4248 74 13 7 526 19 3.696584e+00 3.726387e+00 2.980229e-02 8.062117e-03 2.664800e+01 2.045182e+01 45 33 4469 27 4 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 9.021271e+00 -6.954767e-01 9.716748e+00 0.000000e+00 Inf 1 LD 2 3.726387e+00 3.726387e+00 0.000000e+00 1.316208e-03 1.519517e+03 1 Last 2 3.726387e+00 3.726387e+00 0.000000e+00 9.032918e-03 2.214124e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 3.726387e+00 3.726387e+00 0.000000e+00 1.349669e-02 1.481845e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 3.726386508996546 Dual Bound: 3.6965842143035728 Dual Gap (relative): 0.00806211706949788 Search Statistics. Total number of nodes processed: 545 Total number of lmo calls: 4474 Total time (s): 26.676 LMO calls / sec: 167.71629929524667 Nodes / sec: 20.4303493777178 LMO calls / node: 8.209174311926606 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 5 Poisson Tests seed = 0x27636eb6a9b95dbe Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.249557e+02 -8.096315e+02 1.532422e+01 1.892740e-02 1.608600e+01 1.864976e-01 7801 78 30 367 8 3 * 9 10 -8.226814e+02 -8.110280e+02 1.165348e+01 1.436877e-02 2.027400e+01 9.371609e-01 855 76 207 511 8 6 * 13 14 -8.220062e+02 -8.123504e+02 9.655865e+00 1.188633e-02 2.293200e+01 1.177394e+00 578 69 292 330 6 6 * 25 26 -8.208915e+02 -8.151949e+02 5.696578e+00 6.987995e-03 3.134800e+01 1.626898e+00 345 53 558 243 8 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 1.152914e+03 1.148652e+03 4.261703e+00 0.000000e+00 Inf 1 LD 2 -7.722222e+02 -7.742858e+02 2.063570e+00 1.761551e-01 1.135363e+01 2 LD 20 -7.943567e+02 -7.950026e+02 6.458426e-01 4.860606e-01 4.114714e+01 2 LD 27 -8.156942e+02 -8.159832e+02 2.890436e-01 5.087196e-01 5.307442e+01 2 LD 33 -8.161930e+02 -8.162721e+02 7.904111e-02 5.234132e-01 6.304770e+01 2 LD 35 -8.162098e+02 -8.162098e+02 1.891051e-09 5.287606e-01 6.619253e+01 2 Last 35 -8.162098e+02 -8.162098e+02 1.891051e-09 5.356482e-01 6.534139e+01 2 ---------------------------------------------------------------------------------------------------------------- PP 35 -8.162098e+02 -8.162098e+02 1.891051e-09 5.396442e-01 6.485755e+01 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -816.2097796901417 Dual Bound: -820.8914687563517 Dual Gap (relative): 0.005735889452326087 Search Statistics. Total number of nodes processed: 51 Total number of lmo calls: 572 Total time (s): 33.555 LMO calls / sec: 17.046639845030548 Nodes / sec: 1.519892713455521 LMO calls / node: 11.215686274509803 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -6.844020e+02 -6.836931e+02 7.088808e-01 1.036841e-03 1.951200e+01 1.537515e-01 7687 65 11 13 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -3.537990e+02 -3.544902e+02 6.912083e-01 0.000000e+00 Inf 1 LD 2 -6.836931e+02 -6.836931e+02 0.000000e+00 1.724602e-01 1.159688e+01 1 Last 2 -6.836931e+02 -6.836931e+02 0.000000e+00 3.511107e-01 5.696209e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -6.836931e+02 -6.836931e+02 0.000000e+00 3.564389e-01 5.611060e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -683.6931300065447 Dual Bound: -684.402010824315 Dual Gap (relative): 0.0010368406331119117 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 16 Total time (s): 21.81 LMO calls / sec: 0.7336084364970198 Nodes / sec: 0.13755158184319122 LMO calls / node: 5.333333333333333 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.701007e+02 3.288053e+02 1.587046e+02 9.330039e-01 1.585600e+01 1.892028e-01 7764 119 19 30 5 0 * 7 8 2.055763e+02 3.276431e+02 1.220669e+02 5.937791e-01 1.683900e+01 8.907892e-01 137 87 103 30 5 1 * 18 19 2.232531e+02 3.273817e+02 1.041286e+02 4.664153e-01 1.836800e+01 2.014373e+00 110 63 232 31 5 0 100 97 2.702295e+02 3.273817e+02 5.715219e+01 2.114950e-01 2.717900e+01 7.248243e+00 59 33 1094 17 4 0 200 177 2.899641e+02 3.273817e+02 3.741758e+01 1.290421e-01 3.455700e+01 1.090951e+01 59 32 1878 21 1 0 300 189 3.021955e+02 3.273817e+02 2.518624e+01 8.334419e-02 3.902200e+01 1.253139e+01 22 16 2420 4 1 3 400 173 3.112348e+02 3.273817e+02 1.614693e+01 5.188023e-02 4.294800e+01 1.334172e+01 37 25 2890 6 3 1 * 413 162 3.126189e+02 3.271081e+02 1.448925e+01 4.634798e-02 4.334200e+01 1.331272e+01 19 13 2935 2 2 0 500 105 3.176967e+02 3.271081e+02 9.411405e+00 2.962387e-02 4.549500e+01 1.334213e+01 17 13 3220 2 1 1 591 32 3.240386e+02 3.271081e+02 3.069504e+00 9.472648e-03 4.735900e+01 1.319707e+01 10 7 3492 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.273817e+02 3.272617e+02 1.200090e-01 0.000000e+00 Inf 1 LD 2 3.271081e+02 3.271081e+02 7.660717e-11 1.768793e-01 1.130715e+01 2 Last 2 3.271081e+02 3.271081e+02 7.660717e-11 3.601423e-01 5.553361e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.271081e+02 3.271081e+02 1.713847e-10 3.652750e-01 5.475326e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 327.1081078022359 Dual Bound: 324.038604287689 Dual Gap (relative): 0.009472647622632434 Search Statistics. Total number of nodes processed: 625 Total number of lmo calls: 3497 Total time (s): 49.715 LMO calls / sec: 70.34094337725033 Nodes / sec: 12.571658453183144 LMO calls / node: 5.5952 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.701007e+02 3.288053e+02 1.587046e+02 9.330039e-01 1.999800e+01 1.500150e-01 8285 122 19 30 4 0 * 2 3 1.701007e+02 3.280535e+02 1.579528e+02 9.285843e-01 2.103500e+01 2.376991e-01 88 62 33 26 5 0 * 8 9 2.012904e+02 3.273817e+02 1.260913e+02 6.264151e-01 2.673900e+01 6.357755e-01 77 51 112 25 3 1 100 87 2.670107e+02 3.273817e+02 6.037101e+01 2.260996e-01 9.215600e+01 2.029168e+00 79 48 1041 20 1 1 200 157 2.893245e+02 3.273817e+02 3.805722e+01 1.315382e-01 1.402560e+02 2.545346e+00 61 40 1765 17 2 1 300 185 3.007875e+02 3.273817e+02 2.659424e+01 8.841537e-02 1.695090e+02 2.861205e+00 15 10 2251 2 1 0 400 163 3.128842e+02 3.273817e+02 1.449746e+01 4.633491e-02 1.878970e+02 2.996322e+00 37 23 2633 6 4 2 * 424 141 3.139985e+02 3.271081e+02 1.310966e+01 4.175071e-02 1.892580e+02 2.995910e+00 17 12 2708 2 2 0 500 75 3.178277e+02 3.271081e+02 9.280382e+00 2.919941e-02 1.925910e+02 2.995986e+00 8 6 2911 0 1 0 577 12 3.239249e+02 3.271081e+02 3.183251e+00 9.827127e-03 1.966860e+02 3.004789e+00 9 6 3107 0 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.273817e+02 3.272617e+02 1.200090e-01 0.000000e+00 Inf 1 LD 2 3.271081e+02 3.271081e+02 7.660717e-11 1.848192e-01 1.082139e+01 2 Last 2 3.271081e+02 3.271081e+02 7.660717e-11 3.726758e-01 5.366595e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 2 3.271081e+02 3.271081e+02 1.713847e-10 3.776164e-01 5.296380e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 327.1081078022359 Dual Bound: 323.92485722282504 Dual Gap (relative): 0.009827126595663318 Search Statistics. Total number of nodes processed: 591 Total number of lmo calls: 3112 Total time (s): 198.919 LMO calls / sec: 15.64455884053308 Nodes / sec: 2.9710585715793862 LMO calls / node: 5.265651438240271 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Mean Risk Test seed = 0x6daf1c79a84d8a94 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -2.508799e+01 7.063938e+01 9.572738e+01 Inf 1.881600e+01 1.594388e-01 9402 189 45 10001 25 7 * 2 3 -2.508799e+01 4.802380e+01 7.311179e+01 Inf 1.928900e+01 2.592151e-01 467 67 63 10001 23 19 * 4 5 -2.058025e+01 2.757677e+01 4.815703e+01 Inf 2.004200e+01 4.490570e-01 319 50 124 7237 20 16 WARNING: Dual bound 36.5533 is larger than the objective of the primal solution 36.5533. The solution might not be optimal. * 42 43 -6.259070e+00 2.145234e+01 2.771141e+01 Inf 3.319300e+01 2.560781e+00 415 66 1350 10001 14 10 * 56 57 -3.868082e+00 1.912548e+01 2.299357e+01 Inf 3.768900e+01 2.998222e+00 150 50 1802 2617 16 27 100 87 1.643315e-01 1.912548e+01 1.896115e+01 1.153835e+02 4.922300e+01 3.799037e+00 69 27 3051 1083 18 8 ┌ Error: Unexpected termination: TIME_LIMIT └ @ FrankWolfe ~/.julia/packages/FrankWolfe/RZPpN/src/moi_oracle.jl:361 133 114 1.738848e+00 1.912548e+01 1.738663e+01 9.998938e+00 6.004300e+01 4.113719e+00 48 8 4035 1 1 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 19.12548302765189 Dual Bound: 1.7388481423736835 Dual Gap (relative): 9.99893806801547 Search Statistics. Total number of nodes processed: 247 Total number of lmo calls: 4035 Total time (s): 60.899 LMO calls / sec: 66.25724560337608 Nodes / sec: 4.055895827517693 LMO calls / node: 16.336032388663966 Total number of global tightenings: 28 Global tightenings / node: 0.21 Total number of local tightenings: 803 Local tightenings / node: 6.04 Total number of potential local tightenings: 1113 Time Limit Test seed = 0x84e9588c02859ac3 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -4.549546e+00 0.000000e+00 4.549546e+00 Inf 1.775500e+01 1.689665e-01 9795 467 29 10001 11 6 * 2 3 -4.549546e+00 -2.111938e+00 2.437607e+00 1.154204e+00 1.800200e+01 2.777469e-01 195 91 52 4402 9 11 * 10 11 -4.120216e+00 -2.552258e+00 1.567958e+00 6.143416e-01 2.141000e+01 9.808501e-01 37 25 282 335 7 11 * 49 42 -3.590970e+00 -2.595728e+00 9.952418e-01 3.834152e-01 2.957700e+01 3.144335e+00 279 238 1125 1842 3 6 ┌ Error: Unexpected termination: TIME_LIMIT └ @ FrankWolfe ~/.julia/packages/FrankWolfe/RZPpN/src/moi_oracle.jl:361 51 44 -3.590970e+00 -2.595728e+00 9.952418e-01 3.834152e-01 3.000500e+01 3.232795e+00 47 38 1155 99 3 5 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -2.595728315636771 Dual Bound: -3.5909701320150536 Dual Gap (relative): 0.3834152481917718 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1155 Total time (s): 30.797 LMO calls / sec: 37.50365295320973 Nodes / sec: 3.1496574341656656 LMO calls / node: 11.907216494845361 Total number of global tightenings: 4 Global tightenings / node: 0.08 Total number of local tightenings: 165 Local tightenings / node: 3.24 Total number of potential local tightenings: 300 Strong Convexity and Sharpness Tests seed = 0xae1c78377bf993e8 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.975446e+02 1.976904e+02 1.458236e-01 7.381807e-04 1.569700e+01 1.911193e-01 7094 1000 12 21 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 197.69044077159447 Dual Bound: 197.54461715421664 Dual Gap (relative): 0.000738180667631096 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 12 Total time (s): 16.545 LMO calls / sec: 0.7252946509519491 Nodes / sec: 0.18132366273798728 LMO calls / node: 4.0 Total number of global tightenings: 8 Global tightenings / node: 8.0 Total number of local tightenings: 8 Local tightenings / node: 8.0 Total number of potential local tightenings: 16 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.225238e+02 2.230051e+02 4.812799e-01 2.162824e-03 1.569200e+01 1.911802e-01 6857 0 12 19 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 223.00506427480568 Dual Bound: 222.52378442434014 Dual Gap (relative): 0.0021628243098174497 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 12 Total time (s): 16.557 LMO calls / sec: 0.7247689798876609 Nodes / sec: 0.18119224497191522 LMO calls / node: 4.0 Total number of global tightenings: 7 Global tightenings / node: 7.0 Total number of local tightenings: 7 Local tightenings / node: 7.0 Total number of potential local tightenings: 15 Branching Strategy Tests seed = 0x52763b1043589f07 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 1.593700e+01 1.882412e-01 7811 54 48 3749 20 5 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.733500e+01 3.749639e+00 10 7 953 27 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.321771298479149 Dual Gap (relative): 0.008253858173238702 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 953 Total time (s): 18.096 LMO calls / sec: 52.663572060123784 Nodes / sec: 3.5919540229885056 LMO calls / node: 14.661538461538461 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 87 Local tightenings / node: 1.43 Total number of potential local tightenings: 162 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.600000e-01 8.333333e+00 247 41 48 3749 1 2 87 0 7.382204e+00 7.382204e+00 0.000000e+00 0.000000e+00 1.687000e+00 5.157084e+01 3 2 1015 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.382204160353686 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.688 LMO calls / sec: 601.303317535545 Nodes / sec: 51.540284360189574 LMO calls / node: 11.666666666666666 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 53 Local tightenings / node: 0.61 Total number of potential local tightenings: 108 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest most infeasible gradient FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.290000e-01 9.118541e+00 209 37 48 3749 20 5 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 1.445000e+00 4.083045e+01 3 2 859 2 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.338246272538823 Dual Gap (relative): 0.005990244287570652 Search Statistics. Total number of nodes processed: 59 Total number of lmo calls: 859 Total time (s): 1.446 LMO calls / sec: 594.0525587828492 Nodes / sec: 40.80221300138313 LMO calls / node: 14.559322033898304 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 77 Local tightenings / node: 1.35 Total number of potential local tightenings: 167 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Uniform Random Choice FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.710000e-01 8.086253e+00 226 43 48 3749 4 2 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.741000e+00 4.307869e+01 11 7 902 27 10 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.334320316425324 Dual Gap (relative): 0.006528736387627484 Search Statistics. Total number of nodes processed: 75 Total number of lmo calls: 902 Total time (s): 1.742 LMO calls / sec: 517.7956371986223 Nodes / sec: 43.053960964408724 LMO calls / node: 12.026666666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 54 Local tightenings / node: 0.74 Total number of potential local tightenings: 118 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Largest Index FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -8.975192e-03 7.382204e+00 7.391179e+00 Inf 3.360000e-01 8.928571e+00 226 43 48 3749 4 2 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.965000e+00 4.936387e+01 3 2 1174 2 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 7.382204160353686 Dual Bound: 7.325011777780223 Dual Gap (relative): 0.007807821244322148 Search Statistics. Total number of nodes processed: 97 Total number of lmo calls: 1174 Total time (s): 1.965 LMO calls / sec: 597.4554707379135 Nodes / sec: 49.36386768447837 LMO calls / node: 12.103092783505154 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 82 Local tightenings / node: 0.88 Total number of potential local tightenings: 170 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.810000e-01 6.237006e+00 478 74 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 8.000000e-01 1.125000e+01 99 48 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.400000e-01 1.170213e+01 137 51 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.182000e+00 2.189066e+01 98 43 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.822000e+00 2.209326e+01 70 29 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.608100e+01 2.493626e+01 56 29 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.236700e+01 2.669111e+01 52 23 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.867700e+01 2.765282e+01 56 27 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.391400e+01 2.851330e+01 26 17 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.927000e+01 2.900433e+01 62 28 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.373700e+01 2.910579e+01 9 6 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.741100e+01 2.887516e+01 8 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 5.030600e+01 2.832664e+01 9 5 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.262300e+01 2.795356e+01 31 15 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.455100e+01 2.740555e+01 9 6 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.599400e+01 2.698503e+01 10 7 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.744900e+01 2.640603e+01 16 11 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.874400e+01 2.592605e+01 11 8 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.933800e+01 2.566652e+01 7 5 27525 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 59.339 LMO calls / sec: 463.86019312762267 Nodes / sec: 25.666088070240484 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 2.044000e+00 1.467710e+00 467 78 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.377000e+00 3.786285e+00 90 40 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.513000e+00 4.377238e+00 134 48 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.070800e+01 1.877101e+01 87 37 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.134200e+01 1.913243e+01 76 34 3485 420 10 10 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.755600e+01 2.261335e+01 89 32 6038 662 16 7 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.272500e+01 2.468647e+01 48 24 8396 223 5 6 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.764900e+01 2.578755e+01 24 15 10594 67 10 19 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 3.159800e+01 2.686879e+01 50 25 12514 245 1 0 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.554500e+01 2.776762e+01 23 13 14423 73 2 2 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.886900e+01 2.842883e+01 8 5 16134 16 8 7 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 4.229200e+01 2.887071e+01 7 5 17857 8 5 1 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.514900e+01 2.912578e+01 9 6 19379 12 5 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.760800e+01 2.946984e+01 11 7 20802 22 9 5 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.961900e+01 2.944437e+01 12 8 22010 10 5 1 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 5.170100e+01 2.938048e+01 8 6 23131 12 9 5 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 5.326900e+01 2.960446e+01 11 8 24076 18 5 4 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 5.472900e+01 2.961867e+01 13 9 24995 22 9 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 5.615700e+01 2.954218e+01 16 10 25874 36 9 12 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.730500e+01 2.929936e+01 7 5 26633 8 6 3 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.746600e+01 2.921728e+01 16 10 26740 41 12 6 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.083355821757877 Dual Gap (relative): 0.009945008189894359 Search Statistics. Total number of nodes processed: 1679 Total number of lmo calls: 26740 Total time (s): 57.467 LMO calls / sec: 465.31052604103223 Nodes / sec: 29.216767884177006 LMO calls / node: 15.926146515783204 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2233 Local tightenings / node: 1.38 Total number of potential local tightenings: 5463 Number of alternative decisions: 438 Number of stable decisions: 401 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.370000e-01 5.586592e+00 473 83 64 4885 36 6 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.321000e+00 9.841030e+00 108 44 256 696 19 22 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 6.731000e+00 1.916506e+01 62 28 2096 346 11 15 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 9.353000e+00 2.149043e+01 76 35 3186 412 13 6 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.594900e+01 2.514264e+01 83 41 6017 417 2 1 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 2.159600e+01 2.755140e+01 50 27 8679 179 9 3 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.680300e+01 2.854158e+01 17 11 11070 27 9 3 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 3.174300e+01 2.932930e+01 71 34 13344 339 17 8 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 3.628700e+01 2.979028e+01 51 21 15506 341 8 3 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 4.037900e+01 2.994131e+01 47 23 17444 229 10 6 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 4.445400e+01 3.003104e+01 7 4 19379 9 7 6 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 4.749600e+01 3.042361e+01 49 23 21026 246 8 7 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 5.057500e+01 3.043005e+01 40 23 22661 137 4 3 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 5.269500e+01 3.087579e+01 6 4 24161 6 4 6 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 5.496200e+01 3.069393e+01 12 8 25390 20 6 3 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 5.728700e+01 3.056540e+01 36 19 26657 170 13 4 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.908200e+01 3.038150e+01 8 5 27751 16 7 3 1458 359 2.644732e+01 2.836265e+01 1.915322e+00 7.242025e-02 6.000200e+01 3.028232e+01 2 1 28330 1 3 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 28.362645025404976 Dual Bound: 26.447323283125005 Dual Gap (relative): 0.07242024917894291 Search Statistics. Total number of nodes processed: 1817 Total number of lmo calls: 28330 Total time (s): 60.006 LMO calls / sec: 472.11945472119453 Nodes / sec: 30.280305302803054 LMO calls / node: 15.591634562465602 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2478 Local tightenings / node: 1.7 Total number of potential local tightenings: 5918 Number of alternative decisions: 543 Number of stable decisions: 365 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.010000e-01 5.988024e+00 449 68 64 4885 2 2 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.462000e+00 1.665313e+01 89 41 678 489 23 5 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 3.162000e+00 1.992410e+01 68 36 968 257 17 12 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.963000e+00 2.524174e+01 15 8 2918 60 2 4 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.251100e+01 3.061306e+01 29 15 5197 153 21 2 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.709700e+01 3.316371e+01 25 15 7469 83 5 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 2.138400e+01 3.437149e+01 24 11 9610 131 7 3 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.621200e+01 3.483137e+01 42 21 11880 193 7 5 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.934400e+01 3.649809e+01 20 11 13971 113 6 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.250100e+01 3.762961e+01 20 12 15981 55 3 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.496400e+01 3.869695e+01 25 14 17719 139 13 1 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.851500e+01 3.824484e+01 15 10 19510 37 9 3 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 4.231900e+01 3.773719e+01 72 32 21254 396 7 4 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.541200e+01 3.732494e+01 13 8 22747 24 8 3 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.793900e+01 3.690106e+01 6 5 24101 6 4 1 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 5.020500e+01 3.643063e+01 17 11 25317 23 11 5 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 5.221400e+01 3.571839e+01 7 5 26374 10 5 1 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 5.391900e+01 3.510822e+01 12 8 27346 16 8 1 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.546300e+01 3.438328e+01 23 13 28188 61 3 1 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.680200e+01 3.381923e+01 6 3 29039 10 7 8 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.796900e+01 3.327641e+01 8 5 29805 14 8 2 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.869100e+01 3.290113e+01 5 3 30260 6 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.106101931570876 Dual Gap (relative): 0.009127665389483692 Search Statistics. Total number of nodes processed: 1931 Total number of lmo calls: 30260 Total time (s): 58.692 LMO calls / sec: 515.57282082737 Nodes / sec: 32.90056566482655 LMO calls / node: 15.67063697566028 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 1888 Local tightenings / node: 1.01 Total number of potential local tightenings: 4439 Number of alternative decisions: 331 Number of stable decisions: 634 Minimum number of branchings per variable: 1 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Pseudocost FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.580000e-01 6.550218e+00 455 72 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.740000e-01 1.162791e+01 90 40 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.160000e-01 1.200873e+01 139 53 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.441000e+00 2.381234e+01 62 27 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.946000e+00 2.425665e+01 50 23 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.496600e+01 2.679407e+01 60 32 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.134300e+01 2.797170e+01 55 24 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.748000e+01 2.885735e+01 70 33 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.286600e+01 2.942250e+01 21 13 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.852000e+01 2.956906e+01 62 28 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.286900e+01 2.969512e+01 15 10 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.669100e+01 2.932043e+01 8 5 20396 14 8 12 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.950300e+01 2.882654e+01 63 27 21910 381 1 1 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 5.188500e+01 2.835116e+01 12 8 23162 19 11 10 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 5.385700e+01 2.783297e+01 37 20 24363 145 12 7 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 5.555300e+01 2.727125e+01 12 8 25359 25 10 8 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 5.706800e+01 2.675755e+01 41 21 26283 172 9 5 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.833400e+01 2.627970e+01 17 11 27090 27 10 9 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.912300e+01 2.596282e+01 7 5 27580 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1535 Total number of lmo calls: 27580 Total time (s): 59.124 LMO calls / sec: 466.47723428726067 Nodes / sec: 25.962384141803668 LMO calls / node: 17.96742671009772 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2409 Local tightenings / node: 1.64 Total number of potential local tightenings: 5193 Number of alternative decisions: 718 Number of stable decisions: 49 Minimum number of branchings per variable: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.700000e-01 6.382979e+00 466 76 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.980000e-01 1.127820e+01 96 44 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 9.440000e-01 1.165254e+01 143 57 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.114000e+00 2.205398e+01 96 37 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 9.758000e+00 2.223816e+01 70 31 3485 420 10 10 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.584900e+01 2.530128e+01 49 24 6086 247 9 4 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 2.199200e+01 2.714623e+01 54 24 8821 325 9 1 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.807300e+01 2.824778e+01 59 29 11544 282 8 5 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 3.328800e+01 2.904951e+01 21 13 13970 61 9 7 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.890300e+01 2.927795e+01 63 29 16456 348 5 8 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 4.342300e+01 2.931626e+01 16 10 18546 31 10 2 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.744500e+01 2.885446e+01 7 5 20396 14 8 12 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 5.031300e+01 2.832270e+01 10 6 21913 21 10 7 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 5.267700e+01 2.792490e+01 27 12 23185 174 5 4 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 5.469000e+01 2.733589e+01 11 7 24396 13 7 5 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 5.623300e+01 2.687034e+01 13 8 25388 20 10 1 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.757700e+01 2.634733e+01 14 8 26318 33 12 12 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.874100e+01 2.592738e+01 9 6 27126 17 9 2 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.928700e+01 2.568860e+01 6 4 27525 6 4 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.082904707232128 Dual Gap (relative): 0.009961231613651684 Search Statistics. Total number of nodes processed: 1523 Total number of lmo calls: 27525 Total time (s): 59.288 LMO calls / sec: 464.2592092834975 Nodes / sec: 25.688166239373906 LMO calls / node: 18.072882468811557 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2413 Local tightenings / node: 1.66 Total number of potential local tightenings: 5196 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 3.468000e+00 8.650519e-01 483 71 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 3.820000e+00 2.356021e+00 101 46 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.966000e+00 2.773575e+00 143 55 217 944 17 16 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.206300e+01 1.666252e+01 92 41 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.270100e+01 1.708527e+01 71 32 3485 420 10 10 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 1.899800e+01 2.100221e+01 73 31 6090 444 9 4 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.534900e+01 2.307783e+01 49 24 8720 225 8 5 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 3.094300e+01 2.414116e+01 71 33 11144 379 18 5 500 399 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.567600e+01 2.519901e+01 12 7 13355 21 11 7 600 411 2.367246e+01 2.836265e+01 4.690187e+00 1.981284e-01 3.965100e+01 2.549747e+01 58 25 15250 331 10 3 700 407 2.449500e+01 2.836265e+01 3.867641e+00 1.578951e-01 4.322300e+01 2.561136e+01 66 31 17024 329 12 3 800 363 2.539631e+01 2.836265e+01 2.966336e+00 1.168019e-01 4.565200e+01 2.547534e+01 20 12 18354 67 15 10 900 301 2.616952e+01 2.836265e+01 2.193126e+00 8.380461e-02 4.776100e+01 2.514604e+01 9 5 19533 32 11 9 1000 225 2.691767e+01 2.836265e+01 1.444975e+00 5.368128e-02 4.970700e+01 2.464442e+01 7 4 20674 8 4 4 1100 137 2.763514e+01 2.836265e+01 7.275008e-01 2.632520e-02 5.095600e+01 2.427585e+01 20 11 21524 68 13 10 1187 52 2.808687e+01 2.836265e+01 2.757701e-01 9.818469e-03 5.203600e+01 2.381044e+01 7 5 22214 14 10 4 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.0868749251736 Dual Gap (relative): 0.009818468625151686 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22214 Total time (s): 52.037 LMO calls / sec: 426.88856006303206 Nodes / sec: 23.80998135941734 LMO calls / node: 17.92897497982244 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2160 Local tightenings / node: 1.82 Total number of potential local tightenings: 4714 Decisions made: [(62, 1), (516, 0), (40, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 5.010000e-01 5.988024e+00 497 87 64 4885 36 6 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 1.076000e+00 8.364312e+00 180 58 192 1340 13 25 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 9.030000e+00 2.225914e+01 53 28 3219 200 6 6 * 118 119 1.406031e+01 2.836265e+01 1.430233e+01 1.017213e+00 1.028700e+01 2.303879e+01 36 17 3726 178 10 12 200 199 1.704058e+01 2.836265e+01 1.132207e+01 6.644180e-01 1.604100e+01 2.487376e+01 49 25 6070 226 3 0 300 287 1.921318e+01 2.836265e+01 9.149468e+00 4.762080e-01 2.207100e+01 2.659599e+01 62 30 8686 275 8 3 400 359 2.087523e+01 2.836265e+01 7.487411e+00 3.586743e-01 2.745100e+01 2.764927e+01 41 23 11090 152 12 0 500 397 2.261057e+01 2.836265e+01 5.752072e+00 2.543975e-01 3.221300e+01 2.784590e+01 33 18 13255 124 12 8 600 411 2.379062e+01 2.836265e+01 4.572023e+00 1.921775e-01 3.615400e+01 2.796371e+01 25 13 15181 90 13 10 700 393 2.462769e+01 2.836265e+01 3.734957e+00 1.516568e-01 3.938400e+01 2.775239e+01 8 5 16798 8 6 12 800 359 2.546045e+01 2.836265e+01 2.902200e+00 1.139886e-01 4.218600e+01 2.747357e+01 13 9 18259 20 8 10 900 299 2.628929e+01 2.836265e+01 2.073352e+00 7.886678e-02 4.445500e+01 2.697109e+01 44 22 19506 212 13 1 1000 217 2.696789e+01 2.836265e+01 1.394758e+00 5.171920e-02 4.607500e+01 2.641346e+01 8 6 20487 10 7 4 1100 135 2.755469e+01 2.836265e+01 8.079536e-01 2.932182e-02 4.739600e+01 2.605705e+01 9 6 21358 19 9 4 1199 40 2.811400e+01 2.836265e+01 2.486474e-01 8.844257e-03 4.845100e+01 2.557223e+01 5 4 22136 6 4 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.113997603576518 Dual Gap (relative): 0.008844257061358888 Search Statistics. Total number of nodes processed: 1239 Total number of lmo calls: 22136 Total time (s): 48.452 LMO calls / sec: 456.86452571617275 Nodes / sec: 25.571699826632546 LMO calls / node: 17.866020984665052 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2101 Local tightenings / node: 1.75 Total number of potential local tightenings: 4676 Decisions made: [(70, 0), (526, 0), (23, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 4.550000e-01 6.593407e+00 452 66 64 4885 36 6 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 1.007000e+00 8.937438e+00 163 46 192 1340 13 25 100 101 1.325701e+01 2.977156e+01 1.651455e+01 1.245722e+00 8.709000e+00 2.307957e+01 51 28 3215 200 6 6 200 201 1.675948e+01 2.977156e+01 1.301208e+01 7.764012e-01 1.553700e+01 2.580936e+01 94 37 6123 607 11 16 * 220 219 1.746732e+01 2.836265e+01 1.089532e+01 6.237546e-01 1.670700e+01 2.639612e+01 33 18 6667 132 6 1 300 289 1.916299e+01 2.836265e+01 9.199655e+00 4.800741e-01 2.161000e+01 2.734845e+01 45 27 8782 119 14 1 400 369 2.094004e+01 2.836265e+01 7.422603e+00 3.544694e-01 2.701700e+01 2.853759e+01 12 8 11289 16 7 4 500 403 2.263394e+01 2.836265e+01 5.728704e+00 2.531024e-01 3.138800e+01 2.883267e+01 47 22 13362 246 7 3 600 415 2.372403e+01 2.836265e+01 4.638612e+00 1.955238e-01 3.553300e+01 2.862128e+01 15 9 15332 35 8 13 700 399 2.451924e+01 2.836265e+01 3.843403e+00 1.567505e-01 3.868800e+01 2.845844e+01 22 12 16953 87 7 0 800 381 2.538724e+01 2.836265e+01 2.975402e+00 1.172007e-01 4.198400e+01 2.817740e+01 14 8 18530 35 6 14 900 315 2.615751e+01 2.836265e+01 2.205134e+00 8.430215e-02 4.415000e+01 2.756512e+01 40 21 19747 152 13 2 1000 237 2.690654e+01 2.836265e+01 1.456107e+00 5.411720e-02 4.577500e+01 2.706718e+01 21 7 20774 16 8 3 1100 153 2.751278e+01 2.836265e+01 8.498667e-01 3.088989e-02 4.722700e+01 2.657378e+01 6 4 21697 6 3 0 1200 55 2.805099e+01 2.836265e+01 3.116569e-01 1.111037e-02 4.842400e+01 2.595820e+01 14 8 22486 33 14 7 1207 50 2.813525e+01 2.836265e+01 2.273973e-01 8.082294e-03 4.855000e+01 2.593203e+01 5 4 22531 6 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.13524768122234 Dual Gap (relative): 0.008082294023464538 Search Statistics. Total number of nodes processed: 1259 Total number of lmo calls: 22531 Total time (s): 48.551 LMO calls / sec: 464.0687112520854 Nodes / sec: 25.931494716895635 LMO calls / node: 17.895949166004765 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2158 Local tightenings / node: 1.79 Total number of potential local tightenings: 4822 Decisions made: [(69, 0), (525, 0), (35, 0)] Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Hierarchy Branching Order of criteria in Hierarchy Branching: ["binary", "most_infeasible", "pseudocost", "largest_most_infeasible_gradient"] FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -9.641193e-03 3.396650e+01 3.397614e+01 Inf 6.130000e-01 4.893964e+00 516 78 64 4885 32 5 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 9.610000e-01 9.365245e+00 92 39 176 523 15 15 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 1.098000e+00 1.001821e+01 134 47 217 944 17 16 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 39 running 1 of 1 signal (10): User defined signal 1 SCIPgetUpperbound at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.490000e+00 2.118019e+01 91 38 3237 536 11 8 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.009900e+01 2.148728e+01 71 30 3485 420 10 10 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 jfptr_wait_6702.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke95955.1 at /opt/julia/lib/julia/sys.so (unknown line) j_wait_37459.1 at /opt/julia/lib/julia/sys.so (unknown line) wait_forever at ./task.jl:1168 jfptr_wait_forever_37458.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] start_task at /source/src/task.c:1272 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007c78555a86a0 Total snapshots: 288. Utilization: 0% ╎288 @Base/task.jl:1168 wait_forever() 287╎ 288 @Base/task.jl:1246 wait() 200 199 1.683575e+01 2.836265e+01 1.152689e+01 6.846676e-01 2.273200e+01 1.755235e+01 53 24 6088 268 9 4 [39] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/Xc4sO/test/branching_strategy_test.jl:275 SCIPboolarrayGetVal at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) solGetArrayVal at /home/pkgeval/.julia/artifacts/dcf2760720b54f48ffe83e7ec4af21962e090305/lib/libscip.so (unknown line) SCIPgetSolVal at /home/pkgeval/.julia/packages/SCIP/4grSV/src/LibSCIP.jl:18076 [inlined] #sol_values##0 at ./none (unknown line) [inlined] iterate at ./generator.jl:48 [inlined] collect_to! at ./array.jl:886 [inlined] collect_to_with_first! at ./array.jl:864 collect at ./array.jl:838 [inlined] sol_values at /home/pkgeval/.julia/packages/SCIP/4grSV/src/convenience.jl:25 [inlined] find_best_solution at /home/pkgeval/.julia/packages/Boscia/Xc4sO/ext/BosciaSCIPExt.jl:28 unknown function (ip: 0x71e7b8313f62) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 find_best_solution at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/MOI_bounded_oracle.jl:592 unknown function (ip: 0x71e7b831322c) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #process_FW_callback_logic#36 at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/callbacks.jl:97 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/callbacks.jl:59 [inlined] #32 at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/callbacks.jl:24 unknown function (ip: 0x71e7b831c576) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #blended_pairwise_conditional_gradient#356 at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:261 unknown function (ip: 0x71e7b830853a) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/RZPpN/src/blended_pairwise.jl:76 #solve_frank_wolfe#6 at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/frank_wolfe_variants.jl:158 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/frank_wolfe_variants.jl:138 unknown function (ip: 0x71e7b82fb367) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/node.jl:364 #optimize!#12 at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/custom_bonobo.jl:35 optimize! at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/custom_bonobo.jl:29 unknown function (ip: 0x71e7b82ef837) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 #solve#108 at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/interface.jl:264 unknown function (ip: 0x71e7b84cf638) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 solve at /home/pkgeval/.julia/packages/Boscia/Xc4sO/src/interface.jl:28 unknown function (ip: 0x71e7da564fb8) at (unknown file) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:550 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_9567.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke96539.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_33389.1 at /opt/julia/lib/julia/sys.so (unknown line) include_string at ./loading.jl:2997 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3057 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke93601.1 at /opt/julia/lib/julia/sys.so (unknown line) include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_61358.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 macro expansion at /home/pkgeval/.julia/packages/Boscia/Xc4sO/test/runtests.jl:30 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/Test/src/Test.jl:1961 [inlined] top-level scope at /home/pkgeval/.julia/packages/Boscia/Xc4sO/test/runtests.jl:17 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 jl_toplevel_eval_flex at /source/src/toplevel.c:731 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_9567.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke96539.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_33389.1 at /opt/julia/lib/julia/sys.so (unknown line) include_string at ./loading.jl:2997 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 _include at ./loading.jl:3057 _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke93601.1 at /opt/julia/lib/julia/sys.so (unknown line) include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_61358.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:679 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 jl_toplevel_eval_flex at /source/src/toplevel.c:742 jl_eval_toplevel_stmts at /source/src/toplevel.c:585 jl_toplevel_eval_flex at /source/src/toplevel.c:683 ijl_toplevel_eval at /source/src/toplevel.c:754 ijl_toplevel_eval_in at /source/src/toplevel.c:799 eval at ./boot.jl:489 jfptr_eval_9567.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke96549.1 at /opt/julia/lib/julia/sys.so (unknown line) j_eval_33316.1 at /opt/julia/lib/julia/sys.so (unknown line) exec_options at ./client.jl:310 jfptr_exec_options_33296.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_invoke at /source/src/gf.c:4123 tojlinvoke93802.1 at /opt/julia/lib/julia/sys.so (unknown line) j_exec_options_58747.1 at /opt/julia/lib/julia/sys.so (unknown line) _start at ./client.jl:577 jfptr__start_58743.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4116 [inlined] ijl_apply_generic at /source/src/gf.c:4313 jl_apply at /source/src/julia.h:2284 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x71e7f4855249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) Allocations: 4424026375 (Pool: 4424022627; Big: 3748); GC: 1824 PkgEval terminated after 2725.43s: test duration exceeded the time limit