Package evaluation of JuDGE on Julia 1.12.0-rc2.1 (084dab1917*) started at 2025-09-12T07:17:28.115 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.24s ################################################################################ # Installation # Installing JuDGE... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [7600667b] + JuDGE v0.5.3 Updating `~/.julia/environments/v1.12/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.0 [864edb3b] + DataStructures v0.19.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.2.0 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [7600667b] + JuDGE v0.5.3 [4076af6c] + JuMP v1.29.1 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.44.0 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [276daf66] + SpecialFunctions v2.5.1 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [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.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.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 v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+1 Installation completed after 4.91s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 38.48s ################################################################################ # Testing # Testing JuDGE Status `/tmp/jl_i3Z8lg/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.29.1 [bac558e1] OrderedCollections v1.8.1 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_i3Z8lg/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.0 [864edb3b] DataStructures v0.19.1 [8bb1440f] DelimitedFiles v1.9.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.2.0 [60bf3e95] GLPK v1.2.1 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [7600667b] JuDGE v0.5.3 [4076af6c] JuMP v1.29.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.44.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [276daf66] SpecialFunctions v2.5.1 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [856f2bd8] StructTypes v1.11.0 [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.6.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.11.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.1+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+1 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.5.0+2 Testing Running tests... Precompiling packages... 18251.1 ms ✓ JuDGE 1 dependency successfully precompiled in 19 seconds. 53 already precompiled. --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.248 Objective value of best integer-feasible solution: 50.0 Objective value of lower bound: 50.0 Solve time: 18.288s 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.864 3 of 3 | 5.400000e+01 5.200000e+01 | 2.000000e+00 3.846154e-02 | 0 | 2.190 Objective value of best integer-feasible solution: 52.0 Objective value of lower bound: 52.0 Solve time: 3.874s 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.005 3 of 3 | 4.453250e+01 4.331250e+01 | 1.220000e+00 2.816739e-02 | 0 | 0.006 Objective value of best integer-feasible solution: 44.5325 Objective value of lower bound: 44.5325 Solve time: 0.008s 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.004 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.006s 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.006 Objective value of best integer-feasible solution: 43.08 Objective value of lower bound: 43.08 Solve time: 0.007s 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) + 22: >>>>> 4.453250000e+01 >= 4.453250000e+01 0.0% (4; 0) + 22: mip = 4.453250000e+01 >= tree is empty 0.0% (0; 7) [ Info: Solved. Objective: 44.5325 Deterministic Equivalent Expansions Node 1: "big" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (3) 19: obj = 4.641250000e+01 inf = 0.000e+00 (0) * 21: obj = 4.216250000e+01 inf = 0.000e+00 (0) + 21: mip = not found yet >= -inf (1; 0) + 29: >>>>> 5.440500000e+01 >= 4.560750000e+01 16.2% (4; 0) + 31: >>>>> 4.560750000e+01 >= 4.560750000e+01 0.0% (3; 1) + 31: mip = 4.560750000e+01 >= tree is empty 0.0% (0; 7) [ 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) + 29: >>>>> 5.172000000e+01 >= 4.308000000e+01 16.7% (4; 0) + 31: >>>>> 4.308000000e+01 >= 4.308000000e+01 0.0% (3; 1) + 31: mip = 4.308000000e+01 >= tree is empty 0.0% (0; 7) [ Info: Solved. Objective: 43.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.481 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.229 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.231 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.231 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.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 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.005 3 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem -3.000000e+01 | -3.000000e+01 -3.000000e+01 | 3.552714e-14 1.184238e-15 | 0 | 0.006 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) * 21: obj = -3.000000000e+01 inf = 0.000e+00 (0) + 21: mip = not found yet >= -inf (1; 0) + 21: >>>>> -3.000000000e+01 >= -3.000000000e+01 0.0% (1; 0) + 21: 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.240000e+02 | 2.629722e+02 8.116427e-01 | 2 | 0.012 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 | 9.947598e-14 1.630012e-15 | 2 | 0.014 4 Solving master problem as MIP -6.102778e+01 | -6.101111e+01 -6.102778e+01 | 1.666667e-02 2.730997e-04 | 0 | 0.077 5* Convergence criteria met. Objective: -61.011111111111106 Re-solved Objective: -61.011111111111106 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 13 nodes [ Info: Building JuMP Model for node 1111111121131212112212313131132133s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (9) * 79: obj = -6.102777778e+01 inf = 0.000e+00 (0) + 79: mip = not found yet >= -inf (1; 0) + 80: >>>>> -6.101111111e+01 >= -6.101111111e+01 < 0.1% (2; 0) + 80: mip = -6.101111111e+01 >= tree is empty 0.0% (0; 3) [ Info: Solved. Deterministic Equivalent Objective: -61.01111111111114 Deterministic Equivalent Expansions Node 1: "papers_ordered" 14.0 Node 11: "papers_ordered" 20.000000000000004 Node 12: "papers_ordered" 9.999999999999996 Node 13: "papers_ordered" 10.000000000000005 [ 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.011 1 Solving subproblem for node 1 1/40Solving subproblem for node 11 2/40Solving subproblem for node 111 3/40Solving subproblem for node 1111 4/40Solving subproblem for node 1112 5/40Solving subproblem for node 1113 6/40Solving subproblem for node 112 7/40Solving subproblem for node 1121 8/40Solving subproblem for node 1122 9/40Solving subproblem for node 1123 10/40Solving subproblem for node 113 11/40Solving subproblem for node 1131 12/40Solving subproblem for node 1132 13/40Solving subproblem for node 1133 14/40Solving subproblem for node 12 15/40Solving subproblem for node 121 16/40Solving subproblem for node 1211 17/40Solving subproblem for node 1212 18/40Solving subproblem for node 1213 19/40Solving subproblem for node 122 20/40Solving subproblem for node 1221 21/40Solving subproblem for node 1222 22/40Solving subproblem for node 1223 23/40Solving subproblem for node 123 24/40Solving subproblem for node 1231 25/40Solving subproblem for node 1232 26/40Solving subproblem for node 1233 27/40Solving subproblem for node 13 28/40Solving subproblem for node 131 29/40Solving subproblem for node 1311 30/40Solving subproblem for node 1312 31/40Solving subproblem for node 1313 32/40Solving subproblem for node 132 33/40Solving subproblem for node 1321 34/40Solving subproblem for node 1322 35/40Solving subproblem for node 1323 36/40Solving subproblem for node 133 37/40Solving subproblem for node 1331 38/40Solving subproblem for node 1332 39/40Solving subproblem for node 1333 40/40Solving master problem 0.000000e+00 | 0.000000e+00 -Inf | Inf NaN | 0 | 0.017 2 Solving subproblem for node 1 1/40Solving subproblem for node 11 2/40Solving subproblem for node 111 3/40Solving subproblem for node 1111 4/40Solving subproblem for node 1112 5/40Solving subproblem for node 1113 6/40Solving subproblem for node 112 7/40Solving subproblem for node 1121 8/40Solving subproblem for node 1122 9/40Solving subproblem for node 1123 10/40Solving subproblem for node 113 11/40Solving subproblem for node 1131 12/40Solving subproblem for node 1132 13/40Solving subproblem for node 1133 14/40Solving subproblem for node 12 15/40Solving subproblem for node 121 16/40Solving subproblem for node 1211 17/40Solving subproblem for node 1212 18/40Solving subproblem for node 1213 19/40Solving subproblem for node 122 20/40Solving subproblem for node 1221 21/40Solving subproblem for node 1222 22/40Solving subproblem for node 1223 23/40Solving subproblem for node 123 24/40Solving subproblem for node 1231 25/40Solving subproblem for node 1232 26/40Solving subproblem for node 1233 27/40Solving subproblem for node 13 28/40Solving subproblem for node 131 29/40Solving subproblem for node 1311 30/40Solving subproblem for node 1312 31/40Solving subproblem for node 1313 32/40Solving subproblem for node 132 33/40Solving subproblem for node 1321 34/40Solving subproblem for node 1322 35/40Solving subproblem for node 1323 36/40Solving subproblem for node 133 37/40Solving subproblem for node 1331 38/40Solving subproblem for node 1332 39/40Solving subproblem for node 1333 40/40Solving master problem -9.061690e+01 | 0.000000e+00 -4.871111e+02 | 3.964942e+02 8.139708e-01 | 6 | 0.025 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 | -8.526513e-14 -9.409407e-16 | 6 | 0.029 4 Solving master problem as MIP -9.061690e+01 | -9.052593e+01 -9.061690e+01 | 9.097222e-02 1.003921e-03 | 0 | 0.035 5* Convergence criteria met. Objective: -90.525925925926 Re-solved Objective: -90.52592592592595 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (27) * 225: obj = -9.061689815e+01 inf = 0.000e+00 (0) 1 + 225: mip = not found yet >= -inf (1; 0) + 235: >>>>> -9.052592593e+01 >= -9.054681481e+01 < 0.1% (6; 0) + 238: 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.131 1 -1.387072e+01 | -1.387072e+01 -Inf | Inf NaN | 0 | 0.133 2 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.134 3 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.135 4 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.135 5* Stalled: exiting. Re-solved Objective: -13.94902462895646 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.004 2 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.005 3 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.006 4 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.007 5* Stalled: exiting. Re-solved Objective: -10.467188400194972 JuDGE Expansions Node 1: "stock" 0.44751499679888973 Node 11: "stock" 3.933488669532398 Node 12: "stock" 50.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+02 (14) 7: obj = 0.000000000e+00 inf = 0.000e+00 (0) * 36: obj = -1.046718871e+01 inf = 7.772e-16 (0) [ Info: Solved. Objective: -10.46718870851416 Deterministic Equivalent Expansions Node 1: "stock" 0.44751499679885853 Node 11: "stock" 3.9334958861658875 Node 12: "stock" 49.99999999999998 [ 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.004 2 -8.581523e+01 | -8.581523e+01 -Inf | Inf NaN | 0 | 0.005 3 -8.581523e+01 | -8.581523e+01 -Inf | Inf NaN | 0 | 0.005 4 -8.581523e+01 | -8.581523e+01 -Inf | Inf NaN | 0 | 0.005 5* Stalled: exiting. Re-solved Objective: -85.81522835638638 JuDGE Expansions Node 12: "stock" 17.5791263942445 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+02 (14) 7: obj = 0.000000000e+00 inf = 0.000e+00 (0) * 35: obj = -8.581522836e+01 inf = 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.004 2 -1.312500e+02 | -1.312500e+02 -1.387500e+02 | 7.500000e+00 5.405405e-02 | 0 | 0.005 3 -1.312500e+02 | -1.312500e+02 -1.312500e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.006 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) + 71: >>>>> -1.287500000e+02 >= -1.325000000e+02 2.9% (9; 8) + 75: >>>>> -1.312500000e+02 >= -1.312500000e+02 0.0% (7; 14) + 75: mip = -1.312500000e+02 >= tree is empty 0.0% (0; 31) [ 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.005 4 Convergence criteria met. Objective: -145.25 JuDGE Expansions Node 11: "bag" -2.0 Node 121: "bag" -2.0 Re-solved Objective: -145.25 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (4) * 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 39007, while current world is 39008. Stacktrace: [1] macro expansion @ ~/.julia/packages/MutableArithmetics/tNSBd/src/rewrite_generic.jl:313 [inlined] [2] macro expansion @ ~/.julia/packages/MutableArithmetics/tNSBd/src/rewrite.jl:371 [inlined] [3] macro expansion @ ~/.julia/packages/JuMP/N7h14/src/macros.jl:264 [inlined] [4] macro expansion @ ~/.julia/packages/JuMP/N7h14/src/macros/@constraint.jl:171 [inlined] [5] macro expansion @ ~/.julia/packages/JuMP/N7h14/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] knapsack_budget() @ Main ~/.julia/packages/JuDGE/yzb6J/examples/knapsacks.jl:693 [10] top-level scope @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:10 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [12] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:153 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [14] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:156 [inlined] [15] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:677 [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.966 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.919193e+03 | 2.391229e+01 1.245955e-02 | 0 | 1.009 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.942072e+03 | 1.942072e+03 1.921880e+03 | 2.019183e+01 1.050629e-02 | 0 | 1.055 3 Solving subproblem for node 11 1/27Solving subproblem for node 1111 2/27Solving subproblem for node 11112 3/27Solving subproblem for node 11121 4/27Solving subproblem for node 111211 5/27Solving subproblem for node 11122 6/27Solving subproblem for node 111222 7/27Solving subproblem for node 112 8/27Solving subproblem for node 1121 9/27Solving subproblem for node 112111 10/27Solving subproblem for node 112121 11/27Solving subproblem for node 1122 12/27Solving subproblem for node 112221 13/27Solving subproblem for node 12 14/27Solving subproblem for node 12111 15/27Solving subproblem for node 12112 16/27Solving subproblem for node 121122 17/27Solving subproblem for node 12121 18/27Solving subproblem for node 121211 19/27Solving subproblem for node 12122 20/27Solving subproblem for node 122 21/27Solving subproblem for node 1221 22/27Solving subproblem for node 12211 23/27Solving subproblem for node 122111 24/27Solving subproblem for node 1222 25/27Solving subproblem for node 122211 26/27Solving subproblem for node 12222 27/27Solving master problem 1.942027e+03 | 1.942027e+03 1.921880e+03 | 2.014692e+01 1.048292e-02 | 0 | 1.251 4 Solving subproblem for node 11112 1/14Solving subproblem for node 11121 2/14Solving subproblem for node 111211 3/14Solving subproblem for node 11122 4/14Solving subproblem for node 111222 5/14Solving subproblem for node 1121 6/14Solving subproblem for node 112111 7/14Solving subproblem for node 112221 8/14Solving subproblem for node 12111 9/14Solving subproblem for node 12122 10/14Solving subproblem for node 12211 11/14Solving subproblem for node 122111 12/14Solving subproblem for node 122211 13/14Solving subproblem for node 12222 14/14Solving master problem 1.942027e+03 | 1.942027e+03 1.921880e+03 | 2.014692e+01 1.048292e-02 | 0 | 1.266 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.932931e+03 | 1.932931e+03 1.923587e+03 | 9.344359e+00 4.857779e-03 | 0 | 1.308 6 Solving subproblem for node 11111 1/22Solving subproblem for node 111111 2/22Solving subproblem for node 111121 3/22Solving subproblem for node 111122 4/22Solving subproblem for node 1112 5/22Solving subproblem for node 111221 6/22Solving subproblem for node 11211 7/22Solving subproblem for node 11212 8/22Solving subproblem for node 11221 9/22Solving subproblem for node 11222 10/22Solving subproblem for node 112222 11/22Solving subproblem for node 121 12/22Solving subproblem for node 121112 13/22Solving subproblem for node 121121 14/22Solving subproblem for node 1212 15/22Solving subproblem for node 122112 16/22Solving subproblem for node 12212 17/22Solving subproblem for node 122121 18/22Solving subproblem for node 122122 19/22Solving subproblem for node 12221 20/22Solving subproblem for node 122221 21/22Solving subproblem for node 122222 22/22Solving master problem 1.932479e+03 | 1.932479e+03 1.923587e+03 | 8.892634e+00 4.622945e-03 | 0 | 1.327 7 Solving subproblem for node 11111 1/4Solving subproblem for node 111111 2/4Solving subproblem for node 111221 3/4Solving subproblem for node 121121 4/4Solving master problem 1.932479e+03 | 1.932479e+03 1.923587e+03 | 8.892634e+00 4.622945e-03 | 0 | 1.337 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.924775e+03 | 1.924775e+03 1.923587e+03 | 1.188128e+00 6.176626e-04 | 0 | 1.372 9 Solving subproblem for node 111112 1/13Solving subproblem for node 11121 2/13Solving subproblem for node 111212 3/13Solving subproblem for node 112112 4/13Solving subproblem for node 112122 5/13Solving subproblem for node 112211 6/13Solving subproblem for node 112212 7/13Solving subproblem for node 1211 8/13Solving subproblem for node 121211 9/13Solving subproblem for node 121212 10/13Solving subproblem for node 121221 11/13Solving subproblem for node 121222 12/13Solving subproblem for node 122212 13/13Solving master problem 1.924775e+03 | 1.924775e+03 1.923587e+03 | 1.188128e+00 6.176626e-04 | 0 | 1.388 10 Solving subproblem for node 111112 1/1Solving master problem 1.924775e+03 | 1.924775e+03 1.923587e+03 | 1.188128e+00 6.176626e-04 | 0 | 1.398 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.924299e+03 | 5.462033e-02 2.838452e-05 | 0 | 1.432 12 Solving subproblem for node 121111 1/1Solving master problem 1.924354e+03 | 1.924354e+03 1.924299e+03 | 5.462033e-02 2.838452e-05 | 0 | 1.443 13 Solving subproblem for node 1 1/63Solving subproblem for node 11 2/63Solving subproblem for node 111 3/63Solving subproblem for node 1111 4/63Solving subproblem for node 11111 5/63Solving subproblem for node 111111 6/63Solving subproblem for node 111112 7/63Solving subproblem for node 11112 8/63Solving subproblem for node 111121 9/63Solving subproblem for node 111122 10/63Solving subproblem for node 1112 11/63Solving subproblem for node 11121 12/63Solving subproblem for node 111211 13/63Solving subproblem for node 111212 14/63Solving subproblem for node 11122 15/63Solving subproblem for node 111221 16/63Solving subproblem for node 111222 17/63Solving subproblem for node 112 18/63Solving subproblem for node 1121 19/63Solving subproblem for node 11211 20/63Solving subproblem for node 112111 21/63Solving subproblem for node 112112 22/63Solving subproblem for node 11212 23/63Solving subproblem for node 112121 24/63Solving subproblem for node 112122 25/63Solving subproblem for node 1122 26/63Solving subproblem for node 11221 27/63Solving subproblem for node 112211 28/63Solving subproblem for node 112212 29/63Solving subproblem for node 11222 30/63Solving subproblem for node 112221 31/63Solving subproblem for node 112222 32/63Solving subproblem for node 12 33/63Solving subproblem for node 121 34/63Solving subproblem for node 1211 35/63Solving subproblem for node 12111 36/63Solving subproblem for node 121111 37/63Solving subproblem for node 121112 38/63Solving subproblem for node 12112 39/63Solving subproblem for node 121121 40/63Solving subproblem for node 121122 41/63Solving subproblem for node 1212 42/63Solving subproblem for node 12121 43/63Solving subproblem for node 121211 44/63Solving subproblem for node 121212 45/63Solving subproblem for node 12122 46/63Solving subproblem for node 121221 47/63Solving subproblem for node 121222 48/63Solving subproblem for node 122 49/63Solving subproblem for node 1221 50/63Solving subproblem for node 12211 51/63Solving subproblem for node 122111 52/63Solving subproblem for node 122112 53/63Solving subproblem for node 12212 54/63Solving subproblem for node 122121 55/63Solving subproblem for node 122122 56/63Solving subproblem for node 1222 57/63Solving subproblem for node 12221 58/63Solving subproblem for node 122211 59/63Solving subproblem for node 122212 60/63Solving subproblem for node 12222 61/63Solving subproblem for node 122221 62/63Solving subproblem for node 122222 63/63Solving master problem 1.924354e+03 | 1.924354e+03 1.924354e+03 | 0.000000e+00 0.000000e+00 | 0 | 1.478 14 Convergence criteria met. Objective: 1924.3540625394007 JuDGE Expansions Node 1: "new_capacity[Buffalo,Chicago]" 8.0 Node 1: "new_capacity[Austin,Denver]" 7.0 Node 1: "new_capacity[Buffalo,Erie]" 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[Austin,Chicago]" 10.0 Node 122222: "new_capacity[Buffalo,Denver]" 9.0 Re-solved Objective: 1924.3540625394003 [ 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) 1119: obj = 2.137319988e+03 inf = 2.220e-16 (0) 6 * 1448: obj = 1.922649230e+03 inf = 2.220e-16 (0) 3 + 1448: mip = not found yet >= -inf (1; 0) + 1607: >>>>> 1.924985887e+03 >= 1.923778004e+03 < 0.1% (57; 0) + 2649: mip = 1.924985887e+03 >= 1.924176674e+03 < 0.1% (424; 21) + 2925: >>>>> 1.924937089e+03 >= 1.924216036e+03 < 0.1% (592; 29) + 2948: >>>>> 1.924865328e+03 >= 1.924217575e+03 < 0.1% (576; 80) + 3201: >>>>> 1.924744770e+03 >= 1.924252403e+03 < 0.1% (611; 214) + 3804: >>>>> 1.924624212e+03 >= 1.924289847e+03 < 0.1% (621; 598) + 4407: >>>>> 1.924586814e+03 >= 1.924317157e+03 < 0.1% (699; 1005) + 4609: >>>>> 1.924549416e+03 >= 1.924324538e+03 < 0.1% (656; 1234) + 4667: >>>>> 1.924503653e+03 >= 1.924325030e+03 < 0.1% (581; 1401) + 4975: >>>>> 1.924466256e+03 >= 1.924331919e+03 < 0.1% (531; 1739) + 5176: >>>>> 1.924428858e+03 >= 1.924339300e+03 < 0.1% (517; 1951) + 5495: >>>>> 1.924391460e+03 >= 1.924346681e+03 < 0.1% (504; 2110) + 5851: >>>>> 1.924354063e+03 >= 1.924354063e+03 < 0.1% (394; 2518) + 5851: mip = 1.924354063e+03 >= tree is empty 0.0% (0; 3635) [ 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 39211, while current world is 39212. Stacktrace: [1] macro expansion @ ~/.julia/packages/MutableArithmetics/tNSBd/src/rewrite.jl:371 [inlined] [2] macro expansion @ ~/.julia/packages/JuMP/N7h14/src/macros.jl:264 [inlined] [3] macro expansion @ ~/.julia/packages/JuMP/N7h14/src/macros/@constraint.jl:171 [inlined] [4] (::var"#340#341"{Leaf, Model})(i::Int64) @ Main ~/.julia/packages/JuMP/N7h14/src/Containers/macro.jl:559 [5] #container##0 @ ~/.julia/packages/JuMP/N7h14/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:790 [8] map @ ./abstractarray.jl:3402 [inlined] [9] container @ ~/.julia/packages/JuMP/N7h14/src/Containers/container.jl:85 [inlined] [10] container @ ~/.julia/packages/JuMP/N7h14/src/Containers/container.jl:71 [inlined] [11] container @ ~/.julia/packages/JuMP/N7h14/src/Containers/container.jl:75 [inlined] [12] macro expansion @ ~/.julia/packages/JuMP/N7h14/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] cutting_stock(; seed::Int64, L::Int64, sizes::Vector{Int64}, test::Bool) @ Main ~/.julia/packages/JuDGE/yzb6J/examples/cutting_stock.jl:228 [17] top-level scope @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:10 [18] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [19] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:165 [inlined] [20] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [21] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:166 [inlined] [22] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:677 [inlined] [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.450000e+02 | 1.450000e+02 -Inf | Inf NaN | 0 | 0.002 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 6.500000e+01 | 6.500000e+01 6.500000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.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.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 4.850000e+01 | 4.850000e+01 4.850000e+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 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.948 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.952 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.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 8.700000e+01 | 8.700000e+01 6.000000e+01 | 2.700000e+01 4.500000e-01 | 0 | 0.005 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.006 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.005 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 8.437500e+01 | 8.437500e+01 4.087500e+01 | 4.350000e+01 1.064220e+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 4.087500e+01 | 1.200000e+01 2.935780e-01 | 0 | 0.012 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.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 8.700000e+01 | 8.700000e+01 -Inf | Inf NaN | 0 | 0.005 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 8.700000e+01 | 8.700000e+01 8.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.009 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.050000e+02 | 1.050000e+02 -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 7.700000e+01 | 7.700000e+01 2.100000e+01 | 5.600000e+01 2.666667e+00 | 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 7.700000e+01 | 7.700000e+01 7.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.050000e+02 | 1.050000e+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 7.700000e+01 | 7.700000e+01 -9.750000e+00 | 8.675000e+01 8.897436e+00 | 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 6.250000e+01 | 6.250000e+01 2.625000e+01 | 3.625000e+01 1.380952e+00 | 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.312500e+01 | 5.312500e+01 3.862500e+01 | 1.450000e+01 3.754045e-01 | 0 | 0.015 4 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.312500e+01 | 5.312500e+01 5.312500e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.019 5 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 7.700000e+01 | 7.700000e+01 -Inf | Inf NaN | 0 | 0.004 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 7.700000e+01 | 7.700000e+01 7.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 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.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.200000e+01 | 6.200000e+01 -Inf | Inf NaN | 0 | 0.008 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 6.200000e+01 | 6.200000e+01 6.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.012 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.008 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.650000e+02 | 1.650000e+02 1.650000e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.011 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 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.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 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.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 5.200000e+01 | 5.200000e+01 -Inf | Inf NaN | 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.200000e+01 | 5.200000e+01 5.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.012 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.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 5.200000e+01 | 5.200000e+01 -Inf | Inf NaN | 0 | 0.007 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.200000e+01 | 5.200000e+01 5.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.010 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.200000e+01 | 4.200000e+01 -Inf | Inf NaN | 0 | 0.002 2 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.200000e+01 | 4.200000e+01 4.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.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.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.008 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 4.200000e+01 | 4.200000e+01 4.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.012 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.005 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 4.200000e+01 | 4.200000e+01 -Inf | Inf NaN | 0 | 0.007 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 4.200000e+01 | 4.200000e+01 4.200000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.011 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 1.450000e+02 | 1.450000e+02 -Inf | Inf NaN | 0 | 0.001 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 9.700000e+01 | 9.700000e+01 9.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.002 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.450000e+02 | 1.450000e+02 -Inf | Inf NaN | 0 | 0.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.850000e+01 | 4.850000e+01 4.850000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.009 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 9.700000e+01 | 9.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 9.700000e+01 | 9.700000e+01 9.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 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.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.604688e+01 | 1.604688e+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 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.008 3 Solving master problem as MIP 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.008 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.004 1 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 6.287500e+01 | 6.287500e+01 -Inf | Inf NaN | 0 | 0.005 2 Solving master problem as MIP 6.287500e+01 | 6.287500e+01 -Inf | Inf NaN | 0 | 0.006 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.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 6.250000e-01 | 6.250000e-01 -Inf | Inf NaN | 0 | 0.003 3 Solving master problem as MIP 6.250000e-01 | 6.250000e-01 -Inf | Inf NaN | 0 | 0.003 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.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 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.007 3 Solving master problem as MIP 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.007 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.006 2 Solving master problem as MIP 1.253125e+02 | 1.253125e+02 -Inf | Inf NaN | 0 | 0.006 3* Stalled: exiting. WARNING: Method definition test_set_policy(Array{Int64, 1}, Array{Int64, 1}, Int64, Int64) in module Main at /home/pkgeval/.julia/packages/JuDGE/yzb6J/examples/set_policy_test.jl:9 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition test_set_policy_state(Array{Int64, 1}, Array{Int64, 1}) in module Main at /home/pkgeval/.julia/packages/JuDGE/yzb6J/examples/set_policy_test.jl:71 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition test_set_policy2(Array{Int64, 1}, Array{Int64, 1}, Int64, Int64) in module Main at /home/pkgeval/.julia/packages/JuDGE/yzb6J/examples/set_policy_test.jl:127 overwritten on the same line (check for duplicate calls to `include`). WARNING: Method definition test_set_policy_state2(Array{Int64, 1}, Array{Int64, 1}) in module Main at /home/pkgeval/.julia/packages/JuDGE/yzb6J/examples/set_policy_test.jl:188 overwritten on the same line (check for duplicate calls to `include`). [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 10: obj = 6.500000000e+01 inf = 0.000e+00 (0) * 16: obj = 6.500000000e+01 inf = 0.000e+00 (0) + 16: mip = not found yet >= -inf (1; 0) + 16: >>>>> 6.500000000e+01 >= 6.500000000e+01 0.0% (1; 0) + 16: mip = 6.500000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 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) 59: obj = 5.550000000e+01 inf = 9.005e-16 (0) * 77: obj = 5.287500000e+01 inf = 7.895e-16 (0) + 77: mip = not found yet >= -inf (1; 0) + 77: >>>>> 5.287500000e+01 >= 5.287500000e+01 0.0% (1; 0) + 77: mip = 5.287500000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.170e+02 (29) 36: obj = 8.700000000e+01 inf = 0.000e+00 (0) * 44: obj = 8.700000000e+01 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 8.700000000e+01 >= 8.700000000e+01 0.0% (1; 0) + 44: mip = 8.700000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 12: obj = 7.700000000e+01 inf = 0.000e+00 (0) * 18: obj = 7.700000000e+01 inf = 0.000e+00 (0) + 18: mip = not found yet >= -inf (1; 0) + 18: >>>>> 7.700000000e+01 >= 7.700000000e+01 0.0% (1; 0) + 18: 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.665e-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) * 67: obj = 6.200000000e+01 inf = 0.000e+00 (0) + 67: mip = not found yet >= -inf (1; 0) + 67: >>>>> 6.200000000e+01 >= 6.200000000e+01 0.0% (1; 0) + 67: 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) 52: obj = 5.200000000e+01 inf = 6.772e-15 (0) * 72: obj = 5.200000000e+01 inf = 1.554e-15 (0) + 72: mip = not found yet >= -inf (1; 0) + 72: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 72: mip = 5.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 4.370e+02 (29) 36: obj = 5.200000000e+01 inf = 0.000e+00 (0) * 44: obj = 5.200000000e+01 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 44: mip = 5.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 12: obj = 4.200000000e+01 inf = 0.000e+00 (0) * 18: obj = 4.200000000e+01 inf = 0.000e+00 (0) + 18: mip = not found yet >= -inf (1; 0) + 18: >>>>> 4.200000000e+01 >= 4.200000000e+01 0.0% (1; 0) + 18: mip = 4.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 52: obj = 4.200000000e+01 inf = 1.332e-15 (0) * 64: obj = 4.200000000e+01 inf = 8.882e-16 (0) + 64: mip = not found yet >= -inf (1; 0) + 64: >>>>> 4.200000000e+01 >= 4.200000000e+01 0.0% (1; 0) + 64: 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) 48: obj = 4.850000000e+01 inf = 0.000e+00 (0) * 65: obj = 4.850000000e+01 inf = 0.000e+00 (0) + 65: mip = not found yet >= -inf (1; 0) + 65: >>>>> 4.850000000e+01 >= 4.850000000e+01 0.0% (1; 0) + 65: mip = 4.850000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.970e+02 (29) 36: obj = 9.700000000e+01 inf = 0.000e+00 (0) * 44: obj = 9.700000000e+01 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 9.700000000e+01 >= 9.700000000e+01 0.0% (1; 0) + 44: mip = 9.700000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 15: obj = 1.257500000e+02 inf = 0.000e+00 (0) * 16: obj = 1.257500000e+02 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.200e+01 (22) 40: obj = 1.604687500e+01 inf = 0.000e+00 (0) * 48: obj = 1.604687500e+01 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.600e+01 (16) 40: obj = 6.287500000e+01 inf = 0.000e+00 (0) * 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) * 46: obj = 1.604687500e+01 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.200e+01 (12) 31: 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.274 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.428000e+02 | 1.428000e+02 1.320000e+01 | 1.296000e+02 9.818182e+00 | 0 | 1.280 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.411800e+02 | 1.411800e+02 1.320000e+01 | 1.279800e+02 9.695455e+00 | 0 | 1.285 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.276500e+01 | 4.276500e+01 2.513200e+01 | 1.763300e+01 7.016155e-01 | 0 | 1.291 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.276500e+01 | 4.276500e+01 2.513200e+01 | 1.763300e+01 7.016155e-01 | 0 | 1.295 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.276500e+01 | 4.276500e+01 2.513200e+01 | 1.763300e+01 7.016155e-01 | 0 | 1.300 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.276500e+01 | 4.276500e+01 3.027620e+01 | 1.248880e+01 4.124956e-01 | 0 | 1.305 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.276500e+01 | 4.276500e+01 3.027620e+01 | 1.248880e+01 4.124956e-01 | 0 | 1.309 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.276500e+01 | 4.276500e+01 3.580847e+01 | 6.956531e+00 1.942705e-01 | 0 | 1.314 9 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.681502e+01 | 5.949980e+00 1.616183e-01 | 0 | 1.319 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.681502e+01 | 5.949980e+00 1.616183e-01 | 0 | 1.323 11 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.681502e+01 | 5.949980e+00 1.616183e-01 | 0 | 1.329 12 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.681502e+01 | 5.949980e+00 1.616183e-01 | 0 | 1.334 13 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.880262e+01 | 3.962382e+00 1.021164e-01 | 0 | 1.339 14 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.880262e+01 | 3.962382e+00 1.021164e-01 | 0 | 1.344 15 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.880262e+01 | 3.962382e+00 1.021164e-01 | 0 | 1.350 16 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.880262e+01 | 3.962382e+00 1.021164e-01 | 0 | 1.355 17 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.954999e+01 | 3.215006e+00 8.128966e-02 | 0 | 1.359 18 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.962448e+01 | 3.140520e+00 7.925707e-02 | 0 | 1.364 19 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.276500e+01 | 4.276500e+01 3.968636e+01 | 3.078639e+00 7.757422e-02 | 0 | 1.370 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.255243e+01 | 4.276500e+01 3.968636e+01 | 2.866072e+00 7.221806e-02 | 5 | 1.375 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.235923e+01 | 4.276500e+01 3.968636e+01 | 2.672867e+00 6.734976e-02 | 4 | 1.380 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.235923e+01 | 4.276500e+01 3.968636e+01 | 2.672867e+00 6.734976e-02 | 4 | 1.385 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.208871e+01 | 4.208871e+01 3.968636e+01 | 2.402353e+00 6.053346e-02 | 0 | 1.390 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.208871e+01 | 4.208871e+01 3.968636e+01 | 2.402353e+00 6.053346e-02 | 0 | 1.395 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.208871e+01 | 4.208871e+01 3.968636e+01 | 2.402353e+00 6.053346e-02 | 0 | 1.399 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.208871e+01 | 4.208871e+01 3.979298e+01 | 2.295731e+00 5.769186e-02 | 0 | 1.405 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.194600e+01 | 4.208871e+01 4.032600e+01 | 1.620000e+00 4.017259e-02 | 5 | 1.410 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.153329e+01 | 4.153329e+01 4.032600e+01 | 1.207286e+00 2.993815e-02 | 0 | 1.415 29 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.149000e+01 | 4.153329e+01 4.032600e+01 | 1.164000e+00 2.886475e-02 | 2 | 1.419 30 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.149000e+01 | 4.153329e+01 4.032600e+01 | 1.164000e+00 2.886475e-02 | 2 | 1.424 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.136100e+01 | 4.136100e+01 4.032600e+01 | 1.035000e+00 2.566582e-02 | 0 | 1.429 32 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.136100e+01 | 4.136100e+01 4.032600e+01 | 1.035000e+00 2.566582e-02 | 0 | 1.434 33 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.136100e+01 | 4.136100e+01 4.035049e+01 | 1.010509e+00 2.504329e-02 | 0 | 1.439 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.136100e+01 | 4.136100e+01 4.035049e+01 | 1.010509e+00 2.504329e-02 | 0 | 1.444 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.136100e+01 | 4.136100e+01 4.035049e+01 | 1.010509e+00 2.504329e-02 | 0 | 1.449 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.136100e+01 | 4.136100e+01 4.035049e+01 | 1.010509e+00 2.504329e-02 | 0 | 1.454 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.045200e+01 | 3.870000e-01 9.566894e-03 | 0 | 1.458 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.045200e+01 | 3.870000e-01 9.566894e-03 | 0 | 1.464 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.052400e+01 | 3.150000e-01 7.773171e-03 | 0 | 1.468 40 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.052400e+01 | 2.880000e-01 7.106900e-03 | 0 | 1.473 41 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.052400e+01 | 2.880000e-01 7.106900e-03 | 0 | 1.477 42 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.057800e+01 | 2.340000e-01 5.766672e-03 | 0 | 1.558 43 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.057800e+01 | 2.340000e-01 5.766672e-03 | 0 | 1.563 44 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.069500e+01 | 1.170000e-01 2.875046e-03 | 0 | 1.567 45 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.081200e+01 | 0.000000e+00 0.000000e+00 | 0 | 1.572 46 Convergence criteria met. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.120e+02 (16) 99: obj = 4.081200000e+01 inf = 5.346e-17 (0) * 130: obj = 4.081200000e+01 inf = 5.346e-17 (0) + 130: mip = not found yet >= -inf (1; 0) + 130: >>>>> 4.081200000e+01 >= 4.081200000e+01 0.0% (1; 0) + 130: mip = 4.081200000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.302333e+02 | 2.302333e+02 -Inf | Inf NaN | 0 | 0.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.006 3 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.187842e+02 | 2.187842e+02 -Inf | Inf NaN | 0 | 0.007 4 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.184225e+02 | 2.184225e+02 -Inf | Inf NaN | 0 | 0.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.011 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.011 7 Solving master problem as MIP 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.011 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.010 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.011 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.012 7 Solving master problem as MIP 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.012 8* Stalled: exiting. JuDGE Expansions Node 1: "large_upgrade[a]" 0.3333333333333335 Node 1: "large_upgrade[b]" 0.4999999999999999 Node 1: "large_upgrade[c]" 0.16666666666666666 Node 11: "small_upgrade[c]" 1.0 Node 12: "small_upgrade[b]" 0.5000000000000002 Node 13: "small_upgrade[a]" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 46: obj = 2.192333333e+02 inf = 7.105e-15 (0) * 52: obj = 2.183350000e+02 inf = 1.281e-16 (0) [ Info: Solved. Deterministic Equivalent Expansions Node 1: "large_upgrade[a]" 0.3333333333333332 Node 1: "large_upgrade[b]" 0.49999999999999967 Node 1: "large_upgrade[c]" 0.16666666666666674 Node 11: "small_upgrade[c]" 1.0 Node 12: "small_upgrade[b]" 0.5000000000000011 Node 13: "small_upgrade[a]" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 30: obj = 2.275333333e+02 inf = 0.000e+00 (0) * 50: obj = 2.183350000e+02 inf = 0.000e+00 (0) [ Info: Solved. Deterministic Equivalent Expansions Node 1: "large_upgrade[a]" 0.3333333333333333 Node 1: "large_upgrade[b]" 0.5 Node 1: "large_upgrade[c]" 0.16666666666666666 Node 11: "small_upgrade[c]" 1.0 Node 12: "small_upgrade[b]" 0.5 Node 13: "small_upgrade[a]" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve_return_relaxation --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.003 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.580000e+02 | 2.580000e+02 -Inf | Inf NaN | 0 | 0.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.346667e+02 | 2.580000e+02 1.993333e+02 | 3.533333e+01 1.772575e-01 | 9 | 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.286667e+02 | 2.286667e+02 1.993333e+02 | 2.933333e+01 1.471572e-01 | 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.246667e+02 | 2.286667e+02 2.150000e+02 | 9.666667e+00 4.496124e-02 | 6 | 0.010 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.246667e+02 | 2.286667e+02 2.150000e+02 | 9.666667e+00 4.496124e-02 | 6 | 0.011 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.234444e+02 | 2.286667e+02 2.192222e+02 | 4.222222e+00 1.926001e-02 | 11 | 0.013 7 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.234444e+02 | 2.286667e+02 2.208889e+02 | 2.555556e+00 1.156942e-02 | 11 | 0.014 8 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.228333e+02 | 2.286667e+02 2.222222e+02 | 6.111111e-01 2.750000e-03 | 6 | 0.016 9 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.226667e+02 | 2.226667e+02 2.225000e+02 | 1.666667e-01 7.490637e-04 | 0 | 0.018 10 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.226667e+02 | 2.226667e+02 2.225000e+02 | 1.666667e-01 7.490637e-04 | 0 | 0.020 11 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.226667e+02 | 2.226667e+02 2.226667e+02 | -2.842171e-14 -1.276424e-16 | 0 | 0.022 12 Convergence criteria met. Performing final MIP solve Objective value of best integer-feasible solution: 222.66666666666666 Objective value of lower bound: 222.66666666666666 Solve time: 0.033s 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.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.436333e+02 | 2.436333e+02 2.137333e+02 | 2.990000e+01 1.398939e-01 | 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.378741e+02 | 2.436333e+02 2.137333e+02 | 2.414078e+01 1.129481e-01 | 15 | 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.316216e+02 | 2.436333e+02 2.137333e+02 | 1.788829e+01 8.369442e-02 | 15 | 0.009 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.286765e+02 | 2.436333e+02 2.159653e+02 | 1.271122e+01 5.885771e-02 | 10 | 0.011 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282679e+02 | 2.436333e+02 2.262359e+02 | 2.031909e+00 8.981373e-03 | 9 | 0.012 7 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282679e+02 | 2.436333e+02 2.278258e+02 | 4.420635e-01 1.940358e-03 | 9 | 0.014 8 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282114e+02 | 2.436333e+02 2.281135e+02 | 9.789005e-02 4.291287e-04 | 9 | 0.015 9 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282114e+02 | 2.436333e+02 2.282114e+02 | 2.842171e-14 1.245412e-16 | 9 | 0.017 10 Solving master problem as MIP 2.282114e+02 | 2.326000e+02 2.282114e+02 | 4.388618e+00 1.923050e-02 | 0 | 0.018 11* Convergence criteria met. Attempting to branch. Adding 2 new nodes to B&P tree. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 2 of 3 | 2.326000e+02 2.282114e+02 | 4.388618e+00 1.923050e-02 | 0 | 0.699 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.300526e+02 | Inf 2.282114e+02 | 1.841249e+00 8.068175e-03 | 5 | 0.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.300526e+02 | Inf 2.300526e+02 | 0.000000e+00 0.000000e+00 | 5 | 0.003 2 Solving master problem as MIP 2.300526e+02 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.004 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.704 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.350000e+02 | 2.350000e+02 2.304333e+02 | 4.566667e+00 1.981773e-02 | 0 | 0.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.350000e+02 | 2.350000e+02 2.349833e+02 | 1.666667e-02 7.092702e-05 | 0 | 0.004 2 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 4 of 5 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.708 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.326000e+02 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.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.326000e+02 | 2.326000e+02 2.323333e+02 | 2.666667e-01 1.147776e-03 | 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.326000e+02 | 2.326000e+02 2.326000e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.005 3 Convergence criteria met. Attempting to branch. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 5 of 5 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.714 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.308395e+02 | Inf 2.308395e+02 | 3.126388e-13 1.354356e-15 | 4 | 0.002 1 Solving master problem as MIP 2.308395e+02 | 2.362333e+02 2.308395e+02 | 5.393860e+00 2.336628e-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 6 of 7 | 2.326000e+02 2.308395e+02 | 1.760526e+00 7.626626e-03 | 0 | 0.718 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.433000e+02 | 2.433000e+02 2.429000e+02 | 4.000000e-01 1.646768e-03 | 0 | 0.003 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 7 of 7 | 2.326000e+02 2.308395e+02 | 1.760526e+00 7.626626e-03 | 0 | 0.721 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.331167e+02 | Inf 2.331167e+02 | 3.979039e-13 1.706888e-15 | 5 | 0.002 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.726s ┌ Warning: Dual variables not present; computing approximate probabilities. └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/utilities.jl:406 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 30: obj = 2.250000000e+02 inf = 0.000e+00 (0) * 50: obj = 2.156666667e+02 inf = 0.000e+00 (0) + 50: mip = not found yet >= -inf (1; 0) + 58: >>>>> 2.226666667e+02 >= 2.198333333e+02 1.3% (5; 0) + 68: mip = 2.226666667e+02 >= tree is empty 0.0% (0; 9) [ Info: Solved. [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 46: obj = 2.263333333e+02 inf = 7.105e-15 (0) * 53: obj = 2.216570175e+02 inf = 0.000e+00 (0) + 53: mip = not found yet >= -inf (1; 0) + 70: >>>>> 2.433000000e+02 >= 2.274903509e+02 6.5% (7; 0) + 113: >>>>> 2.326000000e+02 >= 2.314733333e+02 0.5% (11; 7) + 119: mip = 2.326000000e+02 >= tree is empty 0.0% (0; 31) [ Info: Solved. ┌ Warning: Dual variables not present; computing approximate probabilities. └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/utilities.jl:406 [ Info: Setting up wait-and-see problems [ Info: Establishing perfect foresight models for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem for scenario given by node 111111121113112111221123113111321133121112121213122112221223123112321233131113121313132113221323133113321333s...Complete [ Info: Solving wait-and-see problems [ Info: Setting up here-and-now problem [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving here-and-now problem Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | -5.888921e+00 -5.906797e+00 | 1.787603e-02 -3.026349e-03 | 0 | 0.189 3 of 5 | -5.888921e+00 -5.906797e+00 | 1.787603e-02 -3.026349e-03 | 0 | 0.295 6 of 7 | -5.888921e+00 -5.901540e+00 | 1.261949e-02 -2.138339e-03 | 0 | 0.555 7 of 9 | -5.888921e+00 -5.901540e+00 | 1.261949e-02 -2.138339e-03 | 0 | 0.650 8 of 11 | -5.888921e+00 -5.901388e+00 | 1.246651e-02 -2.112471e-03 | 0 | 0.738 9 of 11 | -5.888921e+00 -5.901388e+00 | 1.246651e-02 -2.112471e-03 | 0 | 0.774 10 of 13 | -5.888921e+00 -5.900661e+00 | 1.173974e-02 -1.989564e-03 | 0 | 0.848 11 of 15 | -5.888921e+00 -5.900661e+00 | 1.173974e-02 -1.989564e-03 | 0 | 0.972 14 of 15 | -5.888921e+00 -5.899032e+00 | 1.011113e-02 -1.714032e-03 | 0 | 1.047 15 of 17 | -5.888921e+00 -5.899032e+00 | 1.011113e-02 -1.714032e-03 | 0 | 1.138 16 of 19 | -5.889990e+00 -5.898974e+00 | 8.983382e-03 -1.522872e-03 | 0 | 1.215 17 of 21 | -5.889990e+00 -5.898974e+00 | 8.983382e-03 -1.522872e-03 | 0 | 1.335 Model 4 dominated. UB: -5.897178122861588, LB:-5.898818721225577 Model 5 dominated. UB: -5.897178122861588, LB:-5.898818721225577 12 of 21 | -5.897178e+00 -5.898819e+00 | 1.640598e-03 -2.781232e-04 | 0 | 1.396 13 of 21 | -5.897178e+00 -5.898819e+00 | 1.640598e-03 -2.781232e-04 | 0 | 1.453 Objective value of best integer-feasible solution: -5.897178122861588 Objective value of lower bound: -5.897178122861588 Solve time: 1.545s [ 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.029s [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 10 nodes [ Info: Building JuMP Model for node 11111X11X11212X12X11313X13X1s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | -5.589160e+00 -5.644961e+00 | 5.580110e-02 -9.885117e-03 | 0 | 0.035 3 of 5 | -5.589160e+00 -5.644961e+00 | 5.580110e-02 -9.885117e-03 | 0 | 0.045 4 of 5 | -5.589160e+00 -5.631335e+00 | 4.217522e-02 -7.489382e-03 | 0 | 0.050 5 of 7 | -5.589160e+00 -5.631335e+00 | 4.217522e-02 -7.489382e-03 | 0 | 0.060 6 of 7 | -5.589160e+00 -5.612412e+00 | 2.325157e-02 -4.142884e-03 | 0 | 0.064 7 of 7 | -5.589160e+00 -5.612412e+00 | 2.325157e-02 -4.142884e-03 | 0 | 0.069 Objective value of best integer-feasible solution: -5.589160162654409 Objective value of lower bound: -5.589160162654409 Solve time: 0.075s [ 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.082 3 of 5 | -5.751871e+00 -5.787502e+00 | 3.563072e-02 -6.156493e-03 | 0 | 0.119 Objective value of best integer-feasible solution: -5.777753449758681 Objective value of lower bound: -5.777753449758681 Solve time: 0.139s [ 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.138 3 of 5 | -5.883161e+00 -5.895420e+00 | 1.225964e-02 -2.079519e-03 | 0 | 0.211 4 of 7 | -5.883161e+00 -5.892868e+00 | 9.707005e-03 -1.647246e-03 | 0 | 0.256 5 of 9 | -5.883161e+00 -5.892868e+00 | 9.707005e-03 -1.647246e-03 | 0 | 0.316 6 of 9 | -5.890256e+00 -5.892618e+00 | 2.361851e-03 -4.008152e-04 | 0 | 0.330 7 of 11 | -5.890256e+00 -5.892618e+00 | 2.361851e-03 -4.008152e-04 | 0 | 0.360 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.388 11 of 11 | -5.890256e+00 -5.891813e+00 | 1.557672e-03 -2.643791e-04 | 0 | 0.421 Objective value of best integer-feasible solution: -5.890255785620322 Objective value of lower bound: -5.890255785620322 Solve time: 0.439s [ Info: HN obj: -5.897178122861587 [ Info: WS obj: -5.900965111808094 [ Info: EEV obj: -5.863704837305665 [ Info: RH obj: -5.8902557856203215 [ Info: EVPI: 0.003786988946506753 [ Info: VSS (EV policy): 0.03347328555592188 [ 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 5m55.2s Tree building | 4 4 28.5s Deterministic | 12 12 2m09.9s Multistage newsvendor | 4 4 13.2s Inventory | 5 5 7.4s Stochastic Knapsack | 2 1 3 28.5s Transportation network expansion | 1 1 53.6s Cutting stock | 1 1 17.3s Lag, duration, set_policy (Decomposition) | 9 9 8.3s Lag, duration, set_policy (Deterministic Equivalent) | 9 9 5.3s Variable Types / Starting solution | 2 2 22.1s Risk aversion and implied probabilities | 10 10 22.0s EVPI / VSS | 1 1 19.2s RNG of the outermost testset: Xoshiro(0xddba96f7ff2e9f6d, 0x939dd01bbd0d3b47, 0xec51648cd48df0c5, 0xbc2aead9a1f33224, 0x5b5769fecac26417) 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 375.49s ERROR: LoadError: Package JuDGE errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.12/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.12/Pkg/src/Operations.jl:2427 [3] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2280 [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.12/Pkg/src/API.jl:483 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:151 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:305 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:321 [12] _start() @ Base ./client.jl:554 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 446.63s: package tests unexpectedly errored