Package evaluation of PowerModelsACDC on Julia 1.13.0-DEV.853 (3e868b27cf*) started at 2025-07-17T03:10:09.340 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.57s ################################################################################ # Installation # Installing PowerModelsACDC... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [ff45984e] + PowerModelsACDC v0.9.0 Updating `~/.julia/environments/v1.13/Manifest.toml` [47edcb42] + ADTypes v1.15.0 [79e6a3ab] + Adapt v4.3.0 [4fba245c] + ArrayInterface v7.19.0 [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.17.0 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [a0c0ee7d] + DifferentiationInterface v0.7.3 [b4f34e82] + Distances v0.10.12 [ffbed154] + DocStringExtensions v0.9.5 [6a86dc24] + FiniteDiff v2.27.0 [f6369f11] + ForwardDiff v1.0.1 [2030c09a] + InfrastructureModels v0.7.8 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [4076af6c] + JuMP v1.26.0 [d3d80556] + LineSearches v7.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.42.0 [f28f55f0] + Memento v1.4.1 [d8a4904e] + MutableArithmetics v1.6.4 [d41bc354] + NLSolversBase v7.10.0 [2774e3e8] + NLsolve v4.5.1 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [c36e90e8] + PowerModels v0.21.4 [ff45984e] + PowerModelsACDC v0.9.0 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.1 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+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 4.55s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 231.55s ################################################################################ # Testing # Testing PowerModelsACDC Status `/tmp/jl_qlRK0Q/Project.toml` ⌅ [87dc4568] HiGHS v1.15.0 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.6 [4076af6c] JuMP v1.26.0 [2ddba703] Juniper v0.9.3 [f28f55f0] Memento v1.4.1 [2774e3e8] NLsolve v4.5.1 [c36e90e8] PowerModels v0.21.4 [ff45984e] PowerModelsACDC v0.9.0 [37e2e46d] LinearAlgebra v1.12.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_qlRK0Q/Manifest.toml` [47edcb42] ADTypes v1.15.0 [79e6a3ab] Adapt v4.3.0 [4fba245c] ArrayInterface v7.19.0 [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.17.0 [187b0558] ConstructionBase v1.6.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [a0c0ee7d] DifferentiationInterface v0.7.3 [b4f34e82] Distances v0.10.12 [ffbed154] DocStringExtensions v0.9.5 [6a86dc24] FiniteDiff v2.27.0 [f6369f11] ForwardDiff v1.0.1 ⌅ [87dc4568] HiGHS v1.15.0 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.6 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.26.0 [2ddba703] Juniper v0.9.3 [d3d80556] LineSearches v7.4.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.42.0 [f28f55f0] Memento v1.4.1 [d8a4904e] MutableArithmetics v1.6.4 [d41bc354] NLSolversBase v7.10.0 [2774e3e8] NLsolve v4.5.1 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [c36e90e8] PowerModels v0.21.4 [ff45984e] PowerModelsACDC v0.9.0 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [efcf1570] Setfield v1.1.2 [276daf66] SpecialFunctions v2.5.1 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 ⌅ [8fd58aa0] HiGHS_jll v1.10.0+0 [e33a78d0] Hwloc_jll v2.12.1+0 [9cc047cb] Ipopt_jll v300.1400.1701+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.0+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [319450e9] SPRAL_jll v2025.5.20+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.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 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.14.1+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 50321.3 ms ✓ Ipopt → IpoptMathOptInterfaceExt 1 dependency successfully precompiled in 51 seconds. 74 already precompiled. Precompiling packages... 11677.7 ms ✓ Juniper 1 dependency successfully precompiled in 14 seconds. 52 already precompiled. ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit https://github.com/coin-or/Ipopt ****************************************************************************** [0] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 117 rows; 128 cols; 312 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [1e+03, 1e+06] Bound [4e-01, 6e+00] RHS [1e-02, 4e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.0904295782e-01 Ph1: 33(46732.9); Du: 3(0.000109043) 0s 79 2.4021711179e+04 Pr: 0(0); Du: 0(1.25056e-12) 0s Model status : Optimal Simplex iterations: 79 Objective value : 2.4021711179e+04 Relative P-D gap : 2.2716817174e-15 HiGHS run time : 0.33 [0] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 155 rows; 151 cols; 383 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e+03, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 6e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.4707058035e-03 Pr: 81(4838.56); Du: 4(6.37478e-05) 0s 109 1.9878411151e+04 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 109 Objective value : 1.9878411151e+04 Relative P-D gap : 1.2078762203e-14 HiGHS run time : 0.00 [0] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 141 rows; 151 cols; 369 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e+03, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 6e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.6061993051e-03 Pr: 74(4834.09); Du: 4(0.000113313) 0s 106 1.9844553319e+04 Pr: 0(0); Du: 0(7.29989e-11) 0s Model status : Optimal Simplex iterations: 106 Objective value : 1.9844553319e+04 Relative P-D gap : 1.3565960765e-14 HiGHS run time : 0.00 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 32 rows; 31 cols; 74 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [1e+03, 4e+03] Bound [2e-02, 6e+00] RHS [5e-01, 4e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.2449019657e-04 Pr: 6(46.5297); Du: 1(7.14066e-06) 0s 10 1.6565084683e+04 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 10 Objective value : 1.6565084683e+04 Relative P-D gap : 2.1961727796e-16 HiGHS run time : 0.00 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 222 rows; 124 cols; 535 nonzeros; 17 integer variables (17 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 25 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 222 rows; 124 cols; 535 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 122 rows, 73 cols, 250 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 177 rows, 90 cols, 446 nonzeros 0s 156 rows, 69 cols, 464 nonzeros 0s 88 rows, 59 cols, 292 nonzeros 0s 88 rows, 59 cols, 292 nonzeros 0s Solving MIP model with: 88 rows 59 cols (16 binary, 0 integer, 0 implied int., 43 continuous) 292 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 4.5 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 20.06401564 inf inf 0 0 0 40 0.0s R 0 0 0 0.00% 20.06401564 27.9331482 28.17% 70 2 0 42 0.0s L 0 0 0 0.00% 25.51691606 26.9331482 5.26% 254 35 7 97 0.1s L 0 0 0 0.00% 25.6336619 26.3331482 2.66% 282 37 7 158 0.1s 50.0% inactive integer columns, restarting Model after restart has 49 rows, 37 cols (8 bin., 0 int., 0 impl., 29 cont.), and 161 nonzeros 0 0 0 0.00% 25.7652385 26.3331482 2.16% 6 0 0 181 0.1s 0 0 0 0.00% 25.7652385 26.3331482 2.16% 6 4 0 201 0.1s 1 0 1 100.00% 26.3331482 26.3331482 0.00% 253 13 10 342 0.2s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) P-D integral 0.0072789259228 Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.15 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 342 (total) 48 (strong br.) 99 (separation) 122 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 88 rows; 54 cols; 207 nonzeros; 4 integer variables (4 binary) Coefficient ranges: Matrix [1e-02, 2e+01] Cost [1e+00, 5e+00] Bound [1e-01, 2e+01] RHS [9e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 9 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Row 4 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] Solution has num max sum Col infeasibilities 3 0.1 0.3 Integer infeasibilities 0 0 0 Row infeasibilities 24 7.2 70.96 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 88 rows; 54 cols; 207 nonzeros Coefficient ranges: Matrix [1e-02, 2e+01] Cost [1e+00, 5e+00] Bound [1e-01, 2e+01] RHS [9e-01, 6e+00] Presolving model 53 rows, 35 cols, 116 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 71 rows, 39 cols, 176 nonzeros 0s 38 rows, 20 cols, 110 nonzeros 0s 27 rows, 15 cols, 73 nonzeros 0s 21 rows, 14 cols, 61 nonzeros 0s 17 rows, 12 cols, 49 nonzeros 0s 10 rows, 12 cols, 29 nonzeros 0s 7 rows, 9 cols, 19 nonzeros 0s Objective function is integral with scale 10 Solving MIP model with: 7 rows 9 cols (2 binary, 0 integer, 0 implied int., 7 continuous) 19 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 10.7 inf inf 0 0 0 0 0.0s S 0 0 0 100.00% 10.7 10.7 0.00% 0 0 0 0 0.0s 1 0 1 100.00% 10.7 10.7 0.00% 0 0 0 6 0.0s Solving report Status Optimal Primal bound 10.7 Dual bound 10.7 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 10.7 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.00 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 6 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 1464 rows; 854 cols; 3533 nonzeros; 227 integer variables (227 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+01] Bound [1e-01, 1e+01] RHS [1e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 0.774 from [lower, value, upper] = [ 0; -0.774; 0] WARNING: Row 2 has infeasibility of 2.949 from [lower, value, upper] = [ 0; -2.949; 0] WARNING: Row 57 has infeasibility of 32.47 from [lower, value, upper] = [ 0; 32.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 751 35.47 1674 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 1464 rows; 854 cols; 3533 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+01] Bound [1e-01, 1e+01] RHS [1e-01, 6e+00] Presolving model 696 rows, 372 cols, 1426 nonzeros 0s 71 rows, 40 cols, 202 nonzeros 0s 50 rows, 28 cols, 148 nonzeros 0s 40 rows, 23 cols, 122 nonzeros 0s 22 rows, 14 cols, 95 nonzeros 0s 8 rows, 7 cols, 35 nonzeros 0s Dependent equations search running on 6 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 8 rows, 7 cols, 35 nonzeros 0s Presolve : Reductions: rows 8(-1456); columns 7(-847); elements 35(-3498) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 5.2499998643e+01 Pr: 8(58.144) 0s 5 6.0424711493e+01 0s Model status : Infeasible Simplex iterations: 5 Objective value : 6.0424691621e+01 HiGHS run time : 0.00 Presolving model 1210 rows, 599 cols, 3030 nonzeros 0s 642 rows, 536 cols, 1998 nonzeros 0s 642 rows, 536 cols, 1998 nonzeros 0s Solving MIP model with: 642 rows 536 cols (227 binary, 0 integer, 0 implied int., 309 continuous) 1998 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 8.06450689 inf inf 0 0 0 484 0.0s C 0 0 0 0.00% 8.226742078 2489.303148 99.67% 46 13 0 541 0.1s L 0 0 0 0.00% 8.424022134 15.6920988 46.32% 221 65 0 796 0.9s L 0 0 0 0.00% 8.424022134 15.6920988 46.32% 222 68 0 1574 1.1s 59.0% inactive integer columns, restarting Model after restart has 363 rows, 262 cols (93 bin., 0 int., 0 impl., 169 cont.), and 1185 nonzeros 0 0 0 0.00% 8.424022134 15.6920988 46.32% 44 0 0 1957 1.1s 0 0 0 0.00% 8.424022134 15.6920988 46.32% 44 39 0 2042 1.1s L 0 0 0 0.00% 8.438089858 15.6920988 46.23% 177 65 0 3631 2.2s 55 0 28 100.00% 15.6920988 15.6920988 0.00% 253 51 523 10329 3.1s Solving report Status Optimal Primal bound 15.6920988029 Dual bound 15.6920988029 Gap 0% (tolerance: 0.01%) P-D integral 1.75461542013 Solution status feasible 15.6920988029 (objective) 0 (bound viol.) 8.43880521018e-13 (int. viol.) 0 (row viol.) Timing 3.10 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 5 Nodes 55 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 10329 (total) 4218 (strong br.) 506 (separation) 3605 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 598 rows; 369 cols; 1428 nonzeros; 56 integer variables (56 binary) Coefficient ranges: Matrix [1e-02, 4e+02] Cost [1e-01, 7e+00] Bound [7e-02, 5e+01] RHS [7e-02, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.22 from [lower, value, upper] = [ 0; 3.22; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 225 11.47 576.2 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 598 rows; 369 cols; 1428 nonzeros Coefficient ranges: Matrix [1e-02, 4e+02] Cost [1e-01, 7e+00] Bound [7e-02, 5e+01] RHS [7e-02, 1e+01] Presolving model 343 rows, 209 cols, 761 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 493 rows, 265 cols, 1239 nonzeros 0s 394 rows, 199 cols, 1132 nonzeros 0s 225 rows, 180 cols, 738 nonzeros 0s 222 rows, 177 cols, 728 nonzeros 0s Solving MIP model with: 222 rows 177 cols (55 binary, 0 integer, 0 implied int., 122 continuous) 728 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3.48 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 19.44392647 inf inf 0 0 0 174 0.0s C 0 0 0 0.00% 21.76442218 203.4605448 89.30% 207 24 0 225 0.1s L 0 0 0 0.00% 23.65258445 25.16054482 5.99% 481 67 0 379 0.2s L 0 0 0 0.00% 23.67609302 25.16054482 5.90% 517 69 0 688 0.6s 20.0% inactive integer columns, restarting Model after restart has 187 rows, 150 cols (44 bin., 0 int., 0 impl., 106 cont.), and 642 nonzeros 0 0 0 0.00% 23.67609302 25.16054482 5.90% 30 0 0 1248 0.6s 0 0 0 0.00% 23.67609302 25.16054482 5.90% 30 29 0 1309 0.7s S 0 0 0 0.00% 23.77758027 25.16054482 5.50% 249 33 25 2728 1.6s 10 0 5 100.00% 25.16054482 25.16054482 0.00% 257 33 62 3781 1.6s Solving report Status Optimal Primal bound 25.1605448204 Dual bound 25.1605448204 Gap 0% (tolerance: 0.01%) P-D integral 0.242333056423 Solution status feasible 25.1605448204 (objective) 0 (bound viol.) 5.21140722541e-13 (int. viol.) 0 (row viol.) Timing 1.58 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 5 Nodes 10 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 3781 (total) 868 (strong br.) 374 (separation) 2119 (heuristics) nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 186 #IntBinVar: 17 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 12.954972982406616 Relaxation Obj: 20.983698326676176 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 255 rows; 220 cols; 538 nonzeros; 17 integer variables (17 binary) Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [1e-07, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 132 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 30 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 55 7.473 107.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 255 rows; 220 cols; 538 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [1e-07, 2e+00] Presolving model 161 rows, 119 cols, 226 nonzeros 0s 3 rows, 4 cols, 6 nonzeros 0s Presolve : Reductions: rows 3(-252); columns 4(-216); elements 6(-532) Solving the presolved LP Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 6.7368056311e+00 Relative P-D gap : 1.3183969797e-16 HiGHS run time : 0.00 Presolving model 216 rows, 151 cols, 460 nonzeros 0s 115 rows, 87 cols, 296 nonzeros 0s 98 rows, 66 cols, 230 nonzeros 0s 72 rows, 53 cols, 178 nonzeros 0s 46 rows, 42 cols, 126 nonzeros 0s MIP start solution is feasible, objective value is 6.73680563109 Solving MIP model with: 46 rows 42 cols (11 binary, 0 integer, 5 implied int., 26 continuous) 126 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 2.406351303 6.736805631 64.28% 0 0 0 0 0.0s T 0 0 0 0.00% 2.406351303 2.406355095 0.00% 0 0 0 21 0.0s 1 0 1 100.00% 2.406355095 2.406355095 0.00% 0 0 0 21 0.0s Solving report Status Optimal Primal bound 2.40635509547 Dual bound 2.40635509547 Gap 0% (tolerance: 0.01%) P-D integral 0.00188796968294 Solution status feasible 2.40635509547 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 1 (1 feasible; 3 iterations) LP iterations 21 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 2.4064 0.1063 29.1 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 307 rows; 254 cols; 691 nonzeros; 51 integer variables (51 binary) Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 132 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 30 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 71 7.473 115.1 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 307 rows; 254 cols; 691 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [4e-04, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 276 rows, 185 cols, 629 nonzeros 0s 159 rows, 113 cols, 424 nonzeros 0s 116 rows, 78 cols, 304 nonzeros 0s 76 rows, 52 cols, 200 nonzeros 0s Solving MIP model with: 76 rows 52 cols (16 binary, 0 integer, 0 implied int., 36 continuous) 200 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.4599956276 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.9703672881 0.9730207264 0.27% 0 0 0 41 0.0s 31.2% inactive integer columns, restarting Model after restart has 3 rows, 4 cols (0 bin., 0 int., 0 impl., 4 cont.), and 6 nonzeros 0 0 0 0.00% 0.9730207264 0.9730207264 0.00% 0 0 0 41 0.0s 1 0 1 100.00% 0.9730207264 0.9730207264 0.00% 0 0 0 41 0.0s Solving report Status Optimal Primal bound 0.97302072641 Dual bound 0.97302072641 Gap 0% (tolerance: 0.01%) P-D integral 1.31223834508e-05 Solution status feasible 0.97302072641 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 41 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.973 0.0272 30.9 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 359 rows; 288 cols; 912 nonzeros; 85 integer variables (85 binary) Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 132 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 30 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 78 7.473 121.4 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 359 rows; 288 cols; 912 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [4e-04, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 328 rows, 219 cols, 850 nonzeros 0s 216 rows, 151 cols, 654 nonzeros 0s 174 rows, 117 cols, 476 nonzeros 0s 159 rows, 53 cols, 220 nonzeros 0s 54 rows, 40 cols, 130 nonzeros 0s 54 rows, 40 cols, 130 nonzeros 0s Solving MIP model with: 54 rows 40 cols (11 binary, 0 integer, 0 implied int., 29 continuous) 130 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.1974679457 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.20159087 0.2015936354 0.00% 0 0 0 33 0.0s 1 0 1 100.00% 0.20159087 0.2015936354 0.00% 0 0 0 33 0.0s Solving report Status Optimal Primal bound 0.201593635441 Dual bound 0.201590870003 Gap 0.00137% (tolerance: 0.01%) P-D integral 6.21119364319e-08 Solution status feasible 0.201593635441 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 33 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.2016 0.0272 31.6 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 411 rows; 322 cols; 1201 nonzeros; 119 integer variables (119 binary) Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 132 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 30 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 85 7.473 128.4 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 411 rows; 322 cols; 1201 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [4e-04, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 380 rows, 253 cols, 1139 nonzeros 0s 265 rows, 183 cols, 926 nonzeros 0s 222 rows, 149 cols, 620 nonzeros 0s 191 rows, 53 cols, 221 nonzeros 0s 54 rows, 40 cols, 130 nonzeros 0s 54 rows, 40 cols, 130 nonzeros 0s Solving MIP model with: 54 rows 40 cols (11 binary, 0 integer, 0 implied int., 29 continuous) 130 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.1974679598 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.201584569 0.2015873339 0.00% 0 0 0 33 0.0s 1 0 1 100.00% 0.201584569 0.2015873339 0.00% 0 0 0 33 0.0s Solving report Status Optimal Primal bound 0.201587333883 Dual bound 0.201584568958 Gap 0.00137% (tolerance: 0.01%) P-D integral 4.48983929207e-09 Solution status feasible 0.201587333883 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 33 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 31.73705792427063 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 20.98 - 10.2 4 - 3 3 - 29.84 - 11.5 - 93.8% 4 3 - 31.27 - 11.6 - 77.4% 5 4 - 30.97 - 11.8 - 77.2% 6 5 - 31.14 - 11.8 - 86.6% 7 6 - 31.39 - 11.9 - 26.0% 8 7 - 31.4 - 12.2 - 95.7% 9 4 - 31.62 - 12.3 - 83.8% 6 4 33.27 31.89 4.15% 12.4 - 92.5% 6 5 33.27 31.67 4.81% 12.5 - 98.3% 7 5 33.27 32.08 3.58% 12.6 - 82.3% 8 6 33.27 30.81 7.38% 12.7 - 70.9% 9 7 33.27 30.5 8.32% 12.9 - 87.6% 9 7 33.27 31.24 6.08% 13.4 - 92.8% 8 8 33.27 31.33 5.81% 14.0 - 94.1% 9 6 33.27 32.08 3.58% 14.1 - 91.5% 10 7 33.27 32.13 3.43% 14.2 - 78.3% 10 8 33.27 32.13 3.43% 14.4 - 64.8% 11 4 33.27 32.15 3.35% 14.6 - 89.8% 11 5 33.27 31.41 5.57% 14.7 - 90.8% 11 5 33.27 32.15 3.35% 14.9 - 99.1% 11 6 33.27 32.07 3.6% 15.1 - 98.2% 11 7 33.27 32.07 3.59% 15.2 - 90.0% 11 8 33.27 32.15 3.36% 15.3 - 80.6% 0 5 32.200612 32.200613 0.0% 15.4 - 99.8% #branches: 25 Obj: 32.20061233634313 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 103 #IntBinVar: 4 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.22400403022766113 Relaxation Obj: 1.4678142298092869 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 98 rows; 111 cols; 200 nonzeros; 4 integer variables (4 binary) Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [4e-06, 1e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 18 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 85 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] Solution has num max sum Col infeasibilities 5 3.6 7.5 Integer infeasibilities 0 0 0 Row infeasibilities 20 7.2 33 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 98 rows; 111 cols; 200 nonzeros Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [4e-06, 1e+00] Presolving model 44 rows, 41 cols, 58 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-98); columns 0(-111); elements 0(-200) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 1.9552835781e+00 Relative P-D gap : 1.1356133065e-16 HiGHS run time : 0.00 Presolving model 72 rows, 53 cols, 146 nonzeros 0s 22 rows, 19 cols, 52 nonzeros 0s 18 rows, 11 cols, 38 nonzeros 0s 12 rows, 8 cols, 26 nonzeros 0s 8 rows, 6 cols, 18 nonzeros 0s MIP start solution is feasible, objective value is 1.95528357808 Solving MIP model with: 8 rows 6 cols (3 binary, 0 integer, 0 implied int., 3 continuous) 18 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.129323942 1.955283578 42.24% 0 0 0 0 0.0s R 0 0 0 0.00% 1.12932752 1.12932752 0.00% 0 0 0 4 0.0s 1 0 1 100.00% 1.12932752 1.12932752 0.00% 0 0 0 4 0.0s Solving report Status Optimal Primal bound 1.12932752045 Dual bound 1.12932752044 Gap 0% (tolerance: 0.01%) P-D integral 0.000331347867696 Solution status feasible 1.12932752045 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 4 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: NLP couldn't be solved to optimality └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:405 1.1293 - 1.3 FP: 1.2650611400604248 s FP: 1 round FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 1 2 10.7 1.47 86.28% 0.4 2 - 0 3 10.7 9.73 9.07% 0.5 - 87.4% #branches: 2 Obj: 10.700000447069845 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 238 #IntBinVar: 17 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.5861468315124512 Relaxation Obj: 15.877095198246574 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored MIP has 911 rows; 272 cols; 2503 nonzeros; 17 integer variables (17 binary) Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [2e-07, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 150 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 54 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 81 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 159 53.6 2617 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 911 rows; 272 cols; 2503 nonzeros Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [2e-07, 1e+02] Presolving model 620 rows, 229 cols, 1630 nonzeros 0s 331 rows, 113 cols, 1196 nonzeros 0s Dependent equations search running on 67 equations with time limit of 1.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1.00s) 310 rows, 113 cols, 1106 nonzeros 0s Presolve : Reductions: rows 310(-601); columns 113(-159); elements 1106(-1397) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 5.8657311956e+00 Pr: 111(1188.32) 0s 104 5.8659445839e+00 0s Model status : Infeasible Simplex iterations: 104 Objective value : 5.8657669859e+00 HiGHS run time : 0.01 Presolving model 736 rows, 246 cols, 2162 nonzeros 0s 643 rows, 153 cols, 2237 nonzeros 0s 554 rows, 135 cols, 1935 nonzeros 0s Solving MIP model with: 554 rows 135 cols (16 binary, 0 integer, 2 implied int., 117 continuous) 1935 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3.078975601 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 3.078975601 inf inf 1 0 0 138 0.0s R 0 0 0 0.00% 4.082805333 4.771578517 14.43% 142 7 0 203 0.1s L 0 0 0 0.00% 4.082805333 4.360248571 6.36% 142 7 0 204 0.2s 1 0 1 100.00% 4.36024303 4.360248571 0.00% 111 7 0 306 0.2s Solving report Status Optimal Primal bound 4.36024857109 Dual bound 4.36024303034 Gap 0.000127% (tolerance: 0.01%) P-D integral 0.0101430630528 Solution status feasible 4.36024857109 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.20 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 3 (3 feasible; 117 iterations) LP iterations 306 (total) 0 (strong br.) 71 (separation) 64 (heuristics) 4.3602 1.6e-5 0.3 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored MIP has 963 rows; 306 cols; 2656 nonzeros; 51 integer variables (51 binary) Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 150 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 54 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 81 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 172 53.6 2620 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 963 rows; 306 cols; 2656 nonzeros Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 792 rows, 280 cols, 2323 nonzeros 0s 698 rows, 187 cols, 2395 nonzeros 0s 579 rows, 146 cols, 1995 nonzeros 0s Solving MIP model with: 579 rows 146 cols (16 binary, 0 integer, 0 implied int., 130 continuous) 1995 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00427744798 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 1.000758462 1.012116544 1.12% 0 0 0 208 0.0s 1 0 1 100.00% 1.012116544 1.012116544 0.00% 42 16 0 230 0.1s Solving report Status Optimal Primal bound 1.01211654376 Dual bound 1.01211654376 Gap 0% (tolerance: 0.01%) P-D integral 0.000212192248816 Solution status feasible 1.01211654376 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.07 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 230 (total) 0 (strong br.) 22 (separation) 0 (heuristics) 1.0121 1.3e-5 0.5 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored MIP has 1015 rows; 340 cols; 2877 nonzeros; 85 integer variables (85 binary) Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 150 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 54 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 81 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 176 53.6 2623 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 1015 rows; 340 cols; 2877 nonzeros Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 844 rows, 314 cols, 2544 nonzeros 0s 750 rows, 221 cols, 2616 nonzeros 0s 667 rows, 148 cols, 2029 nonzeros 0s 580 rows, 147 cols, 1983 nonzeros 0s Solving MIP model with: 580 rows 147 cols (16 binary, 0 integer, 0 implied int., 131 continuous) 1983 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283812 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992462 0.014509025 0.07% 0 0 0 167 0.0s 1 0 1 100.00% 0.014509025 0.014509025 0.00% 0 0 0 186 0.0s Solving report Status Optimal Primal bound 0.0145090249582 Dual bound 0.0145090249582 Gap 0% (tolerance: 0.01%) P-D integral 5.62124188973e-06 Solution status feasible 0.0145090249582 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) 0.0145 1.3e-5 0.9 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored MIP has 1067 rows; 374 cols; 3166 nonzeros; 119 integer variables (119 binary) Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 150 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 54 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 81 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 180 53.6 2627 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 1067 rows; 374 cols; 3166 nonzeros Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 896 rows, 348 cols, 2833 nonzeros 0s 802 rows, 255 cols, 2905 nonzeros 0s 699 rows, 148 cols, 2030 nonzeros 0s 580 rows, 147 cols, 1983 nonzeros 0s Solving MIP model with: 580 rows 147 cols (16 binary, 0 integer, 0 implied int., 131 continuous) 1983 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283892 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992458 0.0145090247 0.07% 0 0 0 167 0.0s 1 0 1 100.00% 0.0145090247 0.0145090247 0.00% 0 0 0 186 0.0s Solving report Status Optimal Primal bound 0.0145090246511 Dual bound 0.0145090246511 Gap 0% (tolerance: 0.01%) P-D integral 6.05188940516e-06 Solution status feasible 0.0145090246511 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) 0.0145 1.3e-5 1.0 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored MIP has 1119 rows; 408 cols; 3523 nonzeros; 153 integer variables (153 binary) Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 150 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 54 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 81 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 184 53.6 2631 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 1119 rows; 408 cols; 3523 nonzeros Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 948 rows, 382 cols, 3190 nonzeros 0s 819 rows, 276 cols, 3149 nonzeros 0s 731 rows, 148 cols, 2030 nonzeros 0s 580 rows, 147 cols, 1983 nonzeros 0s Solving MIP model with: 580 rows 147 cols (16 binary, 0 integer, 0 implied int., 131 continuous) 1983 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283892 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992458 0.0145090247 0.07% 0 0 0 167 0.0s 1 0 1 100.00% 0.0145090247 0.0145090247 0.00% 0 0 0 186 0.0s Solving report Status Optimal Primal bound 0.0145090246511 Dual bound 0.0145090246511 Gap 0% (tolerance: 0.01%) P-D integral 5.82917370457e-06 Solution status feasible 0.0145090246511 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 1.1176440715789795 s FP: 5 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 15.88 - 8.0 4 - 3 3 - 28.7 - 8.2 - 61.3% 4 4 - 28.9 - 8.4 - 75.3% 5 5 - 29.14 - 8.7 - 85.8% 6 5 - 29.49 - 8.9 - 75.9% 7 6 - 29.49 - 9.2 - 83.0% 8 6 - 29.53 - 9.5 - 81.2% 9 4 - 29.78 - 9.7 - 89.1% 10 5 - 29.88 - 9.9 - 73.4% 11 7 - 30.04 - 10.2 - 79.6% 12 6 - 30.08 - 10.4 - 80.8% 13 7 - 30.17 - 10.6 - 72.8% 14 7 - 30.18 - 10.9 - 83.9% 15 8 - 30.27 - 11.4 - 87.7% 5 9 31.08 30.27 2.61% 12.3 - 92.8% 4 7 31.08 30.3 2.5% 12.9 - 92.3% 4 7 31.08 30.33 2.41% 13.2 - 93.0% 4 3 31.08 30.36 2.31% 13.4 - 80.7% 4 4 31.08 30.36 2.31% 13.7 - 89.5% 4 8 31.08 30.43 2.09% 14.0 - 88.4% 4 9 31.08 30.43 2.09% 14.2 - 96.9% 4 10 31.08 30.61 1.53% 14.4 - 83.2% 3 11 31.08 30.69 1.25% 15.3 - ∞ 3 8 31.08 30.71 1.18% 15.7 - 91.5% 2 9 31.08 30.71 1.18% 16.0 - 95.2% 2 5 31.08 30.8 0.91% 16.3 - 18.0% 2 8 31.08 30.84 0.76% 16.5 - 78.0% 1 9 31.08 30.84 0.76% 16.8 - 93.5% 1 6 31.08 30.85 0.75% 17.0 - 91.8% 1 7 31.08 30.85 0.75% 17.3 - 72.2% 0 8 31.08 30.85 0.75% 17.6 - 91.7% #branches: 31 Obj: 31.081483413078534 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 123 #IntBinVar: 4 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.19515681266784668 Relaxation Obj: 0.63462323634396 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored MIP has 324 rows; 131 cols; 927 nonzeros; 4 integer variables (4 binary) Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [6e-06, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 97 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] WARNING: Row 68 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 58 11.13 164.1 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 324 rows; 131 cols; 927 nonzeros Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [6e-06, 1e+02] Presolving model 207 rows, 107 cols, 637 nonzeros 0s 135 rows, 68 cols, 518 nonzeros 0s Dependent equations search running on 37 equations with time limit of 1.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1.00s) 124 rows, 62 cols, 500 nonzeros 0s Presolve : Reductions: rows 124(-200); columns 62(-69); elements 500(-427) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 2.0887668211e+00 Pr: 56(173.201) 0s 45 2.0887880537e+00 0s Model status : Infeasible Simplex iterations: 45 Objective value : 2.0887615137e+00 HiGHS run time : 0.00 Presolving model 256 rows, 111 cols, 804 nonzeros 0s 192 rows, 78 cols, 682 nonzeros 0s 174 rows, 69 cols, 614 nonzeros 0s Solving MIP model with: 174 rows 69 cols (3 binary, 0 integer, 0 implied int., 66 continuous) 614 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.177614989 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 1.358847631 inf inf 0 0 0 71 0.0s C 0 0 0 0.00% 2.194869779 3.088748703 28.94% 10 0 0 83 0.0s H 0 0 0 0.00% 2.194869779 2.733727506 19.71% 10 0 0 83 0.0s 1 0 1 100.00% 2.733727506 2.733727506 0.00% 3 0 0 89 0.0s Solving report Status Optimal Primal bound 2.73372750646 Dual bound 2.73372750646 Gap 0% (tolerance: 0.01%) P-D integral 0.000484142297382 Solution status feasible 2.73372750646 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 89 (total) 0 (strong br.) 12 (separation) 6 (heuristics) 2.7337 3.0e-6 0.1 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored MIP has 337 rows; 139 cols; 963 nonzeros; 12 integer variables (12 binary) Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-03, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 97 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] WARNING: Row 68 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 60 11.13 165 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 337 rows; 139 cols; 963 nonzeros Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-03, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 269 rows, 119 cols, 840 nonzeros 0s 202 rows, 84 cols, 709 nonzeros 0s 175 rows, 68 cols, 617 nonzeros 0s 174 rows, 68 cols, 613 nonzeros 0s Solving MIP model with: 174 rows 68 cols (3 binary, 0 integer, 0 implied int., 65 continuous) 613 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0018788866 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.9996399183 1.00118797 0.15% 0 0 0 61 0.0s 1 0 1 100.00% 1.00118797 1.00118797 0.00% 3 2 0 63 0.0s Solving report Status Optimal Primal bound 1.00118797011 Dual bound 1.00118797011 Gap 0% (tolerance: 0.01%) P-D integral 4.11630539138e-06 Solution status feasible 1.00118797011 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 63 (total) 0 (strong br.) 2 (separation) 0 (heuristics) 1.0012 5.0e-6 0.1 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored MIP has 350 rows; 147 cols; 1015 nonzeros; 20 integer variables (20 binary) Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 97 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] WARNING: Row 68 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 63 11.13 169 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 350 rows; 147 cols; 1015 nonzeros Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 282 rows, 127 cols, 892 nonzeros 0s 212 rows, 90 cols, 748 nonzeros 0s 171 rows, 67 cols, 608 nonzeros 0s 169 rows, 66 cols, 602 nonzeros 0s Solving MIP model with: 169 rows 66 cols (3 binary, 0 integer, 0 implied int., 63 continuous) 602 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00437799902 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 0.00437799902 0.00437799902 0.00% 0 0 0 62 0.0s 1 0 1 100.00% 0.00437799902 0.00437799902 0.00% 0 0 0 62 0.0s Solving report Status Optimal Primal bound 0.00437799901706 Dual bound 0.00437799901706 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 0.00437799901706 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 62 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.0044 5.0e-6 0.2 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored MIP has 363 rows; 155 cols; 1083 nonzeros; 28 integer variables (28 binary) Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 97 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] WARNING: Row 68 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 66 11.13 172 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 363 rows; 155 cols; 1083 nonzeros Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 295 rows, 135 cols, 960 nonzeros 0s 222 rows, 96 cols, 799 nonzeros 0s 171 rows, 67 cols, 608 nonzeros 0s 169 rows, 66 cols, 602 nonzeros 0s Solving MIP model with: 169 rows 66 cols (3 binary, 0 integer, 0 implied int., 63 continuous) 602 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00428338883 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 0.00428338883 0.00428338883 0.00% 0 0 0 62 0.0s 1 0 1 100.00% 0.00428338883 0.00428338883 0.00% 0 0 0 62 0.0s Solving report Status Optimal Primal bound 0.00428338883256 Dual bound 0.00428338883256 Gap 0% (tolerance: 0.01%) P-D integral 3.36172144678e-18 Solution status feasible 0.00428338883256 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 62 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.21506500244140625 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 1 2 10.7 0.63 94.07% 0.5 2 - 0 3 10.7 9.73 9.11% 0.7 - 87.0% #branches: 2 Obj: 10.700000760133749 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 138 rows; 81 cols; 337 nonzeros; 8 integer variables (8 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 23 2 25.48 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 138 rows; 81 cols; 337 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Presolving model 72 rows, 42 cols, 146 nonzeros 0s 24 rows, 15 cols, 57 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 107 rows, 50 cols, 268 nonzeros 0s 91 rows, 34 cols, 273 nonzeros 0s 60 rows, 31 cols, 207 nonzeros 0s 59 rows, 30 cols, 212 nonzeros 0s Solving MIP model with: 59 rows 30 cols (8 binary, 0 integer, 0 implied int., 22 continuous) 212 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -400 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 311.1639469 inf inf 0 0 0 37 0.0s R 0 0 0 0.00% 320.8523953 354.9545624 9.61% 56 6 0 46 0.0s L 0 0 0 0.00% 320.8523953 329.9545624 2.76% 56 6 0 46 0.0s 1 0 1 100.00% 329.9545624 329.9545624 0.00% 64 7 0 58 0.0s Solving report Status Optimal Primal bound 329.954562409 Dual bound 329.954562409 Gap 0% (tolerance: 0.01%) P-D integral 0.00127217257615 Solution status feasible 329.954562409 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 58 (total) 0 (strong br.) 17 (separation) 4 (heuristics) nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 131 #IntBinVar: 8 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.47687578201293945 Relaxation Obj: 333.01469191472864 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 143 rows; 147 cols; 293 nonzeros; 8 integer variables (8 binary) Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [7e-09, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 18 2 18.03 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 143 rows; 147 cols; 293 nonzeros Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [7e-09, 2e+00] Presolving model 72 rows, 54 cols, 98 nonzeros 0s 2 rows, 12 cols, 8 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-143); columns 0(-147); elements 0(-293) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 3.7375769779e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 115 rows, 70 cols, 237 nonzeros 0s 66 rows, 39 cols, 154 nonzeros 0s 48 rows, 29 cols, 106 nonzeros 0s 32 rows, 21 cols, 74 nonzeros 0s 22 rows, 16 cols, 50 nonzeros 0s MIP start solution is feasible, objective value is 3.73757697793 Solving MIP model with: 22 rows 16 cols (6 binary, 0 integer, 3 implied int., 7 continuous) 50 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.7375769779 3.737576978 80.27% 0 0 0 0 0.0s T 0 0 0 0.00% 0.7375769779 0.7375782006 0.00% 0 0 0 9 0.0s 1 0 1 100.00% 0.7375782006 0.7375782006 0.00% 0 0 0 9 0.0s Solving report Status Optimal Primal bound 0.737578200595 Dual bound 0.737578200595 Gap 0% (tolerance: 0.01%) P-D integral 0.00141555540271 Solution status feasible 0.737578200595 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 1 (1 feasible; 0 iterations) LP iterations 9 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.7376 1.8282 1.1 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 168 rows; 163 cols; 365 nonzeros; 24 integer variables (24 binary) Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [5e-02, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 25 2 21.12 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 168 rows; 163 cols; 365 nonzeros Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [5e-02, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 144 rows, 86 cols, 317 nonzeros 0s 92 rows, 55 cols, 226 nonzeros 0s 73 rows, 44 cols, 174 nonzeros 0s 57 rows, 36 cols, 142 nonzeros 0s 51 rows, 23 cols, 87 nonzeros 0s 14 rows, 10 cols, 32 nonzeros 0s 12 rows, 9 cols, 28 nonzeros 0s Solving MIP model with: 12 rows 9 cols (4 binary, 0 integer, 0 implied int., 5 continuous) 28 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.049168337 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 1.049168337 1.049168337 0.00% 0 0 0 5 0.0s 1 0 1 100.00% 1.049168337 1.049168337 0.00% 0 0 0 5 0.0s Solving report Status Optimal Primal bound 1.04916833712 Dual bound 1.04916833712 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 1.04916833712 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 5 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: NLP couldn't be solved to optimality └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:405 1.0492 - 6.1 FP: 6.099318981170654 s FP: 2 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 333.01 - 0.3 0 - 1 3 348.02 343.77 1.22% 0.4 - 74.2% 0 4 348.02 344.32 1.06% 0.5 - 45.1% #branches: 3 Obj: 348.0219280921732 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 162 #IntBinVar: 8 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.40308690071105957 Relaxation Obj: 313.63100257663666 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored MIP has 663 rows; 178 cols; 1816 nonzeros; 8 integer variables (8 binary) Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [2e-08, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] WARNING: Row 37 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 89 50 2235 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 663 rows; 178 cols; 1816 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [2e-08, 5e+01] Presolving model 411 rows, 141 cols, 1157 nonzeros 0s 297 rows, 92 cols, 968 nonzeros 0s Dependent equations search running on 49 equations with time limit of 1.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1.00s) 260 rows, 83 cols, 871 nonzeros 0s Presolve : Reductions: rows 260(-403); columns 83(-95); elements 871(-945) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 4.0741245071e+00 Pr: 90(849.449); Du: 0(4.01042e-12) 0s 74 4.0742224803e+00 0s Model status : Infeasible Simplex iterations: 74 Objective value : 4.0741474752e+00 HiGHS run time : 0.00 Presolving model 501 rows, 149 cols, 1482 nonzeros 0s 452 rows, 100 cols, 1454 nonzeros 0s 366 rows, 82 cols, 1216 nonzeros 0s Solving MIP model with: 366 rows 82 cols (8 binary, 0 integer, 2 implied int., 72 continuous) 1216 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.5062481748 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 0.7347061741 inf inf 0 0 6 79 0.0s R 0 0 0 0.00% 1.191044828 1.531641504 22.24% 75 1 6 98 0.0s 62.5% inactive integer columns, restarting Model after restart has 206 rows, 53 cols (3 bin., 0 int., 0 impl., 50 cont.), and 709 nonzeros 0 0 0 0.00% 1.191044828 1.531641504 22.24% 1 0 0 101 0.1s 0 0 0 0.00% 1.230010085 1.531641504 19.69% 1 1 2 117 0.1s 1 0 1 100.00% 1.531641504 1.531641504 0.00% 1 1 2 117 0.1s Solving report Status Optimal Primal bound 1.53164150354 Dual bound 1.53164150354 Gap 0% (tolerance: 0.01%) P-D integral 0.00375897361242 Solution status feasible 1.53164150354 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.07 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 117 (total) 0 (strong br.) 19 (separation) 3 (heuristics) 1.5316 1.2e-5 0.1 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored MIP has 688 rows; 194 cols; 1888 nonzeros; 24 integer variables (24 binary) Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] WARNING: Row 37 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 96 50 2240 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 688 rows; 194 cols; 1888 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 530 rows, 165 cols, 1562 nonzeros 0s 477 rows, 112 cols, 1537 nonzeros 0s 371 rows, 82 cols, 1240 nonzeros 0s 357 rows, 82 cols, 1206 nonzeros 0s Solving MIP model with: 357 rows 82 cols (8 binary, 0 integer, 0 implied int., 74 continuous) 1206 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00528048082 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 1.001715419 1.005593776 0.39% 0 0 0 96 0.0s 1 0 1 100.00% 1.005593776 1.005593776 0.00% 8 3 1 138 0.0s Solving report Status Optimal Primal bound 1.00559377597 Dual bound 1.00559377597 Gap 0% (tolerance: 0.01%) P-D integral 4.46672714353e-05 Solution status feasible 1.00559377597 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 138 (total) 0 (strong br.) 5 (separation) 37 (heuristics) 1.0056 1.0e-5 0.3 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored MIP has 713 rows; 210 cols; 1992 nonzeros; 40 integer variables (40 binary) Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] WARNING: Row 37 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 100 50 2243 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 713 rows; 210 cols; 1992 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 555 rows, 181 cols, 1666 nonzeros 0s 455 rows, 123 cols, 1436 nonzeros 0s 372 rows, 83 cols, 1236 nonzeros 0s 358 rows, 83 cols, 1202 nonzeros 0s Solving MIP model with: 358 rows 83 cols (8 binary, 0 integer, 0 implied int., 75 continuous) 1202 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0034717667 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.00819361426 0.00819738351 0.05% 0 0 0 87 0.0s 25.0% inactive integer columns, restarting 0 0 0 100.00% 0.00819738351 0.00819738351 0.00% 0 211 0 87 0.0s Solving report Status Optimal Primal bound 0.00819738350593 Dual bound 0.00819738350593 Gap 0% (tolerance: 0.01%) P-D integral 2.46672433716e-06 Solution status feasible 0.00819738350593 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 0 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 87 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.0082 1.0e-5 0.4 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored MIP has 738 rows; 226 cols; 2128 nonzeros; 56 integer variables (56 binary) Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] WARNING: Row 37 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 104 50 2247 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 738 rows; 226 cols; 2128 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 580 rows, 197 cols, 1802 nonzeros 0s 479 rows, 139 cols, 1508 nonzeros 0s 372 rows, 83 cols, 1236 nonzeros 0s 358 rows, 83 cols, 1202 nonzeros 0s Solving MIP model with: 358 rows 83 cols (8 binary, 0 integer, 0 implied int., 75 continuous) 1202 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00347179352 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.00819367374 0.00819744303 0.05% 0 0 0 87 0.0s 25.0% inactive integer columns, restarting 0 0 0 100.00% 0.00819744303 0.00819744303 0.00% 0 211 0 87 0.0s Solving report Status Optimal Primal bound 0.00819744303134 Dual bound 0.00819744303134 Gap 0% (tolerance: 0.01%) P-D integral 3.09348348114e-06 Solution status feasible 0.00819744303134 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 0 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 87 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.40021491050720215 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 313.63 - 1.3 0 - 3 3 - 317.71 - 1.7 - 71.7% 1 4 342.07 329.96 3.54% 2.0 - 63.9% 0 5 333.1 331.65 0.44% 2.5 - 44.4% #branches: 4 Obj: 333.09519616504946 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 222 rows; 124 cols; 535 nonzeros; 17 integer variables (17 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 25 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 222 rows; 124 cols; 535 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 122 rows, 73 cols, 250 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 177 rows, 90 cols, 446 nonzeros 0s 156 rows, 69 cols, 464 nonzeros 0s 88 rows, 59 cols, 292 nonzeros 0s 88 rows, 59 cols, 292 nonzeros 0s Solving MIP model with: 88 rows 59 cols (16 binary, 0 integer, 0 implied int., 43 continuous) 292 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 4.5 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 20.06401564 inf inf 0 0 0 40 0.0s R 0 0 0 0.00% 20.06401564 27.9331482 28.17% 70 2 0 42 0.0s L 0 0 0 0.00% 25.51691606 26.9331482 5.26% 254 35 7 97 0.1s L 0 0 0 0.00% 25.6336619 26.3331482 2.66% 282 37 7 158 0.1s 50.0% inactive integer columns, restarting Model after restart has 49 rows, 37 cols (8 bin., 0 int., 0 impl., 29 cont.), and 161 nonzeros 0 0 0 0.00% 25.7652385 26.3331482 2.16% 6 0 0 181 0.1s 0 0 0 0.00% 25.7652385 26.3331482 2.16% 6 4 0 201 0.1s 1 0 1 100.00% 26.3331482 26.3331482 0.00% 253 13 10 342 0.1s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) P-D integral 0.00771648030434 Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.15 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 342 (total) 48 (strong br.) 99 (separation) 122 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 228 rows; 126 cols; 555 nonzeros; 18 integer variables (18 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 3e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 25 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 228 rows; 126 cols; 555 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 3e+01] Presolving model 126 rows, 75 cols, 262 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 185 rows, 93 cols, 470 nonzeros 0s 162 rows, 70 cols, 494 nonzeros 0s 103 rows, 66 cols, 352 nonzeros 0s 103 rows, 66 cols, 352 nonzeros 0s Solving MIP model with: 103 rows 66 cols (18 binary, 0 integer, 0 implied int., 48 continuous) 352 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 16.23419662 inf inf 0 0 0 58 0.0s C 0 0 0 0.00% 19.79604205 54.7331482 63.83% 277 13 0 77 0.0s L 0 0 0 0.00% 22.08202676 25.4220988 13.14% 365 31 0 107 0.1s 3 0 2 100.00% 25.4220988 25.4220988 0.00% 372 13 16 380 0.2s Solving report Status Optimal Primal bound 25.4220988029 Dual bound 25.4220988029 Gap 0% (tolerance: 0.01%) P-D integral 0.0407624979379 Solution status feasible 25.4220988029 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.18 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 3 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 380 (total) 126 (strong br.) 49 (separation) 99 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 235 rows; 140 cols; 575 nonzeros; 17 integer variables (17 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [1e-02, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 35 has infeasibility of 1.6 from [lower, value, upper] = [ -2; -3.6; 2] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] Solution has num max sum Col infeasibilities 2 1.6 3.2 Integer infeasibilities 0 0 0 Row infeasibilities 94 7.473 293 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 235 rows; 140 cols; 575 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [1e-02, 6e+00] Presolving model 130 rows, 84 cols, 277 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 189 rows, 101 cols, 481 nonzeros 0s 163 rows, 76 cols, 483 nonzeros 0s 95 rows, 66 cols, 315 nonzeros 0s 90 rows, 61 cols, 320 nonzeros 0s Solving MIP model with: 90 rows 61 cols (16 binary, 0 integer, 0 implied int., 45 continuous) 320 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 4.5 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 18.50146576 24.44419761 24.31% 0 0 0 52 0.0s L 0 0 0 0.00% 21.86982283 22.84419761 4.27% 329 27 0 117 0.1s 50.0% inactive integer columns, restarting Model after restart has 40 rows, 38 cols (8 bin., 0 int., 0 impl., 30 cont.), and 116 nonzeros 0 0 0 0.00% 22.35609975 22.84419761 2.14% 6 0 0 213 0.1s 25.0% inactive integer columns, restarting Model after restart has 36 rows, 35 cols (6 bin., 0 int., 0 impl., 29 cont.), and 106 nonzeros 0 0 0 0.00% 22.35609975 22.84419761 2.14% 6 0 0 235 0.1s 0 0 0 0.00% 22.35609975 22.84419761 2.14% 6 6 0 256 0.1s 1 0 1 100.00% 22.84419761 22.84419761 0.00% 115 19 3 358 0.1s Solving report Status Optimal Primal bound 22.8441976059 Dual bound 22.8441976059 Gap 0% (tolerance: 0.01%) P-D integral 0.00923754870301 Solution status feasible 22.8441976059 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.11 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 358 (total) 0 (strong br.) 120 (separation) 122 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 126 rows; 100 cols; 301 nonzeros; 11 integer variables (11 binary) Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 4e+00] Bound [4e-01, 1e+01] RHS [1e-02, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 25 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 126 rows; 100 cols; 301 nonzeros Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 4e+00] Bound [4e-01, 1e+01] RHS [1e-02, 2e+00] Presolving model 55 rows, 46 cols, 136 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 77 rows, 57 cols, 202 nonzeros 0s 62 rows, 42 cols, 183 nonzeros 0s 54 rows, 34 cols, 164 nonzeros 0s 27 rows, 28 cols, 96 nonzeros 0s 26 rows, 27 cols, 96 nonzeros 0s Solving MIP model with: 26 rows 27 cols (11 binary, 0 integer, 0 implied int., 16 continuous) 96 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.4552470073 inf inf 0 0 0 0 0.0s S 0 0 0 0.00% 0.4552470073 14.96629641 96.96% 0 0 0 0 0.0s 0 0 0 0.00% 11.01699014 14.96629641 26.39% 0 0 0 16 0.0s L 0 0 0 0.00% 11.36682792 13.96629641 18.61% 25 2 2 19 0.0s 36.4% inactive integer columns, restarting Model after restart has 20 rows, 21 cols (7 bin., 0 int., 0 impl., 14 cont.), and 73 nonzeros 0 0 0 0.00% 11.76343475 13.96629641 15.77% 3 0 0 42 0.0s 0 0 0 0.00% 11.76343475 13.96629641 15.77% 3 3 0 48 0.0s L 0 0 0 0.00% 13.02015969 13.96629641 6.77% 133 7 3 72 0.1s B 0 0 0 0.00% 13.02015969 13.36629641 2.59% 134 7 5 97 0.1s 1 0 1 100.00% 13.36629641 13.36629641 0.00% 134 7 7 139 0.1s Solving report Status Optimal Primal bound 13.3662964088 Dual bound 13.3662964088 Gap 0% (tolerance: 0.01%) P-D integral 0.00824197076303 Solution status feasible 13.3662964088 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.07 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 139 (total) 36 (strong br.) 22 (separation) 53 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 271 rows; 158 cols; 652 nonzeros; 14 integer variables (14 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+00] Bound [1e+00, 6e+00] RHS [1e+00, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 46 2 50.96 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 271 rows; 158 cols; 652 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+00] Bound [1e+00, 6e+00] RHS [1e+00, 6e+00] Presolving model 144 rows, 84 cols, 284 nonzeros 0s 32 rows, 22 cols, 80 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 204 rows, 91 cols, 504 nonzeros 0s 168 rows, 57 cols, 508 nonzeros 0s 103 rows, 50 cols, 348 nonzeros 0s 102 rows, 49 cols, 357 nonzeros 0s Objective function is integral with scale 5 Solving MIP model with: 102 rows 49 cols (7 binary, 0 integer, 0 implied int., 42 continuous) 357 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 6.243037666 inf inf 0 0 0 32 0.0s S 0 0 0 100.00% 6.243037666 8.2 23.87% 21 1 0 32 0.0s 1 0 1 100.00% 8.2 8.2 0.00% 16 1 0 42 0.0s Solving report Status Optimal Primal bound 8.2 Dual bound 8.2 Gap 0% (tolerance: 0.01%) P-D integral 1.35989886317e-05 Solution status feasible 8.2 (objective) 0 (bound viol.) 5.01820807131e-14 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 42 (total) 0 (strong br.) 10 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 466 rows; 258 cols; 1120 nonzeros; 34 integer variables (34 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 18 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] WARNING: Row 25 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 2 0.5 1 Integer infeasibilities 0 0 0 Row infeasibilities 165 7.473 466.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 466 rows; 258 cols; 1120 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 250 rows, 155 cols, 518 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 362 rows, 172 cols, 914 nonzeros 0s 317 rows, 127 cols, 945 nonzeros 0s 186 rows, 114 cols, 614 nonzeros 0s 178 rows, 106 cols, 608 nonzeros 0s Solving MIP model with: 178 rows 106 cols (16 binary, 0 integer, 0 implied int., 90 continuous) 608 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 9 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 39.23831494 inf inf 0 0 0 91 0.0s R 0 0 0 0.00% 46.59572038 63.06629641 26.12% 157 5 0 107 0.0s L 0 0 0 0.00% 51.42789765 52.66629641 2.35% 502 25 0 166 0.1s 56.2% inactive integer columns, restarting Model after restart has 53 rows, 50 cols (7 bin., 0 int., 2 impl., 41 cont.), and 150 nonzeros 0 0 0 0.00% 51.75626318 52.66629641 1.73% 4 0 0 282 0.2s 28.6% inactive integer columns, restarting Model after restart has 45 rows, 46 cols (5 bin., 0 int., 0 impl., 41 cont.), and 131 nonzeros 0 0 0 0.00% 51.75626318 52.66629641 1.73% 3 0 0 298 0.2s 0 0 0 0.00% 51.75626318 52.66629641 1.73% 3 3 0 304 0.2s 1 0 1 100.00% 52.66629641 52.66629641 0.00% 67 7 1 316 0.2s Solving report Status Optimal Primal bound 52.6662964088 Dual bound 52.6662964088 Gap 0% (tolerance: 0.01%) P-D integral 0.0207128952311 Solution status feasible 52.6662964088 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.18 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 316 (total) 0 (strong br.) 84 (separation) 118 (heuristics) nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 306 #IntBinVar: 14 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.4475531578063965 Relaxation Obj: 5.6560522821656 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored MIP has 1331 rows; 334 cols; 3660 nonzeros; 14 integer variables (14 binary) Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [2e-06, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] WARNING: Row 36 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 188 50 4870 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 1331 rows; 334 cols; 3660 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [2e-06, 5e+01] Presolving model 846 rows, 268 cols, 2392 nonzeros 0s 620 rows, 180 cols, 2028 nonzeros 0s Dependent equations search running on 104 equations with time limit of 1.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1.00s) 562 rows, 168 cols, 1874 nonzeros 0s Presolve : Reductions: rows 562(-769); columns 168(-166); elements 1874(-1786) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 7.9973483477e+00 Pr: 182(2058.06); Du: 0(1.99661e-12) 0s 132 7.9975868955e+00 0s Model status : Infeasible Simplex iterations: 132 Objective value : 7.9974097857e+00 HiGHS run time : 0.01 Presolving model 1010 rows, 275 cols, 3000 nonzeros 0s 862 rows, 195 cols, 2603 nonzeros 0s 742 rows, 152 cols, 2409 nonzeros 0s 724 rows, 148 cols, 2331 nonzeros 0s Solving MIP model with: 724 rows 148 cols (6 binary, 0 integer, 0 implied int., 142 continuous) 2331 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.815151259 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 2.407598659 6.802591963 64.61% 0 0 0 172 0.0s C 0 0 0 0.00% 3.984894684 5.81516365 31.47% 55 7 0 235 0.1s L 0 0 0 0.00% 3.984894684 3.984901819 0.00% 55 7 0 235 0.1s 1 0 1 100.00% 3.984894684 3.984901819 0.00% 55 7 0 244 0.1s Solving report Status Optimal Primal bound 3.98490181926 Dual bound 3.98489468411 Gap 0.000179% (tolerance: 0.01%) P-D integral 0.0328560942156 Solution status feasible 3.98490181926 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.11 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 244 (total) 0 (strong br.) 63 (separation) 9 (heuristics) 3.9849 1.9e-5 0.3 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored MIP has 1374 rows; 362 cols; 3786 nonzeros; 42 integer variables (42 binary) Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] WARNING: Row 36 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 197 50 4879 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 1374 rows; 362 cols; 3786 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1053 rows, 303 cols, 3126 nonzeros 0s 905 rows, 223 cols, 2729 nonzeros 0s 747 rows, 154 cols, 2423 nonzeros 0s 729 rows, 150 cols, 2345 nonzeros 0s Solving MIP model with: 729 rows 150 cols (6 binary, 0 integer, 0 implied int., 144 continuous) 2345 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00907880828 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 2.001858054 2.007615521 0.29% 0 0 0 162 0.0s 1 0 1 100.00% 2.007615521 2.007615521 0.00% 0 0 0 188 0.1s Solving report Status Optimal Primal bound 2.00761552083 Dual bound 2.00761552083 Gap 0% (tolerance: 0.01%) P-D integral 1.63878811617e-05 Solution status feasible 2.00761552083 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 188 (total) 0 (strong br.) 26 (separation) 0 (heuristics) 2.0076 1.4e-5 0.4 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored MIP has 1417 rows; 390 cols; 3968 nonzeros; 70 integer variables (70 binary) Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] WARNING: Row 36 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 204 50 4884 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 1417 rows; 390 cols; 3968 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1096 rows, 331 cols, 3308 nonzeros 0s 947 rows, 251 cols, 2855 nonzeros 0s 750 rows, 156 cols, 2425 nonzeros 0s 732 rows, 152 cols, 2347 nonzeros 0s Solving MIP model with: 732 rows 152 cols (6 binary, 0 integer, 0 implied int., 146 continuous) 2347 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00540643997 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129948194 0.0130007341 0.05% 0 0 0 150 0.0s 16.7% inactive integer columns, restarting Model after restart has 419 rows, 102 cols (0 bin., 0 int., 0 impl., 102 cont.), and 1294 nonzeros 0 0 0 0.00% 0.0130007341 0.0130007341 0.00% 0 0 0 150 0.1s 1 0 1 100.00% 0.0130007341 0.0130007341 0.00% 0 0 0 206 0.1s Solving report Status Optimal Primal bound 0.0130007341293 Dual bound 0.0130007341293 Gap 0% (tolerance: 0.01%) P-D integral 8.88328818514e-06 Solution status feasible 0.0130007341293 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.06 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 206 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.013 1.4e-5 0.6 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored MIP has 1460 rows; 418 cols; 4206 nonzeros; 98 integer variables (98 binary) Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] WARNING: Row 36 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 211 50 4891 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 1460 rows; 418 cols; 4206 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1139 rows, 359 cols, 3546 nonzeros 0s 989 rows, 279 cols, 2981 nonzeros 0s 750 rows, 156 cols, 2425 nonzeros 0s 732 rows, 152 cols, 2347 nonzeros 0s Solving MIP model with: 732 rows 152 cols (6 binary, 0 integer, 0 implied int., 146 continuous) 2347 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00540641046 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129946795 0.0130005941 0.05% 0 0 0 152 0.0s 16.7% inactive integer columns, restarting Model after restart has 419 rows, 102 cols (0 bin., 0 int., 0 impl., 102 cont.), and 1294 nonzeros 0 0 0 0.00% 0.0130005941 0.0130005941 0.00% 0 0 0 152 0.0s 1 0 1 100.00% 0.0130005941 0.0130005941 0.00% 0 0 0 208 0.1s Solving report Status Optimal Primal bound 0.0130005940961 Dual bound 0.0130005940961 Gap 0% (tolerance: 0.01%) P-D integral 4.91779593418e-06 Solution status feasible 0.0130005940961 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.07 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 208 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.7191829681396484 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 5.66 - 5.3 1 - 2 3 - 7.38 - 6.2 - 70.3% 3 3 - 8.24 - 6.4 - 91.1% 3 4 - 8.24 - 7.2 - 7903.4% 3 5 - 8.24 - 7.8 - 82.1% 3 4 - 8.45 - 8.5 - 68.7% 3 5 - 8.95 - 9.1 - 83.6% 0 6 10.2 10.20001 0.0% 9.3 - 83.7% #branches: 8 Obj: 10.200001576561705 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 284 rows; 162 cols; 690 nonzeros; 16 integer variables (16 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ 0; 1; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 46 2 50.96 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 284 rows; 162 cols; 690 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Presolving model 144 rows, 84 cols, 292 nonzeros 0s 48 rows, 30 cols, 114 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 214 rows, 92 cols, 536 nonzeros 0s 182 rows, 60 cols, 539 nonzeros 0s 115 rows, 54 cols, 400 nonzeros 0s 113 rows, 52 cols, 417 nonzeros 0s Solving MIP model with: 113 rows 52 cols (8 binary, 0 integer, 0 implied int., 44 continuous) 417 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -800 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 622.3278939 inf inf 1 0 0 71 0.0s R 0 0 0 0.00% 622.3278939 659.9091248 5.69% 81 3 0 72 0.0s 25.0% inactive integer columns, restarting Model after restart has 76 rows, 42 cols (4 bin., 0 int., 0 impl., 38 cont.), and 249 nonzeros 0 0 0 0.00% 622.3278939 659.9091248 5.69% 1 0 0 97 0.0s 0 0 0 0.00% 622.3278939 659.9091248 5.69% 1 1 0 98 0.0s H 0 0 0 0.00% 646.2927624 659.9091248 2.06% 59 3 1 102 0.0s T 0 0 0 0.00% 646.2927624 659.9091248 2.06% 59 3 1 130 0.0s 1 0 1 100.00% 659.9091248 659.9091248 0.00% 56 3 1 130 0.0s Solving report Status Optimal Primal bound 659.909124818 Dual bound 659.909124818 Gap 0% (tolerance: 0.01%) P-D integral 0.000594423988263 Solution status feasible 659.909124818 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 130 (total) 0 (strong br.) 5 (separation) 42 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 2884 rows; 1920 cols; 7669 nonzeros; 720 integer variables (720 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 8e+00] RHS [5e-01, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 144 5 441.4 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 2884 rows; 1920 cols; 7669 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 8e+00] RHS [5e-01, 5e+00] Presolving model 744 rows, 864 cols, 2088 nonzeros 0s 384 rows, 600 cols, 1201 nonzeros 0s 240 rows, 480 cols, 720 nonzeros 0s 132 rows, 297 cols, 396 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-2884); columns 0(-1920); elements 0(-7669) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 3.1030420000e+08 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2164 rows, 1824 cols, 6661 nonzeros 0s 1753 rows, 1543 cols, 6180 nonzeros 0s 1687 rows, 1479 cols, 6425 nonzeros 0s MIP start solution is feasible, objective value is 310304200 Solving MIP model with: 1687 rows 1479 cols (568 binary, 0 integer, 0 implied int., 911 continuous) 6425 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -1000 310304200 100.00% 0 0 0 0 0.1s R 0 0 0 0.00% 844938.897072 17491136.69304 95.17% 0 0 0 808 0.1s C 0 0 0 0.00% 892130.436328 1098355.618983 18.78% 1696 91 0 992 0.4s L 0 0 0 0.00% 893123.513229 893123.513229 0.00% 2160 105 0 1016 1.3s 1 0 1 100.00% 893123.513229 893123.513229 0.00% 2160 105 0 1484 1.3s Solving report Status Optimal Primal bound 893123.513229 Dual bound 893123.513229 Gap 0% (tolerance: 0.01%) P-D integral 0.489361018831 Solution status feasible 893123.513229 (objective) 0 (bound viol.) 2.14643118094e-14 (int. viol.) 0 (row viol.) Timing 1.33 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 5 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1484 (total) 0 (strong br.) 208 (separation) 468 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 2884 rows; 1920 cols; 7669 nonzeros; 240 integer variables (240 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 8e+00] RHS [5e-01, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 144 5 441.4 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 2884 rows; 1920 cols; 7669 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 8e+00] RHS [5e-01, 5e+00] Presolving model 867 rows, 918 cols, 2337 nonzeros 0s 384 rows, 600 cols, 1201 nonzeros 0s 240 rows, 480 cols, 720 nonzeros 0s 132 rows, 297 cols, 396 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-2884); columns 0(-1920); elements 0(-7669) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 3.1030420000e+08 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2164 rows, 1824 cols, 6661 nonzeros 0s 1809 rows, 1605 cols, 5827 nonzeros 0s MIP start solution is feasible, objective value is 310304200 Solving MIP model with: 1809 rows 1605 cols (240 binary, 0 integer, 6 implied int., 1359 continuous) 5827 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 310304200 100.00% 0 0 0 0 0.0s R 0 0 0 0.00% 844938.897072 17519702.57138 95.18% 0 0 0 813 0.1s C 0 0 0 0.00% 892663.368038 1106300.351765 19.31% 1195 101 0 985 0.3s L 0 0 0 0.00% 893123.513229 893123.513229 0.00% 1402 111 0 1007 0.5s 1 0 1 100.00% 893123.513229 893123.513229 0.00% 1402 111 0 1048 0.5s Solving report Status Optimal Primal bound 893123.513229 Dual bound 893123.513229 Gap 0% (tolerance: 0.01%) P-D integral 0.282822344199 Solution status feasible 893123.513229 (objective) 0 (bound viol.) 6.66133814775e-16 (int. viol.) 0 (row viol.) Timing 0.48 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1048 (total) 0 (strong br.) 194 (separation) 41 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 3244 rows; 2304 cols; 8629 nonzeros; 720 integer variables (720 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.7 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 3244 rows; 2304 cols; 8629 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Presolving model 936 rows, 1080 cols, 2712 nonzeros 0s 590 rows, 823 cols, 1951 nonzeros 0s 415 rows, 703 cols, 1479 nonzeros 0s Dependent equations search running on 396 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 396 rows, 667 cols, 1403 nonzeros 0s Presolve : Reductions: rows 396(-2848); columns 667(-1637); elements 1403(-7226) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.3089554739e-03 Pr: 396(7160.68); Du: 0(3.26772e-12) 0s 482 3.1063114320e+08 0s Model status : Infeasible Simplex iterations: 482 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2356 rows, 2040 cols, 7285 nonzeros 0s 1972 rows, 1762 cols, 6721 nonzeros 0s 1688 rows, 1505 cols, 6443 nonzeros 0s Solving MIP model with: 1688 rows 1505 cols (567 binary, 0 integer, 0 implied int., 938 continuous) 6443 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -4200 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 829745.562234 1676017.6677 50.49% 0 0 0 876 0.2s C 0 0 0 0.00% 852996.649092 893963.615673 4.58% 1541 77 0 1061 0.4s L 0 0 0 0.00% 862040.91683 869583.36262 0.87% 4801 114 0 1596 4.5s L 0 0 0 0.00% 862041.09292 869583.36262 0.87% 4708 98 0 2417 6.1s 19.0% inactive integer columns, restarting Model after restart has 1399 rows, 1235 cols (433 bin., 0 int., 0 impl., 802 cont.), and 5196 nonzeros 0 0 0 0.00% 862041.09292 869583.36262 0.87% 65 0 0 3458 6.2s 0 0 0 0.00% 862041.09292 869583.36262 0.87% 65 61 0 3664 6.2s 0 0 0 0.00% 862670.900377 869583.36262 0.79% 185 63 0 6675 11.3s 3 0 2 100.00% 869583.36262 869583.36262 0.00% 196 63 32 9183 14.0s Solving report Status Optimal Primal bound 869583.36262 Dual bound 869583.36262 Gap 0% (tolerance: 0.01%) P-D integral 0.346659862025 Solution status feasible 869583.36262 (objective) 0 (bound viol.) 2.35212815408e-12 (int. viol.) 0 (row viol.) Timing 14.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 6 Nodes 3 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 9183 (total) 599 (strong br.) 892 (separation) 6481 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 3244 rows; 2304 cols; 8629 nonzeros; 240 integer variables (240 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.7 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 3244 rows; 2304 cols; 8629 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Presolving model 1059 rows, 1134 cols, 2961 nonzeros 0s 590 rows, 823 cols, 1951 nonzeros 0s 415 rows, 703 cols, 1479 nonzeros 0s Dependent equations search running on 396 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 396 rows, 667 cols, 1403 nonzeros 0s Presolve : Reductions: rows 396(-2848); columns 667(-1637); elements 1403(-7226) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.3089554739e-03 Pr: 396(7160.68); Du: 0(3.26772e-12) 0s 482 3.1063114320e+08 0s Model status : Infeasible Simplex iterations: 482 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2356 rows, 2040 cols, 7285 nonzeros 0s 1892 rows, 1730 cols, 6169 nonzeros 0s 1812 rows, 1632 cols, 5886 nonzeros 0s Solving MIP model with: 1812 rows 1632 cols (240 binary, 0 integer, 6 implied int., 1386 continuous) 5886 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 829745.562234 inf inf 0 0 2 878 0.1s R 0 0 0 0.00% 849018.723612 2171214.427914 60.90% 471 46 4 988 0.2s C 0 0 0 0.00% 855282.278928 905096.214992 5.50% 1133 88 4 1081 0.3s L 0 0 0 0.00% 863045.885527 869583.36262 0.75% 3893 92 4 1392 2.0s 3.7% inactive integer columns, restarting Model after restart has 1606 rows, 1447 cols (227 bin., 0 int., 2 impl., 1218 cont.), and 5410 nonzeros 0 0 0 0.00% 863051.994491 869583.36262 0.75% 64 0 0 3313 3.6s 0 0 0 0.00% 863052.124047 869583.36262 0.75% 64 56 4 3538 3.6s L 0 0 0 0.00% 864034.812146 869583.36262 0.64% 1043 89 4 3757 5.7s L 0 0 0 0.00% 864034.812146 869583.36262 0.64% 1043 59 4 6373 10.4s 1 0 1 100.00% 869583.36262 869583.36262 0.00% 1049 59 16 8621 10.7s Solving report Status Optimal Primal bound 869583.36262 Dual bound 869583.36262 Gap 0% (tolerance: 0.01%) P-D integral 0.206623512164 Solution status feasible 869583.36262 (objective) 0 (bound viol.) 1.50324197534e-13 (int. viol.) 0 (row viol.) Timing 10.67 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 4 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 8621 (total) 1180 (strong br.) 738 (separation) 5507 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 3630 rows; 2592 cols; 9493 nonzeros; 768 integer variables (768 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 38 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 96 0.5 38.4 Integer infeasibilities 0 0 0 Row infeasibilities 408 5 650.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 3630 rows; 2592 cols; 9493 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Presolving model 936 rows, 1080 cols, 2712 nonzeros 0s 590 rows, 823 cols, 1951 nonzeros 0s 417 rows, 705 cols, 1485 nonzeros 0s Dependent equations search running on 400 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 400 rows, 671 cols, 1417 nonzeros 0s Presolve : Reductions: rows 400(-3230); columns 671(-1921); elements 1417(-8076) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.2217143365e-03 Pr: 400(6973.56); Du: 0(2.88333e-12) 0s 487 3.1063130426e+08 0s Model status : Infeasible Simplex iterations: 487 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2452 rows, 2232 cols, 7667 nonzeros 0s 2041 rows, 1927 cols, 6945 nonzeros 0s 1738 rows, 1649 cols, 6796 nonzeros 0s Solving MIP model with: 1738 rows 1649 cols (568 binary, 0 integer, 0 implied int., 1081 continuous) 6796 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 822387.098796 1085603.05903 24.25% 0 0 0 998 0.2s C 0 0 0 0.00% 842820.104888 875480.526324 3.73% 1662 86 0 1209 0.5s L 0 0 0 0.00% 852109.432335 857044.684693 0.58% 5639 156 0 1801 3.8s 18.5% inactive integer columns, restarting Model after restart has 1440 rows, 1369 cols (432 bin., 0 int., 0 impl., 937 cont.), and 5484 nonzeros 0 0 0 0.00% 852113.41892 857044.684693 0.58% 72 0 0 6611 6.9s 0 0 0 0.00% 852113.41892 857044.684693 0.58% 72 66 0 6883 6.9s L 0 0 0 0.00% 852285.873734 857044.684693 0.56% 682 106 0 9193 13.1s 1 0 1 100.00% 857043.65388 857044.684693 0.00% 690 67 19 15248 16.0s Solving report Status Optimal Primal bound 857044.684693 Dual bound 857043.65388 Gap 0.00012% (tolerance: 0.01%) P-D integral 0.227002651151 Solution status feasible 857044.684693 (objective) 0 (bound viol.) 1.01534961119e-11 (int. viol.) 0 (row viol.) Timing 16.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 7 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 15248 (total) 637 (strong br.) 952 (separation) 12086 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 3630 rows; 2592 cols; 9493 nonzeros; 288 integer variables (288 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 38 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 96 0.5 38.4 Integer infeasibilities 0 0 0 Row infeasibilities 408 5 650.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 3630 rows; 2592 cols; 9493 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Presolving model 1059 rows, 1134 cols, 2961 nonzeros 0s 590 rows, 823 cols, 1951 nonzeros 0s 417 rows, 705 cols, 1485 nonzeros 0s Dependent equations search running on 400 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 400 rows, 671 cols, 1417 nonzeros 0s Presolve : Reductions: rows 400(-3230); columns 671(-1921); elements 1417(-8076) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.2217143365e-03 Pr: 400(6973.56); Du: 0(2.88333e-12) 0s 487 3.1063130426e+08 0s Model status : Infeasible Simplex iterations: 487 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2452 rows, 2232 cols, 7667 nonzeros 0s 1939 rows, 1873 cols, 6451 nonzeros 0s 1859 rows, 1775 cols, 6167 nonzeros 0s Solving MIP model with: 1859 rows 1775 cols (240 binary, 0 integer, 6 implied int., 1529 continuous) 6167 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 822387.098796 1233083.53523 33.31% 0 0 0 935 0.1s C 0 0 0 0.00% 845007.344276 887063.125642 4.74% 1113 90 0 1186 0.3s L 0 0 0 0.00% 849280.767778 857044.684693 0.91% 2747 122 0 1633 2.1s L 0 0 0 0.00% 849282.336544 857044.684693 0.91% 2751 127 0 3044 3.5s 3.7% inactive integer columns, restarting Model after restart has 1648 rows, 1591 cols (227 bin., 0 int., 4 impl., 1360 cont.), and 5682 nonzeros 0 0 0 0.00% 849282.336544 857044.684693 0.91% 82 0 0 4612 3.5s 0 0 0 0.00% 849282.336544 857044.684693 0.91% 82 75 2 4922 3.6s L 0 0 0 0.00% 849344.43958 857044.684693 0.90% 136 86 2 4952 6.8s 1 0 1 100.00% 856998.981283 857044.684693 0.01% 147 77 17 12598 12.3s 1 0 1 100.00% 856998.981283 857044.684693 0.01% 147 77 17 12598 12.3s Solving report Status Optimal Primal bound 857044.684693 Dual bound 856998.981283 Gap 0.00533% (tolerance: 0.01%) P-D integral 0.235446098484 Solution status feasible 857044.684693 (objective) 0 (bound viol.) 8.81072992343e-12 (int. viol.) 0 (row viol.) Timing 12.31 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 5 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 12598 (total) 700 (strong br.) 734 (separation) 9700 (heuristics) Any[1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 201, 211, 221, 231] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 31300 rows; 18624 cols; 78860 nonzeros; 1152 integer variables (1152 binary) Coefficient ranges: Matrix [5e-01, 3e+02] Cost [2e+01, 1e+06] Bound [5e-01, 1e+06] RHS [1e-03, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 16338 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 96 0.5 38.4 Integer infeasibilities 0 0 0 Row infeasibilities 1680 5 1709 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 31300 rows; 18624 cols; 78860 nonzeros Coefficient ranges: Matrix [5e-01, 3e+02] Cost [2e+01, 1e+06] Bound [5e-01, 1e+06] RHS [1e-03, 1e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.02 Presolving model 8318 rows, 6192 cols, 39270 nonzeros 0s 6872 rows, 4814 cols, 35440 nonzeros 0s 4542 rows, 2758 cols, 17806 nonzeros 0s 4333 rows, 2525 cols, 18083 nonzeros 0s Solving MIP model with: 4333 rows 2525 cols (914 binary, 0 integer, 96 implied int., 1515 continuous) 18083 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 88800 inf inf 0 0 0 0 0.3s R 0 0 0 0.00% 1219855.63119 14212879.40378 91.42% 0 0 0 1488 0.5s C 0 0 0 0.00% 1245117.826254 1254217.943459 0.73% 1314 222 0 1744 0.9s L 0 0 0 0.00% 1247417.388878 1251663.01406 0.34% 1576 260 0 1799 3.2s 23.3% inactive integer columns, restarting Model after restart has 3117 rows, 1940 cols (562 bin., 0 int., 81 impl., 1297 cont.), and 12583 nonzeros 0 0 0 0.00% 1248326.474116 1251663.01406 0.27% 93 0 0 3734 8.1s 0 0 0 0.00% 1248326.474116 1251663.01406 0.27% 93 86 0 4102 8.1s 0 0 0 0.00% 1249355.688294 1251663.01406 0.18% 411 90 0 6950 16.9s 13.0% inactive integer columns, restarting Model after restart has 2577 rows, 1716 cols (418 bin., 0 int., 65 impl., 1233 cont.), and 10106 nonzeros 0 0 0 0.00% 1249355.688294 1251663.01406 0.18% 84 0 0 6950 16.9s 0 0 0 0.00% 1249355.688294 1251663.01406 0.18% 84 79 0 7193 17.0s L 0 0 0 0.00% 1250007.571662 1251663.01406 0.13% 391 120 0 8505 22.7s 11.7% inactive integer columns, restarting Model after restart has 2190 rows, 1507 cols (295 bin., 0 int., 53 impl., 1159 cont.), and 8283 nonzeros 0 0 0 0.00% 1250007.571662 1251663.01406 0.13% 86 0 0 9548 22.8s 0 0 0 0.00% 1250037.377492 1251663.01406 0.13% 86 81 0 9820 22.8s 0 0 0 0.00% 1250744.747625 1251663.01406 0.07% 785 86 0 12208 29.2s 10.2% inactive integer columns, restarting Model after restart has 2008 rows, 1412 cols (245 bin., 0 int., 46 impl., 1121 cont.), and 7519 nonzeros 0 0 0 0.00% 1250744.747625 1251663.01406 0.07% 82 0 0 12208 29.2s 0 0 0 0.00% 1250745.691998 1251663.01406 0.07% 82 79 0 12480 29.3s 0 0 0 0.00% 1251063.471683 1251663.01406 0.05% 548 82 0 14155 34.8s 11.8% inactive integer columns, restarting Model after restart has 1801 rows, 1333 cols (205 bin., 0 int., 35 impl., 1093 cont.), and 6721 nonzeros 0 0 0 0.00% 1251063.471683 1251663.01406 0.05% 82 0 0 14155 34.9s 0 0 0 0.00% 1251094.587198 1251663.01406 0.05% 82 78 0 14402 34.9s 12.2% inactive integer columns, restarting Model after restart has 1617 rows, 1277 cols (176 bin., 0 int., 21 impl., 1080 cont.), and 6102 nonzeros 0 0 0 0.00% 1251321.025802 1251663.01406 0.03% 75 0 0 14499 35.1s 0 0 0 0.00% 1251321.468386 1251663.01406 0.03% 75 73 0 14704 35.1s 6.2% inactive integer columns, restarting Model after restart has 1515 rows, 1240 cols (154 bin., 0 int., 17 impl., 1069 cont.), and 5720 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1251486.092523 1251663.01406 0.01% 77 0 0 14860 35.5s 0 0 0 0.00% 1251486.092523 1251663.01406 0.01% 77 74 0 15053 35.5s 1 0 1 100.00% 1251545.644322 1251663.01406 0.01% 162 87 0 15072 35.7s Solving report Status Optimal Primal bound 1251663.01406 Dual bound 1251545.64432 Gap 0.00938% (tolerance: 0.01%) P-D integral 0.452571540443 Solution status feasible 1251663.01406 (objective) 0 (bound viol.) 2.91513500708e-12 (int. viol.) 0 (row viol.) Timing 35.72 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 7 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 15072 (total) 0 (strong br.) 993 (separation) 10791 (heuristics) Any[1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 201, 211, 221, 231] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 31780 rows; 18624 cols; 79340 nonzeros; 1152 integer variables (1152 binary) Coefficient ranges: Matrix [5e-01, 3e+02] Cost [2e+01, 1e+06] Bound [5e-01, 1e+06] RHS [1e-03, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 16338 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 96 0.5 38.4 Integer infeasibilities 0 0 0 Row infeasibilities 1680 5 1709 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 31780 rows; 18624 cols; 79340 nonzeros Coefficient ranges: Matrix [5e-01, 3e+02] Cost [2e+01, 1e+06] Bound [5e-01, 1e+06] RHS [1e-03, 1e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.02 Presolving model 8126 rows, 5952 cols, 35958 nonzeros 0s 6632 rows, 4622 cols, 31072 nonzeros 0s 4072 rows, 2566 cols, 15553 nonzeros 0s 3660 rows, 2368 cols, 14769 nonzeros 0s Solving MIP model with: 3660 rows 2368 cols (941 binary, 0 integer, 79 implied int., 1348 continuous) 14769 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 88800 inf inf 0 0 0 0 0.3s R 0 0 0 0.00% 65118373.49489 79833415.0798 18.43% 0 0 0 911 0.4s L 0 0 0 0.00% 69829723.85337 69829723.85337 0.00% 230 108 0 940 0.8s T 0 0 0 0.00% 69829723.85337 69829723.85337 0.00% 230 108 0 1024 0.8s 1 0 1 100.00% 69829723.85337 69829723.85337 0.00% 230 108 0 1024 0.8s Solving report Status Optimal Primal bound 69829723.8534 Dual bound 69829723.8534 Gap 0% (tolerance: 0.01%) P-D integral 0.0463613723845 Solution status feasible 69829723.8534 (objective) 0 (bound viol.) 1.33226762955e-15 (int. viol.) 0 (row viol.) Timing 0.78 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1024 (total) 0 (strong br.) 29 (separation) 84 (heuristics) Test Summary: | Pass Total Time PowerModelsACDC | 324 324 13m52.2s Testing PowerModelsACDC tests passed Testing completed after 954.78s PkgEval succeeded after 1220.26s