Package evaluation to test Boscia on Julia 1.14.0-DEV.2213 (dc778b8d37*) started at 2026-05-21T09:26:28.882 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.39s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.12 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.12 [d360d2e6] + ChainRulesCore v1.26.1 [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.19.4 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.3 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.4 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.2 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.2 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.1+0 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 6.27s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:460 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 2.0 s ? GenericLinearAlgebra 15.6 s ✓ Boscia ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14197337-ba66-59df-a3e3-ca00e7dcff7a"), "GenericLinearAlgebra") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base ./module.jl:137 [inlined]  [11] top-level scope  @ ~/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [13] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3271  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [17] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [19] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 14.7 s ✓ Boscia → BosciaHiGHSExt 19.2 s ✓ Boscia → BosciaSCIPExt 26.6 s ✓ CombinatorialLinearOracles 4 dependencies successfully precompiled in 83 seconds. 172 already precompiled. 1 dependency failed but may be precompilable after restarting julia 1 dependency had output during precompilation: ┌ GenericLinearAlgebra │ WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:460 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ Precompilation completed after 116.03s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_yfMVeM/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.125 [497a8b3b] DoubleFloats v1.7.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [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_yfMVeM/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.4 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.125 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.7.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.3 [f55ce6ea] FrankWolfe v0.6.4 [14197337] GenericLinearAlgebra v0.4.0 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.23.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.6.0 [4076af6c] JuMP v1.30.1 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.4 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.3 [be4d8f0f] Quadmath v1.0.1 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.10 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.6 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.2 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.8.2 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.3 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.14.0+0 [e33a78d0] Hwloc_jll v2.13.0+1 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.5+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.33+1 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.19.0+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.9+0 [1317d2d5] oneTBB_jll v2022.3.0+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.13.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.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [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.5.1+0 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.3+0 [29816b5a] LibSSH2_jll v1.11.101+0 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.5.14 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.6+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.69.0+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0x35e2dd3859cd996f WARNING: Use of Boscia.CubeSimpleBLMO is deprecated, use CubeLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:97 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = TIME_LIMIT_REACHED WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:986 Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = TIME_LIMIT_REACHED Callback Tests seed = 0x0a4fb66969b2e22f LMO Tests seed = 0x371aaa409d8ce609 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:218 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:254 Indicator Tests seed = 0x5065876862c33499 Heuristics Tests seed = 0x0499009cac6412f2 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:193 [ Info: Polish solution Sparse Regression Tests seed = 0x5b284912a696a2de 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.424379e+00 2.735855e+00 3.114767e-01 1.284769e-01 2.297900e+01 1.305540e-01 9512 49 18 22 10 1 59 12 2.712497e+00 2.735855e+00 2.335878e-02 8.611543e-03 2.768300e+01 2.564751e+00 5 3 281 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 7.835028e+00 -1.460544e+00 9.295572e+00 0.000000e+00 Inf 1 LD 2 2.735855e+00 2.735855e+00 0.000000e+00 2.342072e+00 8.539448e-01 1 Last 2 2.735855e+00 2.735855e+00 0.000000e+00 2.498979e+00 8.003268e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.735855e+00 2.735855e+00 0.000000e+00 2.501978e+00 7.993675e-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.7358553438108633 Dual Bound: 2.712496562517097 Dual Gap (relative): 0.008611543187391185 Search Statistics. Total number of nodes processed: 71 Total number of lmo calls: 286 Total time (s): 32.939 LMO calls / sec: 8.682716536628313 Nodes / sec: 2.1554995597923434 LMO calls / node: 4.028169014084507 Total number of global tightenings: 37 Global tightenings / node: 0.63 Total number of local tightenings: 50 Local tightenings / node: 0.85 Total number of potential local tightenings: 50 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 8.143559e-01 2.477773e+00 1.663417e+00 2.042617e+00 2.045000e+01 1.466993e-01 9656 186 42 92 29 1 * 3 4 8.321847e-01 2.467715e+00 1.635530e+00 1.965345e+00 2.075400e+01 3.372844e-01 106 75 99 50 21 0 * 53 52 1.631842e+00 2.460007e+00 8.281641e-01 5.075025e-01 2.574900e+01 4.077828e+00 14 9 1136 9 0 0 100 53 1.723807e+00 2.460007e+00 7.361993e-01 4.270775e-01 2.674200e+01 5.721337e+00 22 14 1432 35 17 0 200 53 1.783442e+00 2.460007e+00 6.765641e-01 3.793585e-01 2.945400e+01 8.589665e+00 50 32 2108 63 20 4 300 53 1.825011e+00 2.460007e+00 6.349951e-01 3.479404e-01 3.182700e+01 1.109121e+01 41 26 2801 64 20 5 400 53 1.860712e+00 2.460007e+00 5.992943e-01 3.220779e-01 3.460500e+01 1.309059e+01 24 15 3491 37 16 6 500 53 1.889863e+00 2.460007e+00 5.701439e-01 3.016854e-01 3.747700e+01 1.475572e+01 29 19 4264 72 16 9 600 53 1.918470e+00 2.460007e+00 5.415367e-01 2.822753e-01 4.014900e+01 1.626442e+01 41 25 5030 65 20 4 700 53 1.950881e+00 2.460007e+00 5.091257e-01 2.609722e-01 4.314400e+01 1.745318e+01 45 25 5801 98 19 7 800 53 1.983778e+00 2.460007e+00 4.762290e-01 2.400617e-01 4.573600e+01 1.865052e+01 54 32 6572 101 22 8 900 53 2.028048e+00 2.460007e+00 4.319589e-01 2.129925e-01 4.854800e+01 1.963006e+01 27 16 7357 42 19 8 1000 53 2.080108e+00 2.460007e+00 3.798985e-01 1.826340e-01 5.105900e+01 2.062320e+01 30 19 8083 22 7 0 1100 53 2.164055e+00 2.460007e+00 2.959511e-01 1.367576e-01 5.324700e+01 2.165380e+01 26 17 8784 32 7 6 1200 25 2.355899e+00 2.460007e+00 1.041079e-01 4.419033e-02 5.498700e+01 2.227799e+01 13 9 9458 6 0 0 1225 0 2.434585e+00 2.460007e+00 2.542160e-02 1.044186e-02 5.529000e+01 2.215591e+01 8 5 9583 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.161371e+00 -1.576793e+00 7.738164e+00 0.000000e+00 Inf 1 LD 2 2.460106e+00 2.446270e+00 1.383559e-02 1.136321e-01 1.760066e+01 2 LD 7 2.460025e+00 2.454112e+00 5.912440e-03 3.093209e-01 2.263022e+01 3 LD 12 2.460010e+00 2.457334e+00 2.675928e-03 3.123057e-01 3.842389e+01 3 LD 17 2.460007e+00 2.458794e+00 1.213354e-03 3.152435e-01 5.392656e+01 3 LD 22 2.460007e+00 2.459456e+00 5.506396e-04 3.180698e-01 6.916722e+01 3 LD 27 2.460007e+00 2.459757e+00 2.499853e-04 3.207085e-01 8.418859e+01 3 LD 32 2.460007e+00 2.459893e+00 1.135108e-04 3.232100e-01 9.900684e+01 3 LD 37 2.460006e+00 2.459955e+00 5.154595e-05 3.259496e-01 1.135145e+02 3 LD 42 2.460006e+00 2.459983e+00 2.340817e-05 3.285723e-01 1.278258e+02 3 LD 47 2.460006e+00 2.459996e+00 1.063035e-05 3.310941e-01 1.419536e+02 3 LD 52 2.460006e+00 2.460002e+00 4.827595e-06 3.337996e-01 1.557821e+02 3 LD 57 2.460006e+00 2.460004e+00 2.192379e-06 3.363967e-01 1.694428e+02 3 LD 62 2.460006e+00 2.460006e+00 9.956370e-07 3.393493e-01 1.827026e+02 3 Last 62 2.460006e+00 2.460006e+00 9.956370e-07 3.440721e-01 1.801948e+02 3 ---------------------------------------------------------------------------------------------------------------- PP 62 2.460006e+00 2.460006e+00 9.956370e-07 3.467195e-01 1.788189e+02 3 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 2.4600064972656366 Dual Bound: 2.460005501628658 Dual Gap (relative): 4.047295739708587e-7 Search Statistics. Total number of nodes processed: 1225 Total number of lmo calls: 9601 Total time (s): 57.757 LMO calls / sec: 166.23093304707655 Nodes / sec: 21.20955035753242 LMO calls / node: 7.8375510204081635 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: 22 Non zero entries: 1th entry: 0.14932671642463352 46th entry: 0.15408684942262885 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 9.219942e-01 2.477773e+00 1.555779e+00 1.687407e+00 2.290000e-01 1.310044e+01 223 168 42 92 29 1 * 3 4 9.378733e-01 2.467715e+00 1.529841e+00 1.631181e+00 5.090000e-01 1.375246e+01 93 64 99 50 21 0 * 51 42 1.680927e+00 2.460007e+00 7.790799e-01 4.634824e-01 4.996000e+00 1.861489e+01 15 10 1096 9 0 0 100 43 1.777090e+00 2.460007e+00 6.829168e-01 3.842894e-01 5.804000e+00 2.463818e+01 19 13 1405 51 21 4 200 43 1.837582e+00 2.460007e+00 6.224244e-01 3.387193e-01 7.572000e+00 3.209192e+01 19 12 2082 47 21 7 300 29 1.887691e+00 2.460007e+00 5.723157e-01 3.031830e-01 9.365000e+00 3.513081e+01 16 11 2793 40 18 6 400 26 1.951261e+00 2.460007e+00 5.087453e-01 2.607264e-01 1.221700e+01 3.486944e+01 5 4 3847 2 0 0 500 26 2.018018e+00 2.460007e+00 4.419885e-01 2.190211e-01 1.508800e+01 3.486214e+01 12 8 4912 14 7 1 600 26 2.112901e+00 2.460007e+00 3.471058e-01 1.642793e-01 1.758800e+01 3.559245e+01 15 10 5896 35 12 6 700 22 2.325699e+00 2.460007e+00 1.343072e-01 5.774916e-02 1.960700e+01 3.682358e+01 16 10 6766 29 0 0 726 3 2.438740e+00 2.460007e+00 2.126665e-02 8.720343e-03 2.006600e+01 3.633011e+01 19 12 7003 26 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.161371e+00 -1.576793e+00 7.738164e+00 0.000000e+00 Inf 1 LD 2 2.460106e+00 2.446270e+00 1.383559e-02 7.164030e-04 2.791725e+03 2 LD 7 2.460025e+00 2.454112e+00 5.912440e-03 3.995722e-03 1.751874e+03 3 LD 12 2.460010e+00 2.457334e+00 2.675928e-03 5.948643e-03 2.017267e+03 3 LD 17 2.460007e+00 2.458794e+00 1.213354e-03 7.703186e-03 2.206879e+03 3 LD 22 2.460007e+00 2.459456e+00 5.506396e-04 9.480870e-03 2.320462e+03 3 LD 27 2.460007e+00 2.459757e+00 2.499853e-04 1.127295e-02 2.395113e+03 3 LD 32 2.460007e+00 2.459893e+00 1.135108e-04 1.303864e-02 2.454244e+03 3 LD 37 2.460006e+00 2.459955e+00 5.154595e-05 1.477530e-02 2.504179e+03 3 LD 42 2.460006e+00 2.459983e+00 2.340817e-05 1.649697e-02 2.545922e+03 3 LD 47 2.460006e+00 2.459996e+00 1.063035e-05 1.827018e-02 2.572498e+03 3 LD 52 2.460006e+00 2.460002e+00 4.827595e-06 2.039289e-02 2.549909e+03 3 LD 57 2.460006e+00 2.460004e+00 2.192379e-06 2.222691e-02 2.564459e+03 3 LD 62 2.460006e+00 2.460006e+00 9.956370e-07 2.396587e-02 2.587012e+03 3 Last 62 2.460006e+00 2.460006e+00 9.956370e-07 2.689533e-02 2.305233e+03 3 ---------------------------------------------------------------------------------------------------------------- PP 62 2.460006e+00 2.460006e+00 9.956370e-07 2.848561e-02 2.176538e+03 3 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.4600064972656366 Dual Bound: 2.438739857093119 Dual Gap (relative): 0.008720339773290307 Search Statistics. Total number of nodes processed: 729 Total number of lmo calls: 7021 Total time (s): 20.101 LMO calls / sec: 349.2861051688971 Nodes / sec: 36.26685239540321 LMO calls / node: 9.631001371742112 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: 21 Poisson Tests seed = 0xa6e10653adabe263 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 -5.445373e+02 -5.076611e+02 3.687620e+01 7.263939e-02 1.621400e+01 1.850253e-01 9098 88 50 2929 29 6 * 3 4 -5.444564e+02 -5.094490e+02 3.500736e+01 6.871612e-02 1.995500e+01 3.507893e-01 1715 73 126 1847 29 15 * 8 9 -5.439686e+02 -5.128483e+02 3.112033e+01 6.068136e-02 2.788100e+01 6.097342e-01 1618 57 301 1704 25 20 * 13 14 -5.434383e+02 -5.253499e+02 1.808841e+01 3.443116e-02 3.333400e+01 8.099838e-01 956 58 472 1008 25 3 * 31 32 -5.428437e+02 -5.267904e+02 1.605334e+01 3.047386e-02 8.190300e+01 7.692026e-01 1426 71 1139 932 22 17 42 43 -5.426628e+02 -5.267904e+02 1.587244e+01 3.013047e-02 1.200050e+02 7.083038e-01 2306 76 1514 1520 29 21 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 8.457050e+02 -8.716563e+02 1.717361e+03 0.000000e+00 Inf 1 LD 2 -5.191962e+02 -5.783834e+02 5.918716e+01 1.666135e-01 1.200383e+01 2 LD 24 -5.285888e+02 -5.560608e+02 2.747206e+01 4.298354e-01 5.583533e+01 2 LD 29 -5.328808e+02 -5.436960e+02 1.081516e+01 4.385227e-01 6.613112e+01 4 LD 90 -5.346700e+02 -5.388120e+02 4.141977e+00 5.171281e-01 1.740381e+02 5 LD 99 -5.353699e+02 -5.366994e+02 1.329508e+00 5.356911e-01 1.848080e+02 6 LD 120 -5.354066e+02 -5.360014e+02 5.948195e-01 6.423726e-01 1.868075e+02 6 LD 173 -5.354225e+02 -5.356912e+02 2.687586e-01 6.986416e-01 2.476234e+02 7 LD 220 -5.354237e+02 -5.355250e+02 1.012819e-01 7.403960e-01 2.971383e+02 7 LD 288 -5.354240e+02 -5.354453e+02 2.129319e-02 8.031878e-01 3.585712e+02 9 LD 326 -5.354241e+02 -5.354311e+02 7.039957e-03 8.449455e-01 3.858237e+02 9 LD 379 -5.354241e+02 -5.354274e+02 3.371724e-03 9.078671e-01 4.174620e+02 9 LD 401 -5.354241e+02 -5.354251e+02 1.017591e-03 9.333967e-01 4.296137e+02 9 LD 457 -5.354241e+02 -5.354245e+02 4.496695e-04 9.871795e-01 4.629350e+02 9 LD 490 -5.354241e+02 -5.354242e+02 1.790528e-04 1.017416e+00 4.816120e+02 9 LD 525 -5.354241e+02 -5.354241e+02 5.016955e-05 1.050444e+00 4.997887e+02 9 LD 585 -5.354241e+02 -5.354241e+02 1.381090e-05 1.105118e+00 5.293552e+02 9 LD 639 -5.354241e+02 -5.354241e+02 4.817995e-06 1.155487e+00 5.530136e+02 9 LD 682 -5.354241e+02 -5.354241e+02 1.110056e-06 1.197849e+00 5.693539e+02 10 P 1000 -5.354241e+02 -5.354241e+02 1.110056e-06 1.554840e+00 6.431528e+02 10 P 2000 -5.354241e+02 -5.354241e+02 1.110056e-06 2.421235e+00 8.260246e+02 10 P 3000 -5.354241e+02 -5.354241e+02 1.110056e-06 3.236995e+00 9.267854e+02 10 P 4000 -5.354241e+02 -5.354241e+02 1.110056e-06 4.008984e+00 9.977591e+02 10 P 5000 -5.354241e+02 -5.354241e+02 1.110056e-06 4.769816e+00 1.048258e+03 10 P 6000 -5.354241e+02 -5.354241e+02 1.110056e-06 5.530966e+00 1.084801e+03 10 P 7000 -5.354241e+02 -5.354241e+02 1.110056e-06 6.269451e+00 1.116525e+03 10 P 8000 -5.354241e+02 -5.354241e+02 1.110056e-06 7.002948e+00 1.142376e+03 10 P 9000 -5.354241e+02 -5.354241e+02 1.110056e-06 7.599711e+00 1.184256e+03 10 P 10000 -5.354241e+02 -5.354241e+02 1.110056e-06 8.081873e+00 1.237337e+03 10 Last 10001 -5.354241e+02 -5.354241e+02 1.110056e-06 8.085237e+00 1.236946e+03 10 ---------------------------------------------------------------------------------------------------------------- PP 10001 -5.354241e+02 -5.354241e+02 1.198087e-05 8.087644e+00 1.236578e+03 10 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -535.4240563381877 Dual Bound: -542.662830112982 Dual Gap (relative): 0.013519702167102587 Search Statistics. Total number of nodes processed: 85 Total number of lmo calls: 1546 Total time (s): 130.804 LMO calls / sec: 11.819210421699642 Nodes / sec: 0.6498272224091006 LMO calls / node: 18.188235294117646 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 -4.840975e+02 -4.812236e+02 2.873962e+00 5.972197e-03 1.627200e+01 1.843658e-01 6048 69 23 62 8 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -2.562549e+02 -5.155017e+02 2.592468e+02 0.000000e+00 Inf 1 LD 2 -4.812236e+02 -4.812236e+02 0.000000e+00 1.076407e-01 1.858034e+01 1 Last 2 -4.812236e+02 -4.812236e+02 0.000000e+00 2.163322e-01 9.245043e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -4.812236e+02 -4.812236e+02 0.000000e+00 2.182689e-01 9.163008e+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: -481.22357456214166 Dual Bound: -484.09753674839016 Dual Gap (relative): 0.005972197411283243 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 28 Total time (s): 18.231 LMO calls / sec: 1.5358455378201963 Nodes / sec: 0.16455487905216387 LMO calls / node: 9.333333333333334 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 2.440724e+02 3.750885e+02 1.310161e+02 5.367919e-01 1.345600e+01 2.229489e-01 6473 77 25 154 11 1 * 2 3 2.440724e+02 3.531303e+02 1.090579e+02 4.468262e-01 1.381000e+01 3.620565e-01 351 87 49 206 12 1 * 6 7 2.712780e+02 3.491520e+02 7.787403e+01 2.870636e-01 1.461900e+01 8.892537e-01 180 63 137 122 12 8 59 6 3.468022e+02 3.491520e+02 2.349851e+00 6.775767e-03 1.741100e+01 3.733272e+00 13 7 616 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.491520e+02 3.491520e+02 0.000000e+00 5.319169e-03 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.491520e+02 3.491520e+02 0.000000e+00 1.165653e-01 0.000000e+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: 349.1520135257193 Dual Bound: 346.8021629327003 Dual Gap (relative): 0.0067757668324434145 Search Statistics. Total number of nodes processed: 65 Total number of lmo calls: 620 Total time (s): 19.199 LMO calls / sec: 32.293348611906865 Nodes / sec: 3.3855929996353975 LMO calls / node: 9.538461538461538 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 2.440724e+02 3.750885e+02 1.310161e+02 5.367919e-01 1.599300e+01 1.875821e-01 6448 89 25 154 11 1 * 3 4 2.625605e+02 3.604330e+02 9.787245e+01 3.727615e-01 1.800600e+01 3.887593e-01 209 63 66 152 10 1 * 11 12 2.957027e+02 3.491520e+02 5.344935e+01 1.807537e-01 2.490800e+01 9.233981e-01 167 49 213 129 7 5 77 6 3.475290e+02 3.491520e+02 1.623044e+00 4.670241e-03 4.540500e+01 1.827993e+00 10 6 727 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- Last 0 3.491520e+02 3.491520e+02 0.000000e+00 1.201203e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 3.491520e+02 3.491520e+02 0.000000e+00 1.839869e-01 0.000000e+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: 349.1520135257193 Dual Bound: 347.5289696287567 Dual Gap (relative): 0.004670240580796458 Search Statistics. Total number of nodes processed: 83 Total number of lmo calls: 731 Total time (s): 48.282 LMO calls / sec: 15.140217886582994 Nodes / sec: 1.7190671471770018 LMO calls / node: 8.80722891566265 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 = 0x517e34cf4fc05298 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 -1.668055e+02 7.100292e-01 1.675155e+02 Inf 2.761500e+01 1.086366e-01 15349 3517 43 10001 17 18 * 4 5 -1.668055e+02 -6.397338e+01 1.028321e+02 1.607420e+00 4.204100e+01 2.140767e-01 6564 6286 167 10001 15 62 * 7 8 -1.662248e+02 -1.537366e+02 1.248828e+01 8.123168e-02 6.162500e+01 2.434077e-01 6410 6158 297 5269 17 17 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -153.73655580342094 Dual Bound: -166.22483395598917 Dual Gap (relative): 0.0812316764045155 Search Statistics. Total number of nodes processed: 15 Total number of lmo calls: 297 Total time (s): 62.665 LMO calls / sec: 4.739487752333838 Nodes / sec: 0.23936806829968882 LMO calls / node: 19.8 Total number of global tightenings: 6 Global tightenings / node: 0.86 Total number of local tightenings: 19 Local tightenings / node: 2.71 Total number of potential local tightenings: 103 Time Limit Test seed = 0x13f3e0fe52fc6534 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 -7.468264e-01 0.000000e+00 7.468264e-01 Inf 2.200700e+01 1.363203e-01 11574 37 21 681 10 0 21 0 -3.802870e-04 0.000000e+00 3.802870e-04 Inf 2.229900e+01 9.417463e-01 3 2 201 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: -0.00038028703422665974 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 21 Total number of lmo calls: 201 Total time (s): 23.37 LMO calls / sec: 8.600770218228497 Nodes / sec: 0.8985879332477535 LMO calls / node: 9.571428571428571 Total number of global tightenings: 6 Global tightenings / node: 0.29 Total number of local tightenings: 13 Local tightenings / node: 0.62 Total number of potential local tightenings: 15 Strong Convexity and Sharpness Tests seed = 0xa41d7c29b05b5d94 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 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.923392e+02 1.923597e+02 2.051294e-02 1.066498e-04 1.732700e+01 1.731402e-01 6622 0 8 6 2 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 192.35972395360076 Dual Bound: 192.33921101491916 Dual Gap (relative): 0.00010664980153222265 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 8 Total time (s): 18.489 LMO calls / sec: 0.43268970739358537 Nodes / sec: 0.1622586402725945 LMO calls / node: 2.6666666666666665 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:135 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:135 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.163369e+02 2.164432e+02 1.062432e-01 4.911006e-04 1.404300e+01 2.136296e-01 6269 0 12 20 3 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 216.4431549184134 Dual Bound: 216.33691172779422 Dual Gap (relative): 0.00049110061602831 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 12 Total time (s): 14.804 LMO calls / sec: 0.810591731964334 Nodes / sec: 0.2026479329910835 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: 17 Branching Strategy Tests seed = 0xf143de4c2453e5fc 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.384900e+01 2.166221e-01 6574 29 48 3749 24 11 61 4 7.321771e+00 7.382204e+00 6.043286e-02 8.253858e-03 1.469500e+01 4.423273e+00 6 4 953 27 3 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): 15.433 LMO calls / sec: 61.750793753644786 Nodes / sec: 4.21175403356444 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.170000e-01 9.463722e+00 218 33 48 3749 24 11 87 0 7.016760e+00 7.382204e+00 3.654439e-01 5.208158e-02 1.213000e+00 7.172300e+01 3 2 1015 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 7.382204160353686 Dual Bound: 7.016760210963634 Dual Gap (relative): 0.05208157873473409 Search Statistics. Total number of nodes processed: 87 Total number of lmo calls: 1015 Total time (s): 1.214 LMO calls / sec: 836.0790774299835 Nodes / sec: 71.66392092257001 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 2.650000e-01 1.132075e+01 173 23 48 3749 24 11 57 2 7.338246e+00 7.382204e+00 4.395789e-02 5.990244e-03 9.820000e-01 6.008147e+01 2 2 859 2 2 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): 0.982 LMO calls / sec: 874.745417515275 Nodes / sec: 60.08146639511202 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 2.700000e-01 1.111111e+01 159 28 48 3749 24 11 73 2 7.334320e+00 7.382204e+00 4.788384e-02 6.528736e-03 1.110000e+00 6.756757e+01 8 6 902 27 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.111 LMO calls / sec: 811.8811881188119 Nodes / sec: 67.50675067506751 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 2.490000e-01 1.204819e+01 163 32 48 3749 24 11 93 4 7.325012e+00 7.382204e+00 5.719238e-02 7.807821e-03 1.262000e+00 7.686212e+01 2 1 1174 2 2 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.263 LMO calls / sec: 929.532858273951 Nodes / sec: 76.8012668250198 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 3.030000e-01 9.900990e+00 302 37 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 5.480000e-01 1.642336e+01 72 25 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 6.720000e-01 1.636905e+01 122 54 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.192000e+00 2.794772e+01 76 24 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 7.692000e+00 2.821113e+01 52 16 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.280700e+01 3.131100e+01 49 19 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.821300e+01 3.277878e+01 45 16 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.321200e+01 3.416336e+01 44 19 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.683500e+01 3.603503e+01 12 6 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.013400e+01 3.779784e+01 36 14 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.272800e+01 3.889636e+01 11 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 3.516600e+01 3.892965e+01 5 3 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 3.691700e+01 3.860010e+01 6 3 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 3.834000e+01 3.836724e+01 26 11 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.005200e+01 3.732648e+01 7 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.134800e+01 3.654348e+01 11 6 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 4.256700e+01 3.563794e+01 13 8 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 4.362200e+01 3.491358e+01 10 6 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 4.416000e+01 3.448822e+01 5 4 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 44.16 LMO calls / sec: 623.3016304347826 Nodes / sec: 34.488224637681164 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.074000e+00 1.446480e+00 460 62 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 2.363000e+00 3.808718e+00 81 30 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 2.488000e+00 4.421222e+00 123 38 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 9.684000e+00 2.075589e+01 84 32 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.021400e+01 2.124535e+01 58 19 3485 420 20 24 200 197 1.666622e+01 2.836265e+01 1.169643e+01 7.018046e-01 1.635600e+01 2.427244e+01 154 23 6038 662 21 11 300 261 1.834626e+01 2.836265e+01 1.001639e+01 5.459636e-01 2.091300e+01 2.682542e+01 43 19 8396 223 19 13 400 313 1.984792e+01 2.836265e+01 8.514726e+00 4.289984e-01 2.533900e+01 2.813844e+01 23 13 10594 67 0 0 500 349 2.103506e+01 2.836265e+01 7.327588e+00 3.483512e-01 2.903400e+01 2.924158e+01 42 18 12514 245 14 6 600 387 2.187953e+01 2.836265e+01 6.483111e+00 2.963094e-01 3.242800e+01 3.043666e+01 21 11 14423 73 8 5 700 405 2.283231e+01 2.836265e+01 5.530334e+00 2.422152e-01 3.535800e+01 3.125177e+01 6 4 16134 16 0 0 800 421 2.364738e+01 2.836265e+01 4.715269e+00 1.993992e-01 3.834800e+01 3.183999e+01 7 5 17857 8 0 0 900 415 2.432591e+01 2.836265e+01 4.036736e+00 1.659439e-01 4.100600e+01 3.206848e+01 9 6 19379 12 0 0 1000 403 2.516307e+01 2.836265e+01 3.199572e+00 1.271535e-01 4.328700e+01 3.241158e+01 10 6 20802 22 0 0 1100 361 2.578895e+01 2.836265e+01 2.573694e+00 9.979832e-02 4.490300e+01 3.253680e+01 6 4 22010 10 0 0 1200 319 2.638832e+01 2.836265e+01 1.974326e+00 7.481817e-02 4.634200e+01 3.277804e+01 7 4 23131 12 0 0 1300 277 2.677983e+01 2.836265e+01 1.582818e+00 5.910485e-02 4.755300e+01 3.316300e+01 8 5 24076 18 0 0 1400 221 2.729222e+01 2.836265e+01 1.070429e+00 3.922105e-02 4.868200e+01 3.329773e+01 10 6 24995 22 0 0 1500 159 2.765610e+01 2.836265e+01 7.065498e-01 2.554771e-02 4.977300e+01 3.333132e+01 10 5 25874 36 0 0 1600 79 2.801457e+01 2.836265e+01 3.480771e-01 1.242486e-02 5.069500e+01 3.311964e+01 6 4 26633 8 0 0 1613 66 2.808336e+01 2.836265e+01 2.792892e-01 9.945008e-03 5.082600e+01 3.303427e+01 13 7 26740 41 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 50.827 LMO calls / sec: 526.0983335628702 Nodes / sec: 33.033623861333545 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.090000e-01 5.893910e+00 442 57 64 4885 42 8 * 6 7 2.829005e-01 3.102006e+01 3.073716e+01 1.086501e+02 1.060000e+00 1.226415e+01 88 28 256 696 23 31 * 64 65 8.136479e+00 2.836265e+01 2.022617e+01 2.485862e+00 4.944000e+00 2.609223e+01 34 13 2096 346 18 32 100 101 1.052093e+01 2.836265e+01 1.784172e+01 1.695831e+00 7.237000e+00 2.777394e+01 59 21 3186 412 21 17 200 201 1.409984e+01 2.836265e+01 1.426280e+01 1.011558e+00 1.286100e+01 3.117954e+01 64 25 6017 417 20 7 300 295 1.601972e+01 2.836265e+01 1.234293e+01 7.704836e-01 1.771300e+01 3.359115e+01 44 22 8679 179 17 9 400 365 1.793051e+01 2.836265e+01 1.043213e+01 5.818091e-01 2.192400e+01 3.489327e+01 14 9 11070 27 0 0 500 431 1.938105e+01 2.836265e+01 8.981593e+00 4.634213e-01 2.594400e+01 3.588498e+01 69 24 13344 339 20 11 600 481 2.039633e+01 2.836265e+01 7.966313e+00 3.905757e-01 2.990300e+01 3.615022e+01 49 16 15506 341 21 14 700 509 2.141903e+01 2.836265e+01 6.943613e+00 3.241796e-01 3.339200e+01 3.620628e+01 41 17 17444 229 16 15 800 535 2.238430e+01 2.836265e+01 5.978348e+00 2.670778e-01 3.671600e+01 3.636017e+01 5 3 19379 9 0 0 900 545 2.314908e+01 2.836265e+01 5.213568e+00 2.252171e-01 3.936600e+01 3.670680e+01 42 17 21026 246 19 15 1000 539 2.379329e+01 2.836265e+01 4.569351e+00 1.920436e-01 4.202100e+01 3.662454e+01 33 16 22661 137 15 5 1100 527 2.451542e+01 2.836265e+01 3.847227e+00 1.569309e-01 4.475000e+01 3.635754e+01 5 3 24161 6 0 0 1200 487 2.513034e+01 2.836265e+01 3.232303e+00 1.286215e-01 4.666000e+01 3.615517e+01 11 6 25390 20 0 0 1300 451 2.563321e+01 2.836265e+01 2.729434e+00 1.064804e-01 4.955400e+01 3.533519e+01 29 12 26657 170 21 7 1400 395 2.618583e+01 2.836265e+01 2.176819e+00 8.312966e-02 5.114800e+01 3.509424e+01 7 4 27751 16 0 0 1500 329 2.665304e+01 2.836265e+01 1.709610e+00 6.414315e-02 5.255300e+01 3.480296e+01 7 4 28707 8 0 0 1600 253 2.705726e+01 2.836265e+01 1.305388e+00 4.824539e-02 5.383400e+01 3.442063e+01 3 2 29538 6 0 0 1700 167 2.749886e+01 2.836265e+01 8.637814e-01 3.141153e-02 5.497100e+01 3.396336e+01 4 2 30350 3 0 0 1800 75 2.797765e+01 2.836265e+01 3.849984e-01 1.376093e-02 5.591100e+01 3.353544e+01 4 3 31067 6 0 0 1821 54 2.809262e+01 2.836265e+01 2.700204e-01 9.611791e-03 5.613200e+01 3.340341e+01 9 6 31241 16 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 28.362645025404976 Dual Bound: 28.09262459123141 Dual Gap (relative): 0.009611790927425446 Search Statistics. Total number of nodes processed: 1875 Total number of lmo calls: 31241 Total time (s): 56.132 LMO calls / sec: 556.5631012613127 Nodes / sec: 33.40340625668068 LMO calls / node: 16.66186666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 2696 Local tightenings / node: 1.48 Total number of potential local tightenings: 6228 Number of alternative decisions: 543 Number of stable decisions: 394 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.170000e-01 5.802708e+00 454 62 64 4885 42 8 * 20 21 7.247175e-01 3.102006e+01 3.029535e+01 4.180297e+01 2.347000e+00 1.746911e+01 78 30 678 489 25 9 * 31 32 4.942816e+00 2.836265e+01 2.341983e+01 4.738155e+00 2.980000e+00 2.114094e+01 58 27 968 257 18 16 100 101 8.335684e+00 2.836265e+01 2.002696e+01 2.402557e+00 7.076000e+00 2.840588e+01 12 6 2918 60 18 11 200 183 1.078500e+01 2.836265e+01 1.757765e+01 1.629824e+00 1.130000e+01 3.389381e+01 31 14 5197 153 24 5 300 267 1.287315e+01 2.836265e+01 1.548950e+01 1.203241e+00 1.535200e+01 3.693330e+01 20 11 7469 83 12 1 400 335 1.434635e+01 2.836265e+01 1.401630e+01 9.769941e-01 1.914200e+01 3.839724e+01 25 11 9610 131 23 5 500 413 1.574830e+01 2.836265e+01 1.261434e+01 8.009968e-01 2.331300e+01 3.916270e+01 38 17 11880 193 16 11 600 471 1.737797e+01 2.836265e+01 1.098467e+01 6.321032e-01 2.692200e+01 3.978159e+01 33 17 13971 113 13 2 700 523 1.945433e+01 2.836265e+01 8.908320e+00 4.579095e-01 3.056000e+01 4.001963e+01 18 11 15981 55 10 2 800 553 2.048023e+01 2.836265e+01 7.882420e+00 3.848796e-01 3.362500e+01 4.023792e+01 34 18 17719 139 18 4 900 573 2.138013e+01 2.836265e+01 6.982518e+00 3.265892e-01 3.676700e+01 4.006310e+01 15 9 19510 37 0 0 1000 597 2.251379e+01 2.836265e+01 5.848851e+00 2.597896e-01 3.981500e+01 4.011051e+01 59 22 21254 396 22 10 1100 595 2.340857e+01 2.836265e+01 4.954072e+00 2.116349e-01 4.233300e+01 4.003969e+01 10 6 22747 24 0 0 1200 569 2.429110e+01 2.836265e+01 4.071541e+00 1.676145e-01 4.441400e+01 3.982978e+01 5 3 24101 6 0 0 1300 529 2.501465e+01 2.836265e+01 3.347998e+00 1.338415e-01 4.618900e+01 3.959817e+01 13 9 25317 23 0 0 1400 465 2.565188e+01 2.836265e+01 2.710762e+00 1.056750e-01 4.769200e+01 3.910509e+01 6 4 26374 10 0 0 1500 393 2.625338e+01 2.836265e+01 2.109263e+00 8.034253e-02 4.897100e+01 3.865553e+01 9 6 27346 16 0 0 1600 307 2.685203e+01 2.836265e+01 1.510613e+00 5.625694e-02 5.010100e+01 3.806311e+01 16 9 28188 61 8 5 1700 221 2.729422e+01 2.836265e+01 1.068424e+00 3.914470e-02 5.123800e+01 3.749171e+01 6 3 29039 10 0 0 1800 129 2.772525e+01 2.836265e+01 6.373991e-01 2.298984e-02 5.221500e+01 3.694341e+01 7 4 29805 14 0 0 1865 66 2.810610e+01 2.836265e+01 2.565431e-01 9.127665e-03 5.282500e+01 3.655466e+01 5 3 30260 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 52.825 LMO calls / sec: 572.8348319924278 Nodes / sec: 36.55466161855182 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.460000e-01 6.726457e+00 441 60 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.250000e-01 1.241379e+01 79 29 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.420000e-01 1.306413e+01 115 35 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 7.730000e+00 2.600259e+01 76 28 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.223000e+00 2.638940e+01 53 18 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.342100e+01 2.987855e+01 43 19 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.881400e+01 3.173169e+01 49 17 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.405100e+01 3.297160e+01 51 22 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.855700e+01 3.386210e+01 19 10 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.344600e+01 3.405489e+01 59 22 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.734100e+01 3.409121e+01 13 8 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.069200e+01 3.364298e+01 6 4 20396 14 0 0 900 527 2.527219e+01 2.836265e+01 3.090457e+00 1.222869e-01 4.318200e+01 3.304618e+01 58 24 21910 381 13 9 1000 471 2.585342e+01 2.836265e+01 2.509221e+00 9.705567e-02 4.524900e+01 3.250901e+01 10 6 23162 19 0 0 1100 399 2.633114e+01 2.836265e+01 2.031509e+00 7.715233e-02 4.705900e+01 3.185363e+01 32 16 24363 145 16 10 1200 315 2.695429e+01 2.836265e+01 1.408354e+00 5.224973e-02 4.842600e+01 3.128485e+01 10 6 25359 25 0 0 1300 227 2.742559e+01 2.836265e+01 9.370550e-01 3.416718e-02 4.969400e+01 3.072806e+01 34 15 26283 172 13 8 1400 133 2.784546e+01 2.836265e+01 5.171871e-01 1.857348e-02 5.080600e+01 3.017360e+01 13 7 27090 27 0 0 1465 70 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.147100e+01 2.982262e+01 6 4 27580 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 51.472 LMO calls / sec: 535.8253030774013 Nodes / sec: 29.822039166925705 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.570000e-01 6.564551e+00 454 58 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 7.420000e-01 1.212938e+01 81 30 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 8.650000e-01 1.271676e+01 120 36 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 8.093000e+00 2.483628e+01 79 30 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 8.634000e+00 2.513319e+01 60 22 3485 420 20 24 200 201 1.669714e+01 2.836265e+01 1.166551e+01 6.986531e-01 1.394200e+01 2.876201e+01 45 20 6086 247 19 20 300 297 1.877956e+01 2.836265e+01 9.583082e+00 5.102931e-01 1.950600e+01 3.060597e+01 47 17 8821 325 14 10 400 393 2.048386e+01 2.836265e+01 7.878788e+00 3.846340e-01 2.502400e+01 3.168958e+01 50 22 11544 282 17 18 500 467 2.164471e+01 2.836265e+01 6.717939e+00 3.103733e-01 2.967000e+01 3.259184e+01 17 9 13970 61 0 0 600 539 2.275179e+01 2.836265e+01 5.610858e+00 2.466117e-01 3.455400e+01 3.296290e+01 56 22 16456 348 17 12 700 573 2.371191e+01 2.836265e+01 4.650731e+00 1.961348e-01 3.848300e+01 3.307954e+01 12 7 18546 31 0 0 800 569 2.442846e+01 2.836265e+01 3.934185e+00 1.610492e-01 4.182700e+01 3.273005e+01 9 6 20396 14 0 0 900 525 2.527577e+01 2.836265e+01 3.086875e+00 1.221278e-01 4.434700e+01 3.213295e+01 8 5 21913 21 0 0 1000 471 2.586638e+01 2.836265e+01 2.496264e+00 9.650612e-02 4.635600e+01 3.173268e+01 27 11 23185 174 12 11 1100 395 2.634747e+01 2.836265e+01 2.015179e+00 7.648474e-02 4.814000e+01 3.105526e+01 8 5 24396 13 0 0 1200 311 2.695533e+01 2.836265e+01 1.407312e+00 5.220905e-02 4.945700e+01 3.055179e+01 11 6 25388 20 0 0 1300 217 2.746436e+01 2.836265e+01 8.982838e-01 3.270725e-02 5.070200e+01 2.991992e+01 12 7 26318 33 0 0 1400 123 2.789032e+01 2.836265e+01 4.723298e-01 1.693526e-02 5.173800e+01 2.943678e+01 9 6 27126 17 0 0 1451 72 2.808290e+01 2.836265e+01 2.797403e-01 9.961232e-03 5.227000e+01 2.913717e+01 6 4 27525 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 52.271 LMO calls / sec: 526.5826175125786 Nodes / sec: 29.136614949015705 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.416000e+00 8.782201e-01 443 59 64 4885 42 8 * 4 5 4.046809e-01 3.102006e+01 3.061538e+01 7.565314e+01 3.697000e+00 2.434406e+00 78 29 176 523 25 27 * 5 6 8.988404e-01 2.929131e+01 2.839247e+01 3.158788e+01 3.813000e+00 2.884868e+00 114 35 217 944 28 30 100 101 1.300634e+01 2.929131e+01 1.628497e+01 1.252079e+00 1.072400e+01 1.874301e+01 77 29 3237 536 25 23 * 108 109 1.349870e+01 2.836265e+01 1.486394e+01 1.101139e+00 1.123200e+01 1.931980e+01 57 19 3485 420 20 24 200 199 1.683472e+01 2.836265e+01 1.152793e+01 6.847711e-01 1.654000e+01 2.412334e+01 61 22 6090 444 23 10 300 285 1.916431e+01 2.836265e+01 9.198340e+00 4.799725e-01 2.170800e+01 2.694859e+01 40 17 8720 225 17 12 400 347 2.074745e+01 2.836265e+01 7.615193e+00 3.670423e-01 2.624500e+01 2.846256e+01 68 25 11144 379 20 19 500 399 2.247788e+01 2.836265e+01 5.884769e+00 2.618027e-01 3.019800e+01 2.977018e+01 11 7 13355 21 0 0 600 411 2.367246e+01 2.836265e+01 4.690187e+00 1.981284e-01 3.342300e+01 3.024863e+01 45 16 15250 331 16 6 ====================================================================================== 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 35 running 1 of 1 signal (10): User defined signal 1 unknown function (ip: 0x70ec90cd510e) at /lib/x86_64-linux-gnu/libc.so.6 __libc_free at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) BMSfreeMemory_call at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPcutpoolFree at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) freeSolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPfreeSolve at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/artifacts/8348a49a704748ae90246128ecdbd36906e83870/lib/libscip.so (unknown line) SCIPfreeTransform at /home/pkgeval/.julia/packages/SCIP/IDBL9/src/LibSCIP.jl:21476:9 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:49:3 [inlined] free_model at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:455:3 [inlined] #compute_extreme_point#3 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:130:181 compute_extreme_point at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/time_tracking_lmo.jl:108:4 [inlined] #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:291:649 unknown function (ip: 0x70ec21039545) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:177 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:103 unknown function (ip: 0x70ec21025f27) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:595 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:16 optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:25 unknown function (ip: 0x70ec21001c4a) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:693 unknown function (ip: 0x70ec20ffef79) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:15 #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:12 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:15 unknown function (ip: 0x70ec20ff783c) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 exec_options at ./client.jl:321:353 _start at ./client.jl:596:35 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] true_main at /source/src/jlapi.c:971:29 jl_repl_entrypoint at /source/src/jlapi.c:1138:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x70ec90c66249) 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) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 700 407 2.449500e+01 2.836265e+01 3.867641e+00 1.578951e-01 3.694000e+01 2.996751e+01 51 20 17024 329 21 6 800 363 2.539631e+01 2.836265e+01 2.966336e+00 1.168019e-01 3.888000e+01 2.991255e+01 14 7 18354 67 0 0 900 301 2.616952e+01 2.836265e+01 2.193126e+00 8.380461e-02 4.499000e+01 2.669482e+01 8 5 19533 32 0 0 ====================================================================================== 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:34 wait at ./task.jl:1246:44 wait_forever at ./task.jl:1168:5 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] start_task at /source/src/task.c:1275:19 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== 1000 225 2.691767e+01 2.836265e+01 1.444975e+00 5.368128e-02 4.792700e+01 2.555971e+01 17 11 20674 8 0 0 ┌ 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 0x00007e78aa031870 Total snapshots: 426. Utilization: 0% ╎426 @Base/task.jl:1168 wait_forever() 425╎ 426 @Base/task.jl:1246 wait() ┌ 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 1100 137 2.763514e+01 2.836265e+01 7.275008e-01 2.632520e-02 5.202200e+01 2.377840e+01 19 10 21524 68 0 0 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000070ec765fc010 Total snapshots: 48. Utilization: 100% ╎39 @Base/client.jl:596 _start() ╎ 39 @Base/client.jl:321 exec_options(opts::Base.JLOptions) ╎ 39 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ 39 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ 39 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _path::Str… ╎ 39 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module, _pat… ╎ ╎ 39 @Base/loading.jl:3113 include_string(mapexpr::typeof(identity), mo… ╎ ╎ 39 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ 39 @Base/Base.jl:328 (::Base.IncludeInto)(fname::String) ╎ ╎ 39 @Base/Base.jl:327 include(mapexpr::Function, mod::Module, _path… ╎ ╎ 39 @Base/loading.jl:3173 _include(mapexpr::Function, mod::Module,… ╎ ╎ ╎ 39 @Base/loading.jl:3113 include_string(mapexpr::typeof(identity… ╎ ╎ ╎ 39 @Base/boot.jl:517 eval(m::Module, e::Any) ╎ ╎ ╎ 39 @Boscia/…_oracle.jl:832 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ 39 @Boscia/…oracle.jl:834 #solve#147 ╎ ╎ ╎ 39 @Boscia/…erface.jl:28 kwcall(::@NamedTuple{settings::@Nam… ╎ ╎ ╎ ╎ 39 @Boscia/…erface.jl:269 solve(f::var"#f#build_examples##0… ╎ ╎ ╎ ╎ 39 @Boscia/…bonobo.jl:29 kwcall(::@NamedTuple{callback::Bo… ╎ ╎ ╎ ╎ 39 @Boscia/…onobo.jl:36 optimize!(tree::BnBTree{Boscia.Fr… ╎ ╎ ╎ ╎ 1 @Boscia/…node.jl:350 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 1 @Boscia/…blem.jl:94 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…acle.jl:229 is_linear_feasible ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:234 is_linear_feasible(o::SCIP.Opt… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…cle.jl:247 is_linear_feasible_subroutine… ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…pper.jl:396 get(o::SCIP.Optimizer, ::Math… ╎ ╎ ╎ ╎ ╎ 1 @Base/sort.jl:1734 iterate(::Set{SCIP.ConsRef}) ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/sort.jl:1741 #sort!#24 ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/sort.jl:1594 _sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/sort.jl:561 _sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:686 _sort! ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:747 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:802 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:731 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:780 _sort! ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1380 _sort!(v::Vector{Mat… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1123 _issorted(v::Vector… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:1128 _sort!(v::Vector{M… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…rt.jl:506 -(x::Int64, y::Int… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ot.jl:715 Array ╎ ╎ ╎ ╎ 38 @Boscia/…node.jl:373 evaluate_node!(tree::BnBTree{Bos… ╎ ╎ ╎ ╎ 38 @Boscia/…ants.jl:188 kwcall(::@NamedTuple{epsilon::F… ╎ ╎ ╎ ╎ ╎ 38 @Boscia/…ants.jl:208 #solve_frank_wolfe#7 ╎ ╎ ╎ ╎ ╎ 38 @FrankWolfe/….jl:76 kwcall(::@NamedTuple{line_sear… 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:0 blended_pairwise_conditional_gr… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:166 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:108 compute_extreme_point ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…mo.jl:130 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…le.jl:455 getindex(A::Vector{Float64}… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…xt.jl:49 _getindex(l::IndexLinear, A… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @SCIP/…IP.jl:21476 SCIPfreeTransform ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:208 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…est.jl:50 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:281 mul!(C::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:71 mul!(y::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:74 _mul!(y::Vector{Float64},… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:79 generic_matvecmul!(y::Ve… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:721 gemv!(y::Vector{Float6… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:680 gemv!(trans::Char, al… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:211 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:355 dot(x::Vector{Float64}, y::Ve… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:361 active_set_argminmax(active_… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:18 getindex(A::Vector{Vector{… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:408 checkbounds(A::Vector{Ve… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:358 dot ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:227 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:9 muladd_memory_mode(memory_mode… ╎ ╎ ╎ ╎ ╎ 1 @Base/…cast.jl:907 materialize!(dest::Vector{Fl… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…cast.jl:911 materialize!(::Base.Broadca… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ast.jl:958 instantiate(bc::Base.Broadc… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:1005 check_broadcast_axes(shp::… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:1006 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:615 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:619 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:674 _broadcast_getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:698 _getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…st.jl:668 _broadcast_getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…jl:230 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 2 @FrankWolfe/…l:438 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 2 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:75 first(a::Vector{Float64}) ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 iterate(r::Base.OneTo{Int64… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…l:453 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:52 (::var"#grad!#build_examples#… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:71 mul!(y::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:74 _mul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:79 generic_matvecmul! ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:721 gemv!(y::Vector{Float6… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:680 gemv!(trans::Char, al… ╎ ╎ ╎ ╎ ╎ 3 @FrankWolfe/…l:467 perform_line_search(line_sear… ╎ ╎ ╎ ╎ ╎ 3 @Boscia/…st.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ ╎ 3 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, … 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:75 first(a::Vector{Float64}) ╎ ╎ ╎ ╎ ╎ ╎ 2 @Base/…loop.jl:77 iterate(r::Base.OneTo{Int64… ╎ ╎ ╎ ╎ ╎ ╎ 2 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:494 + 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:245 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 13 @FrankWolfe/…jl:261 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 13 @Boscia/…cks.jl:24 (::Boscia.var"#33#34"{Bool, B… ╎ ╎ ╎ ╎ ╎ 13 @Boscia/…ks.jl:59 process_FW_callback_logic ╎ ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…ks.jl:97 process_FW_callback_logic(tr… ╎ ╎ ╎ ╎ ╎ ╎ 12 @Boscia/…e.jl:591 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…t.jl:28 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…nce.jl:25 iterate(A::Vector{Ptr{Noth… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…ay.jl:843 iterate(A::Vector{Ptr{Not… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…ay.jl:869 collect_to_with_first!(d… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…ay.jl:914 setindex!(A::Vector{Flo… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…or.jl:45 _setindex!(A::Vector{Fl… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1242 checkbounds(A::Vecto… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ay.jl:1250 checkbounds(::Type{… 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…or.jl:48 _setindex!(A::Vector{Fl… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 none:? #sol_values##0 ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…er.jl:128 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @SCIP/…ta.jl:181 var ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 4 @Base/…ct.jl:478 getindex 1╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ct.jl:238 ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ct.jl:244 ht_keyindex(h::Di… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ct.jl:129 hashindex(key::S… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ 3 @Base/…ng.jl:40 rem(x::UInt64, :… ╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +1 3 @Base/…ng.jl:46 hash 3╎ ╎ ╎ ╎ ╎ ╎ ╎ ╎ +2 3 @Base/…ls.jl:878 objectid ╎ ╎ ╎ ╎ ╎ ╎ 7 @Boscia/…t.jl:30 find_best_solution(tree::Bn… ╎ ╎ ╎ ╎ ╎ ╎ 7 @Boscia/…t.jl:45 (::var"#f#build_examples##… 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:0 dot(x::Vector{Float64}, A::… ╎ ╎ ╎ ╎ ╎ ╎ 6 @LinearAlgebra/…:1048 dot(x::Vector{Float6… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @Base/…op.jl:77 iterate(r::Base.OneTo{Int… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex 5╎ ╎ ╎ ╎ ╎ ╎ ╎ 5 @Base/…at.jl:494 + ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…ks.jl:119 process_FW_callback_logic(t… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…st.jl:45 (::var"#f#build_examples##0… ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64}… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…oop.jl:77 macro expansion ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…at.jl:494 + ╎ ╎ ╎ ╎ ╎ 11 @FrankWolfe/…jl:291 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 11 @Boscia/…mo.jl:108 storage_find_argmin_vertex(ve… ╎ ╎ ╎ ╎ ╎ 6 @Boscia/…mo.jl:116 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…l:24 set(o::SCIP.Optimizer, ::Mat… ╎ ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…l:43 compute_extreme_point(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 6 @FrankWolfe/…:358 _optimize_and_return(lmo::… ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…er.jl:427 optimize!(o::SCIP.Optimize… ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…er.jl:16 string(::String, ::String,… 5╎ ╎ ╎ ╎ ╎ ╎ ╎ 6 @SCIP/…IP.jl:21458 SCIPsolve ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…mo.jl:130 compute_extreme_point(tlmo::… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…le.jl:455 getindex(A::Vector{Float64}… ╎ ╎ ╎ ╎ ╎ ╎ 5 @Boscia/…xt.jl:49 _getindex(l::IndexLinear, A… 5╎ ╎ ╎ ╎ ╎ ╎ 5 @SCIP/…IP.jl:21476 SCIPfreeTransform 1╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:395 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @FrankWolfe/…jl:427 blended_pairwise_conditional_… ╎ ╎ ╎ ╎ ╎ 1 @Boscia/…est.jl:45 (::var"#f#build_examples##0"{… ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1048 dot(x::Vector{Float64}, A… ╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…loop.jl:77 iterate(r::Base.OneTo{Int64}) ╎ ╎ ╎ ╎ ╎ ╎ 1 @LinearAlgebra/…:1049 macro expansion 1╎ ╎ ╎ ╎ ╎ ╎ 1 @Base/…ls.jl:1040 getindex 1187 52 2.808687e+01 2.836265e+01 2.757701e-01 9.818469e-03 5.309000e+01 2.333773e+01 6 3 22214 14 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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): 53.09 LMO calls / sec: 418.42154831418344 Nodes / sec: 23.33772838576003 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 4.570000e-01 6.564551e+00 453 55 64 4885 42 8 * 4 5 2.020880e-01 2.977156e+01 2.956947e+01 1.463198e+02 9.320000e-01 9.656652e+00 146 36 192 1340 32 43 [35] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/Boscia/EgUlC/test/branching_strategy_test.jl:275 arg_tuple at /source/src/builtins.c:970:5 find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/ext/BosciaSCIPExt.jl:42:65 unknown function (ip: 0x70ec21046942) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 find_best_solution at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:591:3 unknown function (ip: 0x70ec21045bcd) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 #process_FW_callback_logic#37 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:97:362 process_FW_callback_logic at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:59:21 [inlined] #33 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/callbacks.jl:24:15 unknown function (ip: 0x70ec21046f05) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 #blended_pairwise_conditional_gradient#357 at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:411:1024 unknown function (ip: 0x70ec21039545) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 blended_pairwise_conditional_gradient at /home/pkgeval/.julia/packages/FrankWolfe/zefNM/src/blended_pairwise.jl:76:177 #solve_frank_wolfe#7 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:208:10 [inlined] solve_frank_wolfe at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/frank_wolfe_variants.jl:188:103 unknown function (ip: 0x70ec21025f27) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 evaluate_node! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/node.jl:373:595 #optimize!#13 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:36:16 optimize! at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/custom_bonobo.jl:29:25 unknown function (ip: 0x70ec21001c4a) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 #solve#110 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:269:693 unknown function (ip: 0x70ec20ffef79) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/interface.jl:28:15 #solve#147 at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:834:12 [inlined] solve at /home/pkgeval/.julia/packages/Boscia/EgUlC/src/MOI_bounded_oracle.jl:832:15 unknown function (ip: 0x70ec20ff783c) at (unknown file) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 eval_body at /source/src/interpreter.c:563:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 eval_body at /source/src/interpreter.c:571:21 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 include_string at ./loading.jl:3113:125 _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 _include at ./loading.jl:3173:35 include at ./Base.jl:327:3 IncludeInto at ./Base.jl:328:4 jfptr_IncludeInto_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:243:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:706:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:897:21 ijl_eval_thunk at /source/src/toplevel.c:768:18 jl_toplevel_eval_flex at /source/src/toplevel.c:712:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:602:15 jl_toplevel_eval_flex at /source/src/toplevel.c:684:27 ijl_toplevel_eval at /source/src/toplevel.c:782:12 ijl_toplevel_eval_in at /source/src/toplevel.c:827:13 eval at ./boot.jl:517:3 exec_options at ./client.jl:321:353 _start at ./client.jl:596:35 jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] true_main at /source/src/jlapi.c:971:29 jl_repl_entrypoint at /source/src/jlapi.c:1138:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x70ec90c66249) 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: 4615005415 (Pool: 4615001804; Big: 3611); GC: 1663 PkgEval terminated after 2759.79s: test duration exceeded the time limit