Package evaluation to test JuDGE on Julia 1.14.0-DEV.2009 (d4d184e100*) started at 2026-04-10T02:16:28.615 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.03s ################################################################################ # 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` [6e4b80f9] + BenchmarkTools v1.7.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.3.3 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 ⌅ [682c06a0] + JSON v0.21.4 [7600667b] + JuDGE v0.5.3 [4076af6c] + JuMP v1.30.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.50.1 [d8a4904e] + MutableArithmetics v1.7.1 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.2 [276daf66] + SpecialFunctions v2.7.2 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.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 5.93s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... 103586.0 ms ✓ MathOptInterface 64378.2 ms ✓ JuMP 12428.8 ms ✓ GLPK 19481.1 ms ✓ JuDGE 4 dependencies successfully precompiled in 202 seconds. 66 already precompiled. Precompilation completed after 229.49s ################################################################################ # Testing # Testing JuDGE Status `/tmp/jl_6Nba2e/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.30.0 [bac558e1] OrderedCollections v1.8.1 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_6Nba2e/Manifest.toml` [6e4b80f9] BenchmarkTools v1.7.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [8bb1440f] DelimitedFiles v1.9.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.3.3 [60bf3e95] GLPK v1.2.1 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 ⌅ [682c06a0] JSON v0.21.4 [7600667b] JuDGE v0.5.3 [4076af6c] JuMP v1.30.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.50.1 [d8a4904e] MutableArithmetics v1.7.1 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.2 [276daf66] SpecialFunctions v2.7.2 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [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.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.19.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2026.3.19 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.5+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.1+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... --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.225 Objective value of best integer-feasible solution: 50.0 Objective value of lower bound: 50.0 Solve time: 18.512s 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 2 of 3 | 5.500000e+01 5.200000e+01 | 3.000000e+00 5.769231e-02 | 0 | 0.822 3 of 3 | 5.400000e+01 5.200000e+01 | 2.000000e+00 3.846154e-02 | 0 | 2.245 Objective value of best integer-feasible solution: 52.0 Objective value of lower bound: 52.0 Solve time: 3.865s 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.004 3 of 3 | 4.453250e+01 4.331250e+01 | 1.220000e+00 2.816739e-02 | 0 | 0.005 Objective value of best integer-feasible solution: 44.5325 Objective value of lower bound: 44.5325 Solve time: 0.006s 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.560750e+01 4.416250e+01 | 1.445000e+00 3.272007e-02 | 0 | 0.005 3 of 3 | 4.560750e+01 4.416250e+01 | 1.445000e+00 3.272007e-02 | 0 | 0.006 Objective value of best integer-feasible solution: 45.6075 Objective value of lower bound: 45.6075 Solve time: 0.009s 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.006s 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.548000e+01 4.180000e+01 | 3.680000e+00 8.803828e-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.006s Re-solved Objective: 43.080000000000005 JuDGE 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) 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) + 23: >>>>> 4.453250000e+01 >= 4.453250000e+01 0.0% (5; 0) + 23: mip = 4.453250000e+01 >= tree is empty 0.0% (0; 9) [ 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) + 22: >>>>> 4.288000000e+01 >= 4.228000000e+01 1.4% (4; 0) + 26: >>>>> 4.228000000e+01 >= 4.228000000e+01 0.0% (1; 3) + 26: mip = 4.228000000e+01 >= tree is empty 0.0% (0; 7) [ 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) + 25: >>>>> 4.448000000e+01 >= 4.308000000e+01 3.1% (3; 0) + 27: >>>>> 4.308000000e+01 >= 4.308000000e+01 0.0% (1; 2) + 27: mip = 4.308000000e+01 >= tree is empty 0.0% (0; 5) [ Info: Solved. Objective: 43.08 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.961 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.800 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.802 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.803 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.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 0.000000e+00 | 0.000000e+00 -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 -3.000000e+01 | -3.000000e+01 -5.066667e+02 | 4.766667e+02 9.407895e-01 | 0 | 0.004 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.005 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) * 22: obj = -3.000000000e+01 inf = 0.000e+00 (0) + 22: mip = not found yet >= -inf (1; 0) + 22: >>>>> -3.000000000e+01 >= -3.000000000e+01 0.0% (1; 0) + 22: 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.005 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.007 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.160000e+02 | 2.549722e+02 8.068741e-01 | 2 | 0.010 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 | 2.842171e-14 4.657176e-16 | 2 | 0.015 4 Solving master problem as MIP -6.102778e+01 | -6.101111e+01 -6.102778e+01 | 1.666667e-02 2.730997e-04 | 0 | 0.071 5* Convergence criteria met. Objective: -61.0111111111111 Re-solved Objective: -61.01111111111113 [ 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) * 70: obj = -6.102777778e+01 inf = 0.000e+00 (0) + 70: mip = not found yet >= -inf (1; 0) + 71: >>>>> -6.101111111e+01 >= -6.101111111e+01 < 0.1% (2; 0) + 71: mip = -6.101111111e+01 >= tree is empty 0.0% (0; 3) [ Info: Solved. Deterministic Equivalent Objective: -61.01111111111111 Deterministic Equivalent Expansions Node 1: "papers_ordered" 14.0 Node 11: "papers_ordered" 20.0 Node 12: "papers_ordered" 10.0 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.016 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.024 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.764444e+02 | 3.858275e+02 8.098060e-01 | 6 | 0.036 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.043 4 Solving master problem as MIP -9.061690e+01 | -9.052593e+01 -9.061690e+01 | 9.097222e-02 1.003921e-03 | 0 | 0.047 5* Convergence criteria met. Objective: -90.52592592592599 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) * 228: obj = -9.061689815e+01 inf = 2.542e-14 (0) 1 + 228: mip = not found yet >= -inf (1; 0) + 238: >>>>> -9.052592593e+01 >= -9.054681481e+01 < 0.1% (6; 0) + 241: 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.185 1 -1.387072e+01 | -1.387072e+01 -Inf | Inf NaN | 0 | 0.187 2 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.188 3 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.188 4 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.189 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.003 2 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.004 3 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.005 4 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.005 5* Stalled: exiting. Re-solved Objective: -10.467188400194972 JuDGE Expansions Node 1: "stock" 0.44751499679888973 Node 11: "stock" 3.9334886695323967 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) * 34: obj = -1.046718871e+01 inf = 1.998e-15 (0) [ Info: Solved. Objective: -10.467188708514163 Deterministic Equivalent Expansions Node 1: "stock" 0.4475149967989098 Node 11: "stock" 3.9334958861659266 Node 12: "stock" 49.99999999999999 [ 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.003 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.004 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.579126394244536 [ 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) * 36: obj = -8.581522836e+01 inf = 0.000e+00 (0) [ Info: Solved. Objective: -85.81522835638638 Deterministic Equivalent Expansions Node 12: "stock" 17.579126394244486 [ 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.112500e+02 | -1.112500e+02 -1.387500e+02 | 2.750000e+01 1.981982e-01 | 0 | 0.003 2 -1.312500e+02 | -1.312500e+02 -1.387500e+02 | 7.500000e+00 5.405405e-02 | 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) + 63: >>>>> -1.262500000e+02 >= -1.337500000e+02 5.9% (10; 0) + 72: >>>>> -1.312500000e+02 >= -1.337500000e+02 1.9% (7; 8) + 78: mip = -1.312500000e+02 >= tree is empty 0.0% (0; 23) [ 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.450000e+02 | -1.450000e+02 -1.627500e+02 | 1.775000e+01 1.090630e-01 | 0 | 0.003 2 -1.452500e+02 | -1.452500e+02 -1.627500e+02 | 1.750000e+01 1.075269e-01 | 0 | 0.004 3 -1.452500e+02 | -1.452500e+02 -1.452500e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.006 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) * 46: obj = -1.467083333e+02 inf = 0.000e+00 (0) + 46: mip = not found yet >= -inf (1; 0) + 52: >>>>> -1.452500000e+02 >= -1.452500000e+02 0.0% (6; 0) + 52: 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 40558, while current world is 40559. Stacktrace: [1] macro expansion @ ~/.julia/packages/MutableArithmetics/2Djmb/src/rewrite_generic.jl:317 [inlined] [2] macro expansion @ ~/.julia/packages/MutableArithmetics/2Djmb/src/rewrite.jl:384 [inlined] [3] macro expansion @ ~/.julia/packages/JuMP/0tD10/src/macros.jl:264 [inlined] [4] macro expansion @ ~/.julia/packages/JuMP/0tD10/src/macros/@constraint.jl:171 [inlined] [5] macro expansion @ ~/.julia/packages/JuMP/0tD10/src/macros.jl:402 [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] kwcall(::@NamedTuple{sideconstraints::var"#budget#knapsack_budget##30"{Vector{Int64}, Int64, Dict{AbstractTree, Int64}}}, ::Type{JuDGEModel}, tree::Tree, probabilities::Function, sub_problem_builder::Function, solver::MathOptInterface.OptimizerWithAttributes) @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/decomposition.jl:127 [10] knapsack_budget() @ Main ~/.julia/packages/JuDGE/yzb6J/examples/knapsacks.jl:693 [11] top-level scope @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:10 [12] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2243 [inlined] [13] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:153 [inlined] [14] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2243 [inlined] [15] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:156 [inlined] [16] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:778 [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 | 0.929 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.943106e+03 | 1.943106e+03 1.918206e+03 | 2.489986e+01 1.298081e-02 | 0 | 0.969 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.942782e+03 | 1.942782e+03 1.921822e+03 | 2.096008e+01 1.090636e-02 | 0 | 1.011 3 Solving subproblem for node 11 1/31Solving subproblem for node 111111 2/31Solving subproblem for node 111112 3/31Solving subproblem for node 11112 4/31Solving subproblem for node 111121 5/31Solving subproblem for node 111122 6/31Solving subproblem for node 1112 7/31Solving subproblem for node 11121 8/31Solving subproblem for node 111221 9/31Solving subproblem for node 112 10/31Solving subproblem for node 11211 11/31Solving subproblem for node 112111 12/31Solving subproblem for node 112112 13/31Solving subproblem for node 11212 14/31Solving subproblem for node 112122 15/31Solving subproblem for node 1122 16/31Solving subproblem for node 11222 17/31Solving subproblem for node 12 18/31Solving subproblem for node 1211 19/31Solving subproblem for node 12112 20/31Solving subproblem for node 121122 21/31Solving subproblem for node 12121 22/31Solving subproblem for node 121211 23/31Solving subproblem for node 12122 24/31Solving subproblem for node 121222 25/31Solving subproblem for node 12211 26/31Solving subproblem for node 122111 27/31Solving subproblem for node 12212 28/31Solving subproblem for node 122122 29/31Solving subproblem for node 12221 30/31Solving subproblem for node 12222 31/31Solving master problem 1.942699e+03 | 1.942699e+03 1.921822e+03 | 2.087756e+01 1.086342e-02 | 0 | 1.107 4 Solving subproblem for node 111111 1/20Solving subproblem for node 111112 2/20Solving subproblem for node 11112 3/20Solving subproblem for node 111121 4/20Solving subproblem for node 111122 5/20Solving subproblem for node 1112 6/20Solving subproblem for node 11121 7/20Solving subproblem for node 111221 8/20Solving subproblem for node 112 9/20Solving subproblem for node 11211 10/20Solving subproblem for node 112111 11/20Solving subproblem for node 11212 12/20Solving subproblem for node 112122 13/20Solving subproblem for node 1122 14/20Solving subproblem for node 12 15/20Solving subproblem for node 1211 16/20Solving subproblem for node 12122 17/20Solving subproblem for node 122111 18/20Solving subproblem for node 12221 19/20Solving subproblem for node 12222 20/20Solving master problem 1.942680e+03 | 1.942680e+03 1.921822e+03 | 2.085853e+01 1.085352e-02 | 0 | 1.124 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.933660e+03 | 1.933660e+03 1.923846e+03 | 9.814323e+00 5.101408e-03 | 0 | 1.159 6 Solving subproblem for node 1111 1/18Solving subproblem for node 111211 2/18Solving subproblem for node 111212 3/18Solving subproblem for node 11122 4/18Solving subproblem for node 111222 5/18Solving subproblem for node 1121 6/18Solving subproblem for node 11221 7/18Solving subproblem for node 112212 8/18Solving subproblem for node 112221 9/18Solving subproblem for node 112222 10/18Solving subproblem for node 121 11/18Solving subproblem for node 12111 12/18Solving subproblem for node 121111 13/18Solving subproblem for node 1212 14/18Solving subproblem for node 121212 15/18Solving subproblem for node 122 16/18Solving subproblem for node 122211 17/18Solving subproblem for node 122222 18/18Solving master problem 1.933174e+03 | 1.933174e+03 1.923846e+03 | 9.327759e+00 4.848496e-03 | 0 | 1.174 7 Solving subproblem for node 12111 1/4Solving subproblem for node 121111 2/4Solving subproblem for node 121212 3/4Solving subproblem for node 122211 4/4Solving master problem 1.933174e+03 | 1.933174e+03 1.923846e+03 | 9.327759e+00 4.848496e-03 | 0 | 1.185 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.925746e+03 | 1.925746e+03 1.923846e+03 | 1.899877e+00 9.875409e-04 | 0 | 1.217 9 Solving subproblem for node 11111 1/11Solving subproblem for node 112111 2/11Solving subproblem for node 112121 3/11Solving subproblem for node 112211 4/11Solving subproblem for node 121112 5/11Solving subproblem for node 121121 6/11Solving subproblem for node 121221 7/11Solving subproblem for node 1221 8/11Solving subproblem for node 122112 9/11Solving subproblem for node 1222 10/11Solving subproblem for node 122212 11/11Solving master problem 1.925746e+03 | 1.925746e+03 1.923846e+03 | 1.899877e+00 9.875409e-04 | 0 | 1.322 10 Solving subproblem for node 11111 1/1Solving master problem 1.925746e+03 | 1.925746e+03 1.923846e+03 | 1.899877e+00 9.875409e-04 | 0 | 1.329 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.923995e+03 | 3.593657e-01 1.867810e-04 | 0 | 1.357 12 Solving subproblem for node 111111 1/4Solving subproblem for node 111112 2/4Solving subproblem for node 122121 3/4Solving subproblem for node 122221 4/4Solving master problem 1.924354e+03 | 1.924354e+03 1.923995e+03 | 3.593657e-01 1.867810e-04 | 0 | 1.367 13 Solving subproblem for node 111112 1/1Solving master problem 1.924354e+03 | 1.924354e+03 1.923995e+03 | 3.593657e-01 1.867810e-04 | 0 | 1.376 14 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.402 15 Convergence criteria met. Objective: 1924.3540625394003 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.3540625394005 [ 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) 1123: obj = 2.137853069e+03 inf = 3.331e-16 (0) 6 * 1456: obj = 1.922649230e+03 inf = 0.000e+00 (0) 3 + 1456: mip = not found yet >= -inf (1; 0) + 1612: >>>>> 1.924985887e+03 >= 1.923782114e+03 < 0.1% (50; 0) + 2462: >>>>> 1.924937089e+03 >= 1.924206963e+03 < 0.1% (400; 21) + 2525: >>>>> 1.924865328e+03 >= 1.924221407e+03 < 0.1% (418; 50) + 2768: >>>>> 1.924744770e+03 >= 1.924256632e+03 < 0.1% (495; 135) + 3214: >>>>> 1.924624212e+03 >= 1.924289847e+03 < 0.1% (514; 430) + 3711: >>>>> 1.924586814e+03 >= 1.924317157e+03 < 0.1% (562; 753) + 3861: >>>>> 1.924549416e+03 >= 1.924324538e+03 < 0.1% (515; 964) + 3905: >>>>> 1.924503653e+03 >= 1.924325030e+03 < 0.1% (445; 1112) + 4127: >>>>> 1.924466256e+03 >= 1.924331919e+03 < 0.1% (395; 1368) + 4263: >>>>> 1.924428858e+03 >= 1.924339669e+03 < 0.1% (367; 1559) + 4437: >>>>> 1.924391460e+03 >= 1.924346681e+03 < 0.1% (342; 1686) + 4631: >>>>> 1.924354063e+03 >= 1.924354063e+03 < 0.1% (263; 1952) + 4631: mip = 1.924354063e+03 >= tree is empty 0.0% (0; 2713) [ 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 40699, while current world is 40700. Stacktrace: [1] macro expansion @ ~/.julia/packages/MutableArithmetics/2Djmb/src/rewrite.jl:384 [inlined] [2] macro expansion @ ~/.julia/packages/JuMP/0tD10/src/macros.jl:264 [inlined] [3] macro expansion @ ~/.julia/packages/JuMP/0tD10/src/macros/@constraint.jl:171 [inlined] [4] (::var"#340#341"{Leaf, Model})(i::Int64) @ Main ~/.julia/packages/JuMP/0tD10/src/Containers/macro.jl:559 [5] #container##0 @ ~/.julia/packages/JuMP/0tD10/src/Containers/container.jl:85 [inlined] [6] iterate @ ./generator.jl:48 [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:828 [8] map @ ./abstractarray.jl:3420 [inlined] [9] container @ ~/.julia/packages/JuMP/0tD10/src/Containers/container.jl:85 [inlined] [10] container @ ~/.julia/packages/JuMP/0tD10/src/Containers/container.jl:71 [inlined] [11] container @ ~/.julia/packages/JuMP/0tD10/src/Containers/container.jl:75 [inlined] [12] macro expansion @ ~/.julia/packages/JuMP/0tD10/src/macros.jl:402 [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] kwcall(::@NamedTuple{sideconstraints::var"#meet_demand#339"{Int64}, check::Bool}, ::Type{JuDGEModel}, tree::Leaf, probabilities::Function, sub_problem_builder::Function, solver::MathOptInterface.OptimizerWithAttributes) @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/decomposition.jl:127 [17] cutting_stock(; seed::Int64, L::Int64, sizes::Vector{Int64}, test::Bool) @ Main ~/.julia/packages/JuDGE/yzb6J/examples/cutting_stock.jl:228 [18] kwcall(::@NamedTuple{test::Bool}, ::typeof(cutting_stock)) @ Main ~/.julia/packages/JuDGE/yzb6J/examples/cutting_stock.jl:11 [19] top-level scope @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:10 [20] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2243 [inlined] [21] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:165 [inlined] [22] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2243 [inlined] [23] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:166 [inlined] [24] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:778 [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.003 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.004 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.008 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.755 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.759 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 6.000000e+01 | 2.700000e+01 4.500000e-01 | 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 8.437500e+01 | 8.437500e+01 2.400000e+01 | 6.037500e+01 2.515625e+00 | 0 | 0.009 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 3.262500e+01 | 2.025000e+01 6.206897e-01 | 0 | 0.013 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.015 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.006 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.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 7.700000e+01 | 7.700000e+01 2.100000e+01 | 5.600000e+01 2.666667e+00 | 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 7.700000e+01 | 7.700000e+01 7.700000e+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 1.050000e+02 | 1.050000e+02 -Inf | Inf NaN | 0 | 0.006 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.250000e+01 | 6.250000e+01 -3.000000e+00 | 6.550000e+01 2.183333e+01 | 0 | 0.010 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.312500e+01 | 5.312500e+01 3.600000e+01 | 1.712500e+01 4.756944e-01 | 0 | 0.014 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 5.312500e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.016 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 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.010 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.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.000000e+01 | 4.000000e+01 4.000000e+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 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 6.200000e+01 | 6.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 6.200000e+01 | 6.200000e+01 6.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.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.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 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.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 Inf | Inf -Inf | Inf NaN | 0 | 0.002 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.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 5.200000e+01 | 5.200000e+01 5.200000e+01 | 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 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.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 5.200000e+01 | 5.200000e+01 5.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.005 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.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.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.008 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 4.200000e+01 | 4.200000e+01 -Inf | Inf NaN | 0 | 0.005 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.006 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.001 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.008 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.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 9.700000e+01 | 9.700000e+01 9.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.005 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.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 1.604688e+01 | 1.604688e+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 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.009 3 Solving master problem as MIP 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.009 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.007 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.009 2 Solving master problem as MIP 6.287500e+01 | 6.287500e+01 -Inf | Inf NaN | 0 | 0.009 3* Stalled: exiting. [ 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.005 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) 9: obj = 6.500000000e+01 inf = 0.000e+00 (0) * 15: obj = 6.500000000e+01 inf = 0.000e+00 (0) + 15: mip = not found yet >= -inf (1; 0) + 15: >>>>> 6.500000000e+01 >= 6.500000000e+01 0.0% (1; 0) + 15: 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) 50: obj = 4.850000000e+01 inf = 0.000e+00 (0) * 67: obj = 4.850000000e+01 inf = 0.000e+00 (0) + 67: mip = not found yet >= -inf (1; 0) + 67: >>>>> 4.850000000e+01 >= 4.850000000e+01 0.0% (1; 0) + 67: 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) 57: obj = 5.550000000e+01 inf = 3.331e-16 (0) * 73: obj = 5.287500000e+01 inf = 0.000e+00 (0) + 73: mip = not found yet >= -inf (1; 0) + 73: >>>>> 5.287500000e+01 >= 5.287500000e+01 0.0% (1; 0) + 73: 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 = 1.776e-15 (0) * 78: obj = 5.312500000e+01 inf = 2.442e-15 (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) * 68: obj = 6.200000000e+01 inf = 0.000e+00 (0) + 68: mip = not found yet >= -inf (1; 0) + 68: >>>>> 6.200000000e+01 >= 6.200000000e+01 0.0% (1; 0) + 68: 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) 11: obj = 5.200000000e+01 inf = 0.000e+00 (0) * 19: obj = 5.200000000e+01 inf = 0.000e+00 (0) + 19: mip = not found yet >= -inf (1; 0) + 19: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 19: 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) 51: obj = 5.200000000e+01 inf = 1.776e-15 (0) * 70: obj = 5.200000000e+01 inf = 1.554e-15 (0) + 70: mip = not found yet >= -inf (1; 0) + 70: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 70: 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) * 17: obj = 4.200000000e+01 inf = 0.000e+00 (0) + 17: mip = not found yet >= -inf (1; 0) + 17: >>>>> 4.200000000e+01 >= 4.200000000e+01 0.0% (1; 0) + 17: 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) 50: obj = 4.200000000e+01 inf = 1.998e-15 (0) * 67: obj = 4.200000000e+01 inf = 1.110e-15 (0) + 67: mip = not found yet >= -inf (1; 0) + 67: >>>>> 4.200000000e+01 >= 4.200000000e+01 0.0% (1; 0) + 67: 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) 14: obj = 9.700000000e+01 inf = 0.000e+00 (0) * 21: obj = 9.700000000e+01 inf = 0.000e+00 (0) + 21: mip = not found yet >= -inf (1; 0) + 21: >>>>> 9.700000000e+01 >= 9.700000000e+01 0.0% (1; 0) + 21: 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) 50: obj = 4.850000000e+01 inf = 0.000e+00 (0) * 67: obj = 4.850000000e+01 inf = 0.000e+00 (0) + 67: mip = not found yet >= -inf (1; 0) + 67: >>>>> 4.850000000e+01 >= 4.850000000e+01 0.0% (1; 0) + 67: 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) * 46: 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) * 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.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.359 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.363 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.402800e+02 | 1.402800e+02 1.554800e+01 | 1.247320e+02 8.022382e+00 | 0 | 1.366 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 4.777800e+01 | 1.402800e+02 1.554800e+01 | 3.223000e+01 2.072935e+00 | 1 | 1.369 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.448400e+01 | 1.402800e+02 1.688700e+01 | 2.759700e+01 1.634216e+00 | 1 | 1.372 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.393950e+01 | 1.402800e+02 2.224300e+01 | 2.169650e+01 9.754305e-01 | 5 | 1.374 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.358615e+01 | 1.402800e+02 2.631550e+01 | 1.727065e+01 6.562920e-01 | 11 | 1.377 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.339326e+01 | 1.402800e+02 2.631550e+01 | 1.707776e+01 6.489619e-01 | 10 | 1.380 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.280340e+01 | 1.402800e+02 3.443709e+01 | 8.366315e+00 2.429449e-01 | 5 | 1.382 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.278469e+01 | 1.402800e+02 3.443709e+01 | 8.347602e+00 2.424015e-01 | 5 | 1.385 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.444090e+01 | 8.324100e+00 2.416923e-01 | 0 | 1.388 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.275870e+01 | 4.276500e+01 3.444090e+01 | 8.317800e+00 2.415094e-01 | 1 | 1.390 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.275870e+01 | 4.276500e+01 3.805170e+01 | 4.707000e+00 1.237001e-01 | 1 | 1.393 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.270636e+01 | 4.270636e+01 3.872445e+01 | 3.981912e+00 1.028268e-01 | 0 | 1.396 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.270636e+01 | 4.270636e+01 3.925666e+01 | 3.449700e+00 8.787553e-02 | 0 | 1.399 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.270636e+01 | 4.270636e+01 3.932332e+01 | 3.383045e+00 8.603152e-02 | 0 | 1.402 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.405 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.408 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.411 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.414 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.417 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.420 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.423 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.426 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.429 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.083900e+01 | 4.083900e+01 3.955179e+01 | 1.287208e+00 3.254486e-02 | 0 | 1.433 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.083900e+01 | 4.083900e+01 3.982957e+01 | 1.009430e+00 2.534373e-02 | 0 | 1.436 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.083900e+01 | 4.083900e+01 4.051086e+01 | 3.281371e-01 8.099978e-03 | 0 | 1.439 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.083900e+01 | 4.083900e+01 4.072229e+01 | 1.167097e-01 2.865990e-03 | 0 | 1.442 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.083900e+01 | 4.083900e+01 4.072229e+01 | 1.167097e-01 2.865990e-03 | 0 | 1.444 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.083900e+01 | 4.083900e+01 4.076045e+01 | 7.854545e-02 1.927001e-03 | 0 | 1.447 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.083900e+01 | 4.083900e+01 4.076045e+01 | 7.854545e-02 1.927001e-03 | 0 | 1.449 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.452 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.454 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.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.457 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.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.459 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.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.462 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.464 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.467 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.469 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.472 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.475 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.477 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.480 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.482 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.485 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.488 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.490 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.493 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.495 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.498 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.501 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.503 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.506 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.509 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.512 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.515 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.518 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.521 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.523 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.526 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.529 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.532 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.534 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.083900e+01 | 4.083900e+01 4.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.537 65 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.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.540 66 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.078500e+01 | 5.400000e-02 1.324016e-03 | 0 | 1.542 67 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.082820e+01 | 4.082820e+01 4.078500e+01 | 4.320000e-02 1.059213e-03 | 0 | 1.545 68 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.082820e+01 | 4.082820e+01 4.079580e+01 | 3.240000e-02 7.941994e-04 | 0 | 1.547 69 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.082820e+01 | 4.082820e+01 4.079580e+01 | 3.240000e-02 7.941994e-04 | 0 | 1.550 70 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.082820e+01 | 4.082820e+01 4.079580e+01 | 3.240000e-02 7.941994e-04 | 0 | 1.553 71 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.082357e+01 | 4.082357e+01 4.079580e+01 | 2.777143e-02 6.807423e-04 | 0 | 1.556 72 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.082357e+01 | 4.082357e+01 4.080043e+01 | 2.314286e-02 5.672209e-04 | 0 | 1.559 73 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.082357e+01 | 4.082357e+01 4.080043e+01 | 2.314286e-02 5.672209e-04 | 0 | 1.561 74 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.082357e+01 | 4.082357e+01 4.080043e+01 | 2.314286e-02 5.672209e-04 | 0 | 1.564 75 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.082357e+01 | 4.082357e+01 4.080043e+01 | 2.314286e-02 5.672209e-04 | 0 | 1.567 76 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.082357e+01 | 4.082357e+01 4.080043e+01 | 2.314286e-02 5.672209e-04 | 0 | 1.570 77 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.080043e+01 | 1.157143e-02 2.836105e-04 | 0 | 1.573 78 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.080043e+01 | 1.157143e-02 2.836105e-04 | 0 | 1.576 79 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.080043e+01 | 1.157143e-02 2.836105e-04 | 0 | 1.579 80 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.080043e+01 | 1.157143e-02 2.836105e-04 | 0 | 1.582 81 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.080043e+01 | 1.157143e-02 2.836105e-04 | 0 | 1.585 82 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.080043e+01 | 1.157143e-02 2.836105e-04 | 0 | 1.588 83 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.080043e+01 | 1.157143e-02 2.836105e-04 | 0 | 1.591 84 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.593 85 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) 103: obj = 4.081200000e+01 inf = 0.000e+00 (0) * 137: obj = 4.081200000e+01 inf = 0.000e+00 (0) + 137: mip = not found yet >= -inf (1; 0) + 137: >>>>> 4.081200000e+01 >= 4.081200000e+01 0.0% (1; 0) + 137: 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.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.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.008 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.008 7 Solving master problem as MIP 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.009 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.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.005 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.007 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.008 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.008 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.009 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) 48: obj = 2.192333333e+02 inf = 6.576e-16 (0) * 53: obj = 2.183350000e+02 inf = 1.281e-16 (0) [ Info: Solved. Deterministic Equivalent Expansions Node 1: "large_upgrade[a]" 0.33333333333333326 Node 1: "large_upgrade[b]" 0.5000000000000001 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) 29: obj = 2.262700000e+02 inf = 0.000e+00 (0) * 45: 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.313333e+02 | 2.313333e+02 1.963333e+02 | 3.500000e+01 1.782683e-01 | 0 | 0.012 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.230000e+02 | 2.230000e+02 1.963333e+02 | 2.666667e+01 1.358234e-01 | 0 | 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.230000e+02 | 2.230000e+02 2.096667e+02 | 1.333333e+01 6.359300e-02 | 0 | 0.017 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.226667e+02 | 2.226667e+02 2.206667e+02 | 2.000000e+00 9.063444e-03 | 0 | 0.020 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.226667e+02 | 2.226667e+02 2.220000e+02 | 6.666667e-01 3.003003e-03 | 0 | 0.023 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.226667e+02 | 2.226667e+02 2.226667e+02 | 2.842171e-14 1.276424e-16 | 0 | 0.027 8 Convergence criteria met. Performing final MIP solve Objective value of best integer-feasible solution: 222.66666666666666 Objective value of lower bound: 222.66666666666663 Solve time: 0.04s 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.007 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.430833e+02 | 2.724000e+02 2.140667e+02 | 2.901667e+01 1.355497e-01 | 5 | 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.308467e+02 | 2.724000e+02 2.140667e+02 | 1.678000e+01 7.838680e-02 | 8 | 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.287196e+02 | 2.724000e+02 2.140667e+02 | 1.465294e+01 6.845036e-02 | 8 | 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.283131e+02 | 2.724000e+02 2.262608e+02 | 2.052311e+00 9.070555e-03 | 7 | 0.017 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.724000e+02 2.266393e+02 | 1.628571e+00 7.185742e-03 | 9 | 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.282114e+02 | 2.724000e+02 2.281135e+02 | 9.789005e-02 4.291287e-04 | 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.724000e+02 2.282114e+02 | 2.842171e-14 1.245412e-16 | 9 | 0.026 9 Solving master problem as MIP 2.282114e+02 | 2.326000e+02 2.282114e+02 | 4.388618e+00 1.923050e-02 | 0 | 0.027 10* 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.664 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.284096e+02 | Inf 2.282114e+02 | 1.982069e-01 8.685234e-04 | 8 | 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.284096e+02 | Inf 2.284096e+02 | 0.000000e+00 0.000000e+00 | 8 | 0.004 2 Solving master problem as MIP 2.284096e+02 | 2.326000e+02 2.284096e+02 | 4.190411e+00 1.834604e-02 | 0 | 0.007 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.673 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.282379e+02 | Inf 2.282379e+02 | 0.000000e+00 0.000000e+00 | 6 | 0.003 1 Solving master problem as MIP 2.282379e+02 | 2.326333e+02 2.282379e+02 | 4.395455e+00 1.925822e-02 | 0 | 0.005 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.282379e+02 | 4.362121e+00 1.911217e-02 | 0 | 0.679 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.351884e+02 | Inf 2.346464e+02 | 5.420290e-01 2.309982e-03 | 3 | 0.003 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 7 of 7 | 2.326000e+02 2.282379e+02 | 4.362121e+00 1.911217e-02 | 0 | 0.684 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.288194e+02 | Inf 2.282379e+02 | 5.815657e-01 2.548068e-03 | 7 | 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.288194e+02 | Inf 2.288194e+02 | 0.000000e+00 0.000000e+00 | 7 | 0.005 2 Solving master problem as MIP 2.288194e+02 | 2.326333e+02 2.288194e+02 | 3.813889e+00 1.666768e-02 | 0 | 0.007 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 4 of 9 | 2.326000e+02 2.284096e+02 | 4.190411e+00 1.834604e-02 | 0 | 0.693 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.300526e+02 | -2.557954e-13 -1.111899e-15 | 5 | 0.002 1 Solving master problem as MIP 2.300526e+02 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.004 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 5 of 11 | 2.326000e+02 2.284096e+02 | 4.190411e+00 1.834604e-02 | 0 | 0.698 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.348667e+02 | 1.333333e-01 5.676980e-04 | 0 | 0.004 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 8 of 11 | 2.326000e+02 2.288194e+02 | 3.780556e+00 1.652200e-02 | 0 | 0.703 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.302233e+02 | Inf 2.302233e+02 | 2.842171e-14 1.234528e-16 | 5 | 0.002 1 Solving master problem as MIP 2.302233e+02 | 2.326333e+02 2.302233e+02 | 2.410000e+00 1.046810e-02 | 0 | 0.003 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 9 of 13 | 2.326000e+02 2.288194e+02 | 3.780556e+00 1.652200e-02 | 0 | 0.707 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.395167e+02 | Inf 2.305833e+02 | 8.933333e+00 3.874232e-02 | 1 | 0.004 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.393667e+02 | 2.393667e+02 2.393667e+02 | 5.684342e-14 2.374742e-16 | 0 | 0.007 2 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 10 of 13 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.715 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.324333e+02 | 1.666667e-01 7.170515e-04 | 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.326000e+02 | 2.326000e+02 2.324333e+02 | 1.666667e-01 7.170515e-04 | 0 | 0.005 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.008 3 Convergence criteria met. Attempting to branch. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 11 of 13 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.724 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 | -5.684342e-14 -2.462465e-16 | 4 | 0.004 1 Solving master problem as MIP 2.308395e+02 | 2.362333e+02 2.308395e+02 | 5.393860e+00 2.336628e-02 | 0 | 0.005 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 12 of 15 | 2.326000e+02 2.302233e+02 | 2.376667e+00 1.032331e-02 | 0 | 0.730 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.326333e+02 | 2.326333e+02 2.325667e+02 | 6.666667e-02 2.866562e-04 | 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.326333e+02 | 2.326333e+02 2.326333e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.006 2 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 13 of 15 | 2.326000e+02 2.302233e+02 | 2.376667e+00 1.032331e-02 | 0 | 0.737 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.315118e+02 | Inf 2.315118e+02 | 0.000000e+00 0.000000e+00 | 4 | 0.003 1 Solving master problem as MIP 2.315118e+02 | 2.472333e+02 2.315118e+02 | 1.572151e+01 6.790800e-02 | 0 | 0.006 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 14 of 17 | 2.326000e+02 2.308395e+02 | 1.760526e+00 7.626626e-03 | 0 | 0.744 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.433000e+02 | 8.526513e-14 3.504526e-16 | 0 | 0.004 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 15 of 17 | 2.326000e+02 2.308395e+02 | 1.760526e+00 7.626626e-03 | 0 | 0.749 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.342556e+02 | Inf 2.342556e+02 | 8.526513e-14 3.639834e-16 | 4 | 0.002 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 16 of 17 | 2.326000e+02 2.315118e+02 | 1.088172e+00 4.700287e-03 | 0 | 0.751 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.433333e+02 | 2.433333e+02 2.431833e+02 | 1.500000e-01 6.168186e-04 | 0 | 0.004 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 17 of 17 | 2.326000e+02 2.315118e+02 | 1.088172e+00 4.700287e-03 | 0 | 0.756 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.372000e+02 | Inf 2.372000e+02 | 0.000000e+00 0.000000e+00 | 1 | 0.004 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.764s ┌ 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) 29: obj = 2.231666667e+02 inf = 0.000e+00 (0) * 45: obj = 2.156666667e+02 inf = 0.000e+00 (0) + 45: mip = not found yet >= -inf (1; 0) + 53: >>>>> 2.226666667e+02 >= 2.198333333e+02 1.3% (5; 0) + 63: 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) 48: obj = 2.263333333e+02 inf = 6.576e-16 (0) * 55: obj = 2.216570175e+02 inf = 1.424e-15 (0) + 55: mip = not found yet >= -inf (1; 0) + 75: >>>>> 2.433000000e+02 >= 2.270403509e+02 6.7% (7; 0) + 129: >>>>> 2.356000000e+02 >= 2.314733333e+02 1.8% (14; 7) + 142: >>>>> 2.326000000e+02 >= 2.326000000e+02 0.0% (6; 20) + 142: mip = 2.326000000e+02 >= tree is empty 0.0% (0; 39) [ 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.216 3 of 5 | -5.888921e+00 -5.906797e+00 | 1.787603e-02 -3.026349e-03 | 0 | 0.318 6 of 7 | -5.888921e+00 -5.901540e+00 | 1.261949e-02 -2.138339e-03 | 0 | 0.393 7 of 9 | -5.888921e+00 -5.901540e+00 | 1.261949e-02 -2.138339e-03 | 0 | 0.477 8 of 11 | -5.888921e+00 -5.901388e+00 | 1.246651e-02 -2.112471e-03 | 0 | 0.542 9 of 11 | -5.888921e+00 -5.901388e+00 | 1.246651e-02 -2.112471e-03 | 0 | 0.601 10 of 13 | -5.888921e+00 -5.900661e+00 | 1.173974e-02 -1.989564e-03 | 0 | 0.700 11 of 15 | -5.888921e+00 -5.900661e+00 | 1.173974e-02 -1.989564e-03 | 0 | 0.836 14 of 15 | -5.888921e+00 -5.899032e+00 | 1.011113e-02 -1.714032e-03 | 0 | 0.918 15 of 17 | -5.888921e+00 -5.899032e+00 | 1.011113e-02 -1.714032e-03 | 0 | 1.004 16 of 19 | -5.889990e+00 -5.898974e+00 | 8.983382e-03 -1.522872e-03 | 0 | 1.088 17 of 21 | -5.889990e+00 -5.898974e+00 | 8.983382e-03 -1.522872e-03 | 0 | 1.154 Model 4 dominated. UB: -5.897178122861589, LB:-5.898818721225577 Model 5 dominated. UB: -5.897178122861589, LB:-5.898818721225577 12 of 21 | -5.897178e+00 -5.898819e+00 | 1.640598e-03 -2.781232e-04 | 0 | 1.210 13 of 21 | -5.897178e+00 -5.898819e+00 | 1.640598e-03 -2.781232e-04 | 0 | 1.262 Objective value of best integer-feasible solution: -5.897178122861589 Objective value of lower bound: -5.897178122861589 Solve time: 1.352s [ 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.016s [ 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.863704837305664 Objective value of lower bound: -5.863704837305664 Solve time: 0.027s [ 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.558448e+00 -5.644961e+00 | 8.651295e-02 -1.532569e-02 | 0 | 0.038 3 of 5 | -5.558448e+00 -5.644961e+00 | 8.651295e-02 -1.532569e-02 | 0 | 0.050 4 of 5 | -5.558448e+00 -5.631335e+00 | 7.288707e-02 -1.294312e-02 | 0 | 0.054 5 of 7 | -5.589160e+00 -5.631335e+00 | 4.217522e-02 -7.489382e-03 | 0 | 0.069 6 of 7 | -5.589160e+00 -5.612412e+00 | 2.325157e-02 -4.142884e-03 | 0 | 0.073 7 of 7 | -5.589160e+00 -5.612412e+00 | 2.325157e-02 -4.142884e-03 | 0 | 0.081 Objective value of best integer-feasible solution: -5.589160162654407 Objective value of lower bound: -5.589160162654407 Solve time: 0.087s [ 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.085 3 of 5 | -5.751871e+00 -5.787502e+00 | 3.563072e-02 -6.156493e-03 | 0 | 0.127 Objective value of best integer-feasible solution: -5.777753449758681 Objective value of lower bound: -5.777753449758681 Solve time: 0.147s [ 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.148 3 of 5 | -5.883161e+00 -5.895420e+00 | 1.225964e-02 -2.079519e-03 | 0 | 0.228 4 of 7 | -5.883161e+00 -5.892868e+00 | 9.707005e-03 -1.647246e-03 | 0 | 0.269 5 of 9 | -5.883161e+00 -5.892868e+00 | 9.707005e-03 -1.647246e-03 | 0 | 0.330 6 of 9 | -5.890256e+00 -5.892618e+00 | 2.361851e-03 -4.008152e-04 | 0 | 0.343 7 of 11 | -5.890256e+00 -5.892618e+00 | 2.361851e-03 -4.008152e-04 | 0 | 0.371 Model 8 dominated. UB: -5.890255785620322, LB:-5.891813457965329 Model 9 dominated. UB: -5.890255785620322, LB:-5.891813457965329 10 of 11 | -5.890256e+00 -5.891813e+00 | 1.557672e-03 -2.643791e-04 | 0 | 0.396 11 of 11 | -5.890256e+00 -5.891813e+00 | 1.557672e-03 -2.643791e-04 | 0 | 0.428 Objective value of best integer-feasible solution: -5.890255785620322 Objective value of lower bound: -5.890255785620322 Solve time: 0.445s [ Info: HN obj: -5.897178122861588 [ Info: WS obj: -5.900965111808093 [ Info: EEV obj: -5.863704837305664 [ Info: RH obj: -5.890255785620322 [ Info: EVPI: 0.0037869889465049766 [ Info: VSS (EV policy): 0.03347328555592366 [ Info: VSS (RH policy): 0.006922337241265453 [ 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 5m59.9s Tree building | 4 4 9.3s Deterministic | 12 12 2m28.7s Multistage newsvendor | 4 4 14.3s Inventory | 5 5 7.8s Stochastic Knapsack | 2 1 3 29.4s Transportation network expansion | 1 1 51.1s Cutting stock | 1 1 17.0s Lag, duration, set_policy (Decomposition) | 9 9 8.1s Lag, duration, set_policy (Deterministic Equivalent) | 9 9 5.8s Variable Types / Starting solution | 2 2 23.8s Risk aversion and implied probabilities | 10 10 23.4s EVPI / VSS | 1 1 21.2s RNG of the outermost testset: Xoshiro(0x4a31561240d2c11a, 0x0edc56c3f66d5fab, 0x70c3bab33d727b3d, 0x38acce77d3e9ec06, 0x3752a52522bcbc76) 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 384.53s 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:3160 [3] test @ /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Operations.jl:3025 [inlined] [4] 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:586 [5] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:562 [6] 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 [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:161 [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [9] test @ /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [inlined] [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:159 [11] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:223 [12] include(mod::Module, _path::String) @ Base ./Base.jl:323 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:344 [14] _start() @ Base ./client.jl:585 in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 PkgEval failed after 659.81s: package tests unexpectedly errored