Package evaluation of PowerModelsACDC on Julia 1.12.0-rc1.2 (995ff9db19*) started at 2025-07-14T18:29:31.535 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.08s ################################################################################ # Installation # Installing PowerModelsACDC... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [ff45984e] + PowerModelsACDC v0.9.0 Updating `~/.julia/environments/v1.12/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.2 [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.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 Installation completed after 3.75s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 259.68s ################################################################################ # Testing # Testing PowerModelsACDC Status `/tmp/jl_SF8wf3/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_SF8wf3/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.2 [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.6.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.11.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.64.0+1 [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... 2219.6 ms ✓ HiGHS_jll 45865.0 ms ✓ HiGHS 2 dependencies successfully precompiled in 49 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 -9.9932125236e-02 Ph1: 33(54748.2); Du: 3(9.99321e-05) 0s 85 2.4021711179e+04 Pr: 0(0); Du: 0(1.56846e-12) 0s Model status : Optimal Simplex iterations: 85 Objective value : 2.4021711179e+04 Relative P-D gap : 2.1202362696e-15 HiGHS run time : 0.32 [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.4323138831e-03 Pr: 82(4829.06); Du: 4(0.000140851) 0s 111 1.9878020979e+04 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 111 Objective value : 1.9878020979e+04 Relative P-D gap : 1.2994074993e-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.5236463899e-03 Pr: 75(4824.57); Du: 4(0.000168405) 0s 102 1.9844553319e+04 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 102 Objective value : 1.9844553319e+04 Relative P-D gap : 1.3932608354e-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.2371494407e-04 Pr: 6(46.5297); Du: 1(9.37614e-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 : 0.0000000000e+00 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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 124 rows, 73 cols, 254 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 179 rows, 90 cols, 450 nonzeros 0s 155 rows, 69 cols, 461 nonzeros 0s 91 rows, 62 cols, 301 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 43 0.0s R 0 0 0 0.00% 22.46564627 34.3331482 34.57% 99 6 0 53 0.0s L 0 0 0 0.00% 24.73555891 26.3331482 6.07% 256 27 0 99 0.1s 6.2% inactive integer columns, restarting Model after restart has 82 rows, 56 cols (15 bin., 0 int., 0 impl., 41 cont.), and 277 nonzeros 0 0 0 0.00% 24.74420975 26.3331482 6.03% 14 0 0 248 0.1s 0 0 0 0.00% 24.74420975 26.3331482 6.03% 14 14 0 275 0.1s L 0 0 0 0.00% 25.22732377 26.3331482 4.20% 255 36 0 347 0.3s 9 0 5 100.00% 26.3331482 26.3331482 0.00% 279 21 11 946 0.4s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) P-D integral 0.0325549163596 Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 1.97619698383e-14 (int. viol.) 0 (row viol.) Timing 0.35 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 9 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 946 (total) 164 (strong br.) 101 (separation) 538 (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; 3] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ 0; -2.7; 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 54 rows, 35 cols, 118 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 72 rows, 39 cols, 178 nonzeros 0s 37 rows, 20 cols, 106 nonzeros 0s 22 rows, 15 cols, 61 nonzeros 0s 18 rows, 13 cols, 51 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 5 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.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) 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 3.372 from [lower, value, upper] = [ 0; -3.372; 0] WARNING: Row 57 has infeasibility of 26.47 from [lower, value, upper] = [ 0; 26.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 73 rows, 41 cols, 202 nonzeros 0s 60 rows, 33 cols, 172 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1210 rows, 599 cols, 3030 nonzeros 0s 637 rows, 534 cols, 1997 nonzeros 0s 637 rows, 534 cols, 1997 nonzeros 0s Solving MIP model with: 637 rows 534 cols (227 binary, 0 integer, 0 implied int., 307 continuous) 1997 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 457 0.0s C 0 0 0 0.00% 8.30568744 2508.658395 99.67% 25 7 0 541 0.1s L 0 0 0 0.00% 8.409137509 15.6920988 46.41% 103 42 0 661 1.0s L 0 0 0 0.00% 8.413281541 15.6920988 46.39% 118 48 0 1679 1.3s 60.4% inactive integer columns, restarting Model after restart has 358 rows, 257 cols (90 bin., 0 int., 0 impl., 167 cont.), and 1169 nonzeros 0 0 0 0.00% 8.413281541 15.6920988 46.39% 27 0 0 2200 1.3s 0 0 0 0.00% 8.413281541 15.6920988 46.39% 27 24 0 2261 1.3s L 0 0 0 0.00% 8.460289011 15.6920988 46.09% 229 71 0 2479 2.0s 61 0 30 100.00% 15.6920988 15.6920988 0.00% 369 69 511 10566 3.7s Solving report Status Optimal Primal bound 15.6920988029 Dual bound 15.6920988029 Gap 0% (tolerance: 0.01%) P-D integral 2.02995818277 Solution status feasible 15.6920988029 (objective) 0 (bound viol.) 1.13686837722e-13 (int. viol.) 0 (row viol.) Timing 3.67 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 5 Nodes 61 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 10566 (total) 3930 (strong br.) 632 (separation) 4085 (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 2 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 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, 1122 nonzeros 0s 237 rows, 185 cols, 781 nonzeros 0s 232 rows, 182 cols, 775 nonzeros 0s Solving MIP model with: 232 rows 182 cols (56 binary, 0 integer, 0 implied int., 126 continuous) 775 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.08 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 16.37446829 inf inf 0 0 0 223 0.0s C 0 0 0 0.00% 21.33110951 210.6627547 89.87% 234 24 0 265 0.1s L 0 0 0 0.00% 22.67984768 25.16054482 9.86% 466 50 0 313 0.3s 16.1% inactive integer columns, restarting Model after restart has 204 rows, 160 cols (47 bin., 0 int., 0 impl., 113 cont.), and 693 nonzeros 0 0 0 0.00% 22.79143326 25.16054482 9.42% 27 0 0 1427 0.7s 0 0 0 0.00% 22.79143326 25.16054482 9.42% 27 23 0 1529 0.7s L 0 0 0 0.00% 23.50705196 25.16054482 6.57% 463 77 0 1675 1.0s L 0 0 0 0.00% 23.50705196 25.16054482 6.57% 463 31 0 2316 1.7s 7 0 4 100.00% 25.16054482 25.16054482 0.00% 479 31 37 3793 1.8s Solving report Status Optimal Primal bound 25.1605448204 Dual bound 25.1605448204 Gap 0% (tolerance: 0.01%) P-D integral 0.33531964099 Solution status feasible 25.1605448204 (objective) 0 (bound viol.) 1.62927354938e-12 (int. viol.) 0 (row viol.) Timing 1.77 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 4 Nodes 7 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 3793 (total) 680 (strong br.) 255 (separation) 2359 (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: 17.50443196296692 Relaxation Obj: 20.983698326676183 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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 : 2.6367939594e-16 HiGHS run time : 0.00 Presolving model 216 rows, 151 cols, 460 nonzeros 0s 115 rows, 87 cols, 296 nonzeros 0s 97 rows, 65 cols, 228 nonzeros 0s 71 rows, 52 cols, 176 nonzeros 0s 45 rows, 41 cols, 124 nonzeros 0s MIP start solution is feasible, objective value is 6.73680563109 Solving MIP model with: 45 rows 41 cols (11 binary, 0 integer, 4 implied int., 26 continuous) 124 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.406351184 6.736805631 64.28% 0 0 0 0 0.0s T 0 0 0 0.00% 2.406351184 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.00414927276855 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) ┌ Warning: NLP couldn't be solved to optimality └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:405 2.4064 - 35.4 FP: 35.51105499267578 s FP: 1 round FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 20.98 - 11.5 4 - 3 3 - 29.84 - 12.8 - 92.6% 4 3 - 31.27 - 12.9 - 77.4% 5 4 - 30.97 - 13.1 - 72.8% 6 5 - 31.14 - 13.2 - 84.0% 7 6 - 31.39 - 13.2 - 11.7% 8 7 - 31.4 - 13.5 - 94.8% 9 4 - 31.62 - 13.6 - 83.8% 6 4 33.27 31.89 4.15% 13.7 - 92.5% 6 5 33.27 31.67 4.81% 13.9 - 98.3% 7 5 33.27 32.08 3.58% 13.9 - 89.4% 7 6 33.27 32.13 3.43% 14.2 - 64.0% 8 4 33.27 32.15 3.35% 14.4 - 97.1% 9 5 33.27 31.92 4.06% 14.6 - 65.0% 10 6 33.27 31.41 5.6% 14.7 - 72.9% 10 6 33.27 32.07 3.6% 14.9 - 90.8% 10 7 33.27 32.07 3.59% 15.0 - 90.0% 10 8 33.27 32.15 3.36% 15.1 - 80.8% 0 5 32.200612 32.200613 0.0% 15.2 - 98.5% #branches: 19 Obj: 32.20061233634311 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.23485207557678223 Relaxation Obj: 1.4678142298092867 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; 3] WARNING: Col 85 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ 0; -2.7; 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, 43 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, 55 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.000428133548573 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 - 0.7 FP: 0.6724519729614258 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.44582700729370117 Relaxation Obj: 15.877095197662769 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 1.2 from [lower, value, upper] = [ 0; -1.2; 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, 1188 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, 1102 nonzeros 0s Presolve : Reductions: rows 310(-601); columns 113(-159); elements 1102(-1401) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 5.8657278919e+00 Pr: 109(1313.59) 0s 105 5.8664628662e+00 0s Model status : Infeasible Simplex iterations: 105 Objective value : 5.8657669858e+00 HiGHS run time : 0.01 Presolving model 736 rows, 246 cols, 2162 nonzeros 0s 642 rows, 152 cols, 2137 nonzeros 0s 553 rows, 133 cols, 1868 nonzeros 0s Solving MIP model with: 553 rows 133 cols (16 binary, 0 integer, 2 implied int., 115 continuous) 1868 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.078975766 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 3.078975766 inf inf 0 0 6 137 0.0s R 0 0 0 0.00% 4.341934917 4.967133868 12.59% 189 9 10 216 0.1s C 0 0 0 0.00% 4.341934917 4.499233123 3.50% 191 9 13 216 0.1s L 0 0 0 0.00% 4.360243196 4.360248571 0.00% 195 10 13 246 0.2s 1 0 1 100.00% 4.360243196 4.360248571 0.00% 145 10 13 257 0.2s Solving report Status Optimal Primal bound 4.36024857118 Dual bound 4.36024319581 Gap 0.000123% (tolerance: 0.01%) P-D integral 0.00292974487046 Solution status feasible 4.36024857118 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.17 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 4 (4 feasible; 121 iterations) LP iterations 257 (total) 0 (strong br.) 109 (separation) 11 (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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 697 rows, 186 cols, 2295 nonzeros 0s 578 rows, 144 cols, 1931 nonzeros 0s Solving MIP model with: 578 rows 144 cols (16 binary, 0 integer, 0 implied int., 128 continuous) 1931 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.00427039007 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 1.000757534 1.012097272 1.12% 0 0 0 179 0.0s 1 0 1 100.00% 1.012097272 1.012097272 0.00% 32 15 0 197 0.0s Solving report Status Optimal Primal bound 1.0120972717 Dual bound 1.0120972717 Gap 0% (tolerance: 0.01%) P-D integral 9.49402743686e-05 Solution status feasible 1.0120972717 (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 197 (total) 0 (strong br.) 18 (separation) 0 (heuristics) 1.0121 1.3e-5 1.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 [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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 749 rows, 220 cols, 2516 nonzeros 0s 666 rows, 146 cols, 1962 nonzeros 0s 579 rows, 145 cols, 1919 nonzeros 0s Solving MIP model with: 579 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1919 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.00250283695 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992397 0.0145090185 0.07% 0 0 0 159 0.0s 1 0 1 100.00% 0.0145090185 0.0145090185 0.00% 0 0 0 177 0.0s Solving report Status Optimal Primal bound 0.014509018537 Dual bound 0.014509018537 Gap 0% (tolerance: 0.01%) P-D integral 6.0062515851e-06 Solution status feasible 0.014509018537 (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 177 (total) 0 (strong br.) 18 (separation) 0 (heuristics) 0.0145 1.3e-5 1.8 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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 801 rows, 254 cols, 2805 nonzeros 0s 698 rows, 146 cols, 1963 nonzeros 0s 579 rows, 145 cols, 1919 nonzeros 0s Solving MIP model with: 579 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1919 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.0025028389 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992457 0.0145090245 0.07% 0 0 0 159 0.0s 1 0 1 100.00% 0.0145090245 0.0145090245 0.00% 0 0 0 177 0.0s Solving report Status Optimal Primal bound 0.0145090245463 Dual bound 0.0145090245463 Gap 0% (tolerance: 0.01%) P-D integral 5.90742947548e-06 Solution status feasible 0.0145090245463 (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 177 (total) 0 (strong br.) 18 (separation) 0 (heuristics) 0.0145 1.3e-5 1.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 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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 818 rows, 274 cols, 3056 nonzeros 0s 730 rows, 146 cols, 1963 nonzeros 0s 579 rows, 145 cols, 1919 nonzeros 0s Solving MIP model with: 579 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1919 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.0025028389 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992457 0.0145090245 0.07% 0 0 0 159 0.0s 1 0 1 100.00% 0.0145090245 0.0145090245 0.00% 0 0 0 177 0.0s Solving report Status Optimal Primal bound 0.0145090245463 Dual bound 0.0145090245463 Gap 0% (tolerance: 0.01%) P-D integral 6.06153074216e-06 Solution status feasible 0.0145090245463 (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 177 (total) 0 (strong br.) 18 (separation) 0 (heuristics) 0.0145 1.3e-5 2.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.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 1171 rows; 442 cols; 3948 nonzeros; 187 integer variables (187 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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 188 53.6 2635 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 1171 rows; 442 cols; 3948 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 1000 rows, 416 cols, 3615 nonzeros 0s 867 rows, 306 cols, 3456 nonzeros 0s 762 rows, 146 cols, 1963 nonzeros 0s 579 rows, 145 cols, 1919 nonzeros 0s Solving MIP model with: 579 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1919 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.0025028389 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992457 0.0145090245 0.07% 0 0 0 159 0.0s 1 0 1 100.00% 0.0145090245 0.0145090245 0.00% 0 0 0 177 0.0s Solving report Status Optimal Primal bound 0.0145090245463 Dual bound 0.0145090245463 Gap 0% (tolerance: 0.01%) P-D integral 8.00266035791e-06 Solution status feasible 0.0145090245463 (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 177 (total) 0 (strong br.) 18 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 2.1689820289611816 s FP: 6 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 15.88 - 7.1 4 - 3 3 - 28.7 - 7.3 - 61.3% 4 4 - 28.9 - 7.6 - 75.4% 5 5 - 29.14 - 7.8 - 85.8% 6 5 - 29.49 - 8.1 - 76.0% 7 6 - 29.49 - 8.4 - 83.1% 8 6 - 29.53 - 8.7 - 81.2% 9 4 - 29.78 - 8.9 - 89.1% 10 5 - 29.88 - 9.2 - 73.6% 11 7 - 30.04 - 9.5 - 79.6% 12 6 - 30.08 - 9.7 - 80.9% 13 7 - 30.17 - 9.9 - 73.0% 14 7 - 30.18 - 10.3 - 83.9% 15 8 - 30.27 - 10.7 - 87.4% 5 9 31.08 30.27 2.61% 11.6 - 92.8% 4 7 31.08 30.3 2.5% 12.2 - 92.3% 4 7 31.08 30.33 2.41% 12.5 - 93.0% 4 3 31.08 30.36 2.31% 12.7 - 80.7% 4 4 31.08 30.36 2.31% 13.0 - 89.5% 4 8 31.08 30.43 2.09% 13.3 - 88.3% 4 9 31.08 30.43 2.09% 13.6 - 96.9% 4 10 31.08 30.61 1.53% 13.9 - 83.2% 3 11 31.08 30.69 1.25% 14.8 - ∞ 3 8 31.08 30.71 1.18% 15.1 - 89.4% 2 9 31.08 30.71 1.18% 15.6 - 95.2% 2 5 31.08 30.8 0.91% 15.8 - 18.0% 2 8 31.08 30.84 0.76% 16.1 - 78.1% 1 9 31.08 30.84 0.76% 16.4 - 93.5% 1 6 31.08 30.85 0.75% 16.6 - 91.8% 1 7 31.08 30.85 0.75% 16.9 - 72.3% 0 8 31.08 30.85 0.75% 17.3 - 91.7% #branches: 31 Obj: 31.081483408589463 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.1831951141357422 Relaxation Obj: 0.6346232363439599 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; 3] WARNING: Col 97 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ 0; -2.7; 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 208 rows, 107 cols, 639 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) 123 rows, 62 cols, 494 nonzeros 0s Presolve : Reductions: rows 123(-201); columns 62(-69); elements 494(-433) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 2.0887618115e+00 Pr: 56(186.064) 0s 48 2.0888553934e+00 0s Model status : Infeasible Simplex iterations: 48 Objective value : 2.0887615137e+00 HiGHS run time : 0.00 Presolving model 257 rows, 111 cols, 806 nonzeros 0s 192 rows, 78 cols, 682 nonzeros 0s 171 rows, 68 cols, 619 nonzeros 0s Solving MIP model with: 171 rows 68 cols (3 binary, 0 integer, 0 implied int., 65 continuous) 619 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.383960841 inf inf 0 0 0 73 0.0s C 0 0 0 0.00% 2.194869779 3.088748703 28.94% 10 0 0 91 0.0s H 0 0 0 0.00% 2.194869779 2.733727506 19.71% 10 0 0 91 0.0s 1 0 1 100.00% 2.733727506 2.733727506 0.00% 3 0 2 102 0.0s Solving report Status Optimal Primal bound 2.73372750646 Dual bound 2.73372750646 Gap 0% (tolerance: 0.01%) P-D integral 0.000571189045952 Solution status feasible 2.73372750646 (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 102 (total) 0 (strong br.) 18 (separation) 11 (heuristics) 2.7337 6.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 [2e-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; 3] WARNING: Col 97 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ 0; -2.7; 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 [2e-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 270 rows, 119 cols, 842 nonzeros 0s 202 rows, 84 cols, 709 nonzeros 0s 169 rows, 66 cols, 616 nonzeros 0s 168 rows, 65 cols, 606 nonzeros 0s Solving MIP model with: 168 rows 65 cols (3 binary, 0 integer, 0 implied int., 62 continuous) 606 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.00473140266 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 0.00473140266 1.001680907 99.53% 0 0 0 57 0.0s 1 0 1 100.00% 1.001680907 1.001680907 0.00% 0 0 0 57 0.0s Solving report Status Optimal Primal bound 1.00168090705 Dual bound 1.00168090705 Gap 0% (tolerance: 0.01%) P-D integral 5.76620575195e-05 Solution status feasible 1.00168090705 (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 57 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 1.0017 4.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; 3] WARNING: Col 97 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ 0; -2.7; 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 283 rows, 127 cols, 894 nonzeros 0s 212 rows, 90 cols, 748 nonzeros 0s 168 rows, 66 cols, 613 nonzeros 0s 167 rows, 65 cols, 603 nonzeros 0s Solving MIP model with: 167 rows 65 cols (3 binary, 0 integer, 0 implied int., 62 continuous) 603 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.00408111119 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 0.00408111119 0.00408111119 0.00% 0 0 0 54 0.0s 1 0 1 100.00% 0.00408111119 0.00408111119 0.00% 0 0 0 54 0.0s Solving report Status Optimal Primal bound 0.00408111118872 Dual bound 0.00408111118872 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 0.00408111118872 (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 54 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.0041 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; 3] WARNING: Col 97 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ 0; -2.7; 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 296 rows, 135 cols, 962 nonzeros 0s 222 rows, 96 cols, 799 nonzeros 0s 198 rows, 70 cols, 634 nonzeros 0s 167 rows, 65 cols, 603 nonzeros 0s Solving MIP model with: 167 rows 65 cols (3 binary, 0 integer, 0 implied int., 62 continuous) 603 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.00436473604 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 0.00436473604 0.00436473604 0.00% 0 0 0 54 0.0s 1 0 1 100.00% 0.00436473604 0.00436473604 0.00% 0 0 0 54 0.0s Solving report Status Optimal Primal bound 0.00436473604039 Dual bound 0.00436473604039 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 0.00436473604039 (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 54 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.23333215713500977 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.6 2 - 0 3 10.7 9.73 9.11% 0.8 - 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 2 from [lower, value, upper] = [ 0; 2; 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, 263 nonzeros 0s 58 rows, 31 cols, 199 nonzeros 0s 58 rows, 31 cols, 199 nonzeros 0s Solving MIP model with: 58 rows 31 cols (8 binary, 0 integer, 0 implied int., 23 continuous) 199 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 38 0.0s R 0 0 0 0.00% 312.5345549 329.9545624 5.28% 41 3 0 43 0.0s 37.5% inactive integer columns, restarting Model after restart has 34 rows, 21 cols (3 bin., 0 int., 0 impl., 18 cont.), and 119 nonzeros 0 0 0 0.00% 312.5345549 329.9545624 5.28% 2 0 0 48 0.0s 0 0 0 0.00% 312.5345549 329.9545624 5.28% 3 2 0 68 0.0s 1 0 1 100.00% 329.9545624 329.9545624 0.00% 16 3 0 74 0.0s Solving report Status Optimal Primal bound 329.954562409 Dual bound 329.954562409 Gap 0% (tolerance: 0.01%) P-D integral 0.000796754054478 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 74 (total) 0 (strong br.) 11 (separation) 5 (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.5199611186981201 Relaxation Obj: 333.01469191472756 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 2 from [lower, value, upper] = [ 0; 2; 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 : 1.1881740830e-16 HiGHS run time : 0.00 Presolving model 115 rows, 70 cols, 237 nonzeros 0s 66 rows, 39 cols, 154 nonzeros 0s 47 rows, 28 cols, 104 nonzeros 0s 31 rows, 20 cols, 72 nonzeros 0s 21 rows, 15 cols, 48 nonzeros 0s MIP start solution is feasible, objective value is 3.73757697793 Solving MIP model with: 21 rows 15 cols (6 binary, 0 integer, 2 implied int., 7 continuous) 48 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.7375769536 3.737576978 80.27% 0 0 0 0 0.0s T 0 0 0 0.00% 0.7375769536 0.7375782006 0.00% 0 0 0 8 0.0s 1 0 1 100.00% 0.7375782006 0.7375782006 0.00% 0 0 0 8 0.0s Solving report Status Optimal Primal bound 0.737578200595 Dual bound 0.737578200595 Gap 0% (tolerance: 0.01%) P-D integral 0.00131738309819 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 8 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.7376 1.8282 7.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 2 from [lower, value, upper] = [ 0; 2; 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.049488462 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 1.049488462 1.049488462 0.00% 0 0 0 5 0.0s 1 0 1 100.00% 1.049488462 1.049488462 0.00% 0 0 0 5 0.0s Solving report Status Optimal Primal bound 1.04948846155 Dual bound 1.04948846155 Gap 0% (tolerance: 0.01%) P-D integral 7.9700260275e-21 Solution status feasible 1.04948846155 (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.0495 - 11.3 FP: 11.328990936279297 s FP: 2 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 333.01 - 0.9 0 - 1 3 348.02 343.77 1.22% 0.9 - 74.2% 0 4 348.02 344.32 1.06% 1.1 - 45.1% #branches: 3 Obj: 348.0219291908087 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.30927491188049316 Relaxation Obj: 313.631001051306 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 [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 [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 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 2 from [lower, value, upper] = [ 0; 2; 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.0741244030e+00 Pr: 90(849.449); Du: 0(4.01042e-12) 0s 76 4.0742221339e+00 0s Model status : Infeasible Simplex iterations: 76 Objective value : 4.0741474730e+00 HiGHS run time : 0.00 Presolving model 501 rows, 149 cols, 1482 nonzeros 0s 452 rows, 100 cols, 1455 nonzeros 0s 369 rows, 83 cols, 1227 nonzeros 0s Solving MIP model with: 369 rows 83 cols (8 binary, 0 integer, 1 implied int., 74 continuous) 1227 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.5062481457 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 0.7347061475 inf inf 0 0 6 94 0.0s R 0 0 0 0.00% 1.191044804 1.531641486 22.24% 67 1 6 110 0.0s 62.5% inactive integer columns, restarting Model after restart has 210 rows, 55 cols (3 bin., 0 int., 0 impl., 52 cont.), and 723 nonzeros 0 0 0 0.00% 1.191044804 1.531641486 22.24% 1 0 0 117 0.1s 0 0 0 0.00% 1.230010062 1.531641486 19.69% 1 1 2 133 0.1s 1 0 1 100.00% 1.531641486 1.531641486 0.00% 1 1 2 133 0.1s Solving report Status Optimal Primal bound 1.53164148551 Dual bound 1.53164148551 Gap 0% (tolerance: 0.01%) P-D integral 0.00521430270341 Solution status feasible 1.53164148551 (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 133 (total) 0 (strong br.) 16 (separation) 7 (heuristics) 1.5316 1.2e-5 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 [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 [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 [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 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 2 from [lower, value, upper] = [ 0; 2; 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 81 0.0s 1 0 1 100.00% 1.005593776 1.005593776 0.00% 11 3 1 127 0.0s Solving report Status Optimal Primal bound 1.00559377597 Dual bound 1.00559377597 Gap 0% (tolerance: 0.01%) P-D integral 4.56958527676e-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 127 (total) 0 (strong br.) 6 (separation) 40 (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 [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 [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 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 2 from [lower, value, upper] = [ 0; 2; 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.00347179352 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.00819367374 0.00819744303 0.05% 0 0 0 80 0.0s 25.0% inactive integer columns, restarting 0 0 0 100.00% 0.00819744303 0.00819744303 0.00% 0 211 0 80 0.0s Solving report Status Optimal Primal bound 0.00819744303134 Dual bound 0.00819744303134 Gap 0% (tolerance: 0.01%) P-D integral 3.11190098858e-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 80 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.0082 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 [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 [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 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 2 from [lower, value, upper] = [ 0; 2; 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 80 0.0s 25.0% inactive integer columns, restarting 0 0 0 100.00% 0.00819744303 0.00819744303 0.00% 0 211 0 80 0.0s Solving report Status Optimal Primal bound 0.00819744303134 Dual bound 0.00819744303134 Gap 0% (tolerance: 0.01%) P-D integral 2.56694009891e-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 80 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.38178205490112305 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 313.63 - 1.0 0 - 3 3 - 317.71 - 1.2 - 71.7% 1 4 342.07 329.96 3.54% 1.5 - 63.9% 0 5 333.1 331.65 0.44% 1.8 - 46.7% #branches: 4 Obj: 333.09519639252153 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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 124 rows, 73 cols, 254 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 179 rows, 90 cols, 450 nonzeros 0s 155 rows, 69 cols, 461 nonzeros 0s 91 rows, 62 cols, 301 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 43 0.0s R 0 0 0 0.00% 22.46564627 34.3331482 34.57% 99 6 0 53 0.0s L 0 0 0 0.00% 24.73555891 26.3331482 6.07% 256 27 0 99 0.1s 6.2% inactive integer columns, restarting Model after restart has 82 rows, 56 cols (15 bin., 0 int., 0 impl., 41 cont.), and 277 nonzeros 0 0 0 0.00% 24.74420975 26.3331482 6.03% 14 0 0 248 0.1s 0 0 0 0.00% 24.74420975 26.3331482 6.03% 14 14 0 275 0.1s L 0 0 0 0.00% 25.22732377 26.3331482 4.20% 255 36 0 347 0.2s 9 0 5 100.00% 26.3331482 26.3331482 0.00% 279 21 11 946 0.3s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) P-D integral 0.0232135325475 Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 1.97619698383e-14 (int. viol.) 0 (row viol.) Timing 0.26 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 9 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 946 (total) 164 (strong br.) 101 (separation) 538 (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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 128 rows, 75 cols, 266 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 187 rows, 93 cols, 474 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 49 0.0s C 0 0 0 0.00% 22.82873192 55.2331482 58.67% 228 29 0 106 0.0s L 0 0 0 0.00% 23.21268419 25.4220988 8.69% 331 43 0 142 0.1s 5.6% inactive integer columns, restarting Model after restart has 97 rows, 63 cols (17 bin., 0 int., 0 impl., 46 cont.), and 338 nonzeros 0 0 0 0.00% 23.2593967 25.4220988 8.51% 22 0 0 464 0.1s 0 0 0 0.00% 23.2593967 25.4220988 8.51% 22 22 0 515 0.1s 5 0 3 100.00% 25.4220988 25.4220988 0.00% 282 20 24 1272 0.3s Solving report Status Optimal Primal bound 25.4220988029 Dual bound 25.4220988029 Gap 0% (tolerance: 0.01%) P-D integral 0.0533689948062 Solution status feasible 25.4220988029 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.33 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 3 Nodes 5 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1272 (total) 242 (strong br.) 172 (separation) 695 (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 1.2 from [lower, value, upper] = [ 0; -1.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 132 rows, 84 cols, 281 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 191 rows, 101 cols, 485 nonzeros 0s 163 rows, 76 cols, 483 nonzeros 0s 104 rows, 69 cols, 345 nonzeros 0s 103 rows, 68 cols, 355 nonzeros 0s Solving MIP model with: 103 rows 68 cols (17 binary, 0 integer, 0 implied int., 51 continuous) 355 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% 14.48590227 inf inf 0 0 0 62 0.0s R 0 0 0 0.00% 19.17693952 34.24419761 44.00% 68 6 0 84 0.0s L 0 0 0 0.00% 21.58777714 22.84419761 5.50% 322 30 0 120 0.1s H 0 0 0 0.00% 21.91373464 22.84419761 4.07% 376 38 0 200 0.1s 1 0 1 100.00% 22.84419761 22.84419761 0.00% 393 42 3 298 0.1s Solving report Status Optimal Primal bound 22.8441976059 Dual bound 22.8441976059 Gap 0% (tolerance: 0.01%) P-D integral 0.0189262122909 Solution status feasible 22.8441976059 (objective) 0 (bound viol.) 1.35447209004e-14 (int. viol.) 0 (row viol.) Timing 0.08 (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 298 (total) 0 (strong br.) 81 (separation) 143 (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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 57 rows, 46 cols, 140 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 79 rows, 57 cols, 206 nonzeros 0s 67 rows, 47 cols, 202 nonzeros 0s 54 rows, 34 cols, 166 nonzeros 0s 27 rows, 28 cols, 96 nonzeros 0s 26 rows, 27 cols, 97 nonzeros 0s Solving MIP model with: 26 rows 27 cols (11 binary, 0 integer, 0 implied int., 16 continuous) 97 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 S 0 0 0 0.00% 0 14.96629641 100.00% 0 0 0 0 0.0s 0 0 0 0.00% 11.01699014 14.96629641 26.39% 0 0 0 20 0.0s L 0 0 0 0.00% 12.4178802 13.96629641 11.09% 139 7 0 32 0.0s H 0 0 0 0.00% 12.45395139 13.36629641 6.83% 155 8 0 61 0.0s 36.4% inactive integer columns, restarting Model after restart has 19 rows, 21 cols (7 bin., 0 int., 0 impl., 14 cont.), and 72 nonzeros 0 0 0 0.00% 12.52549602 13.36629641 6.29% 5 0 0 87 0.0s 0 0 0 0.00% 12.5340465 13.36629641 6.23% 5 5 0 98 0.0s 28.6% inactive integer columns, restarting Model after restart has 15 rows, 15 cols (4 bin., 0 int., 0 impl., 11 cont.), and 56 nonzeros 0 0 0 0.00% 13.12956289 13.36629641 1.77% 5 0 0 165 0.1s 25.0% inactive integer columns, restarting Model after restart has 12 rows, 12 cols (3 bin., 0 int., 0 impl., 9 cont.), and 51 nonzeros 0 0 0 0.00% 13.16899503 13.36629641 1.48% 3 0 0 175 0.1s 0 0 0 0.00% 13.16899503 13.36629641 1.48% 3 3 0 180 0.1s 1 0 1 100.00% 13.36629641 13.36629641 0.00% 3 3 0 187 0.1s Solving report Status Optimal Primal bound 13.3662964088 Dual bound 13.3662964088 Gap 0% (tolerance: 0.01%) P-D integral 0.00700869472888 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 2 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 187 (total) 0 (strong br.) 53 (separation) 82 (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 2 from [lower, value, upper] = [ 0; 2; 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, 510 nonzeros 0s 101 rows, 51 cols, 341 nonzeros 0s 97 rows, 49 cols, 349 nonzeros 0s Objective function is integral with scale 5 Solving MIP model with: 97 rows 49 cols (7 binary, 0 integer, 0 implied int., 42 continuous) 349 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 42 0.0s S 0 0 0 0.00% 6.243037666 8.2 23.87% 43 5 0 42 0.0s 1 0 1 100.00% 8.2 8.2 0.00% 43 5 0 52 0.0s Solving report Status Optimal Primal bound 8.2 Dual bound 8.2 Gap 0% (tolerance: 0.01%) P-D integral 7.99438453038e-05 Solution status feasible 8.2 (objective) 0 (bound viol.) 3.53050921831e-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 52 (total) 0 (strong br.) 9 (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 1.2 from [lower, value, upper] = [ 0; -1.2; 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 254 rows, 155 cols, 526 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 366 rows, 172 cols, 922 nonzeros 0s 315 rows, 127 cols, 943 nonzeros 0s 187 rows, 114 cols, 621 nonzeros 0s 181 rows, 108 cols, 603 nonzeros 0s Solving MIP model with: 181 rows 108 cols (16 binary, 0 integer, 0 implied int., 92 continuous) 603 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 88 0.0s R 0 0 0 0.00% 43.58825518 71.48839521 39.03% 216 8 0 104 0.0s S 0 0 0 0.00% 48.96115359 60.46629641 19.03% 503 27 0 144 0.0s L 0 0 0 0.00% 51.19285796 53.86629641 4.96% 513 28 0 173 0.1s L 0 0 0 0.00% 51.1983544 52.66629641 2.79% 579 33 0 253 0.1s 31.2% inactive integer columns, restarting Model after restart has 153 rows, 91 cols (11 bin., 0 int., 0 impl., 80 cont.), and 519 nonzeros 0 0 0 0.00% 51.30315244 52.66629641 2.59% 17 0 0 286 0.1s 0 0 0 0.00% 51.30315244 52.66629641 2.59% 17 9 0 344 0.1s 27.3% inactive integer columns, restarting Model after restart has 95 rows, 66 cols (8 bin., 0 int., 0 impl., 58 cont.), and 315 nonzeros 0 0 0 0.00% 52.44985848 52.66629641 0.41% 6 0 0 438 0.2s 0 0 0 0.00% 52.45865514 52.66629641 0.39% 6 6 0 464 0.2s 1 0 1 100.00% 52.66629641 52.66629641 0.00% 78 10 3 497 0.2s Solving report Status Optimal Primal bound 52.6662964088 Dual bound 52.6662964088 Gap 0% (tolerance: 0.01%) P-D integral 0.0139392916279 Solution status feasible 52.6662964088 (objective) 0 (bound viol.) 8.881784197e-16 (int. viol.) 0 (row viol.) Timing 0.20 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 1 Repair LPs 1 (0 feasible; 0 iterations) LP iterations 497 (total) 0 (strong br.) 159 (separation) 166 (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.2960069179534912 Relaxation Obj: 5.656052282503017 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 [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 [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 [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 [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 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 2 from [lower, value, upper] = [ 0; 2; 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.9973451888e+00 Pr: 182(2101.18); Du: 0(1.99661e-12) 0s 132 7.9975889801e+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 863 rows, 196 cols, 2588 nonzeros 0s 742 rows, 152 cols, 2397 nonzeros 0s 724 rows, 148 cols, 2324 nonzeros 0s Solving MIP model with: 724 rows 148 cols (6 binary, 0 integer, 0 implied int., 142 continuous) 2324 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 3.984901819 39.58% 0 0 0 178 0.0s H 0 0 0 0.00% 3.125409203 3.984901819 21.57% 24 2 0 204 0.0s 1 0 1 100.00% 3.984901819 3.984901819 0.00% 28 2 4 344 0.1s Solving report Status Optimal Primal bound 3.98490181894 Dual bound 3.98490181894 Gap 0% (tolerance: 0.01%) P-D integral 0.0067136218886 Solution status feasible 3.98490181894 (objective) 0 (bound viol.) 2.02293737317e-12 (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 344 (total) 0 (strong br.) 73 (separation) 90 (heuristics) 3.9849 1.9e-5 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 [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 [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 [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 [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 [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 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 2 from [lower, value, upper] = [ 0; 2; 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 906 rows, 224 cols, 2714 nonzeros 0s 747 rows, 154 cols, 2411 nonzeros 0s 729 rows, 150 cols, 2338 nonzeros 0s Solving MIP model with: 729 rows 150 cols (6 binary, 0 integer, 0 implied int., 144 continuous) 2338 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.00907992295 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 2.001858406 2.007616758 0.29% 0 0 0 188 0.0s 1 0 1 100.00% 2.007616758 2.007616758 0.00% 5 1 2 272 0.1s Solving report Status Optimal Primal bound 2.00761675762 Dual bound 2.00761675762 Gap 0% (tolerance: 0.01%) P-D integral 4.58212770542e-05 Solution status feasible 2.00761675762 (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 272 (total) 0 (strong br.) 13 (separation) 71 (heuristics) 2.0076 1.4e-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 [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 [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 [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 [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 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 2 from [lower, value, upper] = [ 0; 2; 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 948 rows, 252 cols, 2840 nonzeros 0s 750 rows, 156 cols, 2413 nonzeros 0s 732 rows, 152 cols, 2340 nonzeros 0s Solving MIP model with: 732 rows 152 cols (6 binary, 0 integer, 0 implied int., 146 continuous) 2340 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.00540084275 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129799277 0.0129858281 0.05% 0 0 0 155 0.0s 16.7% inactive integer columns, restarting Model after restart has 417 rows, 102 cols (0 bin., 0 int., 0 impl., 102 cont.), and 1282 nonzeros 0 0 0 0.00% 0.0129858281 0.0129858281 0.00% 0 0 0 155 0.0s T 0 0 0 100.00% 0.0129858281 0.0129858281 0.00% 0 0 0 216 0.0s 1 0 1 100.00% 0.0129858281 0.0129858281 0.00% 0 0 0 216 0.0s Solving report Status Optimal Primal bound 0.0129858281338 Dual bound 0.0129858281338 Gap 0% (tolerance: 0.01%) P-D integral 4.56790484737e-06 Solution status feasible 0.0129858281338 (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 216 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.013 1.4e-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 [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 [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 [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 [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 [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 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 2 from [lower, value, upper] = [ 0; 2; 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 990 rows, 280 cols, 2966 nonzeros 0s 750 rows, 156 cols, 2413 nonzeros 0s 732 rows, 152 cols, 2340 nonzeros 0s Solving MIP model with: 732 rows 152 cols (6 binary, 0 integer, 0 implied int., 146 continuous) 2340 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.00540083781 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129799189 0.0129858194 0.05% 0 0 0 155 0.0s 16.7% inactive integer columns, restarting Model after restart has 417 rows, 102 cols (0 bin., 0 int., 0 impl., 102 cont.), and 1282 nonzeros 0 0 0 0.00% 0.0129858194 0.0129858194 0.00% 0 0 0 155 0.0s T 0 0 0 100.00% 0.0129858194 0.0129858194 0.00% 0 0 0 216 0.0s 1 0 1 100.00% 0.0129858194 0.0129858194 0.00% 0 0 0 216 0.1s Solving report Status Optimal Primal bound 0.0129858193585 Dual bound 0.0129858193585 Gap 0% (tolerance: 0.01%) P-D integral 3.26055990794e-06 Solution status feasible 0.0129858193585 (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 216 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.5341100692749023 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 5.66 - 3.6 1 - 2 3 - 7.38 - 4.2 - 70.3% 3 3 - 8.24 - 4.4 - 91.2% 3 4 - 8.24 - 4.8 - 12747.5% 3 5 - 8.24 - 5.2 - 82.1% 3 4 - 8.45 - 5.8 - 68.7% 3 5 - 8.95 - 6.2 - 83.6% 0 6 10.2 10.20001 0.0% 6.4 - 83.7% #branches: 8 Obj: 10.200001576587853 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 2 from [lower, value, upper] = [ 0; 2; 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 183 rows, 61 cols, 546 nonzeros 0s 118 rows, 54 cols, 412 nonzeros 0s 117 rows, 53 cols, 421 nonzeros 0s Solving MIP model with: 117 rows 53 cols (8 binary, 0 integer, 0 implied int., 45 continuous) 421 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 96 0.0s R 0 0 0 0.00% 622.3278939 679.7633046 8.45% 124 5 0 99 0.0s 37.5% inactive integer columns, restarting Model after restart has 66 rows, 39 cols (3 bin., 0 int., 0 impl., 36 cont.), and 218 nonzeros 0 0 0 0.00% 622.3278939 679.7633046 8.45% 4 0 0 130 0.0s 0 0 0 0.00% 622.3278939 679.7633046 8.45% 4 4 0 136 0.0s H 0 0 0 0.00% 646.2927624 659.9091248 2.06% 65 7 0 145 0.0s 1 0 1 100.00% 659.9091248 659.9091248 0.00% 63 7 0 178 0.0s Solving report Status Optimal Primal bound 659.909124818 Dual bound 659.909124818 Gap 0% (tolerance: 0.01%) P-D integral 0.00110920373386 Solution status feasible 659.909124818 (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 178 (total) 0 (strong br.) 13 (separation) 50 (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 2 has infeasibility of 3.4 from [lower, value, upper] = [ 0; 3.4; 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 389 rows, 600 cols, 1213 nonzeros 0s 240 rows, 480 cols, 720 nonzeros 0s 168 rows, 378 cols, 504 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 : 3.8416911389e-16 HiGHS run time : 0.01 Presolving model 2164 rows, 1824 cols, 6661 nonzeros 0s 1799 rows, 1565 cols, 6485 nonzeros 0s 1683 rows, 1477 cols, 6369 nonzeros 0s MIP start solution is feasible, objective value is 310304200 Solving MIP model with: 1683 rows 1477 cols (567 binary, 0 integer, 0 implied int., 910 continuous) 6369 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% -2000 310304200 100.00% 0 0 0 0 0.1s 0 0 0 0.00% 844938.897072 310304200 99.73% 0 0 3 824 0.1s C 0 0 0 0.00% 892760.305304 1110771.787095 19.63% 1728 99 3 1038 0.4s L 0 0 0 0.00% 893123.513229 893123.513229 0.00% 1858 109 3 1042 0.6s 1 0 1 100.00% 893123.513229 893123.513229 0.00% 1858 109 3 1124 0.6s Solving report Status Optimal Primal bound 893123.513229 Dual bound 893123.513229 Gap 0% (tolerance: 0.01%) P-D integral 0.36499671971 Solution status feasible 893123.513229 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.64 (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 1124 (total) 0 (strong br.) 218 (separation) 82 (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 2 has infeasibility of 3.4 from [lower, value, upper] = [ 0; 3.4; 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 858 rows, 912 cols, 2322 nonzeros 0s 389 rows, 600 cols, 1213 nonzeros 0s 240 rows, 480 cols, 720 nonzeros 0s 168 rows, 378 cols, 504 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 : 3.8416911389e-16 HiGHS run time : 0.01 Presolving model 2164 rows, 1824 cols, 6661 nonzeros 0s 1808 rows, 1604 cols, 5817 nonzeros 0s MIP start solution is feasible, objective value is 310304200 Solving MIP model with: 1808 rows 1604 cols (240 binary, 0 integer, 6 implied int., 1358 continuous) 5817 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 18913942.77183 95.53% 0 0 0 818 0.1s C 0 0 0 0.00% 893035.551588 1106300.351765 19.28% 1305 105 0 1019 0.2s L 0 0 0 0.00% 893123.513229 893123.513229 0.00% 1404 111 0 1020 0.3s 1 0 1 100.00% 893123.513229 893123.513229 0.00% 1404 111 0 1056 0.3s Solving report Status Optimal Primal bound 893123.513229 Dual bound 893123.513229 Gap 0% (tolerance: 0.01%) P-D integral 0.196099001741 Solution status feasible 893123.513229 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.33 (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 1056 (total) 0 (strong br.) 202 (separation) 36 (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 2 has infeasibility of 3.4 from [lower, value, upper] = [ 0; 3.4; 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 593 rows, 825 cols, 1953 nonzeros 0s 420 rows, 708 cols, 1494 nonzeros 0s Dependent equations search running on 405 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 405 rows, 678 cols, 1434 nonzeros 0s Presolve : Reductions: rows 405(-2839); columns 678(-1626); elements 1434(-7195) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.4401406758e-03 Pr: 405(9253.3); Du: 0(2.57238e-12) 0s 506 3.1063107642e+08 0s Model status : Infeasible Simplex iterations: 506 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2356 rows, 2040 cols, 7285 nonzeros 0s 1816 rows, 1654 cols, 6473 nonzeros 0s 1681 rows, 1496 cols, 6470 nonzeros 0s Solving MIP model with: 1681 rows 1496 cols (560 binary, 0 integer, 0 implied int., 936 continuous) 6470 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 988968.104349 16.10% 0 0 0 847 0.2s C 0 0 0 0.00% 854610.018392 917274.216117 6.83% 1357 83 0 1040 0.4s L 0 0 0 0.00% 860652.617529 869583.36262 1.03% 3836 91 0 1347 2.7s L 0 0 0 0.00% 860682.779091 869583.36262 1.02% 3844 92 0 2318 4.3s 17.0% inactive integer columns, restarting Model after restart has 1413 rows, 1241 cols (449 bin., 0 int., 0 impl., 792 cont.), and 5289 nonzeros 0 0 0 0.00% 860682.779091 869583.36262 1.02% 57 0 0 3484 4.3s 0 0 0 0.00% 860682.779091 869583.36262 1.02% 57 52 0 3672 4.3s L 0 0 0 0.00% 862066.145927 869583.36262 0.86% 262 89 0 5128 7.9s T 0 0 0 0.00% 862066.145927 869583.36262 0.86% 273 60 93 7875 10.5s 1 0 1 100.00% 869583.36262 869583.36262 0.00% 274 60 93 8320 10.5s Solving report Status Optimal Primal bound 869583.36262 Dual bound 869583.36262 Gap 0% (tolerance: 0.01%) P-D integral 0.251003676439 Solution status feasible 869583.36262 (objective) 0 (bound viol.) 2.50493799958e-11 (int. viol.) 0 (row viol.) Timing 10.52 (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 8320 (total) 368 (strong br.) 648 (separation) 6192 (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 2 has infeasibility of 3.4 from [lower, value, upper] = [ 0; 3.4; 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 1050 rows, 1128 cols, 2946 nonzeros 0s 593 rows, 825 cols, 1953 nonzeros 0s 420 rows, 708 cols, 1494 nonzeros 0s Dependent equations search running on 405 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 405 rows, 678 cols, 1434 nonzeros 0s Presolve : Reductions: rows 405(-2839); columns 678(-1626); elements 1434(-7195) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.4401406758e-03 Pr: 405(9253.3); Du: 0(2.57238e-12) 0s 506 3.1063107642e+08 0s Model status : Infeasible Simplex iterations: 506 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2356 rows, 2040 cols, 7285 nonzeros 0s 1894 rows, 1732 cols, 6181 nonzeros 0s 1810 rows, 1630 cols, 5871 nonzeros 0s Solving MIP model with: 1810 rows 1630 cols (240 binary, 0 integer, 6 implied int., 1384 continuous) 5871 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 853 0.1s R 0 0 0 0.00% 847620.651226 2504203.187005 66.15% 467 47 4 956 0.2s C 0 0 0 0.00% 854804.967094 905096.214992 5.56% 1174 87 4 1045 0.3s L 0 0 0 0.00% 863434.923537 869583.36262 0.71% 4446 108 4 1459 2.3s 3.3% inactive integer columns, restarting Model after restart has 1592 rows, 1439 cols (225 bin., 0 int., 2 impl., 1212 cont.), and 5366 nonzeros 0 0 0 0.00% 863434.923537 869583.36262 0.71% 60 0 0 3401 3.6s 0 0 0 0.00% 863434.923537 869583.36262 0.71% 60 57 0 3570 3.6s 1 0 0 100.00% 869519.718634 869583.36262 0.01% 102 58 22 6613 7.0s Solving report Status Optimal Primal bound 869583.36262 Dual bound 869519.718634 Gap 0.00732% (tolerance: 0.01%) P-D integral 0.187072628079 Solution status feasible 869583.36262 (objective) 0 (bound viol.) 2.74225087082e-14 (int. viol.) 0 (row viol.) Timing 7.00 (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 6613 (total) 673 (strong br.) 644 (separation) 4183 (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 2 has infeasibility of 3.4 from [lower, value, upper] = [ 0; 3.4; 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 591 rows, 824 cols, 1950 nonzeros 0s 411 rows, 699 cols, 1462 nonzeros 0s Dependent equations search running on 395 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 395 rows, 667 cols, 1398 nonzeros 0s Presolve : Reductions: rows 395(-3235); columns 667(-1925); elements 1398(-8095) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.1295312251e-03 Pr: 395(8638.89); Du: 0(3.54344e-12) 0s 482 3.1063124293e+08 0s Model status : Infeasible Simplex iterations: 482 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2452 rows, 2232 cols, 7667 nonzeros 0s 1889 rows, 1823 cols, 6661 nonzeros 0s 1726 rows, 1638 cols, 6739 nonzeros 0s Solving MIP model with: 1726 rows 1638 cols (558 binary, 0 integer, 0 implied int., 1080 continuous) 6739 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% -1100 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 822387.098796 1016068.854091 19.06% 0 0 0 955 0.2s C 0 0 0 0.00% 842249.387836 898141.126768 6.22% 1514 80 0 1142 0.4s L 0 0 0 0.00% 851732.689269 857044.684693 0.62% 5603 138 0 1775 2.9s L 0 0 0 0.00% 851761.72943 857044.684693 0.62% 5677 140 0 2987 4.8s 19.4% inactive integer columns, restarting Model after restart has 1412 rows, 1353 cols (417 bin., 0 int., 0 impl., 936 cont.), and 5401 nonzeros 0 0 0 0.00% 851761.72943 857044.684693 0.62% 75 0 0 4414 4.8s 0 0 0 0.00% 851761.72943 857044.684693 0.62% 75 70 0 4684 4.9s 0 0 0 0.00% 851961.907386 857044.684693 0.59% 639 73 0 10995 12.4s 1 0 1 100.00% 857044.684693 857044.684693 0.00% 646 73 13 14446 15.0s Solving report Status Optimal Primal bound 857044.684693 Dual bound 857044.684693 Gap 0% (tolerance: 0.01%) P-D integral 0.249018078873 Solution status feasible 857044.684693 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 15.03 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 6 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 14446 (total) 739 (strong br.) 991 (separation) 11292 (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 2 has infeasibility of 3.4 from [lower, value, upper] = [ 0; 3.4; 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 1050 rows, 1128 cols, 2946 nonzeros 0s 591 rows, 824 cols, 1950 nonzeros 0s 411 rows, 699 cols, 1462 nonzeros 0s Dependent equations search running on 395 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 395 rows, 667 cols, 1398 nonzeros 0s Presolve : Reductions: rows 395(-3235); columns 667(-1925); elements 1398(-8095) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.1295312251e-03 Pr: 395(8638.89); Du: 0(3.54344e-12) 0s 482 3.1063124293e+08 0s Model status : Infeasible Simplex iterations: 482 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2452 rows, 2232 cols, 7667 nonzeros 0s 1940 rows, 1874 cols, 6465 nonzeros 0s 1858 rows, 1774 cols, 6157 nonzeros 0s Solving MIP model with: 1858 rows 1774 cols (240 binary, 0 integer, 6 implied int., 1528 continuous) 6157 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% 822387.098796 inf inf 0 0 2 942 0.1s R 0 0 0 0.00% 834255.911936 986323.160334 15.42% 287 29 2 1024 0.2s C 0 0 0 0.00% 842725.127479 887063.125642 5.00% 1205 84 2 1196 0.4s L 0 0 0 0.00% 848167.605186 857044.684693 1.04% 3285 155 2 1581 1.9s 2.5% inactive integer columns, restarting Model after restart has 1663 rows, 1596 cols (229 bin., 0 int., 3 impl., 1364 cont.), and 5719 nonzeros 0 0 0 0.00% 848295.907929 857044.684693 1.02% 72 0 0 4455 4.0s 0 0 0 0.00% 848295.907929 857044.684693 1.02% 72 66 0 4752 4.1s 0 0 0 0.00% 850179.360422 857044.684693 0.80% 1006 67 0 8353 9.7s 1 0 0 100.00% 856989.292216 857044.684693 0.01% 1011 67 18 11214 12.2s Solving report Status Optimal Primal bound 857044.684693 Dual bound 856989.292216 Gap 0.00646% (tolerance: 0.01%) P-D integral 0.180735811552 Solution status feasible 857044.684693 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 12.24 (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 11214 (total) 632 (strong br.) 1181 (separation) 7982 (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 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.4; 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 6869 rows, 4811 cols, 35410 nonzeros 0s 4539 rows, 2755 cols, 17507 nonzeros 0s 4333 rows, 2525 cols, 17782 nonzeros 0s Solving MIP model with: 4333 rows 2525 cols (917 binary, 0 integer, 96 implied int., 1512 continuous) 17782 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 22280221.87135 94.52% 0 0 0 1431 0.6s C 0 0 0 0.00% 1245026.369363 1253671.728759 0.69% 1313 230 0 1677 1.1s L 0 0 0 0.00% 1247541.48744 1251663.01406 0.33% 1520 268 0 1737 4.2s 0 0 0 0.00% 1248350.408484 1251663.01406 0.26% 1672 107 0 4752 12.5s 22.9% inactive integer columns, restarting Model after restart has 3117 rows, 1933 cols (552 bin., 0 int., 81 impl., 1300 cont.), and 12310 nonzeros 0 0 0 0.00% 1248350.408484 1251663.01406 0.26% 94 0 0 4752 12.6s 0 0 0 0.00% 1248350.556018 1251663.01406 0.26% 94 83 0 5107 12.6s L 0 0 0 0.00% 1249626.56095 1251663.01406 0.16% 464 145 0 5204 17.7s L 0 0 0 0.00% 1249626.56095 1251663.008334 0.16% 464 145 0 7215 19.2s 10.7% inactive integer columns, restarting Model after restart has 2784 rows, 1777 cols (455 bin., 0 int., 70 impl., 1252 cont.), and 10875 nonzeros 0 0 0 0.00% 1249626.56095 1251663.008334 0.16% 88 0 0 8114 19.2s 0 0 0 0.00% 1249626.56095 1251663.008334 0.16% 88 82 0 8385 19.3s 0 0 0 0.00% 1250579.147819 1251663.008334 0.09% 599 92 0 11219 26.1s 10.3% inactive integer columns, restarting Model after restart has 2539 rows, 1648 cols (391 bin., 0 int., 61 impl., 1196 cont.), and 9842 nonzeros 0 0 0 0.00% 1250579.147819 1251663.008334 0.09% 90 0 0 11219 26.1s 0 0 0 0.00% 1250579.147819 1251663.008334 0.09% 90 87 0 11522 26.2s 12.8% inactive integer columns, restarting Model after restart has 2232 rows, 1486 cols (281 bin., 0 int., 45 impl., 1160 cont.), and 8571 nonzeros 0 0 0 0.00% 1251135.416777 1251663.008334 0.04% 86 0 0 13345 30.3s 0 0 0 0.00% 1251142.098993 1251663.008334 0.04% 86 80 0 13645 30.3s 13.2% inactive integer columns, restarting Model after restart has 1887 rows, 1377 cols (224 bin., 0 int., 33 impl., 1120 cont.), and 7014 nonzeros 0 0 0 0.00% 1251268.313318 1251663.008334 0.03% 82 0 0 14816 32.7s 0 0 0 0.00% 1251268.313318 1251663.008334 0.03% 82 80 0 15061 32.7s 10.3% inactive integer columns, restarting Model after restart has 1678 rows, 1314 cols (193 bin., 0 int., 25 impl., 1096 cont.), and 6165 nonzeros 0 0 0 0.00% 1251411.655701 1251663.008334 0.02% 79 0 0 15215 32.9s 0 0 0 0.00% 1251411.660115 1251663.008334 0.02% 79 74 0 15464 32.9s 9.3% inactive integer columns, restarting Model after restart has 1587 rows, 1274 cols (173 bin., 0 int., 20 impl., 1081 cont.), and 5806 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% 1251513.486179 1251663.008334 0.01% 74 0 0 15628 33.3s 0 0 0 0.00% 1251513.486179 1251663.008334 0.01% 74 71 0 15867 33.3s 6.4% inactive integer columns, restarting Model after restart has 1475 rows, 1233 cols (150 bin., 0 int., 18 impl., 1065 cont.), and 5320 nonzeros 0 0 0 0.00% 1251529.028458 1251663.008334 0.01% 72 0 0 15939 33.6s 0 0 0 0.00% 1251529.028458 1251663.008334 0.01% 72 69 0 16141 33.6s 1 0 0 100.00% 1251541.7095 1251663.008334 0.01% 87 68 6 16243 33.8s Solving report Status Optimal Primal bound 1251663.00833 Dual bound 1251541.7095 Gap 0.00969% (tolerance: 0.01%) P-D integral 0.564151049607 Solution status feasible 1251663.00833 (objective) 0 (bound viol.) 6.43010570345e-07 (int. viol.) 0 (row viol.) Timing 33.79 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 8 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 16243 (total) 84 (strong br.) 1173 (separation) 11378 (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 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.4; 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 6629 rows, 4619 cols, 31042 nonzeros 0s 4061 rows, 2563 cols, 15474 nonzeros 0s 3641 rows, 2353 cols, 14635 nonzeros 0s Solving MIP model with: 3641 rows 2353 cols (933 binary, 0 integer, 75 implied int., 1345 continuous) 14635 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.2s R 0 0 0 0.00% 65118373.49489 79300483.41313 17.88% 0 0 0 894 0.4s L 0 0 0 0.00% 69829723.85337 69829723.85337 0.00% 239 114 0 924 0.7s 1 0 1 100.00% 69829723.85337 69829723.85337 0.00% 239 114 0 1023 0.7s Solving report Status Optimal Primal bound 69829723.8534 Dual bound 69829723.8534 Gap 0% (tolerance: 0.01%) P-D integral 0.0389600395071 Solution status feasible 69829723.8534 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.66 (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 1023 (total) 0 (strong br.) 30 (separation) 99 (heuristics) Test Summary: | Pass Total Time PowerModelsACDC | 324 324 14m19.9s Testing PowerModelsACDC tests passed Testing completed after 962.22s PkgEval succeeded after 1251.9s