Package evaluation to test JuDGE on Julia 1.14.0-DEV.3141 (fbd24f51d0*) started at 2026-09-08T18:27:18.284 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.62s ################################################################################ # Installation # Installing JuDGE... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [7600667b] + JuDGE v0.5.3 Updating `~/.julia/environments/v1.14/Manifest.toml` [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.9 [bbf7d656] + CommonSubexpressions v0.3.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.4.5 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 ⌅ [682c06a0] + JSON v0.21.4 [7600667b] + JuDGE v0.5.3 [4076af6c] + JuMP v1.31.2 [2ab3a3ac] + LogExpFunctions v1.0.1 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.53.0 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.4 ⌅ [bac558e1] + OrderedCollections v1.8.2 ⌅ [69de0a69] + Parsers v2.8.8 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [276daf66] + SpecialFunctions v2.9.0 [1e83bf80] + StaticArraysCore v1.4.4 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.7+0 [4536629a] + OpenBLAS_jll v0.3.34+0 [05823500] + OpenLibm_jll v0.8.8+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 4.82s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... 102.3 s ✓ MathOptInterface 60.7 s ✓ JuMP 10.0 s ✓ GLPK 18.1 s ✓ JuDGE 4 dependencies successfully precompiled in 191 seconds. 60 already precompiled. Precompilation completed after 199.45s ################################################################################ # Testing # Testing JuDGE Status `/tmp/jl_iJhtCm/Project.toml` [8bb1440f] DelimitedFiles v1.9.1 [60bf3e95] GLPK v1.2.1 ⌅ [682c06a0] JSON v0.21.4 [7600667b] JuDGE v0.5.3 [4076af6c] JuMP v1.31.2 ⌅ [bac558e1] OrderedCollections v1.8.2 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_iJhtCm/Manifest.toml` [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.9 [bbf7d656] CommonSubexpressions v0.3.1 [8bb1440f] DelimitedFiles v1.9.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.4.5 [60bf3e95] GLPK v1.2.1 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.8.0 ⌅ [682c06a0] JSON v0.21.4 [7600667b] JuDGE v0.5.3 [4076af6c] JuMP v1.31.2 [2ab3a3ac] LogExpFunctions v1.0.1 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.53.0 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.4 ⌅ [bac558e1] OrderedCollections v1.8.2 ⌅ [69de0a69] Parsers v2.8.8 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [276daf66] SpecialFunctions v2.9.0 [1e83bf80] StaticArraysCore v1.4.4 [3bb67fe8] TranscodingStreams v0.11.3 [6e34b625] Bzip2_jll v1.0.9+0 ⌅ [e8aa6df9] GLPK_jll v5.0.1+1 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [0dad84c5] ArgTools v1.2.0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.14.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 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.7+0 [781609d7] GMP_jll v6.3.0+5 [deac9b47] LibCURL_jll v8.22.0+0 [e37daf67] LibGit2_jll v1.9.7+0 [29816b5a] LibSSH2_jll v1.11.104+0 [14a3606d] MozillaCACerts_jll v2026.8.13 [4536629a] OpenBLAS_jll v0.3.34+0 [05823500] OpenLibm_jll v0.8.8+0 [458c3c95] OpenSSL_jll v3.5.8+0 [efcefdf7] PCRE2_jll v10.48.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.70.0+0 [3f19e933] p7zip_jll v17.8.2+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... --1 --11 --111 --1111 --112 --1121 --12 --121 --1211 --12111 --12112 --1212 --1213 --1 --11 --111 --1111 --112 --1121 --12 --121 --1211 --12111 --12112 --1212 --1213 --A (1.0) --B (0.5) --D (0.4) --G (1.0) --E (0.6) --H (1.0) --C (0.5) --F (1.0) --I (0.6) --L (0.3333333333) --M (0.6666666667) --J (0.1) --K (0.3) --A (1.0) --B (0.5) --D (0.2) --G (0.2) --E (0.3) --H (0.3) --C (0.5) --F (0.5) --I (0.3) --L (0.09999999998999999) --M (0.20000000000999998) --J (0.05) --K (0.15) [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.395 Objective value of best integer-feasible solution: 50.0 Objective value of lower bound: 50.0 Solve time: 19.465s Re-solved Objective: 50.0 JuDGE Expansions Node 1: "big" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 Objective value of best integer-feasible solution: 52.0 Objective value of lower bound: 52.0 Solve time: 0.495s Re-solved Objective: 52.0 JuDGE Expansions Node 1: "big" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | 4.453250e+01 4.331250e+01 | 1.220000e+00 2.816739e-02 | 0 | 0.175 3 of 3 | 4.453250e+01 4.331250e+01 | 1.220000e+00 2.816739e-02 | 0 | 1.602 ┌ Warning: `_unsetindex!(A, i)` is deprecated, use `Base.unsetindex!(A, i)` instead. │ caller = _delete!(h::OrderedCollections.OrderedDict{GLPK._ConstraintKey, GLPK._ConstraintInfo}, index::Int64) at ordered_dict.jl:441 [inlined] └ @ OrderedCollections ~/.julia/packages/OrderedCollections/MglBA/src/ordered_dict.jl:441 ┌ Warning: `_unsetindex!(A, i)` is deprecated, use `Base.unsetindex!(A, i)` instead. │ caller = _delete!(h::OrderedCollections.OrderedDict{GLPK._ConstraintKey, GLPK._ConstraintInfo}, index::Int64) at ordered_dict.jl:442 [inlined] └ @ OrderedCollections ~/.julia/packages/OrderedCollections/MglBA/src/ordered_dict.jl:442 ┌ Warning: `_unsetindex!(A, i)` is deprecated, use `Base.unsetindex!(A, i)` instead. │ caller = _delete!(h::OrderedCollections.OrderedDict{MathOptInterface.ConstraintIndex{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.GreaterThan{Float64}}, Tuple{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.GreaterThan{Float64}}}, index::Int64) at ordered_dict.jl:441 [inlined] └ @ OrderedCollections ~/.julia/packages/OrderedCollections/MglBA/src/ordered_dict.jl:441 ┌ Warning: `_unsetindex!(A, i)` is deprecated, use `Base.unsetindex!(A, i)` instead. │ caller = _delete!(h::OrderedCollections.OrderedDict{MathOptInterface.ConstraintIndex{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.GreaterThan{Float64}}, Tuple{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.GreaterThan{Float64}}}, index::Int64) at ordered_dict.jl:442 [inlined] └ @ OrderedCollections ~/.julia/packages/OrderedCollections/MglBA/src/ordered_dict.jl:442 ┌ Warning: `_unsetindex!(A, i)` is deprecated, use `Base.unsetindex!(A, i)` instead. │ caller = _delete!(h::OrderedCollections.OrderedDict{MathOptInterface.ConstraintIndex{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.LessThan{Float64}}, Tuple{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.LessThan{Float64}}}, index::Int64) at ordered_dict.jl:441 [inlined] └ @ OrderedCollections ~/.julia/packages/OrderedCollections/MglBA/src/ordered_dict.jl:441 ┌ Warning: `_unsetindex!(A, i)` is deprecated, use `Base.unsetindex!(A, i)` instead. │ caller = _delete!(h::OrderedCollections.OrderedDict{MathOptInterface.ConstraintIndex{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.LessThan{Float64}}, Tuple{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.LessThan{Float64}}}, index::Int64) at ordered_dict.jl:442 [inlined] └ @ OrderedCollections ~/.julia/packages/OrderedCollections/MglBA/src/ordered_dict.jl:442 Objective value of best integer-feasible solution: 44.5325 Objective value of lower bound: 44.5325 Solve time: 7.029s Re-solved Objective: 44.5325 JuDGE Expansions Node 1: "big" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | 4.773250e+01 4.416250e+01 | 3.570000e+00 8.083781e-02 | 0 | 0.004 3 of 3 | 4.560750e+01 4.416250e+01 | 1.445000e+00 3.272007e-02 | 0 | 0.018 Objective value of best integer-feasible solution: 45.6075 Objective value of lower bound: 45.6075 Solve time: 0.025s Re-solved Objective: 45.6075 JuDGE Expansions Node 1: "small[1]" 1.0 Node 111: "small[2]" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | 4.228000e+01 4.100000e+01 | 1.280000e+00 3.121951e-02 | 0 | 0.004 3 of 3 | 4.228000e+01 4.100000e+01 | 1.280000e+00 3.121951e-02 | 0 | 0.005 Objective value of best integer-feasible solution: 42.28 Objective value of lower bound: 42.28 Solve time: 0.011s Re-solved Objective: 42.28 JuDGE Expansions Node 1: "small[2]" 1.0 Node 111: "small[1]" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | 4.308000e+01 4.180000e+01 | 1.280000e+00 3.062201e-02 | 0 | 0.004 3 of 3 | 4.308000e+01 4.180000e+01 | 1.280000e+00 3.062201e-02 | 0 | 0.005 Objective value of best integer-feasible solution: 43.08 Objective value of lower bound: 43.08 Solve time: 0.01s Re-solved Objective: 43.080000000000005 JuDGE Expansions Node 1: "small[2]" 1.0 Node 111: "small[1]" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (3) 16: obj = 4.900000000e+01 inf = 0.000e+00 (0) * 17: obj = 4.900000000e+01 inf = 0.000e+00 (0) + 17: mip = not found yet >= -inf (1; 0) + 22: >>>>> 5.000000000e+01 >= 5.000000000e+01 0.0% (4; 0) + 22: mip = 5.000000000e+01 >= tree is empty 0.0% (0; 7) [ Info: Solved. Objective: 50.0 Deterministic Equivalent Expansions Node 1: "big" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (3) 18: obj = 5.500000000e+01 inf = 0.000e+00 (0) * 19: obj = 5.000000000e+01 inf = 0.000e+00 (0) + 19: mip = not found yet >= -inf (1; 0) + 23: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (3; 0) + 23: mip = 5.200000000e+01 >= tree is empty 0.0% (0; 5) [ Info: Solved. Objective: 52.0 Deterministic Equivalent Expansions Node 1: "big" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (3) 16: obj = 4.131250000e+01 inf = 0.000e+00 (0) * 17: obj = 4.131250000e+01 inf = 0.000e+00 (0) + 17: mip = not found yet >= -inf (1; 0) + 22: >>>>> 4.453250000e+01 >= 4.453250000e+01 0.0% (4; 0) + 22: mip = 4.453250000e+01 >= tree is empty 0.0% (0; 7) [ Info: Solved. Objective: 44.5325 Deterministic Equivalent Expansions Node 1: "big" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (3) 19: obj = 4.641250000e+01 inf = 0.000e+00 (0) * 21: obj = 4.216250000e+01 inf = 0.000e+00 (0) + 21: mip = not found yet >= -inf (1; 0) + 25: >>>>> 4.623250000e+01 >= 4.560750000e+01 1.4% (3; 0) + 27: >>>>> 4.560750000e+01 >= 4.560750000e+01 0.0% (1; 2) + 27: mip = 4.560750000e+01 >= tree is empty 0.0% (0; 5) [ Info: Solved. Objective: 45.6075 Deterministic Equivalent Expansions Node 1: "small[2]" 1.0 Node 111: "small[1]" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (3) 16: obj = 3.900000000e+01 inf = 0.000e+00 (0) * 17: obj = 3.900000000e+01 inf = 0.000e+00 (0) + 17: mip = not found yet >= -inf (1; 0) + 23: >>>>> 4.288000000e+01 >= 4.228000000e+01 1.4% (5; 0) + 27: >>>>> 4.228000000e+01 >= 4.228000000e+01 0.0% (1; 5) + 27: mip = 4.228000000e+01 >= tree is empty 0.0% (0; 9) [ Info: Solved. Objective: 42.28 Deterministic Equivalent Expansions Node 1: "small[1]" 1.0 Node 111: "small[2]" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (3) 19: obj = 4.380000000e+01 inf = 2.220e-15 (0) * 21: obj = 3.980000000e+01 inf = 0.000e+00 (0) + 21: mip = not found yet >= -inf (1; 0) + 29: >>>>> 5.172000000e+01 >= 4.308000000e+01 16.7% (4; 0) + 31: >>>>> 4.308000000e+01 >= 4.308000000e+01 0.0% (3; 1) + 31: mip = 4.308000000e+01 >= tree is empty 0.0% (0; 7) [ Info: Solved. Objective: 43.080000000000005 Deterministic Equivalent Expansions Node 1: "small[2]" 1.0 Node 111: "small[1]" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 2.186 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 0.000000e+00 | 0.000000e+00 -Inf | Inf NaN | 0 | 3.138 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem -5.333333e+01 | -5.333333e+01 -5.066667e+02 | 4.533333e+02 8.947368e-01 | 0 | 3.139 3 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem -5.333333e+01 | -5.333333e+01 -5.333333e+01 | 0.000000e+00 0.000000e+00 | 0 | 3.140 4 Convergence criteria met. Objective: -53.33333333333334 Re-solved Objective: -53.33333333333334 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (3) * 17: obj = -5.333333333e+01 inf = 0.000e+00 (0) + 17: mip = not found yet >= -inf (1; 0) + 17: >>>>> -5.333333333e+01 >= -5.333333333e+01 0.0% (1; 0) + 17: mip = -5.333333333e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. Deterministic Equivalent Objective: -53.33333333333334 Deterministic Equivalent Expansions Node 1: "papers_ordered" 80.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 0.000000e+00 | 0.000000e+00 -Inf | Inf NaN | 0 | 0.002 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem -3.000000e+01 | -3.000000e+01 -5.066667e+02 | 4.766667e+02 9.407895e-01 | 0 | 0.003 3 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem -3.000000e+01 | -3.000000e+01 -3.000000e+01 | 3.552714e-14 1.184238e-15 | 0 | 0.003 4 Convergence criteria met. Objective: -30.0 Re-solved Objective: -30.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (3) * 23: obj = -3.000000000e+01 inf = 0.000e+00 (0) + 23: mip = not found yet >= -inf (1; 0) + 23: >>>>> -3.000000000e+01 >= -3.000000000e+01 0.0% (1; 0) + 23: mip = -3.000000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. Deterministic Equivalent Objective: -30.0 Deterministic Equivalent Expansions Node 1: "papers_ordered" 10.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 13 nodes [ Info: Building JuMP Model for node 1111111121131212112212313131132133s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 13 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/13Solving subproblem for node 11 2/13Solving subproblem for node 111 3/13Solving subproblem for node 112 4/13Solving subproblem for node 113 5/13Solving subproblem for node 12 6/13Solving subproblem for node 121 7/13Solving subproblem for node 122 8/13Solving subproblem for node 123 9/13Solving subproblem for node 13 10/13Solving subproblem for node 131 11/13Solving subproblem for node 132 12/13Solving subproblem for node 133 13/13Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.004 1 Solving subproblem for node 1 1/13Solving subproblem for node 11 2/13Solving subproblem for node 111 3/13Solving subproblem for node 112 4/13Solving subproblem for node 113 5/13Solving subproblem for node 12 6/13Solving subproblem for node 121 7/13Solving subproblem for node 122 8/13Solving subproblem for node 123 9/13Solving subproblem for node 13 10/13Solving subproblem for node 131 11/13Solving subproblem for node 132 12/13Solving subproblem for node 133 13/13Solving master problem 0.000000e+00 | 0.000000e+00 -Inf | Inf NaN | 0 | 0.006 2 Solving subproblem for node 1 1/13Solving subproblem for node 11 2/13Solving subproblem for node 111 3/13Solving subproblem for node 112 4/13Solving subproblem for node 113 5/13Solving subproblem for node 12 6/13Solving subproblem for node 121 7/13Solving subproblem for node 122 8/13Solving subproblem for node 123 9/13Solving subproblem for node 13 10/13Solving subproblem for node 131 11/13Solving subproblem for node 132 12/13Solving subproblem for node 133 13/13Solving master problem -6.102778e+01 | 0.000000e+00 -3.226667e+02 | 2.616389e+02 8.108643e-01 | 2 | 0.008 3 Solving subproblem for node 1 1/13Solving subproblem for node 11 2/13Solving subproblem for node 111 3/13Solving subproblem for node 112 4/13Solving subproblem for node 113 5/13Solving subproblem for node 12 6/13Solving subproblem for node 121 7/13Solving subproblem for node 122 8/13Solving subproblem for node 123 9/13Solving subproblem for node 13 10/13Solving subproblem for node 131 11/13Solving subproblem for node 132 12/13Solving subproblem for node 133 13/13Solving master problem -6.102778e+01 | 0.000000e+00 -6.102778e+01 | 6.394885e-14 1.047865e-15 | 2 | 0.009 4 Solving master problem as MIP -6.102778e+01 | -6.101111e+01 -6.102778e+01 | 1.666667e-02 2.730997e-04 | 0 | 0.119 5* Convergence criteria met. Objective: -61.01111111111112 Re-solved Objective: -61.011111111111106 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 13 nodes [ Info: Building JuMP Model for node 1111111121131212112212313131132133s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (9) * 74: obj = -6.102777778e+01 inf = 0.000e+00 (0) + 74: mip = not found yet >= -inf (1; 0) + 75: >>>>> -6.101111111e+01 >= -6.101111111e+01 < 0.1% (2; 0) + 75: mip = -6.101111111e+01 >= tree is empty 0.0% (0; 3) [ Info: Solved. Deterministic Equivalent Objective: -61.01111111111114 Deterministic Equivalent Expansions Node 1: "papers_ordered" 14.000000000000002 Node 11: "papers_ordered" 20.000000000000004 Node 12: "papers_ordered" 9.999999999999995 Node 13: "papers_ordered" 10.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 40 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/40Solving subproblem for node 11 2/40Solving subproblem for node 111 3/40Solving subproblem for node 1111 4/40Solving subproblem for node 1112 5/40Solving subproblem for node 1113 6/40Solving subproblem for node 112 7/40Solving subproblem for node 1121 8/40Solving subproblem for node 1122 9/40Solving subproblem for node 1123 10/40Solving subproblem for node 113 11/40Solving subproblem for node 1131 12/40Solving subproblem for node 1132 13/40Solving subproblem for node 1133 14/40Solving subproblem for node 12 15/40Solving subproblem for node 121 16/40Solving subproblem for node 1211 17/40Solving subproblem for node 1212 18/40Solving subproblem for node 1213 19/40Solving subproblem for node 122 20/40Solving subproblem for node 1221 21/40Solving subproblem for node 1222 22/40Solving subproblem for node 1223 23/40Solving subproblem for node 123 24/40Solving subproblem for node 1231 25/40Solving subproblem for node 1232 26/40Solving subproblem for node 1233 27/40Solving subproblem for node 13 28/40Solving subproblem for node 131 29/40Solving subproblem for node 1311 30/40Solving subproblem for node 1312 31/40Solving subproblem for node 1313 32/40Solving subproblem for node 132 33/40Solving subproblem for node 1321 34/40Solving subproblem for node 1322 35/40Solving subproblem for node 1323 36/40Solving subproblem for node 133 37/40Solving subproblem for node 1331 38/40Solving subproblem for node 1332 39/40Solving subproblem for node 1333 40/40Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.012 1 Solving subproblem for node 1 1/40Solving subproblem for node 11 2/40Solving subproblem for node 111 3/40Solving subproblem for node 1111 4/40Solving subproblem for node 1112 5/40Solving subproblem for node 1113 6/40Solving subproblem for node 112 7/40Solving subproblem for node 1121 8/40Solving subproblem for node 1122 9/40Solving subproblem for node 1123 10/40Solving subproblem for node 113 11/40Solving subproblem for node 1131 12/40Solving subproblem for node 1132 13/40Solving subproblem for node 1133 14/40Solving subproblem for node 12 15/40Solving subproblem for node 121 16/40Solving subproblem for node 1211 17/40Solving subproblem for node 1212 18/40Solving subproblem for node 1213 19/40Solving subproblem for node 122 20/40Solving subproblem for node 1221 21/40Solving subproblem for node 1222 22/40Solving subproblem for node 1223 23/40Solving subproblem for node 123 24/40Solving subproblem for node 1231 25/40Solving subproblem for node 1232 26/40Solving subproblem for node 1233 27/40Solving subproblem for node 13 28/40Solving subproblem for node 131 29/40Solving subproblem for node 1311 30/40Solving subproblem for node 1312 31/40Solving subproblem for node 1313 32/40Solving subproblem for node 132 33/40Solving subproblem for node 1321 34/40Solving subproblem for node 1322 35/40Solving subproblem for node 1323 36/40Solving subproblem for node 133 37/40Solving subproblem for node 1331 38/40Solving subproblem for node 1332 39/40Solving subproblem for node 1333 40/40Solving master problem 0.000000e+00 | 0.000000e+00 -Inf | Inf NaN | 0 | 0.017 2 Solving subproblem for node 1 1/40Solving subproblem for node 11 2/40Solving subproblem for node 111 3/40Solving subproblem for node 1111 4/40Solving subproblem for node 1112 5/40Solving subproblem for node 1113 6/40Solving subproblem for node 112 7/40Solving subproblem for node 1121 8/40Solving subproblem for node 1122 9/40Solving subproblem for node 1123 10/40Solving subproblem for node 113 11/40Solving subproblem for node 1131 12/40Solving subproblem for node 1132 13/40Solving subproblem for node 1133 14/40Solving subproblem for node 12 15/40Solving subproblem for node 121 16/40Solving subproblem for node 1211 17/40Solving subproblem for node 1212 18/40Solving subproblem for node 1213 19/40Solving subproblem for node 122 20/40Solving subproblem for node 1221 21/40Solving subproblem for node 1222 22/40Solving subproblem for node 1223 23/40Solving subproblem for node 123 24/40Solving subproblem for node 1231 25/40Solving subproblem for node 1232 26/40Solving subproblem for node 1233 27/40Solving subproblem for node 13 28/40Solving subproblem for node 131 29/40Solving subproblem for node 1311 30/40Solving subproblem for node 1312 31/40Solving subproblem for node 1313 32/40Solving subproblem for node 132 33/40Solving subproblem for node 1321 34/40Solving subproblem for node 1322 35/40Solving subproblem for node 1323 36/40Solving subproblem for node 133 37/40Solving subproblem for node 1331 38/40Solving subproblem for node 1332 39/40Solving subproblem for node 1333 40/40Solving master problem -9.061690e+01 | 0.000000e+00 -4.680000e+02 | 3.773831e+02 8.063741e-01 | 6 | 0.024 3 Solving subproblem for node 1 1/40Solving subproblem for node 11 2/40Solving subproblem for node 111 3/40Solving subproblem for node 1111 4/40Solving subproblem for node 1112 5/40Solving subproblem for node 1113 6/40Solving subproblem for node 112 7/40Solving subproblem for node 1121 8/40Solving subproblem for node 1122 9/40Solving subproblem for node 1123 10/40Solving subproblem for node 113 11/40Solving subproblem for node 1131 12/40Solving subproblem for node 1132 13/40Solving subproblem for node 1133 14/40Solving subproblem for node 12 15/40Solving subproblem for node 121 16/40Solving subproblem for node 1211 17/40Solving subproblem for node 1212 18/40Solving subproblem for node 1213 19/40Solving subproblem for node 122 20/40Solving subproblem for node 1221 21/40Solving subproblem for node 1222 22/40Solving subproblem for node 1223 23/40Solving subproblem for node 123 24/40Solving subproblem for node 1231 25/40Solving subproblem for node 1232 26/40Solving subproblem for node 1233 27/40Solving subproblem for node 13 28/40Solving subproblem for node 131 29/40Solving subproblem for node 1311 30/40Solving subproblem for node 1312 31/40Solving subproblem for node 1313 32/40Solving subproblem for node 132 33/40Solving subproblem for node 1321 34/40Solving subproblem for node 1322 35/40Solving subproblem for node 1323 36/40Solving subproblem for node 133 37/40Solving subproblem for node 1331 38/40Solving subproblem for node 1332 39/40Solving subproblem for node 1333 40/40Solving master problem -9.061690e+01 | 0.000000e+00 -9.061690e+01 | 5.684342e-14 6.272938e-16 | 6 | 0.027 4 Solving master problem as MIP -9.061690e+01 | -9.052593e+01 -9.061690e+01 | 9.097222e-02 1.003921e-03 | 0 | 0.031 5* Convergence criteria met. Objective: -90.525925925926 Re-solved Objective: -90.52592592592595 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (27) * 211: obj = -9.061689815e+01 inf = 9.592e-14 (0) 1 + 211: mip = not found yet >= -inf (1; 0) + 221: >>>>> -9.052592593e+01 >= -9.055540741e+01 < 0.1% (6; 0) + 225: mip = -9.052592593e+01 >= tree is empty 0.0% (0; 11) [ Info: Solved. Deterministic Equivalent Objective: -90.52592592592599 Deterministic Equivalent Expansions Node 1: "papers_ordered" 14.0 Node 11: "papers_ordered" 10.0 Node 111: "papers_ordered" 10.0 Node 112: "papers_ordered" 10.0 Node 113: "papers_ordered" 10.0 Node 12: "papers_ordered" 16.0 Node 121: "papers_ordered" 10.0 Node 122: "papers_ordered" 20.0 Node 123: "papers_ordered" 20.0 Node 13: "papers_ordered" 16.0 Node 131: "papers_ordered" 10.0 Node 132: "papers_ordered" 20.0 Node 133: "papers_ordered" 20.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter 3.515765e+01 | 3.515765e+01 -Inf | Inf NaN | 0 | 0.170 1 -1.387072e+01 | -1.387072e+01 -Inf | Inf NaN | 0 | 0.171 2 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.172 3 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.172 4 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.172 5* Stalled: exiting. Re-solved Objective: -13.949024628956462 JuDGE Expansions Node 1: "stock" 50.0 Node 11: "stock" 50.0 Node 12: "stock" 50.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 Complete [ Info: Building master problem... ┌ Warning: No penalty set for risk constraint violation. │ This may lead to an infeasible initial solution. └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/master.jl:486 Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Inf | Inf -Inf | Inf NaN | 0 | 0.002 1 -9.904461e+00 | -9.904461e+00 -Inf | Inf NaN | 0 | 0.002 2 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.003 3 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.004 4 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.004 5* Stalled: exiting. Re-solved Objective: -10.467188400194972 JuDGE Expansions Node 1: "stock" 0.44751499679888973 Node 11: "stock" 3.933488669532398 Node 12: "stock" 50.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+02 (14) 7: obj = 0.000000000e+00 inf = 0.000e+00 (0) * 35: obj = -1.046718871e+01 inf = 0.000e+00 (0) [ Info: Solved. Objective: -10.467188708514165 Deterministic Equivalent Expansions Node 1: "stock" 0.44751499679890827 Node 11: "stock" 3.933495886165918 Node 12: "stock" 50.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 Complete [ Info: Building master problem... ┌ Warning: No penalty set for risk constraint violation. │ This may lead to an infeasible initial solution. └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/master.jl:486 Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Inf | Inf -Inf | Inf NaN | 0 | 0.002 1 -8.399189e+01 | -8.399189e+01 -Inf | Inf NaN | 0 | 0.002 2 -8.581523e+01 | -8.581523e+01 -Inf | Inf NaN | 0 | 0.003 3 -8.581523e+01 | -8.581523e+01 -Inf | Inf NaN | 0 | 0.003 4 -8.581523e+01 | -8.581523e+01 -Inf | Inf NaN | 0 | 0.004 5* Stalled: exiting. Re-solved Objective: -85.81522835638638 JuDGE Expansions Node 12: "stock" 17.579126394244504 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+02 (14) 7: obj = 0.000000000e+00 inf = 0.000e+00 (0) * 35: obj = -8.581522836e+01 inf = 8.882e-16 (0) [ Info: Solved. Objective: -85.81522835638638 Deterministic Equivalent Expansions Node 12: "stock" 17.579126394244504 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter 1.800000e+02 | 1.800000e+02 -Inf | Inf NaN | 0 | 0.002 1 -1.212500e+02 | -1.212500e+02 -1.512500e+02 | 3.000000e+01 1.983471e-01 | 0 | 0.003 2 -1.312500e+02 | -1.312500e+02 -1.512500e+02 | 2.000000e+01 1.322314e-01 | 0 | 0.004 3 -1.312500e+02 | -1.312500e+02 -1.312500e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.005 4 Convergence criteria met. Objective: -131.25 JuDGE Expansions Node 1: "bag" 0.0 Node 11: "bag" 1.0 Node 111: "bag" 0.0 Node 112: "bag" 0.0 Node 12: "bag" 0.0 Node 121: "bag" 1.0 Node 122: "bag" 1.0 Re-solved Objective: -131.25 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (4) * 49: obj = -1.350000000e+02 inf = 0.000e+00 (0) + 49: mip = not found yet >= -inf (1; 0) + 62: >>>>> -1.262500000e+02 >= -1.337500000e+02 5.9% (9; 0) + 70: >>>>> -1.312500000e+02 >= -1.337500000e+02 1.9% (6; 8) + 75: mip = -1.312500000e+02 >= tree is empty 0.0% (0; 21) [ Info: Solved. Deterministic Equivalent Objective: -131.25 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter 0.000000e+00 | 0.000000e+00 -Inf | Inf NaN | 0 | 0.002 1 -1.427500e+02 | -1.427500e+02 -1.637500e+02 | 2.100000e+01 1.282443e-01 | 0 | 0.003 2 -1.452500e+02 | -1.452500e+02 -1.637500e+02 | 1.850000e+01 1.129771e-01 | 0 | 0.004 3 -1.452500e+02 | -1.452500e+02 -1.452500e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.005 4 Convergence criteria met. Objective: -145.25 JuDGE Expansions Node 11: "bag" -2.0 Node 121: "bag" -2.0 Re-solved Objective: -145.25 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (4) * 44: obj = -1.467083333e+02 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 50: >>>>> -1.452500000e+02 >= -1.452500000e+02 0.0% (6; 0) + 50: mip = -1.452500000e+02 >= tree is empty 0.0% (0; 11) [ Info: Solved. Deterministic Equivalent Objective: -145.25 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem...  Stochastic Knapsack: Error During Test at /home/pkgeval/.julia/packages/JuDGE/yzb6J/test/runtests.jl:156 Test threw exception Expression: ≈(knapsack_budget(), -159.0, atol = 0.001) UndefVarError: `invest` not defined in `Main` The binding may be too new: running in world age 43195, while current world is 43196. Stacktrace: [1] macro expansion @ ~/.julia/packages/MutableArithmetics/xwKH0/src/rewrite_generic.jl:316 [inlined] [2] macro expansion @ ~/.julia/packages/MutableArithmetics/xwKH0/src/rewrite.jl:384 [inlined] [3] macro expansion @ ~/.julia/packages/JuMP/Y8Mtc/src/macros.jl:264 [inlined] [4] macro expansion @ ~/.julia/packages/JuMP/Y8Mtc/src/macros/@constraint.jl:202 [inlined] [5] macro expansion @ ~/.julia/packages/JuMP/Y8Mtc/src/macros.jl:414 [inlined] [6] (::var"#budget#knapsack_budget##30"{Vector{Int64}, Int64, Dict{AbstractTree, Int64}})(model::Model, tree::Tree) @ Main ~/.julia/packages/JuDGE/yzb6J/examples/knapsacks.jl:683 [7] build_master(sub_problems::Dict{AbstractTree, Model}, tree::Tree, probabilities::Dict{AbstractTree, Float64}, solver::MathOptInterface.OptimizerWithAttributes, discount_factor::Float64, risk::Risk, sideconstraints::var"#budget#knapsack_budget##30"{Vector{Int64}, Int64, Dict{AbstractTree, Int64}}) @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/master.jl:463 [8] JuDGEModel(tree::Tree, probabilities::typeof(ConditionallyUniformProbabilities), sub_problem_builder::var"#sub_problems#knapsack_budget##0"{Vector{Int64}, Int64, Int64, Int64, Dict{AbstractTree, Vector{Int64}}, Dict{AbstractTree, Vector{Int64}}, Dict{AbstractTree, Int64}}, solver::MathOptInterface.OptimizerWithAttributes; discount_factor::Float64, risk::Risk, sideconstraints::Function, check::Bool, perfect_foresight::Bool) @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/decomposition.jl:179 [9] knapsack_budget() @ Main ~/.julia/packages/JuDGE/yzb6J/examples/knapsacks.jl:693 [10] top-level scope @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:10 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2252 [inlined] [12] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:153 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2252 [inlined] [14] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:156 [inlined] [15] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:786 [inlined] [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 63 nodes [ Info: Building JuMP Model for node 111111111111111111111111112111121111211111221112111211112111112121112211122111122211211211121111211111211211212112121112122112211221112211112212112221122211122221212112111211112111112111212112121121121122121212121121211121212121221212211212221221221122111221111221121221212212112212212221222112221112221212222122221122222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 63 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-07 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/63Solving subproblem for node 11 2/63Solving subproblem for node 111 3/63Solving subproblem for node 1111 4/63Solving subproblem for node 11111 5/63Solving subproblem for node 111111 6/63Solving subproblem for node 111112 7/63Solving subproblem for node 11112 8/63Solving subproblem for node 111121 9/63Solving subproblem for node 111122 10/63Solving subproblem for node 1112 11/63Solving subproblem for node 11121 12/63Solving subproblem for node 111211 13/63Solving subproblem for node 111212 14/63Solving subproblem for node 11122 15/63Solving subproblem for node 111221 16/63Solving subproblem for node 111222 17/63Solving subproblem for node 112 18/63Solving subproblem for node 1121 19/63Solving subproblem for node 11211 20/63Solving subproblem for node 112111 21/63Solving subproblem for node 112112 22/63Solving subproblem for node 11212 23/63Solving subproblem for node 112121 24/63Solving subproblem for node 112122 25/63Solving subproblem for node 1122 26/63Solving subproblem for node 11221 27/63Solving subproblem for node 112211 28/63Solving subproblem for node 112212 29/63Solving subproblem for node 11222 30/63Solving subproblem for node 112221 31/63Solving subproblem for node 112222 32/63Solving subproblem for node 12 33/63Solving subproblem for node 121 34/63Solving subproblem for node 1211 35/63Solving subproblem for node 12111 36/63Solving subproblem for node 121111 37/63Solving subproblem for node 121112 38/63Solving subproblem for node 12112 39/63Solving subproblem for node 121121 40/63Solving subproblem for node 121122 41/63Solving subproblem for node 1212 42/63Solving subproblem for node 12121 43/63Solving subproblem for node 121211 44/63Solving subproblem for node 121212 45/63Solving subproblem for node 12122 46/63Solving subproblem for node 121221 47/63Solving subproblem for node 121222 48/63Solving subproblem for node 122 49/63Solving subproblem for node 1221 50/63Solving subproblem for node 12211 51/63Solving subproblem for node 122111 52/63Solving subproblem for node 122112 53/63Solving subproblem for node 12212 54/63Solving subproblem for node 122121 55/63Solving subproblem for node 122122 56/63Solving subproblem for node 1222 57/63Solving subproblem for node 12221 58/63Solving subproblem for node 122211 59/63Solving subproblem for node 122212 60/63Solving subproblem for node 12222 61/63Solving subproblem for node 122221 62/63Solving subproblem for node 122222 63/63Solving master problem 1.943396e+03 | 1.943396e+03 -Inf | Inf NaN | 0 | 1.133 1 Solving subproblem for node 1 1/63Solving subproblem for node 11 2/63Solving subproblem for node 111 3/63Solving subproblem for node 1111 4/63Solving subproblem for node 11111 5/63Solving subproblem for node 111111 6/63Solving subproblem for node 111112 7/63Solving subproblem for node 11112 8/63Solving subproblem for node 111121 9/63Solving subproblem for node 111122 10/63Solving subproblem for node 1112 11/63Solving subproblem for node 11121 12/63Solving subproblem for node 111211 13/63Solving subproblem for node 111212 14/63Solving subproblem for node 11122 15/63Solving subproblem for node 111221 16/63Solving subproblem for node 111222 17/63Solving subproblem for node 112 18/63Solving subproblem for node 1121 19/63Solving subproblem for node 11211 20/63Solving subproblem for node 112111 21/63Solving subproblem for node 112112 22/63Solving subproblem for node 11212 23/63Solving subproblem for node 112121 24/63Solving subproblem for node 112122 25/63Solving subproblem for node 1122 26/63Solving subproblem for node 11221 27/63Solving subproblem for node 112211 28/63Solving subproblem for node 112212 29/63Solving subproblem for node 11222 30/63Solving subproblem for node 112221 31/63Solving subproblem for node 112222 32/63Solving subproblem for node 12 33/63Solving subproblem for node 121 34/63Solving subproblem for node 1211 35/63Solving subproblem for node 12111 36/63Solving subproblem for node 121111 37/63Solving subproblem for node 121112 38/63Solving subproblem for node 12112 39/63Solving subproblem for node 121121 40/63Solving subproblem for node 121122 41/63Solving subproblem for node 1212 42/63Solving subproblem for node 12121 43/63Solving subproblem for node 121211 44/63Solving subproblem for node 121212 45/63Solving subproblem for node 12122 46/63Solving subproblem for node 121221 47/63Solving subproblem for node 121222 48/63Solving subproblem for node 122 49/63Solving subproblem for node 1221 50/63Solving subproblem for node 12211 51/63Solving subproblem for node 122111 52/63Solving subproblem for node 122112 53/63Solving subproblem for node 12212 54/63Solving subproblem for node 122121 55/63Solving subproblem for node 122122 56/63Solving subproblem for node 1222 57/63Solving subproblem for node 12221 58/63Solving subproblem for node 122211 59/63Solving subproblem for node 122212 60/63Solving subproblem for node 12222 61/63Solving subproblem for node 122221 62/63Solving subproblem for node 122222 63/63Solving master problem 1.943396e+03 | 1.943396e+03 1.914587e+03 | 2.880877e+01 1.504699e-02 | 0 | 1.166 2 Solving subproblem for node 1 1/63Solving subproblem for node 11 2/63Solving subproblem for node 111 3/63Solving subproblem for node 1111 4/63Solving subproblem for node 11111 5/63Solving subproblem for node 111111 6/63Solving subproblem for node 111112 7/63Solving subproblem for node 11112 8/63Solving subproblem for node 111121 9/63Solving subproblem for node 111122 10/63Solving subproblem for node 1112 11/63Solving subproblem for node 11121 12/63Solving subproblem for node 111211 13/63Solving subproblem for node 111212 14/63Solving subproblem for node 11122 15/63Solving subproblem for node 111221 16/63Solving subproblem for node 111222 17/63Solving subproblem for node 112 18/63Solving subproblem for node 1121 19/63Solving subproblem for node 11211 20/63Solving subproblem for node 112111 21/63Solving subproblem for node 112112 22/63Solving subproblem for node 11212 23/63Solving subproblem for node 112121 24/63Solving subproblem for node 112122 25/63Solving subproblem for node 1122 26/63Solving subproblem for node 11221 27/63Solving subproblem for node 112211 28/63Solving subproblem for node 112212 29/63Solving subproblem for node 11222 30/63Solving subproblem for node 112221 31/63Solving subproblem for node 112222 32/63Solving subproblem for node 12 33/63Solving subproblem for node 121 34/63Solving subproblem for node 1211 35/63Solving subproblem for node 12111 36/63Solving subproblem for node 121111 37/63Solving subproblem for node 121112 38/63Solving subproblem for node 12112 39/63Solving subproblem for node 121121 40/63Solving subproblem for node 121122 41/63Solving subproblem for node 1212 42/63Solving subproblem for node 12121 43/63Solving subproblem for node 121211 44/63Solving subproblem for node 121212 45/63Solving subproblem for node 12122 46/63Solving subproblem for node 121221 47/63Solving subproblem for node 121222 48/63Solving subproblem for node 122 49/63Solving subproblem for node 1221 50/63Solving subproblem for node 12211 51/63Solving subproblem for node 122111 52/63Solving subproblem for node 122112 53/63Solving subproblem for node 12212 54/63Solving subproblem for node 122121 55/63Solving subproblem for node 122122 56/63Solving subproblem for node 1222 57/63Solving subproblem for node 12221 58/63Solving subproblem for node 122211 59/63Solving subproblem for node 122212 60/63Solving subproblem for node 12222 61/63Solving subproblem for node 122221 62/63Solving subproblem for node 122222 63/63Solving master problem 1.942863e+03 | 1.942863e+03 1.918627e+03 | 2.423591e+01 1.263190e-02 | 0 | 1.209 3 Solving subproblem for node 1 1/18Solving subproblem for node 11 2/18Solving subproblem for node 111 3/18Solving subproblem for node 11112 4/18Solving subproblem for node 111122 5/18Solving subproblem for node 1112 6/18Solving subproblem for node 11121 7/18Solving subproblem for node 111211 8/18Solving subproblem for node 111212 9/18Solving subproblem for node 112 10/18Solving subproblem for node 1121 11/18Solving subproblem for node 1122 12/18Solving subproblem for node 12 13/18Solving subproblem for node 121 14/18Solving subproblem for node 121111 15/18Solving subproblem for node 12112 16/18Solving subproblem for node 122 17/18Solving subproblem for node 122121 18/18Solving master problem 1.941942e+03 | 1.941942e+03 1.918627e+03 | 2.331550e+01 1.215218e-02 | 0 | 1.296 4 Solving subproblem for node 11 1/15Solving subproblem for node 111 2/15Solving subproblem for node 11112 3/15Solving subproblem for node 111122 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 11121 6/15Solving subproblem for node 111211 7/15Solving subproblem for node 111212 8/15Solving subproblem for node 112 9/15Solving subproblem for node 1121 10/15Solving subproblem for node 1122 11/15Solving subproblem for node 12 12/15Solving subproblem for node 121 13/15Solving subproblem for node 122 14/15Solving subproblem for node 122121 15/15Solving master problem 1.941639e+03 | 1.941639e+03 1.918627e+03 | 2.301190e+01 1.199394e-02 | 0 | 1.311 5 Solving subproblem for node 1 1/63Solving subproblem for node 11 2/63Solving subproblem for node 111 3/63Solving subproblem for node 1111 4/63Solving subproblem for node 11111 5/63Solving subproblem for node 111111 6/63Solving subproblem for node 111112 7/63Solving subproblem for node 11112 8/63Solving subproblem for node 111121 9/63Solving subproblem for node 111122 10/63Solving subproblem for node 1112 11/63Solving subproblem for node 11121 12/63Solving subproblem for node 111211 13/63Solving subproblem for node 111212 14/63Solving subproblem for node 11122 15/63Solving subproblem for node 111221 16/63Solving subproblem for node 111222 17/63Solving subproblem for node 112 18/63Solving subproblem for node 1121 19/63Solving subproblem for node 11211 20/63Solving subproblem for node 112111 21/63Solving subproblem for node 112112 22/63Solving subproblem for node 11212 23/63Solving subproblem for node 112121 24/63Solving subproblem for node 112122 25/63Solving subproblem for node 1122 26/63Solving subproblem for node 11221 27/63Solving subproblem for node 112211 28/63Solving subproblem for node 112212 29/63Solving subproblem for node 11222 30/63Solving subproblem for node 112221 31/63Solving subproblem for node 112222 32/63Solving subproblem for node 12 33/63Solving subproblem for node 121 34/63Solving subproblem for node 1211 35/63Solving subproblem for node 12111 36/63Solving subproblem for node 121111 37/63Solving subproblem for node 121112 38/63Solving subproblem for node 12112 39/63Solving subproblem for node 121121 40/63Solving subproblem for node 121122 41/63Solving subproblem for node 1212 42/63Solving subproblem for node 12121 43/63Solving subproblem for node 121211 44/63Solving subproblem for node 121212 45/63Solving subproblem for node 12122 46/63Solving subproblem for node 121221 47/63Solving subproblem for node 121222 48/63Solving subproblem for node 122 49/63Solving subproblem for node 1221 50/63Solving subproblem for node 12211 51/63Solving subproblem for node 122111 52/63Solving subproblem for node 122112 53/63Solving subproblem for node 12212 54/63Solving subproblem for node 122121 55/63Solving subproblem for node 122122 56/63Solving subproblem for node 1222 57/63Solving subproblem for node 12221 58/63Solving subproblem for node 122211 59/63Solving subproblem for node 122212 60/63Solving subproblem for node 12222 61/63Solving subproblem for node 122221 62/63Solving subproblem for node 122222 63/63Solving master problem 1.936682e+03 | 1.936682e+03 1.922866e+03 | 1.381626e+01 7.185244e-03 | 0 | 1.352 6 Solving subproblem for node 1111 1/25Solving subproblem for node 111111 2/25Solving subproblem for node 111112 3/25Solving subproblem for node 111121 4/25Solving subproblem for node 11122 5/25Solving subproblem for node 111221 6/25Solving subproblem for node 11211 7/25Solving subproblem for node 112111 8/25Solving subproblem for node 112112 9/25Solving subproblem for node 11212 10/25Solving subproblem for node 11221 11/25Solving subproblem for node 11222 12/25Solving subproblem for node 112221 13/25Solving subproblem for node 1211 14/25Solving subproblem for node 121112 15/25Solving subproblem for node 121121 16/25Solving subproblem for node 121122 17/25Solving subproblem for node 1212 18/25Solving subproblem for node 12121 19/25Solving subproblem for node 12122 20/25Solving subproblem for node 1221 21/25Solving subproblem for node 1222 22/25Solving subproblem for node 12221 23/25Solving subproblem for node 122212 24/25Solving subproblem for node 12222 25/25Solving master problem 1.936579e+03 | 1.936579e+03 1.922866e+03 | 1.371278e+01 7.131427e-03 | 0 | 1.371 7 Solving subproblem for node 111111 1/6Solving subproblem for node 111112 2/6Solving subproblem for node 112111 3/6Solving subproblem for node 112112 4/6Solving subproblem for node 12121 5/6Solving subproblem for node 12122 6/6Solving master problem 1.936579e+03 | 1.936579e+03 1.922866e+03 | 1.371278e+01 7.131427e-03 | 0 | 1.483 8 Solving subproblem for node 1 1/63Solving subproblem for node 11 2/63Solving subproblem for node 111 3/63Solving subproblem for node 1111 4/63Solving subproblem for node 11111 5/63Solving subproblem for node 111111 6/63Solving subproblem for node 111112 7/63Solving subproblem for node 11112 8/63Solving subproblem for node 111121 9/63Solving subproblem for node 111122 10/63Solving subproblem for node 1112 11/63Solving subproblem for node 11121 12/63Solving subproblem for node 111211 13/63Solving subproblem for node 111212 14/63Solving subproblem for node 11122 15/63Solving subproblem for node 111221 16/63Solving subproblem for node 111222 17/63Solving subproblem for node 112 18/63Solving subproblem for node 1121 19/63Solving subproblem for node 11211 20/63Solving subproblem for node 112111 21/63Solving subproblem for node 112112 22/63Solving subproblem for node 11212 23/63Solving subproblem for node 112121 24/63Solving subproblem for node 112122 25/63Solving subproblem for node 1122 26/63Solving subproblem for node 11221 27/63Solving subproblem for node 112211 28/63Solving subproblem for node 112212 29/63Solving subproblem for node 11222 30/63Solving subproblem for node 112221 31/63Solving subproblem for node 112222 32/63Solving subproblem for node 12 33/63Solving subproblem for node 121 34/63Solving subproblem for node 1211 35/63Solving subproblem for node 12111 36/63Solving subproblem for node 121111 37/63Solving subproblem for node 121112 38/63Solving subproblem for node 12112 39/63Solving subproblem for node 121121 40/63Solving subproblem for node 121122 41/63Solving subproblem for node 1212 42/63Solving subproblem for node 12121 43/63Solving subproblem for node 121211 44/63Solving subproblem for node 121212 45/63Solving subproblem for node 12122 46/63Solving subproblem for node 121221 47/63Solving subproblem for node 121222 48/63Solving subproblem for node 122 49/63Solving subproblem for node 1221 50/63Solving subproblem for node 12211 51/63Solving subproblem for node 122111 52/63Solving subproblem for node 122112 53/63Solving subproblem for node 12212 54/63Solving subproblem for node 122121 55/63Solving subproblem for node 122122 56/63Solving subproblem for node 1222 57/63Solving subproblem for node 12221 58/63Solving subproblem for node 122211 59/63Solving subproblem for node 122212 60/63Solving subproblem for node 12222 61/63Solving subproblem for node 122221 62/63Solving subproblem for node 122222 63/63Solving master problem 1.925586e+03 | 1.925586e+03 1.923168e+03 | 2.418348e+00 1.257482e-03 | 0 | 1.517 9 Solving subproblem for node 11111 1/18Solving subproblem for node 111222 2/18Solving subproblem for node 112121 3/18Solving subproblem for node 112122 4/18Solving subproblem for node 112211 5/18Solving subproblem for node 112212 6/18Solving subproblem for node 112222 7/18Solving subproblem for node 12111 8/18Solving subproblem for node 121211 9/18Solving subproblem for node 121212 10/18Solving subproblem for node 121221 11/18Solving subproblem for node 121222 12/18Solving subproblem for node 12211 13/18Solving subproblem for node 122112 14/18Solving subproblem for node 12212 15/18Solving subproblem for node 122211 16/18Solving subproblem for node 122221 17/18Solving subproblem for node 122222 18/18Solving master problem 1.925586e+03 | 1.925586e+03 1.923168e+03 | 2.418348e+00 1.257482e-03 | 0 | 1.533 10 Solving subproblem for node 11111 1/1Solving master problem 1.925586e+03 | 1.925586e+03 1.923168e+03 | 2.418348e+00 1.257482e-03 | 0 | 1.543 11 Solving subproblem for node 1 1/63Solving subproblem for node 11 2/63Solving subproblem for node 111 3/63Solving subproblem for node 1111 4/63Solving subproblem for node 11111 5/63Solving subproblem for node 111111 6/63Solving subproblem for node 111112 7/63Solving subproblem for node 11112 8/63Solving subproblem for node 111121 9/63Solving subproblem for node 111122 10/63Solving subproblem for node 1112 11/63Solving subproblem for node 11121 12/63Solving subproblem for node 111211 13/63Solving subproblem for node 111212 14/63Solving subproblem for node 11122 15/63Solving subproblem for node 111221 16/63Solving subproblem for node 111222 17/63Solving subproblem for node 112 18/63Solving subproblem for node 1121 19/63Solving subproblem for node 11211 20/63Solving subproblem for node 112111 21/63Solving subproblem for node 112112 22/63Solving subproblem for node 11212 23/63Solving subproblem for node 112121 24/63Solving subproblem for node 112122 25/63Solving subproblem for node 1122 26/63Solving subproblem for node 11221 27/63Solving subproblem for node 112211 28/63Solving subproblem for node 112212 29/63Solving subproblem for node 11222 30/63Solving subproblem for node 112221 31/63Solving subproblem for node 112222 32/63Solving subproblem for node 12 33/63Solving subproblem for node 121 34/63Solving subproblem for node 1211 35/63Solving subproblem for node 12111 36/63Solving subproblem for node 121111 37/63Solving subproblem for node 121112 38/63Solving subproblem for node 12112 39/63Solving subproblem for node 121121 40/63Solving subproblem for node 121122 41/63Solving subproblem for node 1212 42/63Solving subproblem for node 12121 43/63Solving subproblem for node 121211 44/63Solving subproblem for node 121212 45/63Solving subproblem for node 12122 46/63Solving subproblem for node 121221 47/63Solving subproblem for node 121222 48/63Solving subproblem for node 122 49/63Solving subproblem for node 1221 50/63Solving subproblem for node 12211 51/63Solving subproblem for node 122111 52/63Solving subproblem for node 122112 53/63Solving subproblem for node 12212 54/63Solving subproblem for node 122121 55/63Solving subproblem for node 122122 56/63Solving subproblem for node 1222 57/63Solving subproblem for node 12221 58/63Solving subproblem for node 122211 59/63Solving subproblem for node 122212 60/63Solving subproblem for node 12222 61/63Solving subproblem for node 122221 62/63Solving subproblem for node 122222 63/63Solving master problem 1.924354e+03 | 1.924354e+03 1.924025e+03 | 3.291063e-01 1.710510e-04 | 0 | 1.588 12 Solving subproblem for node 111112 1/3Solving subproblem for node 122111 2/3Solving subproblem for node 122122 3/3Solving master problem 1.924354e+03 | 1.924354e+03 1.924025e+03 | 3.291063e-01 1.710510e-04 | 0 | 1.598 13 Solving subproblem for node 1 1/63Solving subproblem for node 11 2/63Solving subproblem for node 111 3/63Solving subproblem for node 1111 4/63Solving subproblem for node 11111 5/63Solving subproblem for node 111111 6/63Solving subproblem for node 111112 7/63Solving subproblem for node 11112 8/63Solving subproblem for node 111121 9/63Solving subproblem for node 111122 10/63Solving subproblem for node 1112 11/63Solving subproblem for node 11121 12/63Solving subproblem for node 111211 13/63Solving subproblem for node 111212 14/63Solving subproblem for node 11122 15/63Solving subproblem for node 111221 16/63Solving subproblem for node 111222 17/63Solving subproblem for node 112 18/63Solving subproblem for node 1121 19/63Solving subproblem for node 11211 20/63Solving subproblem for node 112111 21/63Solving subproblem for node 112112 22/63Solving subproblem for node 11212 23/63Solving subproblem for node 112121 24/63Solving subproblem for node 112122 25/63Solving subproblem for node 1122 26/63Solving subproblem for node 11221 27/63Solving subproblem for node 112211 28/63Solving subproblem for node 112212 29/63Solving subproblem for node 11222 30/63Solving subproblem for node 112221 31/63Solving subproblem for node 112222 32/63Solving subproblem for node 12 33/63Solving subproblem for node 121 34/63Solving subproblem for node 1211 35/63Solving subproblem for node 12111 36/63Solving subproblem for node 121111 37/63Solving subproblem for node 121112 38/63Solving subproblem for node 12112 39/63Solving subproblem for node 121121 40/63Solving subproblem for node 121122 41/63Solving subproblem for node 1212 42/63Solving subproblem for node 12121 43/63Solving subproblem for node 121211 44/63Solving subproblem for node 121212 45/63Solving subproblem for node 12122 46/63Solving subproblem for node 121221 47/63Solving subproblem for node 121222 48/63Solving subproblem for node 122 49/63Solving subproblem for node 1221 50/63Solving subproblem for node 12211 51/63Solving subproblem for node 122111 52/63Solving subproblem for node 122112 53/63Solving subproblem for node 12212 54/63Solving subproblem for node 122121 55/63Solving subproblem for node 122122 56/63Solving subproblem for node 1222 57/63Solving subproblem for node 12221 58/63Solving subproblem for node 122211 59/63Solving subproblem for node 122212 60/63Solving subproblem for node 12222 61/63Solving subproblem for node 122221 62/63Solving subproblem for node 122222 63/63Solving master problem 1.924354e+03 | 1.924354e+03 1.924354e+03 | 0.000000e+00 0.000000e+00 | 0 | 1.625 14 Convergence criteria met. Objective: 1924.3540625394005 JuDGE Expansions Node 1: "new_capacity[Austin,Denver]" 7.0 Node 1: "new_capacity[Buffalo,Erie]" 8.0 Node 1: "new_capacity[Buffalo,Chicago]" 8.0 Node 1111: "new_capacity[Austin,Denver]" 7.0 Node 111112: "new_capacity[Austin,Chicago]" 10.0 Node 111112: "new_supply[Austin]" 30.0 Node 11112: "new_capacity[Buffalo,Erie]" 8.0 Node 111121: "new_capacity[Austin,Chicago]" 10.0 Node 111121: "new_supply[Austin]" 30.0 Node 111122: "new_capacity[Austin,Chicago]" 10.0 Node 111122: "new_supply[Austin]" 30.0 Node 1112: "new_capacity[Austin,Denver]" 7.0 Node 1112: "new_capacity[Buffalo,Erie]" 8.0 Node 111211: "new_capacity[Austin,Chicago]" 10.0 Node 111211: "new_supply[Austin]" 30.0 Node 111212: "new_capacity[Austin,Chicago]" 10.0 Node 111212: "new_supply[Austin]" 30.0 Node 11122: "new_capacity[Austin,Chicago]" 10.0 Node 11122: "new_supply[Austin]" 30.0 Node 112: "new_capacity[Austin,Denver]" 7.0 Node 112: "new_capacity[Buffalo,Erie]" 8.0 Node 112111: "new_capacity[Austin,Chicago]" 10.0 Node 112111: "new_supply[Austin]" 30.0 Node 112112: "new_capacity[Austin,Chicago]" 10.0 Node 112112: "new_supply[Austin]" 30.0 Node 11212: "new_capacity[Austin,Chicago]" 10.0 Node 11212: "new_supply[Austin]" 30.0 Node 1122: "new_capacity[Austin,Chicago]" 10.0 Node 1122: "new_supply[Austin]" 30.0 Node 12: "new_capacity[Austin,Denver]" 7.0 Node 12: "new_capacity[Buffalo,Erie]" 8.0 Node 121111: "new_capacity[Austin,Chicago]" 10.0 Node 121111: "new_supply[Austin]" 30.0 Node 121112: "new_capacity[Austin,Chicago]" 10.0 Node 121112: "new_supply[Austin]" 30.0 Node 12112: "new_capacity[Austin,Chicago]" 10.0 Node 12112: "new_supply[Austin]" 30.0 Node 1212: "new_capacity[Austin,Chicago]" 10.0 Node 1212: "new_supply[Austin]" 30.0 Node 122: "new_capacity[Austin,Chicago]" 10.0 Node 122: "new_supply[Austin]" 30.0 Node 122222: "new_capacity[Buffalo,Denver]" 9.0 Node 122222: "new_capacity[Austin,Chicago]" 10.0 Re-solved Objective: 1924.3540625394 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 63 nodes [ Info: Building JuMP Model for node 111111111111111111111111112111121111211111221112111211112111112121112211122111122211211211121111211111211211212112121112122112211221112211112212112221122211122221212112111211112111112111212112121121121122121212121121211121212121221212211212221221221122111221111221121221212212112212212221222112221112221212222122221122222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 4.455e+03 (189) 1120: obj = 2.156013108e+03 inf = 7.327e-15 (0) 6 * 1447: obj = 1.922649230e+03 inf = 3.331e-16 (0) 4 + 1447: mip = not found yet >= -inf (1; 0) + 1600: >>>>> 1.924985887e+03 >= 1.923739525e+03 < 0.1% (53; 0) + 2660: mip = 1.924985887e+03 >= 1.924131759e+03 < 0.1% (447; 21) + 3398: >>>>> 1.924937089e+03 >= 1.924216036e+03 < 0.1% (819; 37) + 3418: >>>>> 1.924865328e+03 >= 1.924221407e+03 < 0.1% (799; 93) + 3511: >>>>> 1.924744770e+03 >= 1.924256632e+03 < 0.1% (697; 327) + 3998: >>>>> 1.924624212e+03 >= 1.924289847e+03 < 0.1% (628; 823) + 4519: >>>>> 1.924586814e+03 >= 1.924317157e+03 < 0.1% (597; 1223) + 4660: >>>>> 1.924549416e+03 >= 1.924324538e+03 < 0.1% (523; 1485) + 4715: >>>>> 1.924503653e+03 >= 1.924325030e+03 < 0.1% (445; 1667) + 4880: >>>>> 1.924466256e+03 >= 1.924331919e+03 < 0.1% (385; 1938) + 5002: >>>>> 1.924428858e+03 >= 1.924339300e+03 < 0.1% (352; 2102) + 5201: >>>>> 1.924391460e+03 >= 1.924346681e+03 < 0.1% (324; 2251) + 5364: >>>>> 1.924354063e+03 >= 1.924354063e+03 < 0.1% (238; 2514) + 5364: mip = 1.924354063e+03 >= tree is empty 0.0% (0; 3239) [ Info: Solved. Deterministic Equivalent Objective: 1924.3540625393998 [ Info: Establishing JuDGE model for tree: Leaf node 1 [ Info: Building JuMP Model for node 1s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building master problem...  Cutting stock: Error During Test at /home/pkgeval/.julia/packages/JuDGE/yzb6J/test/runtests.jl:166 Test threw exception Expression: cutting_stock(test = true) == 70.0 UndefVarError: `made` not defined in `Main` The binding may be too new: running in world age 43336, while current world is 43337. Stacktrace: [1] macro expansion @ ~/.julia/packages/MutableArithmetics/xwKH0/src/rewrite.jl:384 [inlined] [2] macro expansion @ ~/.julia/packages/JuMP/Y8Mtc/src/macros.jl:264 [inlined] [3] macro expansion @ ~/.julia/packages/JuMP/Y8Mtc/src/macros/@constraint.jl:202 [inlined] [4] (::var"#340#341"{Leaf, Model})(i::Int64) @ Main ~/.julia/packages/JuMP/Y8Mtc/src/Containers/macro.jl:604 [5] (::JuMP.Containers.var"#container##0#container##1"{var"#340#341"{Leaf, Model}})(I::Tuple{Int64}) @ JuMP.Containers ~/.julia/packages/JuMP/Y8Mtc/src/Containers/container.jl:85 [inlined] [6] iterate(::Base.Generator{JuMP.Containers.VectorizedProductIterator{Tuple{Base.OneTo{Int64}}}, JuMP.Containers.var"#container##0#container##1"{var"#340#341"{Leaf, Model}}}) @ Base generator.jl:49 [inlined] [7] collect(itr::Base.Generator{JuMP.Containers.VectorizedProductIterator{Tuple{Base.OneTo{Int64}}}, JuMP.Containers.var"#container##0#container##1"{var"#340#341"{Leaf, Model}}}) @ Base array.jl:839 [8] map(f::JuMP.Containers.var"#container##0#container##1"{var"#340#341"{Leaf, Model}}, A::JuMP.Containers.VectorizedProductIterator{Tuple{Base.OneTo{Int64}}}) @ Base abstractarray.jl:3521 [inlined] [9] container(f::var"#340#341"{Leaf, Model}, indices::JuMP.Containers.VectorizedProductIterator{Tuple{Base.OneTo{Int64}}}, ::Core.TypeEgal{Array}) @ JuMP.Containers ~/.julia/packages/JuMP/Y8Mtc/src/Containers/container.jl:85 [inlined] [10] container(f::var"#340#341"{Leaf, Model}, indices::JuMP.Containers.VectorizedProductIterator{Tuple{Base.OneTo{Int64}}}, D::Core.TypeEgal{Array}, names::Vector{Any}) @ JuMP.Containers ~/.julia/packages/JuMP/Y8Mtc/src/Containers/container.jl:71 [inlined] [11] container(f::var"#340#341"{Leaf, Model}, indices::JuMP.Containers.VectorizedProductIterator{Tuple{Base.OneTo{Int64}}}, ::Core.TypeEgal{JuMP.Containers.AutoContainerType}, names::Vector{Any}) @ JuMP.Containers ~/.julia/packages/JuMP/Y8Mtc/src/Containers/container.jl:75 [inlined] [12] macro expansion @ ~/.julia/packages/JuMP/Y8Mtc/src/macros.jl:414 [inlined] [13] (::var"#meet_demand#339"{Int64})(model::Model, tree::Leaf) @ Main ~/.julia/packages/JuDGE/yzb6J/examples/cutting_stock.jl:104 [14] build_master(sub_problems::Dict{AbstractTree, Model}, tree::Leaf, probabilities::Dict{AbstractTree, Float64}, solver::MathOptInterface.OptimizerWithAttributes, discount_factor::Float64, risk::Risk, sideconstraints::var"#meet_demand#339"{Int64}) @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/master.jl:463 [15] JuDGEModel(tree::Leaf, probabilities::typeof(ConditionallyUniformProbabilities), sub_problem_builder::var"#sub_problems#313"{var"#sub_problems#294#314"{Int64, Vector{Int64}, Int64}}, solver::MathOptInterface.OptimizerWithAttributes; discount_factor::Float64, risk::Risk, sideconstraints::Function, check::Bool, perfect_foresight::Bool) @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/decomposition.jl:179 [16] cutting_stock(; seed::Int64, L::Int64, sizes::Vector{Int64}, test::Bool) @ Main ~/.julia/packages/JuDGE/yzb6J/examples/cutting_stock.jl:228 [17] top-level scope @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:10 [18] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2252 [inlined] [19] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:165 [inlined] [20] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2252 [inlined] [21] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:166 [inlined] [22] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:786 [inlined] [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.450000e+02 | 1.450000e+02 -Inf | Inf NaN | 0 | 0.002 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 6.500000e+01 | 6.500000e+01 6.500000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.003 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.450000e+02 | 1.450000e+02 -Inf | Inf NaN | 0 | 0.005 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 4.850000e+01 | 4.850000e+01 4.850000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.009 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.900000e+02 | 1.900000e+02 -Inf | Inf NaN | 0 | 0.353 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.900000e+02 | 1.900000e+02 1.900000e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.357 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.200000e+02 | 1.200000e+02 -Inf | Inf NaN | 0 | 0.002 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 8.700000e+01 | 8.700000e+01 0.000000e+00 | 8.700000e+01 Inf | 0 | 0.002 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 8.700000e+01 | 8.700000e+01 8.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.003 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.200000e+02 | 1.200000e+02 -Inf | Inf NaN | 0 | 0.004 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 7.912500e+01 | 7.912500e+01 1.875000e+01 | 6.037500e+01 3.220000e+00 | 0 | 0.008 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.287500e+01 | 5.287500e+01 4.612500e+01 | 6.750000e+00 1.463415e-01 | 0 | 0.011 3 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.287500e+01 | 5.287500e+01 5.287500e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.013 4 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 8.700000e+01 | 8.700000e+01 -Inf | Inf NaN | 0 | 0.005 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 8.700000e+01 | 8.700000e+01 8.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.009 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.050000e+02 | 1.050000e+02 -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 7.700000e+01 | 7.700000e+01 7.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.002 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.050000e+02 | 1.050000e+02 -Inf | Inf NaN | 0 | 0.004 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 7.700000e+01 | 7.700000e+01 3.750000e+00 | 7.325000e+01 1.953333e+01 | 0 | 0.008 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 6.250000e+01 | 6.250000e+01 4.375000e+01 | 1.875000e+01 4.285714e-01 | 0 | 0.010 3 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.312500e+01 | 5.312500e+01 4.375000e+01 | 9.375000e+00 2.142857e-01 | 0 | 0.011 4 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.312500e+01 | 5.312500e+01 5.312500e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.016 5 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 7.700000e+01 | 7.700000e+01 -Inf | Inf NaN | 0 | 0.005 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 7.700000e+01 | 7.700000e+01 7.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.006 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.002 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.000000e+01 | 4.000000e+01 -Inf | Inf NaN | 0 | 0.003 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.000000e+01 | 4.000000e+01 4.000000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.004 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.004 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 6.200000e+01 | 6.200000e+01 -Inf | Inf NaN | 0 | 0.006 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 6.200000e+01 | 6.200000e+01 6.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.011 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.004 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.650000e+02 | 1.650000e+02 -Inf | Inf NaN | 0 | 0.006 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.650000e+02 | 1.650000e+02 1.650000e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.008 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 5.200000e+01 | 5.200000e+01 -Inf | Inf NaN | 0 | 0.001 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 5.200000e+01 | 5.200000e+01 5.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.002 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.005 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.200000e+01 | 5.200000e+01 -Inf | Inf NaN | 0 | 0.007 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.200000e+01 | 5.200000e+01 5.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.010 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.200000e+01 | 5.200000e+01 -Inf | Inf NaN | 0 | 0.007 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.200000e+01 | 5.200000e+01 5.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.009 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.200000e+01 | 4.200000e+01 -Inf | Inf NaN | 0 | 0.002 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.200000e+01 | 4.200000e+01 4.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.002 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.004 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 4.200000e+01 | 4.200000e+01 -Inf | Inf NaN | 0 | 0.006 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 4.200000e+01 | 4.200000e+01 4.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.009 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.005 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 4.200000e+01 | 4.200000e+01 -Inf | Inf NaN | 0 | 0.007 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 4.200000e+01 | 4.200000e+01 4.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.009 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.450000e+02 | 1.450000e+02 -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 9.700000e+01 | 9.700000e+01 9.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.002 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.450000e+02 | 1.450000e+02 -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 4.850000e+01 | 4.850000e+01 4.850000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.006 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 9.700000e+01 | 9.700000e+01 -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 9.700000e+01 | 9.700000e+01 9.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.004 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.257500e+02 | 1.257500e+02 -Inf | Inf NaN | 0 | 0.002 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.257500e+02 | 1.257500e+02 -Inf | Inf NaN | 0 | 0.002 3 Solving master problem as MIP 1.257500e+02 | 1.257500e+02 -Inf | Inf NaN | 0 | 0.002 4* Stalled: exiting. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.007 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.010 3 Solving master problem as MIP 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.010 4* Stalled: exiting. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 6.287500e+01 | 6.287500e+01 -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 6.287500e+01 | 6.287500e+01 -Inf | Inf NaN | 0 | 0.007 2 Solving master problem as MIP 6.287500e+01 | 6.287500e+01 -Inf | Inf NaN | 0 | 0.008 3* Stalled: exiting. ┌ Warning: `_unsetindex!(A, i)` is deprecated, use `Base.unsetindex!(A, i)` instead. │ caller = _delete!(h::OrderedCollections.OrderedDict{MathOptInterface.ConstraintIndex{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.EqualTo{Float64}}, Tuple{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.EqualTo{Float64}}}, index::Int64) at ordered_dict.jl:441 [inlined] └ @ OrderedCollections ~/.julia/packages/OrderedCollections/MglBA/src/ordered_dict.jl:441 ┌ Warning: `_unsetindex!(A, i)` is deprecated, use `Base.unsetindex!(A, i)` instead. │ caller = _delete!(h::OrderedCollections.OrderedDict{MathOptInterface.ConstraintIndex{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.EqualTo{Float64}}, Tuple{MathOptInterface.ScalarAffineFunction{Float64}, MathOptInterface.EqualTo{Float64}}}, index::Int64) at ordered_dict.jl:442 [inlined] └ @ OrderedCollections ~/.julia/packages/OrderedCollections/MglBA/src/ordered_dict.jl:442 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 6.250000e-01 | 6.250000e-01 -Inf | Inf NaN | 0 | 0.001 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 6.250000e-01 | 6.250000e-01 -Inf | Inf NaN | 0 | 0.002 3 Solving master problem as MIP 6.250000e-01 | 6.250000e-01 -Inf | Inf NaN | 0 | 0.002 4* Stalled: exiting. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.004 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.006 3 Solving master problem as MIP 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.006 4* Stalled: exiting. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.253125e+02 | 1.253125e+02 -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.253125e+02 | 1.253125e+02 -Inf | Inf NaN | 0 | 0.004 2 Solving master problem as MIP 1.253125e+02 | 1.253125e+02 -Inf | Inf NaN | 0 | 0.005 3* Stalled: exiting. WARNING: Method definition test_set_policy(Array{Int64, 1}, Array{Int64, 1}, Int64, Int64) in module Main at /home/pkgeval/.julia/packages/JuDGE/yzb6J/examples/set_policy_test.jl:9 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition test_set_policy_state(Array{Int64, 1}, Array{Int64, 1}) in module Main at /home/pkgeval/.julia/packages/JuDGE/yzb6J/examples/set_policy_test.jl:71 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition test_set_policy2(Array{Int64, 1}, Array{Int64, 1}, Int64, Int64) in module Main at /home/pkgeval/.julia/packages/JuDGE/yzb6J/examples/set_policy_test.jl:127 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition test_set_policy_state2(Array{Int64, 1}, Array{Int64, 1}) in module Main at /home/pkgeval/.julia/packages/JuDGE/yzb6J/examples/set_policy_test.jl:188 overwritten on the same line (check for duplicate calls to `include`). [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 10: obj = 6.500000000e+01 inf = 0.000e+00 (0) * 16: obj = 6.500000000e+01 inf = 0.000e+00 (0) + 16: mip = not found yet >= -inf (1; 0) + 16: >>>>> 6.500000000e+01 >= 6.500000000e+01 0.0% (1; 0) + 16: mip = 6.500000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 48: obj = 4.850000000e+01 inf = 0.000e+00 (0) * 65: obj = 4.850000000e+01 inf = 0.000e+00 (0) + 65: mip = not found yet >= -inf (1; 0) + 65: >>>>> 4.850000000e+01 >= 4.850000000e+01 0.0% (1; 0) + 65: mip = 4.850000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 5.370e+02 (25) 36: obj = 1.900000000e+02 inf = 0.000e+00 (0) * 44: obj = 1.900000000e+02 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 1.900000000e+02 >= 1.900000000e+02 0.0% (1; 0) + 44: mip = 1.900000000e+02 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 11: obj = 8.700000000e+01 inf = 0.000e+00 (0) * 19: obj = 8.700000000e+01 inf = 0.000e+00 (0) + 19: mip = not found yet >= -inf (1; 0) + 19: >>>>> 8.700000000e+01 >= 8.700000000e+01 0.0% (1; 0) + 19: mip = 8.700000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 59: obj = 5.550000000e+01 inf = 0.000e+00 (0) * 77: obj = 5.287500000e+01 inf = 0.000e+00 (0) + 77: mip = not found yet >= -inf (1; 0) + 77: >>>>> 5.287500000e+01 >= 5.287500000e+01 0.0% (1; 0) + 77: mip = 5.287500000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.170e+02 (29) 36: obj = 8.700000000e+01 inf = 0.000e+00 (0) * 44: obj = 8.700000000e+01 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 8.700000000e+01 >= 8.700000000e+01 0.0% (1; 0) + 44: mip = 8.700000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 12: obj = 7.700000000e+01 inf = 0.000e+00 (0) * 19: obj = 7.700000000e+01 inf = 0.000e+00 (0) + 19: mip = not found yet >= -inf (1; 0) + 19: >>>>> 7.700000000e+01 >= 7.700000000e+01 0.0% (1; 0) + 19: mip = 7.700000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 61: obj = 5.837500000e+01 inf = 4.441e-16 (0) * 78: obj = 5.312500000e+01 inf = 0.000e+00 (0) + 78: mip = not found yet >= -inf (1; 0) + 78: >>>>> 5.312500000e+01 >= 5.312500000e+01 0.0% (1; 0) + 78: mip = 5.312500000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.370e+02 (29) 36: obj = 7.700000000e+01 inf = 0.000e+00 (0) * 44: obj = 7.700000000e+01 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 7.700000000e+01 >= 7.700000000e+01 0.0% (1; 0) + 44: mip = 7.700000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 10: obj = 4.000000000e+01 inf = 0.000e+00 (0) * 16: obj = 4.000000000e+01 inf = 0.000e+00 (0) + 16: mip = not found yet >= -inf (1; 0) + 16: >>>>> 4.000000000e+01 >= 4.000000000e+01 0.0% (1; 0) + 16: mip = 4.000000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 51: obj = 6.200000000e+01 inf = 0.000e+00 (0) * 66: obj = 6.200000000e+01 inf = 0.000e+00 (0) + 66: mip = not found yet >= -inf (1; 0) + 66: >>>>> 6.200000000e+01 >= 6.200000000e+01 0.0% (1; 0) + 66: mip = 6.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 3.370e+02 (25) 36: obj = 1.650000000e+02 inf = 0.000e+00 (0) * 44: obj = 1.650000000e+02 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 1.650000000e+02 >= 1.650000000e+02 0.0% (1; 0) + 44: mip = 1.650000000e+02 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 10: obj = 5.200000000e+01 inf = 0.000e+00 (0) * 18: obj = 5.200000000e+01 inf = 0.000e+00 (0) + 18: mip = not found yet >= -inf (1; 0) + 18: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 18: mip = 5.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 50: obj = 5.200000000e+01 inf = 0.000e+00 (0) * 67: obj = 5.200000000e+01 inf = 0.000e+00 (0) + 67: mip = not found yet >= -inf (1; 0) + 67: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 67: mip = 5.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 4.370e+02 (29) 36: obj = 5.200000000e+01 inf = 0.000e+00 (0) * 44: obj = 5.200000000e+01 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 44: mip = 5.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 12: obj = 4.200000000e+01 inf = 0.000e+00 (0) * 18: obj = 4.200000000e+01 inf = 0.000e+00 (0) + 18: mip = not found yet >= -inf (1; 0) + 18: >>>>> 4.200000000e+01 >= 4.200000000e+01 0.0% (1; 0) + 18: mip = 4.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 53: obj = 4.200000000e+01 inf = 0.000e+00 (0) * 66: obj = 4.200000000e+01 inf = 0.000e+00 (0) + 66: mip = not found yet >= -inf (1; 0) + 66: >>>>> 4.200000000e+01 >= 4.200000000e+01 0.0% (1; 0) + 66: mip = 4.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 3.570e+02 (29) 36: obj = 4.200000000e+01 inf = 0.000e+00 (0) * 44: obj = 4.200000000e+01 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 4.200000000e+01 >= 4.200000000e+01 0.0% (1; 0) + 44: mip = 4.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 3.000e+00 (3) 13: obj = 9.700000000e+01 inf = 0.000e+00 (0) * 20: obj = 9.700000000e+01 inf = 0.000e+00 (0) + 20: mip = not found yet >= -inf (1; 0) + 20: >>>>> 9.700000000e+01 >= 9.700000000e+01 0.0% (1; 0) + 20: mip = 9.700000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 48: obj = 4.850000000e+01 inf = 0.000e+00 (0) * 65: obj = 4.850000000e+01 inf = 0.000e+00 (0) + 65: mip = not found yet >= -inf (1; 0) + 65: >>>>> 4.850000000e+01 >= 4.850000000e+01 0.0% (1; 0) + 65: mip = 4.850000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.970e+02 (29) 36: obj = 9.700000000e+01 inf = 0.000e+00 (0) * 44: obj = 9.700000000e+01 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 9.700000000e+01 >= 9.700000000e+01 0.0% (1; 0) + 44: mip = 9.700000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 15: obj = 1.257500000e+02 inf = 0.000e+00 (0) * 16: obj = 1.257500000e+02 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.200e+01 (22) 40: obj = 1.604687500e+01 inf = 0.000e+00 (0) * 48: obj = 1.604687500e+01 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.600e+01 (16) 40: obj = 6.287500000e+01 inf = 0.000e+00 (0) * 47: obj = 6.287500000e+01 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (6) 12: obj = 6.250000000e-01 inf = 0.000e+00 (0) * 14: obj = 6.250000000e-01 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.200e+01 (22) 40: obj = 1.604687500e+01 inf = 0.000e+00 (0) * 46: obj = 1.604687500e+01 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.200e+01 (12) 32: obj = 1.253125000e+02 inf = 0.000e+00 (0) * 38: obj = 1.253125000e+02 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 2.145260e+02 | 2.145260e+02 -Inf | Inf NaN | 0 | 1.537 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.527000e+02 | 1.527000e+02 6.000000e+00 | 1.467000e+02 2.445000e+01 | 0 | 1.540 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.428000e+02 | 1.428000e+02 6.000000e+00 | 1.368000e+02 2.280000e+01 | 0 | 1.542 3 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 6.204300e+01 | 6.204300e+01 1.922200e+01 | 4.282100e+01 2.227708e+00 | 0 | 1.545 4 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.608600e+01 | 4.608600e+01 1.922200e+01 | 2.686400e+01 1.397565e+00 | 0 | 1.547 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.608600e+01 | 4.608600e+01 2.176150e+01 | 2.432450e+01 1.117777e+00 | 0 | 1.549 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.608600e+01 | 4.608600e+01 2.372225e+01 | 2.236375e+01 9.427331e-01 | 0 | 1.552 7 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.608600e+01 | 4.608600e+01 2.372225e+01 | 2.236375e+01 9.427331e-01 | 0 | 1.554 8 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.608600e+01 | 4.608600e+01 2.447351e+01 | 2.161249e+01 8.830974e-01 | 0 | 1.556 9 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.261880e+01 | 1.014620e+01 3.110537e-01 | 0 | 1.559 10 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.261880e+01 | 1.014620e+01 3.110537e-01 | 0 | 1.561 11 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.612153e+01 | 6.643466e+00 1.839198e-01 | 0 | 1.565 12 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.612153e+01 | 6.643466e+00 1.839198e-01 | 0 | 1.569 13 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.612153e+01 | 6.643466e+00 1.839198e-01 | 0 | 1.573 14 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.701100e+01 | 5.754000e+00 1.554673e-01 | 0 | 1.577 15 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.921745e+01 | 3.547545e+00 9.045833e-02 | 0 | 1.581 16 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.921745e+01 | 3.547545e+00 9.045833e-02 | 0 | 1.584 17 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.921745e+01 | 3.547545e+00 9.045833e-02 | 0 | 1.587 18 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.921745e+01 | 3.547545e+00 9.045833e-02 | 0 | 1.591 19 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.921745e+01 | 3.547545e+00 9.045833e-02 | 0 | 1.595 20 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.964961e+01 | 3.115388e+00 7.857298e-02 | 0 | 1.597 21 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.968766e+01 | 3.077344e+00 7.753907e-02 | 0 | 1.599 22 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.273800e+01 | 4.276500e+01 4.051949e+01 | 2.218508e+00 5.475161e-02 | 6 | 1.601 23 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.237902e+01 | 4.276500e+01 4.051949e+01 | 1.859530e+00 4.589224e-02 | 4 | 1.603 24 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.235021e+01 | 4.276500e+01 4.051949e+01 | 1.830713e+00 4.518105e-02 | 4 | 1.605 25 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.217850e+01 | 4.276500e+01 4.051949e+01 | 1.659008e+00 4.094344e-02 | 4 | 1.607 26 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.217494e+01 | 4.276500e+01 4.051949e+01 | 1.655445e+00 4.085552e-02 | 5 | 1.609 27 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.217494e+01 | 4.276500e+01 4.051949e+01 | 1.655445e+00 4.085552e-02 | 5 | 1.610 28 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.211893e+01 | 4.276500e+01 4.051949e+01 | 1.599436e+00 3.947325e-02 | 4 | 1.612 29 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.149000e+01 | 4.276500e+01 4.051949e+01 | 9.705075e-01 2.395162e-02 | 2 | 1.614 30 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.149000e+01 | 4.276500e+01 4.051949e+01 | 9.705075e-01 2.395162e-02 | 2 | 1.616 31 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.149000e+01 | 4.276500e+01 4.051949e+01 | 9.705075e-01 2.395162e-02 | 2 | 1.618 32 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.136100e+01 | 4.136100e+01 4.051949e+01 | 8.415075e-01 2.076797e-02 | 0 | 1.620 33 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.136100e+01 | 4.136100e+01 4.051949e+01 | 8.415075e-01 2.076797e-02 | 0 | 1.622 34 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.083900e+01 | 4.083900e+01 4.068420e+01 | 1.548000e-01 3.804917e-03 | 0 | 1.624 35 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.083900e+01 | 4.083900e+01 4.068420e+01 | 1.548000e-01 3.804917e-03 | 0 | 1.626 36 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.083900e+01 | 4.083900e+01 4.068420e+01 | 1.548000e-01 3.804917e-03 | 0 | 1.628 37 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.630 38 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.632 39 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.634 40 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.636 41 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.638 42 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.640 43 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.642 44 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.644 45 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.646 46 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.648 47 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.650 48 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.652 49 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.654 50 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.655 51 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.068420e+01 | 1.278000e-01 3.141269e-03 | 0 | 1.657 52 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.659 53 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.661 54 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.663 55 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.664 56 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.666 57 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.668 58 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.670 59 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.672 60 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.674 61 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.676 62 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.678 63 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.680 64 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.081200e+01 | 0.000000e+00 0.000000e+00 | 0 | 1.681 65 Convergence criteria met. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.120e+02 (16) 99: obj = 4.081200000e+01 inf = 0.000e+00 (0) * 135: obj = 4.081200000e+01 inf = 0.000e+00 (0) + 135: mip = not found yet >= -inf (1; 0) + 135: >>>>> 4.081200000e+01 >= 4.081200000e+01 0.0% (1; 0) + 135: mip = 4.081200000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.302333e+02 | 2.302333e+02 -Inf | Inf NaN | 0 | 0.004 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.197758e+02 | 2.197758e+02 -Inf | Inf NaN | 0 | 0.005 3 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.187842e+02 | 2.187842e+02 -Inf | Inf NaN | 0 | 0.006 4 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.184225e+02 | 2.184225e+02 -Inf | Inf NaN | 0 | 0.007 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.009 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.009 7 Solving master problem as MIP 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.010 8* Stalled: exiting. JuDGE Expansions Node 1: "large_upgrade[a]" 0.3333333333333335 Node 1: "large_upgrade[b]" 0.4999999999999999 Node 1: "large_upgrade[c]" 0.16666666666666666 Node 11: "small_upgrade[c]" 1.0 Node 12: "small_upgrade[b]" 0.5000000000000002 Node 13: "small_upgrade[a]" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.002 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.302333e+02 | 2.302333e+02 -Inf | Inf NaN | 0 | 0.004 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.197758e+02 | 2.197758e+02 -Inf | Inf NaN | 0 | 0.006 3 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.187842e+02 | 2.187842e+02 -Inf | Inf NaN | 0 | 0.007 4 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.184225e+02 | 2.184225e+02 -Inf | Inf NaN | 0 | 0.009 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.011 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.011 7 Solving master problem as MIP 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.012 8* Stalled: exiting. JuDGE Expansions Node 1: "large_upgrade[a]" 0.3333333333333335 Node 1: "large_upgrade[b]" 0.4999999999999999 Node 1: "large_upgrade[c]" 0.16666666666666666 Node 11: "small_upgrade[c]" 1.0 Node 12: "small_upgrade[b]" 0.5000000000000002 Node 13: "small_upgrade[a]" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 46: obj = 2.192333333e+02 inf = 7.105e-15 (0) * 52: obj = 2.183350000e+02 inf = 1.281e-16 (0) [ Info: Solved. Deterministic Equivalent Expansions Node 1: "large_upgrade[a]" 0.3333333333333332 Node 1: "large_upgrade[b]" 0.49999999999999967 Node 1: "large_upgrade[c]" 0.16666666666666674 Node 11: "small_upgrade[c]" 1.0 Node 12: "small_upgrade[b]" 0.5000000000000011 Node 13: "small_upgrade[a]" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 30: obj = 2.275333333e+02 inf = 0.000e+00 (0) * 50: obj = 2.183350000e+02 inf = 0.000e+00 (0) [ Info: Solved. Deterministic Equivalent Expansions Node 1: "large_upgrade[a]" 0.3333333333333333 Node 1: "large_upgrade[b]" 0.5 Node 1: "large_upgrade[c]" 0.16666666666666666 Node 11: "small_upgrade[c]" 1.0 Node 12: "small_upgrade[b]" 0.5 Node 13: "small_upgrade[a]" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve_return_relaxation --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.580000e+02 | 2.580000e+02 -Inf | Inf NaN | 0 | 0.008 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.346667e+02 | 2.580000e+02 1.993333e+02 | 3.533333e+01 1.772575e-01 | 9 | 0.010 3 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.286667e+02 | 2.286667e+02 1.993333e+02 | 2.933333e+01 1.471572e-01 | 0 | 0.012 4 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.246667e+02 | 2.286667e+02 2.150000e+02 | 9.666667e+00 4.496124e-02 | 6 | 0.015 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.246667e+02 | 2.286667e+02 2.150000e+02 | 9.666667e+00 4.496124e-02 | 6 | 0.018 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.234444e+02 | 2.286667e+02 2.192222e+02 | 4.222222e+00 1.926001e-02 | 11 | 0.020 7 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.234444e+02 | 2.286667e+02 2.208889e+02 | 2.555556e+00 1.156942e-02 | 11 | 0.023 8 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.228333e+02 | 2.286667e+02 2.222222e+02 | 6.111111e-01 2.750000e-03 | 6 | 0.026 9 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.226667e+02 | 2.226667e+02 2.225000e+02 | 1.666667e-01 7.490637e-04 | 0 | 0.030 10 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.226667e+02 | 2.226667e+02 2.225000e+02 | 1.666667e-01 7.490637e-04 | 0 | 0.034 11 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.226667e+02 | 2.226667e+02 2.226667e+02 | -2.842171e-14 -1.276424e-16 | 0 | 0.037 12 Convergence criteria met. Performing final MIP solve Objective value of best integer-feasible solution: 222.66666666666666 Objective value of lower bound: 222.66666666666666 Solve time: 0.062s Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve_return_relaxation --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.724000e+02 | 2.724000e+02 -Inf | Inf NaN | 0 | 0.008 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.436333e+02 | 2.436333e+02 2.137333e+02 | 2.990000e+01 1.398939e-01 | 0 | 0.011 3 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.378741e+02 | 2.436333e+02 2.137333e+02 | 2.414078e+01 1.129481e-01 | 15 | 0.013 4 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.316216e+02 | 2.436333e+02 2.137333e+02 | 1.788829e+01 8.369442e-02 | 15 | 0.016 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.286765e+02 | 2.436333e+02 2.159653e+02 | 1.271122e+01 5.885771e-02 | 10 | 0.018 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282679e+02 | 2.436333e+02 2.262359e+02 | 2.031909e+00 8.981373e-03 | 9 | 0.021 7 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282679e+02 | 2.436333e+02 2.278258e+02 | 4.420635e-01 1.940358e-03 | 9 | 0.024 8 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282114e+02 | 2.436333e+02 2.281135e+02 | 9.789005e-02 4.291287e-04 | 9 | 0.026 9 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282114e+02 | 2.436333e+02 2.282114e+02 | 2.842171e-14 1.245412e-16 | 9 | 0.029 10 Solving master problem as MIP 2.282114e+02 | 2.326000e+02 2.282114e+02 | 4.388618e+00 1.923050e-02 | 0 | 0.030 11* Convergence criteria met. Attempting to branch. Adding 2 new nodes to B&P tree. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 2 of 3 | 2.326000e+02 2.282114e+02 | 4.388618e+00 1.923050e-02 | 0 | 0.539 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.300526e+02 | Inf 2.282114e+02 | 1.841249e+00 8.068175e-03 | 5 | 0.003 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.300526e+02 | Inf 2.300526e+02 | 0.000000e+00 0.000000e+00 | 5 | 0.005 2 Solving master problem as MIP 2.300526e+02 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.006 3* Convergence criteria met. Attempting to branch. Adding 2 new nodes to B&P tree. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 3 of 5 | 2.326000e+02 2.282114e+02 | 4.388618e+00 1.923050e-02 | 0 | 0.548 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.350000e+02 | 2.350000e+02 2.304333e+02 | 4.566667e+00 1.981773e-02 | 0 | 0.008 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.350000e+02 | 2.350000e+02 2.349833e+02 | 1.666667e-02 7.092702e-05 | 0 | 0.012 2 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 4 of 5 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.561 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.326000e+02 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.007 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.326000e+02 | 2.326000e+02 2.323333e+02 | 2.666667e-01 1.147776e-03 | 0 | 0.010 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.326000e+02 | 2.326000e+02 2.326000e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.012 3 Convergence criteria met. Attempting to branch. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 5 of 5 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.574 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.308395e+02 | Inf 2.308395e+02 | 3.126388e-13 1.354356e-15 | 4 | 0.008 1 Solving master problem as MIP 2.308395e+02 | 2.362333e+02 2.308395e+02 | 5.393860e+00 2.336628e-02 | 0 | 0.010 2* Convergence criteria met. Attempting to branch. Adding 2 new nodes to B&P tree. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 6 of 7 | 2.326000e+02 2.308395e+02 | 1.760526e+00 7.626626e-03 | 0 | 0.586 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.433000e+02 | 2.433000e+02 2.429000e+02 | 4.000000e-01 1.646768e-03 | 0 | 0.008 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 7 of 7 | 2.326000e+02 2.308395e+02 | 1.760526e+00 7.626626e-03 | 0 | 0.596 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.331167e+02 | Inf 2.331167e+02 | 3.979039e-13 1.706888e-15 | 5 | 0.010 1 Dominated by incumbent. Performing final MIP solve Objective value of best integer-feasible solution: 232.59999999999997 Objective value of lower bound: 232.59999999999997 Solve time: 0.615s ┌ Warning: Dual variables not present; computing approximate probabilities. └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/utilities.jl:406 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 30: obj = 2.250000000e+02 inf = 0.000e+00 (0) * 50: obj = 2.156666667e+02 inf = 0.000e+00 (0) + 50: mip = not found yet >= -inf (1; 0) + 58: >>>>> 2.226666667e+02 >= 2.198333333e+02 1.3% (5; 0) + 68: mip = 2.226666667e+02 >= tree is empty 0.0% (0; 9) [ Info: Solved. [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 46: obj = 2.263333333e+02 inf = 7.105e-15 (0) * 53: obj = 2.216570175e+02 inf = 0.000e+00 (0) + 53: mip = not found yet >= -inf (1; 0) + 70: >>>>> 2.433000000e+02 >= 2.274903509e+02 6.5% (7; 0) + 113: >>>>> 2.326000000e+02 >= 2.314733333e+02 0.5% (11; 7) + 119: mip = 2.326000000e+02 >= tree is empty 0.0% (0; 31) [ Info: Solved. ┌ Warning: Dual variables not present; computing approximate probabilities. └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/utilities.jl:406 [ Info: Setting up wait-and-see problems [ Info: Establishing perfect foresight models for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem for scenario given by node 111111121113112111221123113111321133121112121213122112221223123112321233131113121313132113221323133113321333s...Complete [ Info: Solving wait-and-see problems [ Info: Setting up here-and-now problem [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving here-and-now problem Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | -5.888921e+00 -5.906797e+00 | 1.787603e-02 -3.026349e-03 | 0 | 0.195 3 of 5 | -5.888921e+00 -5.906797e+00 | 1.787603e-02 -3.026349e-03 | 0 | 0.296 6 of 7 | -5.888921e+00 -5.901540e+00 | 1.261949e-02 -2.138339e-03 | 0 | 0.370 7 of 9 | -5.888921e+00 -5.901540e+00 | 1.261949e-02 -2.138339e-03 | 0 | 0.431 8 of 11 | -5.888921e+00 -5.901388e+00 | 1.246651e-02 -2.112471e-03 | 0 | 0.513 9 of 11 | -5.888921e+00 -5.901388e+00 | 1.246651e-02 -2.112471e-03 | 0 | 0.567 10 of 13 | -5.888921e+00 -5.900661e+00 | 1.173974e-02 -1.989564e-03 | 0 | 0.650 11 of 15 | -5.888921e+00 -5.900661e+00 | 1.173974e-02 -1.989564e-03 | 0 | 0.779 14 of 15 | -5.888921e+00 -5.899032e+00 | 1.011113e-02 -1.714032e-03 | 0 | 0.861 15 of 17 | -5.888921e+00 -5.899032e+00 | 1.011113e-02 -1.714032e-03 | 0 | 0.956 16 of 19 | -5.889990e+00 -5.898974e+00 | 8.983382e-03 -1.522872e-03 | 0 | 1.033 17 of 21 | -5.889990e+00 -5.898974e+00 | 8.983382e-03 -1.522872e-03 | 0 | 1.100 Model 4 dominated. UB: -5.897178122861586, LB:-5.898818721225576 Model 5 dominated. UB: -5.897178122861586, LB:-5.898818721225576 12 of 21 | -5.897178e+00 -5.898819e+00 | 1.640598e-03 -2.781232e-04 | 0 | 1.166 13 of 21 | -5.897178e+00 -5.898819e+00 | 1.640598e-03 -2.781232e-04 | 0 | 1.234 Objective value of best integer-feasible solution: -5.897178122861586 Objective value of lower bound: -5.897178122861586 Solve time: 1.325s [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 11X1X11X11s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 Objective value of best integer-feasible solution: -5.263768780367521 Objective value of lower bound: -5.263768780367521 Solve time: 0.02s [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 Objective value of best integer-feasible solution: -5.8637048373056615 Objective value of lower bound: -5.8637048373056615 Solve time: 0.324s [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 10 nodes [ Info: Building JuMP Model for node 11111X11X11212X12X11313X13X1s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | -5.589160e+00 -5.644961e+00 | 5.580110e-02 -9.885117e-03 | 0 | 0.045 3 of 5 | -5.589160e+00 -5.644961e+00 | 5.580110e-02 -9.885117e-03 | 0 | 0.064 4 of 5 | -5.589160e+00 -5.631335e+00 | 4.217522e-02 -7.489382e-03 | 0 | 0.075 5 of 7 | -5.589160e+00 -5.631335e+00 | 4.217522e-02 -7.489382e-03 | 0 | 0.094 6 of 7 | -5.589160e+00 -5.612412e+00 | 2.325157e-02 -4.142884e-03 | 0 | 0.108 7 of 7 | -5.589160e+00 -5.612412e+00 | 2.325157e-02 -4.142884e-03 | 0 | 0.157 Objective value of best integer-feasible solution: -5.589160162654409 Objective value of lower bound: -5.589160162654409 Solve time: 0.175s [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 22 nodes [ Info: Building JuMP Model for node 111111111X112112X113113X12121121X122122X123123X13131131X132132X133133Xs...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | -5.751871e+00 -5.787502e+00 | 3.563072e-02 -6.156493e-03 | 0 | 0.134 3 of 5 | -5.751871e+00 -5.787502e+00 | 3.563072e-02 -6.156493e-03 | 0 | 0.230 Objective value of best integer-feasible solution: -5.7777534497586815 Objective value of lower bound: -5.7777534497586815 Solve time: 0.27s [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | -5.883161e+00 -5.895420e+00 | 1.225964e-02 -2.079519e-03 | 0 | 0.233 3 of 5 | -5.883161e+00 -5.895420e+00 | 1.225964e-02 -2.079519e-03 | 0 | 0.401 4 of 7 | -5.883161e+00 -5.892868e+00 | 9.707005e-03 -1.647246e-03 | 0 | 0.534 5 of 9 | -5.883161e+00 -5.892868e+00 | 9.707005e-03 -1.647246e-03 | 0 | 0.689 6 of 9 | -5.890256e+00 -5.892618e+00 | 2.361851e-03 -4.008152e-04 | 0 | 0.761 7 of 11 | -5.890256e+00 -5.892618e+00 | 2.361851e-03 -4.008152e-04 | 0 | 0.883 Model 8 dominated. UB: -5.8902557856203215, LB:-5.891813457965329 Model 9 dominated. UB: -5.8902557856203215, LB:-5.891813457965329 10 of 11 | -5.890256e+00 -5.891813e+00 | 1.557672e-03 -2.643791e-04 | 0 | 0.993 11 of 11 | -5.890256e+00 -5.891813e+00 | 1.557672e-03 -2.643791e-04 | 0 | 1.128 Objective value of best integer-feasible solution: -5.8902557856203215 Objective value of lower bound: -5.8902557856203215 Solve time: 1.209s [ Info: HN obj: -5.897178122861586 [ Info: WS obj: -5.900965111808092 [ Info: EEV obj: -5.8637048373056615 [ Info: RH obj: -5.8902557856203215 [ Info: EVPI: 0.003786988946505865 [ Info: VSS (EV policy): 0.03347328555592455 [ Info: VSS (RH policy): 0.0069223372412645645 [ Info: HN expansions: JuDGE Expansions Node 132: "bag[1]" 1.0 Node 132: "bag[2]" 1.0 Node 1331: "bag[1]" 1.0 [ Info: EEV expansions: JuDGE Expansions [ Info: RH expansions: JuDGE Expansions Node 132: "bag[1]" 1.0 Node 1331: "bag[1]" 1.0 Test Summary: | Pass Error Total Time JuDGE tests | 59 2 61 7m48.2s Tree building | 4 4 9.3s Deterministic | 12 12 3m12.9s Multistage newsvendor | 4 4 20.6s Inventory | 5 5 13.6s Stochastic Knapsack | 2 1 3 38.8s Transportation network expansion | 1 1 58.8s Cutting stock | 1 1 28.0s Lag, duration, set_policy (Decomposition) | 9 9 13.3s Lag, duration, set_policy (Deterministic Equivalent) | 9 9 7.3s Variable Types / Starting solution | 2 2 26.6s Risk aversion and implied probabilities | 10 10 28.4s EVPI / VSS | 1 1 30.5s RNG of the outermost testset: Xoshiro(0x981c58728aa19c26, 0x4f53d54d8643f695, 0x74359cd56061eff2, 0xc3aee13eaec1c925, 0x24ec113cc6a3afa2) ERROR: LoadError: Some tests did not pass: 59 passed, 0 failed, 2 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/JuDGE/yzb6J/test/runtests.jl:9 Testing failed after 472.41s ERROR: LoadError: Package JuDGE errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Operations.jl:3298 [3] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:587 [4] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:172 [5] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [6] test(pkg::String; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:159 [inlined] [7] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:223 in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 PkgEval failed after 773.47s: package tests unexpectedly errored