Package evaluation of JuDGE on Julia 1.13.0-DEV.1234 (bbaa34b41d*) started at 2025-10-01T17:29:08.823 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 10.05s ################################################################################ # Installation # Installing JuDGE... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [7600667b] + JuDGE v0.5.3 Updating `~/.julia/environments/v1.13/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.1 [864edb3b] + DataStructures v0.19.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff 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.45.0 [d8a4904e] + MutableArithmetics v1.6.6 [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.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.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.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 Installation completed after 5.56s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 43.42s ################################################################################ # Testing # Testing JuDGE Status `/tmp/jl_ILEDzz/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_ILEDzz/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.1 [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.1 [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.45.0 [d8a4904e] MutableArithmetics v1.6.6 [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.7.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.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.9.9 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.2+0 [efcefdf7] PCRE2_jll v10.46.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.67.1+0 [3f19e933] p7zip_jll v17.6.0+0 Testing Running tests... --1 --11 --111 --1111 --112 --1121 --12 --121 --1211 --12111 --12112 --1212 --1213 --1 --11 --111 --1111 --112 --1121 --12 --121 --1211 --12111 --12112 --1212 --1213 --A (1.0) --B (0.5) --D (0.4) --G (1.0) --E (0.6) --H (1.0) --C (0.5) --F (1.0) --I (0.6) --L (0.3333333333) --M (0.6666666667) --J (0.1) --K (0.3) --A (1.0) --B (0.5) --D (0.2) --G (0.2) --E (0.3) --H (0.3) --C (0.5) --F (0.5) --I (0.3) --L (0.09999999998999999) --M (0.20000000000999998) --J (0.05) --K (0.15) [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.225 Objective value of best integer-feasible solution: 50.0 Objective value of lower bound: 50.0 Solve time: 17.446s Re-solved Objective: 50.0 JuDGE Expansions Node 1: "big" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 Objective value of best integer-feasible solution: 52.0 Objective value of lower bound: 52.0 Solve time: 0.629s 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.176 3 of 3 | 4.453250e+01 4.331250e+01 | 1.220000e+00 2.816739e-02 | 0 | 1.522 Objective value of best integer-feasible solution: 44.5325 Objective value of lower bound: 44.5325 Solve time: 3.09s 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.008 3 of 3 | 4.560750e+01 4.416250e+01 | 1.445000e+00 3.272007e-02 | 0 | 0.020 Objective value of best integer-feasible solution: 45.6075 Objective value of lower bound: 45.6075 Solve time: 0.022s 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.009 3 of 3 | 4.228000e+01 4.100000e+01 | 1.280000e+00 3.121951e-02 | 0 | 0.010 Objective value of best integer-feasible solution: 42.28 Objective value of lower bound: 42.28 Solve time: 0.011s Re-solved Objective: 42.28 JuDGE Expansions Node 1: "small[2]" 1.0 Node 111: "small[1]" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 1 of 1 | Inf -Inf | Inf NaN | 0 | 0.000 2 of 3 | 4.548000e+01 4.180000e+01 | 3.680000e+00 8.803828e-02 | 0 | 0.010 3 of 3 | 4.308000e+01 4.180000e+01 | 1.280000e+00 3.062201e-02 | 0 | 0.010 Objective value of best integer-feasible solution: 43.08 Objective value of lower bound: 43.08 Solve time: 0.012s 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) + 23: >>>>> 4.288000000e+01 >= 4.228000000e+01 1.4% (5; 0) + 27: >>>>> 4.228000000e+01 >= 4.228000000e+01 0.0% (1; 5) + 27: mip = 4.228000000e+01 >= tree is empty 0.0% (0; 9) [ Info: Solved. Objective: 42.28 Deterministic Equivalent Expansions Node 1: "small[1]" 1.0 Node 111: "small[2]" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 3 nodes [ Info: Building JuMP Model for node 111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (3) 19: obj = 4.380000000e+01 inf = 2.220e-15 (0) * 21: obj = 3.980000000e+01 inf = 0.000e+00 (0) + 21: mip = not found yet >= -inf (1; 0) + 29: >>>>> 5.172000000e+01 >= 4.308000000e+01 16.7% (4; 0) + 31: >>>>> 4.308000000e+01 >= 4.308000000e+01 0.0% (3; 1) + 31: mip = 4.308000000e+01 >= tree is empty 0.0% (0; 7) [ Info: Solved. Objective: 43.080000000000005 Deterministic Equivalent Expansions Node 1: "small[2]" 1.0 Node 111: "small[1]" 1.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 2.584 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.359 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.361 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.361 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.010 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.012 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.013 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 | 2.131628e-14 7.105427e-16 | 0 | 0.013 4 Convergence criteria met. Objective: -30.0 Re-solved Objective: -30.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (3) * 22: obj = -3.000000000e+01 inf = 0.000e+00 (0) + 22: mip = not found yet >= -inf (1; 0) + 22: >>>>> -3.000000000e+01 >= -3.000000000e+01 0.0% (1; 0) + 22: mip = -3.000000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. Deterministic Equivalent Objective: -30.0 Deterministic Equivalent Expansions Node 1: "papers_ordered" 10.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 13 nodes [ Info: Building JuMP Model for node 1111111121131212112212313131132133s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 13 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/13Solving subproblem for node 11 2/13Solving subproblem for node 111 3/13Solving subproblem for node 112 4/13Solving subproblem for node 113 5/13Solving subproblem for node 12 6/13Solving subproblem for node 121 7/13Solving subproblem for node 122 8/13Solving subproblem for node 123 9/13Solving subproblem for node 13 10/13Solving subproblem for node 131 11/13Solving subproblem for node 132 12/13Solving subproblem for node 133 13/13Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.021 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.023 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.253333e+02 | 2.643056e+02 8.124146e-01 | 2 | 0.027 3 Solving subproblem for node 1 1/13Solving subproblem for node 11 2/13Solving subproblem for node 111 3/13Solving subproblem for node 112 4/13Solving subproblem for node 113 5/13Solving subproblem for node 12 6/13Solving subproblem for node 121 7/13Solving subproblem for node 122 8/13Solving subproblem for node 123 9/13Solving subproblem for node 13 10/13Solving subproblem for node 131 11/13Solving subproblem for node 132 12/13Solving subproblem for node 133 13/13Solving master problem -6.102778e+01 | 0.000000e+00 -6.102778e+01 | -2.131628e-14 -3.492882e-16 | 2 | 0.029 4 Solving master problem as MIP -6.102778e+01 | -6.101111e+01 -6.102778e+01 | 1.666667e-02 2.730997e-04 | 0 | 0.083 5* Convergence criteria met. Objective: -61.01111111111111 Re-solved Objective: -61.011111111111106 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 13 nodes [ Info: Building JuMP Model for node 1111111121131212112212313131132133s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (9) * 74: obj = -6.102777778e+01 inf = 0.000e+00 (0) + 74: mip = not found yet >= -inf (1; 0) + 75: >>>>> -6.101111111e+01 >= -6.101111111e+01 < 0.1% (2; 0) + 75: mip = -6.101111111e+01 >= tree is empty 0.0% (0; 3) [ Info: Solved. Deterministic Equivalent Objective: -61.01111111111111 Deterministic Equivalent Expansions Node 1: "papers_ordered" 14.0 Node 11: "papers_ordered" 20.0 Node 12: "papers_ordered" 10.0 Node 13: "papers_ordered" 10.0 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 40 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/40Solving subproblem for node 11 2/40Solving subproblem for node 111 3/40Solving subproblem for node 1111 4/40Solving subproblem for node 1112 5/40Solving subproblem for node 1113 6/40Solving subproblem for node 112 7/40Solving subproblem for node 1121 8/40Solving subproblem for node 1122 9/40Solving subproblem for node 1123 10/40Solving subproblem for node 113 11/40Solving subproblem for node 1131 12/40Solving subproblem for node 1132 13/40Solving subproblem for node 1133 14/40Solving subproblem for node 12 15/40Solving subproblem for node 121 16/40Solving subproblem for node 1211 17/40Solving subproblem for node 1212 18/40Solving subproblem for node 1213 19/40Solving subproblem for node 122 20/40Solving subproblem for node 1221 21/40Solving subproblem for node 1222 22/40Solving subproblem for node 1223 23/40Solving subproblem for node 123 24/40Solving subproblem for node 1231 25/40Solving subproblem for node 1232 26/40Solving subproblem for node 1233 27/40Solving subproblem for node 13 28/40Solving subproblem for node 131 29/40Solving subproblem for node 1311 30/40Solving subproblem for node 1312 31/40Solving subproblem for node 1313 32/40Solving subproblem for node 132 33/40Solving subproblem for node 1321 34/40Solving subproblem for node 1322 35/40Solving subproblem for node 1323 36/40Solving subproblem for node 133 37/40Solving subproblem for node 1331 38/40Solving subproblem for node 1332 39/40Solving subproblem for node 1333 40/40Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.089 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.094 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.884444e+02 | 3.978275e+02 8.144786e-01 | 6 | 0.102 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 | 0.000000e+00 0.000000e+00 | 6 | 0.107 4 Solving master problem as MIP -9.061690e+01 | -9.052593e+01 -9.061690e+01 | 9.097222e-02 1.003921e-03 | 0 | 0.114 5* Convergence criteria met. Objective: -90.52592592592599 Re-solved Objective: -90.52592592592595 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 40 nodes [ Info: Building JuMP Model for node 1111111111111211131121121112211231131131113211331212112111212121312212211222122312312311232123313131131113121313132132113221323133133113321333s...Complete [ Info: Skipping checks of sub-problem format [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation * 0: obj = 0.000000000e+00 inf = 0.000e+00 (27) * 218: obj = -9.061689815e+01 inf = 0.000e+00 (0) 1 + 218: mip = not found yet >= -inf (1; 0) + 228: >>>>> -9.052592593e+01 >= -9.054681481e+01 < 0.1% (6; 0) + 231: 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.183 1 -1.387072e+01 | -1.387072e+01 -Inf | Inf NaN | 0 | 0.184 2 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.184 3 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.185 4 -1.394902e+01 | -1.394902e+01 -Inf | Inf NaN | 0 | 0.185 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.012 1 -9.904461e+00 | -9.904461e+00 -Inf | Inf NaN | 0 | 0.013 2 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.014 3 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.014 4 -1.046719e+01 | -1.046719e+01 -Inf | Inf NaN | 0 | 0.015 5* Stalled: exiting. Re-solved Objective: -10.46718840019497 JuDGE Expansions Node 1: "stock" 0.4475149967988897 Node 11: "stock" 3.933488669532393 Node 12: "stock" 50.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 ┌ Warning: Expansion or shutdown variable in == constraint └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/model_verification.jl:306 Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+02 (14) 7: obj = 0.000000000e+00 inf = 0.000e+00 (0) * 35: obj = -1.046718871e+01 inf = 0.000e+00 (0) [ Info: Solved. Objective: -10.467188708514165 Deterministic Equivalent Expansions Node 1: "stock" 0.4475149967989136 Node 11: "stock" 3.9334958861659266 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.013 1 -8.399189e+01 | -8.399189e+01 -Inf | Inf NaN | 0 | 0.014 2 -8.581523e+01 | -8.581523e+01 -Inf | Inf NaN | 0 | 0.015 3 -8.581523e+01 | -8.581523e+01 -Inf | Inf NaN | 0 | 0.015 4 -8.581523e+01 | -8.581523e+01 -Inf | Inf NaN | 0 | 0.015 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.81522835638637 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.012 1 -1.112500e+02 | -1.112500e+02 -1.362500e+02 | 2.500000e+01 1.834862e-01 | 0 | 0.014 2 -1.312500e+02 | -1.312500e+02 -1.362500e+02 | 5.000000e+00 3.669725e-02 | 0 | 0.015 3 -1.312500e+02 | -1.312500e+02 -1.312500e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.016 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.312500000e+02 >= -1.337500000e+02 1.9% (7; 6) + 83: mip = -1.312500000e+02 >= tree is empty 0.0% (0; 21) [ Info: Solved. Deterministic Equivalent Objective: -131.25 [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes [ Info: Building JuMP Model for node 11111111212121122s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 7 nodes Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter 0.000000e+00 | 0.000000e+00 -Inf | Inf NaN | 0 | 0.012 1 -1.452500e+02 | -1.452500e+02 -1.587500e+02 | 1.350000e+01 8.503937e-02 | 0 | 0.014 2 -1.452500e+02 | -1.452500e+02 -1.587500e+02 | 1.350000e+01 8.503937e-02 | 0 | 0.015 3 -1.452500e+02 | -1.452500e+02 -1.452500e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.016 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 39802, while current world is 39803. Stacktrace: [1] macro expansion @ ~/.julia/packages/MutableArithmetics/VMS0x/src/rewrite_generic.jl:313 [inlined] [2] macro expansion @ ~/.julia/packages/MutableArithmetics/VMS0x/src/rewrite.jl:374 [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] kwcall(::@NamedTuple{sideconstraints::var"#budget#knapsack_budget##30"{Vector{Int64}, Int64, Dict{AbstractTree, Int64}}}, ::Type{JuDGEModel}, tree::Tree, probabilities::Function, sub_problem_builder::Function, solver::MathOptInterface.OptimizerWithAttributes) @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/decomposition.jl:127 [10] knapsack_budget() @ Main ~/.julia/packages/JuDGE/yzb6J/examples/knapsacks.jl:693 [11] top-level scope @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:10 [12] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [13] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:153 [inlined] [14] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [15] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:156 [inlined] [16] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:748 [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.980 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.917229e+03 | 2.587662e+01 1.349688e-02 | 0 | 1.022 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.941996e+03 | 1.941996e+03 1.922608e+03 | 1.938857e+01 1.008452e-02 | 0 | 1.067 3 Solving subproblem for node 11 1/30Solving subproblem for node 111 2/30Solving subproblem for node 1111 3/30Solving subproblem for node 11111 4/30Solving subproblem for node 11112 5/30Solving subproblem for node 111121 6/30Solving subproblem for node 111122 7/30Solving subproblem for node 11121 8/30Solving subproblem for node 11122 9/30Solving subproblem for node 112 10/30Solving subproblem for node 1121 11/30Solving subproblem for node 11212 12/30Solving subproblem for node 112121 13/30Solving subproblem for node 11221 14/30Solving subproblem for node 112212 15/30Solving subproblem for node 11222 16/30Solving subproblem for node 112221 17/30Solving subproblem for node 112222 18/30Solving subproblem for node 12 19/30Solving subproblem for node 121 20/30Solving subproblem for node 12111 21/30Solving subproblem for node 121112 22/30Solving subproblem for node 121211 23/30Solving subproblem for node 121212 24/30Solving subproblem for node 12122 25/30Solving subproblem for node 122 26/30Solving subproblem for node 122111 27/30Solving subproblem for node 122121 28/30Solving subproblem for node 122211 29/30Solving subproblem for node 122221 30/30Solving master problem 1.941137e+03 | 1.941137e+03 1.922608e+03 | 1.852972e+01 9.637805e-03 | 0 | 1.160 4 Solving subproblem for node 111 1/15Solving subproblem for node 11111 2/15Solving subproblem for node 111121 3/15Solving subproblem for node 111122 4/15Solving subproblem for node 11122 5/15Solving subproblem for node 1121 6/15Solving subproblem for node 112221 7/15Solving subproblem for node 112222 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 12111 11/15Solving subproblem for node 121211 12/15Solving subproblem for node 12122 13/15Solving subproblem for node 122 14/15Solving subproblem for node 122211 15/15Solving master problem 1.941137e+03 | 1.941137e+03 1.922608e+03 | 1.852972e+01 9.637805e-03 | 0 | 1.175 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.932810e+03 | 1.932810e+03 1.923031e+03 | 9.778377e+00 5.084876e-03 | 0 | 1.216 6 Solving subproblem for node 111111 1/20Solving subproblem for node 111112 2/20Solving subproblem for node 1112 3/20Solving subproblem for node 111222 4/20Solving subproblem for node 11211 5/20Solving subproblem for node 112111 6/20Solving subproblem for node 112122 7/20Solving subproblem for node 1122 8/20Solving subproblem for node 1211 9/20Solving subproblem for node 121111 10/20Solving subproblem for node 12112 11/20Solving subproblem for node 121122 12/20Solving subproblem for node 1212 13/20Solving subproblem for node 12121 14/20Solving subproblem for node 121221 15/20Solving subproblem for node 121222 16/20Solving subproblem for node 1221 17/20Solving subproblem for node 122122 18/20Solving subproblem for node 1222 19/20Solving subproblem for node 122212 20/20Solving master problem 1.932454e+03 | 1.932454e+03 1.923031e+03 | 9.422312e+00 4.899718e-03 | 0 | 1.234 7 Solving subproblem for node 111111 1/4Solving subproblem for node 111112 2/4Solving subproblem for node 111222 3/4Solving subproblem for node 121111 4/4Solving master problem 1.932454e+03 | 1.932454e+03 1.923031e+03 | 9.422312e+00 4.899718e-03 | 0 | 1.245 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.925557e+03 | 1.925557e+03 1.923676e+03 | 1.880741e+00 9.776806e-04 | 0 | 1.283 9 Solving subproblem for node 111211 1/10Solving subproblem for node 111212 2/10Solving subproblem for node 111221 3/10Solving subproblem for node 112112 4/10Solving subproblem for node 112211 5/10Solving subproblem for node 121121 6/10Solving subproblem for node 12211 7/10Solving subproblem for node 12212 8/10Solving subproblem for node 12221 9/10Solving subproblem for node 12222 10/10Solving master problem 1.925557e+03 | 1.925557e+03 1.923676e+03 | 1.880741e+00 9.776806e-04 | 0 | 1.298 10 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.923824e+03 | 5.302128e-01 2.756036e-04 | 0 | 1.332 11 Solving subproblem for node 122112 1/2Solving subproblem for node 122222 2/2Solving master problem 1.924354e+03 | 1.924354e+03 1.923824e+03 | 5.302128e-01 2.756036e-04 | 0 | 1.343 12 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.376 13 Convergence criteria met. Objective: 1924.3540625394007 JuDGE Expansions Node 1: "new_capacity[Austin,Denver]" 7.0 Node 1: "new_capacity[Buffalo,Erie]" 8.0 Node 1: "new_capacity[Buffalo,Chicago]" 8.0 Node 1111: "new_capacity[Austin,Denver]" 7.0 Node 111112: "new_capacity[Austin,Chicago]" 10.0 Node 111112: "new_supply[Austin]" 30.0 Node 11112: "new_capacity[Buffalo,Erie]" 8.0 Node 111121: "new_capacity[Austin,Chicago]" 10.0 Node 111121: "new_supply[Austin]" 30.0 Node 111122: "new_capacity[Austin,Chicago]" 10.0 Node 111122: "new_supply[Austin]" 30.0 Node 1112: "new_capacity[Austin,Denver]" 7.0 Node 1112: "new_capacity[Buffalo,Erie]" 8.0 Node 111211: "new_capacity[Austin,Chicago]" 10.0 Node 111211: "new_supply[Austin]" 30.0 Node 111212: "new_capacity[Austin,Chicago]" 10.0 Node 111212: "new_supply[Austin]" 30.0 Node 11122: "new_capacity[Austin,Chicago]" 10.0 Node 11122: "new_supply[Austin]" 30.0 Node 112: "new_capacity[Austin,Denver]" 7.0 Node 112: "new_capacity[Buffalo,Erie]" 8.0 Node 112111: "new_capacity[Austin,Chicago]" 10.0 Node 112111: "new_supply[Austin]" 30.0 Node 112112: "new_capacity[Austin,Chicago]" 10.0 Node 112112: "new_supply[Austin]" 30.0 Node 11212: "new_capacity[Austin,Chicago]" 10.0 Node 11212: "new_supply[Austin]" 30.0 Node 1122: "new_capacity[Austin,Chicago]" 10.0 Node 1122: "new_supply[Austin]" 30.0 Node 12: "new_capacity[Austin,Denver]" 7.0 Node 12: "new_capacity[Buffalo,Erie]" 8.0 Node 121111: "new_capacity[Austin,Chicago]" 10.0 Node 121111: "new_supply[Austin]" 30.0 Node 121112: "new_capacity[Austin,Chicago]" 10.0 Node 121112: "new_supply[Austin]" 30.0 Node 12112: "new_capacity[Austin,Chicago]" 10.0 Node 12112: "new_supply[Austin]" 30.0 Node 1212: "new_capacity[Austin,Chicago]" 10.0 Node 1212: "new_supply[Austin]" 30.0 Node 122: "new_capacity[Austin,Chicago]" 10.0 Node 122: "new_supply[Austin]" 30.0 Node 122222: "new_capacity[Buffalo,Denver]" 9.0 Node 122222: "new_capacity[Austin,Chicago]" 10.0 Re-solved Objective: 1924.3540625394005 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 63 nodes [ Info: Building JuMP Model for node 111111111111111111111111112111121111211111221112111211112111112121112211122111122211211211121111211111211211212112121112122112211221112211112212112221122211122221212112111211112111112111212112121121121122121212121121211121212121221212211212221221221122111221111221121221212212112212212221222112221112221212222122221122222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 4.455e+03 (189) 1086: obj = 2.114371167e+03 inf = 1.255e-14 (0) 6 * 1388: obj = 1.922649230e+03 inf = 4.441e-16 (0) 3 + 1388: mip = not found yet >= -inf (1; 0) + 1543: >>>>> 1.924985887e+03 >= 1.923819386e+03 < 0.1% (55; 0) + 2366: >>>>> 1.924937089e+03 >= 1.924206963e+03 < 0.1% (407; 21) + 2484: >>>>> 1.924865328e+03 >= 1.924221307e+03 < 0.1% (438; 60) + 2963: >>>>> 1.924744770e+03 >= 1.924256632e+03 < 0.1% (590; 160) + 3511: >>>>> 1.924624212e+03 >= 1.924289847e+03 < 0.1% (583; 521) + 4066: >>>>> 1.924586814e+03 >= 1.924317157e+03 < 0.1% (645; 860) + 4223: >>>>> 1.924549416e+03 >= 1.924324538e+03 < 0.1% (587; 1095) + 4274: >>>>> 1.924503653e+03 >= 1.924325030e+03 < 0.1% (494; 1292) + 4494: >>>>> 1.924466256e+03 >= 1.924331919e+03 < 0.1% (416; 1627) + 4698: >>>>> 1.924428858e+03 >= 1.924339300e+03 < 0.1% (403; 1843) + 4912: >>>>> 1.924391460e+03 >= 1.924346681e+03 < 0.1% (391; 1954) + 5179: >>>>> 1.924354063e+03 >= 1.924354063e+03 0.0% (311; 2252) + 5179: mip = 1.924354063e+03 >= tree is empty 0.0% (0; 3143) [ 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 40006, while current world is 40007. Stacktrace: [1] macro expansion @ ~/.julia/packages/MutableArithmetics/VMS0x/src/rewrite.jl:374 [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:828 [8] map @ ./abstractarray.jl:3423 [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] kwcall(::@NamedTuple{sideconstraints::var"#meet_demand#339"{Int64}, check::Bool}, ::Type{JuDGEModel}, tree::Leaf, probabilities::Function, sub_problem_builder::Function, solver::MathOptInterface.OptimizerWithAttributes) @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/decomposition.jl:127 [17] cutting_stock(; seed::Int64, L::Int64, sizes::Vector{Int64}, test::Bool) @ Main ~/.julia/packages/JuDGE/yzb6J/examples/cutting_stock.jl:228 [18] kwcall(::@NamedTuple{test::Bool}, ::typeof(cutting_stock)) @ Main ~/.julia/packages/JuDGE/yzb6J/examples/cutting_stock.jl:11 [19] top-level scope @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:10 [20] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [21] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:165 [inlined] [22] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1952 [inlined] [23] macro expansion @ ~/.julia/packages/JuDGE/yzb6J/test/runtests.jl:166 [inlined] [24] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:748 [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.010 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.011 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.026 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.028 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.857 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.859 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.009 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.010 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.011 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.200000e+02 | 1.200000e+02 -Inf | Inf NaN | 0 | 0.027 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.550000e+01 | 5.550000e+01 4.350000e+01 | 1.200000e+01 2.758621e-01 | 0 | 0.030 2 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.287500e+01 | 5.287500e+01 4.612500e+01 | 6.750000e+00 1.463415e-01 | 0 | 0.032 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.035 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.028 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.030 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.009 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.009 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 5.000000e+01 | 2.700000e+01 5.400000e-01 | 0 | 0.010 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 7.700000e+01 | 7.700000e+01 7.700000e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.011 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 1.050000e+02 | 1.050000e+02 -Inf | Inf NaN | 0 | 0.027 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 4.750000e+00 | 7.225000e+01 1.521053e+01 | 0 | 0.029 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.032 3 Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 5.312500e+01 | 5.312500e+01 5.312500e+01 | 0.000000e+00 0.000000e+00 | 0 | 0.035 4 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 7.700000e+01 | 7.700000e+01 -Inf | Inf NaN | 0 | 0.027 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.030 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.008 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.010 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.011 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.029 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.032 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.034 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.026 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.028 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.031 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.009 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.009 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.010 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.026 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.027 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.030 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.027 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.029 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.031 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.009 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.010 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.010 3 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.035 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.037 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.038 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.024 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.026 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.027 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.007 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.008 2 Convergence criteria met. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem 1.450000e+02 | 1.450000e+02 -Inf | Inf NaN | 0 | 0.024 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.026 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.026 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.029 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.008 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.008 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.009 3 Solving master problem as MIP 1.257500e+02 | 1.257500e+02 -Inf | Inf NaN | 0 | 0.009 4* Stalled: exiting. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.024 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.027 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.029 3 Solving master problem as MIP 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.030 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.024 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.026 2 Solving master problem as MIP 6.287500e+01 | 6.287500e+01 -Inf | Inf NaN | 0 | 0.027 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.008 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.009 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.009 3 Solving master problem as MIP 6.250000e-01 | 6.250000e-01 -Inf | Inf NaN | 0 | 0.010 4* Stalled: exiting. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 15 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/15Solving subproblem for node 11 2/15Solving subproblem for node 111 3/15Solving subproblem for node 1111 4/15Solving subproblem for node 1112 5/15Solving subproblem for node 112 6/15Solving subproblem for node 1121 7/15Solving subproblem for node 1122 8/15Solving subproblem for node 12 9/15Solving subproblem for node 121 10/15Solving subproblem for node 1211 11/15Solving subproblem for node 1212 12/15Solving subproblem for node 122 13/15Solving subproblem for node 1221 14/15Solving subproblem for node 1222 15/15Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.025 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.029 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.030 3 Solving master problem as MIP 1.604688e+01 | 1.604688e+01 -Inf | Inf NaN | 0 | 0.031 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.032 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.034 2 Solving master problem as MIP 1.253125e+02 | 1.253125e+02 -Inf | Inf NaN | 0 | 0.034 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) 58: obj = 5.550000000e+01 inf = 0.000e+00 (0) * 78: obj = 5.287500000e+01 inf = 0.000e+00 (0) + 78: mip = not found yet >= -inf (1; 0) + 78: >>>>> 5.287500000e+01 >= 5.287500000e+01 0.0% (1; 0) + 78: 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) * 65: obj = 6.200000000e+01 inf = 0.000e+00 (0) + 65: mip = not found yet >= -inf (1; 0) + 65: >>>>> 6.200000000e+01 >= 6.200000000e+01 0.0% (1; 0) + 65: mip = 6.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 3.370e+02 (25) 36: obj = 1.650000000e+02 inf = 0.000e+00 (0) * 44: obj = 1.650000000e+02 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 1.650000000e+02 >= 1.650000000e+02 0.0% (1; 0) + 44: mip = 1.650000000e+02 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 10: obj = 5.200000000e+01 inf = 0.000e+00 (0) * 18: obj = 5.200000000e+01 inf = 0.000e+00 (0) + 18: mip = not found yet >= -inf (1; 0) + 18: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 18: mip = 5.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 50: obj = 5.200000000e+01 inf = 0.000e+00 (0) * 66: obj = 5.200000000e+01 inf = 0.000e+00 (0) + 66: mip = not found yet >= -inf (1; 0) + 66: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 66: mip = 5.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 4.370e+02 (29) 36: obj = 5.200000000e+01 inf = 0.000e+00 (0) * 44: obj = 5.200000000e+01 inf = 0.000e+00 (0) + 44: mip = not found yet >= -inf (1; 0) + 44: >>>>> 5.200000000e+01 >= 5.200000000e+01 0.0% (1; 0) + 44: mip = 5.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.000e+00 (2) 12: obj = 4.200000000e+01 inf = 0.000e+00 (0) * 17: obj = 4.200000000e+01 inf = 0.000e+00 (0) + 17: mip = not found yet >= -inf (1; 0) + 17: >>>>> 4.200000000e+01 >= 4.200000000e+01 0.0% (1; 0) + 17: mip = 4.200000000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 7.000e+00 (7) 50: obj = 4.200000000e+01 inf = 1.998e-15 (0) * 65: obj = 4.200000000e+01 inf = 1.110e-15 (0) + 65: mip = not found yet >= -inf (1; 0) + 65: >>>>> 4.200000000e+01 >= 4.200000000e+01 0.0% (1; 0) + 65: 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) 49: obj = 4.850000000e+01 inf = 0.000e+00 (0) * 66: obj = 4.850000000e+01 inf = 0.000e+00 (0) + 66: mip = not found yet >= -inf (1; 0) + 66: >>>>> 4.850000000e+01 >= 4.850000000e+01 0.0% (1; 0) + 66: 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) * 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.600e+01 (16) 40: obj = 6.287500000e+01 inf = 0.000e+00 (0) * 47: obj = 6.287500000e+01 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111111111s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 6.000e+00 (6) 12: obj = 6.250000000e-01 inf = 0.000e+00 (0) * 14: obj = 6.250000000e-01 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 2.200e+01 (22) 40: obj = 1.604687500e+01 inf = 0.000e+00 (0) * 48: obj = 1.604687500e+01 inf = 0.000e+00 (0) [ Info: Solved. [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 15 nodes [ Info: Building JuMP Model for node 1111111111111211211211122121211211121212212211222s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.200e+01 (12) 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.281 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.656600e+02 | 1.656600e+02 2.058000e+01 | 1.450800e+02 7.049563e+00 | 0 | 1.287 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.872975e+01 | 1.656600e+02 2.058000e+01 | 2.814975e+01 1.367821e+00 | 5 | 1.292 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.593480e+01 | 1.656600e+02 2.058000e+01 | 2.535480e+01 1.232012e+00 | 14 | 1.295 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.562829e+01 | 1.656600e+02 2.058000e+01 | 2.504829e+01 1.217118e+00 | 14 | 1.300 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.456500e+01 | 4.456500e+01 2.158976e+01 | 2.297524e+01 1.064173e+00 | 0 | 1.305 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.404122e+01 | 4.456500e+01 2.273180e+01 | 2.130942e+01 9.374278e-01 | 17 | 1.310 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.361635e+01 | 4.456500e+01 2.932503e+01 | 1.429132e+01 4.873420e-01 | 12 | 1.314 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.338751e+01 | 4.456500e+01 2.957682e+01 | 1.381069e+01 4.669431e-01 | 12 | 1.317 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.314273e+01 | 4.456500e+01 3.153166e+01 | 1.161107e+01 3.682352e-01 | 11 | 1.321 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.288646e+01 | 4.456500e+01 3.406612e+01 | 8.820337e+00 2.589182e-01 | 9 | 1.326 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.287273e+01 | 4.456500e+01 3.406612e+01 | 8.806611e+00 2.585152e-01 | 8 | 1.330 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.281200e+01 | 4.456500e+01 3.465543e+01 | 8.156569e+00 2.353619e-01 | 6 | 1.333 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.278720e+01 | 4.456500e+01 3.465543e+01 | 8.131765e+00 2.346462e-01 | 5 | 1.338 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.720420e+01 | 5.560799e+00 1.494670e-01 | 0 | 1.342 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.274605e+01 | 4.276500e+01 3.874479e+01 | 4.001266e+00 1.032724e-01 | 5 | 1.345 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.274382e+01 | 4.276500e+01 3.975521e+01 | 2.988613e+00 7.517538e-02 | 5 | 1.349 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.267604e+01 | 4.276500e+01 3.975521e+01 | 2.920828e+00 7.347032e-02 | 3 | 1.354 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.267604e+01 | 4.276500e+01 3.995527e+01 | 2.720769e+00 6.809538e-02 | 3 | 1.357 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.097400e+01 | 4.097400e+01 4.031423e+01 | 6.597692e-01 1.636567e-02 | 0 | 1.361 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.097400e+01 | 4.097400e+01 4.031423e+01 | 6.597692e-01 1.636567e-02 | 0 | 1.366 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.087950e+01 | 4.097400e+01 4.031423e+01 | 5.652692e-01 1.402158e-02 | 1 | 1.370 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.084671e+01 | 4.084671e+01 4.031423e+01 | 5.324835e-01 1.320833e-02 | 0 | 1.374 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.084671e+01 | 4.084671e+01 4.031423e+01 | 5.324835e-01 1.320833e-02 | 0 | 1.379 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.084671e+01 | 4.084671e+01 4.031423e+01 | 5.324835e-01 1.320833e-02 | 0 | 1.383 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.084671e+01 | 4.084671e+01 4.031423e+01 | 5.324835e-01 1.320833e-02 | 0 | 1.386 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.084671e+01 | 4.084671e+01 4.031423e+01 | 5.324835e-01 1.320833e-02 | 0 | 1.390 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.082820e+01 | 4.082820e+01 4.031423e+01 | 5.139692e-01 1.274908e-02 | 0 | 1.394 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.082820e+01 | 4.082820e+01 4.031423e+01 | 5.139692e-01 1.274908e-02 | 0 | 1.399 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.082820e+01 | 4.082820e+01 4.031423e+01 | 5.139692e-01 1.274908e-02 | 0 | 1.403 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.082820e+01 | 4.082820e+01 4.043234e+01 | 3.958615e-01 9.790716e-03 | 0 | 1.409 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.082820e+01 | 4.082820e+01 4.044738e+01 | 3.808246e-01 9.415311e-03 | 0 | 1.413 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.082820e+01 | 4.082820e+01 4.046529e+01 | 3.629077e-01 8.968369e-03 | 0 | 1.418 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.082820e+01 | 4.082820e+01 4.046529e+01 | 3.629077e-01 8.968369e-03 | 0 | 1.422 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.082820e+01 | 4.082820e+01 4.052832e+01 | 2.998800e-01 7.399270e-03 | 0 | 1.427 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.082820e+01 | 4.082820e+01 4.052832e+01 | 2.998800e-01 7.399270e-03 | 0 | 1.432 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.082820e+01 | 4.082820e+01 4.063830e+01 | 1.899000e-01 4.672932e-03 | 0 | 1.436 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.082820e+01 | 4.082820e+01 4.063830e+01 | 1.899000e-01 4.672932e-03 | 0 | 1.441 38 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.079580e+01 | 1.620000e-02 3.970997e-04 | 0 | 1.445 39 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 111 3/4Solving subproblem for node 1111 4/4Solving master problem 4.081200e+01 | 4.081200e+01 4.081200e+01 | 7.105427e-15 1.741014e-16 | 0 | 1.448 40 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) 89: obj = 4.428600000e+01 inf = 0.000e+00 (0) * 137: obj = 4.081200000e+01 inf = 0.000e+00 (0) + 137: mip = not found yet >= -inf (1; 0) + 137: >>>>> 4.081200000e+01 >= 4.081200000e+01 0.0% (1; 0) + 137: mip = 4.081200000e+01 >= tree is empty 0.0% (0; 1) [ Info: Solved. [ Info: Establishing JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building master problem... Complete [ Info: Solving JuDGE model for tree: Subtree rooted at node 1 containing 4 nodes --------------------------------------------- Termination Absolute Relative --------------------------------------------- Binary/Integer: 1.0000e-09 1.0000e-09 Relaxation: 1.0000e-09 1.0000e-09 --------------------------------------------- Integer tolerance: 1.0000e-08 Time-limit: Unlimited Max iterations: Unlimited Allow fractional: binary_solve --------------------------------------------- Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem Inf | Inf -Inf | Inf NaN | 0 | 0.012 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.013 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.014 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.016 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.017 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.018 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.019 7 Solving master problem as MIP 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.020 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.011 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.013 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.014 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.015 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.016 5 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.019 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.022 7 Solving master problem as MIP 2.183350e+02 | 2.183350e+02 -Inf | Inf NaN | 0 | 0.022 8* Stalled: exiting. JuDGE Expansions Node 1: "large_upgrade[a]" 0.3333333333333334 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) 50: obj = 2.192333333e+02 inf = 3.977e-15 (0) * 55: obj = 2.183350000e+02 inf = 0.000e+00 (0) [ Info: Solved. Deterministic Equivalent Expansions Node 1: "large_upgrade[a]" 0.33333333333333376 Node 1: "large_upgrade[b]" 0.49999999999999994 Node 1: "large_upgrade[c]" 0.16666666666666663 Node 11: "small_upgrade[c]" 1.0 Node 12: "small_upgrade[b]" 0.5000000000000006 Node 13: "small_upgrade[a]" 1.0 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 29: obj = 2.262700000e+02 inf = 0.000e+00 (0) * 44: 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.010 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.014 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.340000e+02 | 2.340000e+02 1.960000e+02 | 3.800000e+01 1.938776e-01 | 0 | 0.018 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.298889e+02 | 2.340000e+02 1.983333e+02 | 3.155556e+01 1.591036e-01 | 11 | 0.020 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.280000e+02 | 2.280000e+02 2.091111e+02 | 1.888889e+01 9.032944e-02 | 0 | 0.022 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.256667e+02 | 2.280000e+02 2.096667e+02 | 1.600000e+01 7.631161e-02 | 11 | 0.024 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.226667e+02 | 2.226667e+02 2.196667e+02 | 3.000000e+00 1.365706e-02 | 0 | 0.027 7 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.226667e+02 | 2.226667e+02 2.196667e+02 | 3.000000e+00 1.365706e-02 | 0 | 0.029 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.226667e+02 | 2.226667e+02 2.218333e+02 | 8.333333e-01 3.756574e-03 | 0 | 0.033 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.223333e+02 | 3.333333e-01 1.499250e-03 | 0 | 0.035 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.223333e+02 | 3.333333e-01 1.499250e-03 | 0 | 0.038 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 | 0.000000e+00 0.000000e+00 | 0 | 0.041 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.055s 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.011 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.015 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.439889e+02 | 2.724000e+02 2.135667e+02 | 3.042222e+01 1.424484e-01 | 12 | 0.017 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.308000e+02 | 2.724000e+02 2.135667e+02 | 1.723333e+01 8.069299e-02 | 9 | 0.018 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.286765e+02 | 2.724000e+02 2.135667e+02 | 1.510980e+01 7.074982e-02 | 10 | 0.022 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.282679e+02 | 2.724000e+02 2.229405e+02 | 5.327334e+00 2.389576e-02 | 9 | 0.025 6 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282679e+02 | 2.724000e+02 2.266813e+02 | 1.586508e+00 6.998846e-03 | 9 | 0.028 7 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282114e+02 | 2.724000e+02 2.268357e+02 | 1.375668e+00 6.064600e-03 | 9 | 0.032 8 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.282114e+02 | 2.724000e+02 2.282114e+02 | 2.842171e-14 1.245412e-16 | 9 | 0.033 9 Solving master problem as MIP 2.282114e+02 | 2.326000e+02 2.282114e+02 | 4.388618e+00 1.923050e-02 | 0 | 0.035 10* Convergence criteria met. Attempting to branch. Adding 2 new nodes to B&P tree. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 2 of 3 | 2.326000e+02 2.282114e+02 | 4.388618e+00 1.923050e-02 | 0 | 0.654 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.284096e+02 | Inf 2.282114e+02 | 1.982069e-01 8.685234e-04 | 8 | 0.002 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.284096e+02 | Inf 2.284096e+02 | 0.000000e+00 0.000000e+00 | 8 | 0.005 2 Solving master problem as MIP 2.284096e+02 | 2.326000e+02 2.284096e+02 | 4.190411e+00 1.834604e-02 | 0 | 0.008 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.664 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.298551e+02 | Inf 2.282114e+02 | 1.643690e+00 7.202491e-03 | 8 | 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.282379e+02 | Inf 2.282114e+02 | 2.649667e-02 1.161058e-04 | 6 | 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.282379e+02 | Inf 2.282379e+02 | 0.000000e+00 0.000000e+00 | 6 | 0.007 3 Solving master problem as MIP 2.282379e+02 | 2.326333e+02 2.282379e+02 | 4.395455e+00 1.925822e-02 | 0 | 0.008 4* Convergence criteria met. Attempting to branch. Adding 2 new nodes to B&P tree. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 6 of 7 | 2.326000e+02 2.282379e+02 | 4.362121e+00 1.911217e-02 | 0 | 0.675 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.302233e+02 | Inf 2.282379e+02 | 1.985455e+00 8.699058e-03 | 5 | 0.004 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.302233e+02 | Inf 2.302233e+02 | 0.000000e+00 0.000000e+00 | 5 | 0.006 2 Solving master problem as MIP 2.302233e+02 | 2.326333e+02 2.302233e+02 | 2.410000e+00 1.046810e-02 | 0 | 0.008 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 7 of 9 | 2.326000e+02 2.282379e+02 | 4.362121e+00 1.911217e-02 | 0 | 0.684 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.357833e+02 | Inf 2.357833e+02 | 1.421085e-13 6.027082e-16 | 3 | 0.003 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 4 of 9 | 2.326000e+02 2.284096e+02 | 4.190411e+00 1.834604e-02 | 0 | 0.688 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.300526e+02 | Inf 2.300526e+02 | 8.526513e-14 3.706331e-16 | 5 | 0.003 1 Solving master problem as MIP 2.300526e+02 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.004 2* Convergence criteria met. Attempting to branch. Adding 2 new nodes to B&P tree. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 5 of 11 | 2.326000e+02 2.284096e+02 | 4.190411e+00 1.834604e-02 | 0 | 0.693 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.350000e+02 | 2.350000e+02 2.350000e+02 | 2.273737e-13 9.675476e-16 | 0 | 0.004 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 10 of 11 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.698 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.326000e+02 | 2.326000e+02 2.324333e+02 | 1.666667e-01 7.170515e-04 | 0 | 0.004 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.326000e+02 | 2.326000e+02 2.326000e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.005 2 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 11 of 11 | 2.326000e+02 2.300526e+02 | 2.547368e+00 1.107298e-02 | 0 | 0.703 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.308395e+02 | Inf 2.303679e+02 | 4.716221e-01 2.047256e-03 | 4 | 0.004 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.308395e+02 | Inf 2.308395e+02 | 0.000000e+00 0.000000e+00 | 4 | 0.006 2 Solving master problem as MIP 2.308395e+02 | 2.362333e+02 2.308395e+02 | 5.393860e+00 2.336628e-02 | 0 | 0.008 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 8 of 13 | 2.326000e+02 2.302233e+02 | 2.376667e+00 1.032331e-02 | 0 | 0.711 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.326333e+02 | 2.326333e+02 2.325000e+02 | 1.333333e-01 5.734767e-04 | 0 | 0.004 1 Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.326333e+02 | 2.326333e+02 2.326333e+02 | 0.000000e+00 0.000000e+00 | 0 | 0.007 2 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 9 of 13 | 2.326000e+02 2.302233e+02 | 2.376667e+00 1.032331e-02 | 0 | 0.719 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.310414e+02 | Inf 2.310414e+02 | 5.684342e-14 2.460314e-16 | 6 | 0.002 1 Solving master problem as MIP 2.310414e+02 | 2.384000e+02 2.310414e+02 | 7.358637e+00 3.184987e-02 | 0 | 0.004 2* Convergence criteria met. Attempting to branch. Adding 2 new nodes to B&P tree. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 12 of 15 | 2.326000e+02 2.308395e+02 | 1.760526e+00 7.626626e-03 | 0 | 0.725 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.431333e+02 | 1.666667e-01 6.854949e-04 | 0 | 0.003 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 13 of 15 | 2.326000e+02 2.308395e+02 | 1.760526e+00 7.626626e-03 | 0 | 0.729 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.342556e+02 | Inf 2.342556e+02 | 0.000000e+00 0.000000e+00 | 4 | 0.003 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 14 of 15 | 2.326000e+02 2.310414e+02 | 1.558637e+00 6.746140e-03 | 0 | 0.734 Relaxed ObjVal | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time Iter Solving subproblem for node 1 1/4Solving subproblem for node 11 2/4Solving subproblem for node 12 3/4Solving subproblem for node 13 4/4Solving master problem 2.433333e+02 | 2.433333e+02 2.430333e+02 | 3.000000e-01 1.234399e-03 | 0 | 0.003 1 Dominated by incumbent. Branch & Price | Upper Bound Lower Bound | Absolute Diff Relative Diff | Fractional | Time 15 of 15 | 2.326000e+02 2.310414e+02 | 1.558637e+00 6.746140e-03 | 0 | 0.738 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 | 0.000000e+00 0.000000e+00 | 4 | 0.003 1 Dominated by incumbent. Performing final MIP solve Objective value of best integer-feasible solution: 232.59999999999974 Objective value of lower bound: 232.59999999999974 Solve time: 0.744s ┌ Warning: Dual variables not present; computing approximate probabilities. └ @ JuDGE ~/.julia/packages/JuDGE/yzb6J/src/utilities.jl:406 [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Establishing deterministic equivalent model for tree: Subtree rooted at node 1 containing 4 nodes [ Info: Building JuMP Model for node 1111213s...Complete [ Info: Checking sub-problem format... Complete [ Info: Building deterministic equivalent problem... Complete [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 29: obj = 2.231666667e+02 inf = 0.000e+00 (0) * 45: obj = 2.156666667e+02 inf = 0.000e+00 (0) + 45: mip = not found yet >= -inf (1; 0) + 53: >>>>> 2.226666667e+02 >= 2.198333333e+02 1.3% (5; 0) + 63: mip = 2.226666667e+02 >= tree is empty 0.0% (0; 9) [ Info: Solved. [ Info: Solving deterministic equivalent formulation 0: obj = 0.000000000e+00 inf = 1.850e+02 (9) 50: obj = 2.263333333e+02 inf = 3.977e-15 (0) * 57: obj = 2.216570175e+02 inf = 4.441e-16 (0) + 57: mip = not found yet >= -inf (1; 0) + 72: >>>>> 2.433000000e+02 >= 2.270403509e+02 6.7% (6; 0) + 120: >>>>> 2.376333333e+02 >= 2.298900000e+02 3.3% (11; 3) + 126: >>>>> 2.326000000e+02 >= 2.320333333e+02 0.2% (5; 16) + 130: mip = 2.326000000e+02 >= tree is empty 0.0% (0; 29) [ 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.234 3 of 5 | -5.888921e+00 -5.906797e+00 | 1.787603e-02 -3.026349e-03 | 0 | 0.327 6 of 7 | -5.888921e+00 -5.901540e+00 | 1.261949e-02 -2.138339e-03 | 0 | 0.392 7 of 9 | -5.888921e+00 -5.901540e+00 | 1.261949e-02 -2.138339e-03 | 0 | 0.426 8 of 11 | -5.888921e+00 -5.901388e+00 | 1.246651e-02 -2.112471e-03 | 0 | 0.502 9 of 11 | -5.888921e+00 -5.901388e+00 | 1.246651e-02 -2.112471e-03 | 0 | 0.560 10 of 13 | -5.888921e+00 -5.900661e+00 | 1.173974e-02 -1.989564e-03 | 0 | 0.629 11 of 15 | -5.888921e+00 -5.900661e+00 | 1.173974e-02 -1.989564e-03 | 0 | 0.756 14 of 15 | -5.888921e+00 -5.899032e+00 | 1.011113e-02 -1.714032e-03 | 0 | 0.816 15 of 17 | -5.888921e+00 -5.899032e+00 | 1.011113e-02 -1.714032e-03 | 0 | 0.896 16 of 19 | -5.889990e+00 -5.898974e+00 | 8.983382e-03 -1.522872e-03 | 0 | 1.002 17 of 21 | -5.889990e+00 -5.898974e+00 | 8.983382e-03 -1.522872e-03 | 0 | 1.067 Model 4 dominated. UB: -5.897178122861587, LB:-5.898818721225576 Model 5 dominated. UB: -5.897178122861587, LB:-5.898818721225576 12 of 21 | -5.897178e+00 -5.898819e+00 | 1.640598e-03 -2.781232e-04 | 0 | 1.125 13 of 21 | -5.897178e+00 -5.898819e+00 | 1.640598e-03 -2.781232e-04 | 0 | 1.197 Objective value of best integer-feasible solution: -5.897178122861587 Objective value of lower bound: -5.897178122861587 Solve time: 1.278s [ 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.026s [ 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.083s [ 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.050 3 of 5 | -5.589160e+00 -5.644961e+00 | 5.580110e-02 -9.885117e-03 | 0 | 0.062 4 of 5 | -5.589160e+00 -5.631335e+00 | 4.217522e-02 -7.489382e-03 | 0 | 0.066 5 of 7 | -5.589160e+00 -5.631335e+00 | 4.217522e-02 -7.489382e-03 | 0 | 0.079 6 of 7 | -5.589160e+00 -5.612412e+00 | 2.325157e-02 -4.142884e-03 | 0 | 0.084 7 of 7 | -5.589160e+00 -5.612412e+00 | 2.325157e-02 -4.142884e-03 | 0 | 0.088 Objective value of best integer-feasible solution: -5.589160162654409 Objective value of lower bound: -5.589160162654409 Solve time: 0.094s [ 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.108 3 of 5 | -5.751871e+00 -5.787502e+00 | 3.563072e-02 -6.156493e-03 | 0 | 0.150 Objective value of best integer-feasible solution: -5.77775344975868 Objective value of lower bound: -5.777753449758681 Solve time: 0.169s [ 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.203 3 of 5 | -5.883161e+00 -5.895420e+00 | 1.225964e-02 -2.079519e-03 | 0 | 0.284 4 of 7 | -5.883161e+00 -5.892868e+00 | 9.707005e-03 -1.647246e-03 | 0 | 0.329 5 of 9 | -5.883161e+00 -5.892868e+00 | 9.707005e-03 -1.647246e-03 | 0 | 0.394 6 of 9 | -5.890256e+00 -5.892618e+00 | 2.361851e-03 -4.008152e-04 | 0 | 0.410 7 of 11 | -5.890256e+00 -5.892618e+00 | 2.361851e-03 -4.008152e-04 | 0 | 0.441 Model 8 dominated. UB: -5.8902557856203215, LB:-5.891813457965327 Model 9 dominated. UB: -5.8902557856203215, LB:-5.891813457965327 10 of 11 | -5.890256e+00 -5.891813e+00 | 1.557672e-03 -2.643791e-04 | 0 | 0.470 11 of 11 | -5.890256e+00 -5.891813e+00 | 1.557672e-03 -2.643791e-04 | 0 | 0.509 Objective value of best integer-feasible solution: -5.8902557856203215 Objective value of lower bound: -5.8902557856203215 Solve time: 0.53s [ Info: HN obj: -5.897178122861587 [ Info: WS obj: -5.889883337156793 [ Info: EEV obj: -5.863704837305664 [ Info: RH obj: -5.890255785620322 [ Info: EVPI: -0.007294785704793583 [ Info: VSS (EV policy): 0.03347328555592277 [ Info: VSS (RH policy): 0.0069223372412645645 [ Info: HN expansions: JuDGE Expansions Node 132: "bag[1]" 1.0 Node 132: "bag[2]" 1.0 Node 1331: "bag[1]" 1.0 [ Info: EEV expansions: JuDGE Expansions [ Info: RH expansions: JuDGE Expansions Node 132: "bag[1]" 1.0 Node 1331: "bag[1]" 1.0 Test Summary: | Pass Error Total Time JuDGE tests | 59 2 61 6m03.3s Tree building | 4 4 38.8s Deterministic | 12 12 2m12.2s Multistage newsvendor | 4 4 13.1s Inventory | 5 5 7.3s Stochastic Knapsack | 2 1 3 27.3s Transportation network expansion | 1 1 52.3s Cutting stock | 1 1 16.9s Lag, duration, set_policy (Decomposition) | 9 9 8.0s Lag, duration, set_policy (Deterministic Equivalent) | 9 9 5.0s Variable Types / Starting solution | 2 2 22.2s Risk aversion and implied probabilities | 10 10 21.8s EVPI / VSS | 1 1 18.2s RNG of the outermost testset: Xoshiro(0x5ea1a32e3b6678ab, 0x01f1598b15df8562, 0x020cd96ebab7a46a, 0x4b2c0a5c23d76107, 0x7cea377e1d7ee614) 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 388.17s ERROR: LoadError: Package JuDGE errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/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.13/Pkg/src/Operations.jl:2673 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2522 [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.13/Pkg/src/API.jl:538 [5] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:515 [6] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:168 [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:157 [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [9] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [11] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [12] include(mod::Module, _path::String) @ Base ./Base.jl:309 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:344 [14] _start() @ Base ./client.jl:577 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 465.31s: package tests unexpectedly errored