Package evaluation of CbaOPF on Julia 1.13.0-DEV.140 (fac1ce7906*) started at 2025-03-02T13:01:51.782 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.05s ################################################################################ # Installation # Installing CbaOPF... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [b09c5755] + CbaOPF v0.3.0 Updating `~/.julia/environments/v1.13/Manifest.toml` [79e6a3ab] + Adapt v4.2.0 [4fba245c] + ArrayInterface v7.18.0 [6e4b80f9] + BenchmarkTools v1.6.0 [b09c5755] + CbaOPF v0.3.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [187b0558] + ConstructionBase v1.5.8 [864edb3b] + DataStructures v0.18.20 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [b4f34e82] + Distances v0.10.12 [ffbed154] + DocStringExtensions v0.9.3 [6a86dc24] + FiniteDiff v2.27.0 [4dc3fedf] + FlexPlan v0.4.0 [f6369f11] + ForwardDiff v0.10.38 [87dc4568] + HiGHS v1.13.0 [2030c09a] + InfrastructureModels v0.7.8 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.1 [4076af6c] + JuMP v1.24.0 [d3d80556] + LineSearches v7.3.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [b8f27783] + MathOptInterface v1.37.0 [f28f55f0] + Memento v1.4.1 [d8a4904e] + MutableArithmetics v1.6.4 [d41bc354] + NLSolversBase v7.8.3 [2774e3e8] + NLsolve v4.5.1 [77ba4419] + NaNMath v1.1.2 [bac558e1] + OrderedCollections v1.8.0 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.1 [c36e90e8] + PowerModels v0.21.3 [ff45984e] + PowerModelsACDC v0.8.0 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.0 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.0 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [6e34b625] + Bzip2_jll v1.0.9+0 [8fd58aa0] + HiGHS_jll v1.9.0+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 [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 [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 [e37daf67] + LibGit2_jll v1.9.0+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.0.16+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.12.0+0 Installation completed after 3.12s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 205.27s ################################################################################ # Testing # Testing CbaOPF Status `/tmp/jl_JdUT9r/Project.toml` [b09c5755] CbaOPF v0.3.0 [9961bab8] Cbc v1.2.0 [4dc3fedf] FlexPlan v0.4.0 [87dc4568] HiGHS v1.13.0 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.7.2 [4076af6c] JuMP v1.24.0 [2ddba703] Juniper v0.9.2 [f28f55f0] Memento v1.4.1 [c36e90e8] PowerModels v0.21.3 [ff45984e] PowerModelsACDC v0.8.0 [c946c3f1] SCS v2.0.2 [8dfed614] Test v1.11.0 Status `/tmp/jl_JdUT9r/Manifest.toml` [79e6a3ab] Adapt v4.2.0 [4fba245c] ArrayInterface v7.18.0 [6e4b80f9] BenchmarkTools v1.6.0 [b09c5755] CbaOPF v0.3.0 [9961bab8] Cbc v1.2.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [187b0558] ConstructionBase v1.5.8 [864edb3b] DataStructures v0.18.20 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [b4f34e82] Distances v0.10.12 [ffbed154] DocStringExtensions v0.9.3 [6a86dc24] FiniteDiff v2.27.0 [4dc3fedf] FlexPlan v0.4.0 [f6369f11] ForwardDiff v0.10.38 [87dc4568] HiGHS v1.13.0 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.7.2 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.1 [4076af6c] JuMP v1.24.0 [2ddba703] Juniper v0.9.2 [d3d80556] LineSearches v7.3.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [b8f27783] MathOptInterface v1.37.0 [f28f55f0] Memento v1.4.1 [d8a4904e] MutableArithmetics v1.6.4 [d41bc354] NLSolversBase v7.8.3 [2774e3e8] NLsolve v4.5.1 [77ba4419] NaNMath v1.1.2 [bac558e1] OrderedCollections v1.8.0 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.1 [c36e90e8] PowerModels v0.21.3 [ff45984e] PowerModelsACDC v0.8.0 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [c946c3f1] SCS v2.0.2 [efcf1570] Setfield v1.1.2 [276daf66] SpecialFunctions v2.5.0 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.0 [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 [38041ee0] Cbc_jll v200.1000.800+0 [3830e938] Cgl_jll v0.6000.600+0 ⌅ [06985876] Clp_jll v100.1700.700+1 ⌅ [be027038] CoinUtils_jll v200.1100.600+0 [8fd58aa0] HiGHS_jll v1.9.0+0 [e33a78d0] Hwloc_jll v2.12.0+0 [9cc047cb] Ipopt_jll v300.1400.1700+0 [1d63c593] LLVMOpenMP_jll v18.1.7+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.700.301+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [7da25872] Osi_jll v0.10800.700+0 [f4f2fc5b] SCS_jll v3.2.7+0 ⌅ [319450e9] SPRAL_jll v2024.5.8+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [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 v2024.12.31 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.0.16+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.12.0+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... 44779.0 ms ✓ HiGHS 1 dependency successfully precompiled in 46 seconds. 58 already precompiled. Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 2e+02] Cost [1e+03, 1e+06] Bound [4e-01, 6e+00] RHS [1e-02, 4e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.4855432938e-01 Ph1: 33(54748.2); Du: 3(0.000148554) 0s 84 3.4021711179e+04 Pr: 0(0); Du: 0(2.27374e-12) 0s Model status : Optimal Simplex iterations: 84 Objective value : 3.4021711179e+04 Relative P-D gap : 5.5604169047e-15 HiGHS run time : 0.13 Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms 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.5321145845e-03 Pr: 86(4851.31); Du: 5(0.000139249) 0s 102 1.8850363728e+03 Pr: 0(0); Du: 0(1.81899e-12) 0s Model status : Optimal Simplex iterations: 102 Objective value : 1.8850363728e+03 Relative P-D gap : 7.9730026239e-14 HiGHS run time : 0.00 Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms 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.5235120032e-03 Pr: 79(4846.7); Du: 5(0.000103632) 0s 109 6.2101107077e+01 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 109 Objective value : 6.2101107077e+01 Relative P-D gap : 3.5448699831e-12 HiGHS run time : 0.00 Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [4e-01, 2e+02] Cost [2e+02, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 0.6197 from [lower, value, upper] = [ 0; 0.61969732; 0] WARNING: Row 3 has infeasibility of 4 from [lower, value, upper] = [ 0; 4; 0] WARNING: Row 122 has infeasibility of 14.8 from [lower, value, upper] = [ 14.8; 0; inf] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 74 14.8 106.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [4e-01, 2e+02] Cost [2e+02, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 1e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 73 rows, 91 cols, 227 nonzeros 0s 47 rows, 73 cols, 173 nonzeros 0s 35 rows, 63 cols, 139 nonzeros 0s 26 rows, 52 cols, 103 nonzeros 0s 25 rows, 51 cols, 101 nonzeros 0s Solving MIP model with: 25 rows 51 cols (1 binary, 0 integer, 0 implied int., 50 continuous) 101 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 Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1000 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 1000 1000 0.00% 0 0 0 35 0.0s 1 0 1 100.00% 1000 1000 0.00% 0 0 0 35 0.0s Solving report Status Optimal Primal bound 1000 Dual bound 1000 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 1000 (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 35 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ****************************************************************************** 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 ****************************************************************************** This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 919 Number of nonzeros in inequality constraint Jacobian.: 102 Number of nonzeros in Lagrangian Hessian.............: 1417 Total number of variables............................: 268 variables with only lower bounds: 0 variables with lower and upper bounds: 254 variables with only upper bounds: 0 Total number of equality constraints.................: 210 Total number of inequality constraints...............: 53 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 15 inequality constraints with only upper bounds: 36 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0761139e+04 4.30e+00 6.14e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.2519560e+04 4.20e+00 6.08e+01 -1.0 7.42e+00 - 8.93e-03 2.23e-02f 1 2 3.1837490e+05 2.13e+00 1.27e+02 -1.0 2.12e+00 2.0 1.30e-02 4.93e-01h 1 3 3.5203474e+05 2.06e+00 1.32e+02 -1.0 1.07e+00 2.4 2.27e-01 3.40e-02h 1 4 2.3098389e+05 1.87e+00 1.30e+02 -1.0 1.18e+00 1.9 6.07e-01 9.36e-02f 1 5 4.0271735e+05 1.32e+00 1.59e+02 -1.0 9.68e-01 2.4 2.89e-01 2.94e-01h 1 6 4.0068846e+05 1.23e+00 1.53e+02 -1.0 9.01e-01 1.9 1.62e-01 6.73e-02h 1 7 8.3108596e+05 6.44e-01 1.51e+02 -1.0 7.05e-01 2.3 7.07e-01 4.76e-01h 1 8 8.5732075e+05 6.15e-01 1.54e+02 -1.0 4.18e-01 2.7 1.89e-01 4.49e-02h 1 9 1.0707412e+06 2.55e-01 1.15e+02 -1.0 4.72e-01 2.3 1.00e+00 5.86e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 9.6592564e+05 1.98e-01 9.42e+01 -1.0 3.75e-01 1.8 1.00e+00 2.24e-01f 1 11 1.1159294e+05 7.77e-02 4.35e+01 -1.0 7.25e-01 1.3 1.00e+00 6.07e-01f 1 12 9.9215372e+04 7.50e-02 5.12e+01 -1.0 2.70e-01 1.7 1.00e+00 3.49e-02f 1 13 1.0344940e+05 1.19e-03 1.73e+01 -1.0 7.86e-02 2.2 1.00e+00 1.00e+00f 1 14 9.9089291e+04 2.55e-04 1.21e+01 -1.0 1.84e-02 1.7 7.02e-01 9.67e-01f 1 15 1.0023507e+05 8.92e-05 1.57e+00 -1.0 4.04e-02 1.2 1.00e+00 1.00e+00f 1 16 9.9311554e+04 2.51e-05 1.61e+00 -1.0 3.66e-02 1.6 1.00e+00 1.00e+00f 1 17 9.8299966e+04 3.94e-05 6.31e-01 -1.0 4.32e-02 1.2 1.00e+00 1.00e+00f 1 18 9.1881518e+04 7.81e-05 2.69e-01 -1.7 4.82e-02 0.7 8.91e-01 1.00e+00f 1 19 8.6231243e+04 6.93e-05 3.20e-01 -1.7 1.97e-01 0.2 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 7.3637538e+04 4.99e-03 2.61e-01 -1.7 3.98e-01 -0.3 6.15e-01 1.00e+00f 1 21 5.8933475e+04 2.30e-03 2.00e-01 -1.7 1.10e+00 -0.7 1.00e+00 4.80e-01f 1 22 5.1986884e+04 1.78e-03 1.56e-01 -2.5 8.85e-01 -1.2 5.71e-01 2.80e-01f 1 23 4.7295384e+04 5.00e-02 9.82e-02 -2.5 2.46e+00 -1.7 4.08e-01 3.55e-01f 1 24 4.1949330e+04 3.34e-02 5.16e-02 -2.5 9.95e-01 -1.3 9.61e-01 9.88e-01h 1 25 3.6822981e+04 4.42e-02 4.71e-02 -2.5 9.57e+00 - 1.38e-01 1.97e-01f 1 26 3.1413526e+04 3.72e-02 3.87e-02 -2.5 1.40e+01 - 2.17e-01 2.50e-01h 1 27 2.7515953e+04 3.02e-02 1.43e-01 -2.5 1.75e+01 - 1.00e+00 2.05e-01h 1 28 2.6613928e+04 2.53e-02 9.60e-02 -2.5 8.39e+00 - 3.99e-01 2.18e-01h 1 29 2.5854896e+04 5.96e-02 2.51e-02 -2.5 4.35e+00 - 8.29e-01 8.91e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 2.6022701e+04 1.13e-02 1.25e-02 -2.5 2.28e+00 - 6.89e-01 1.00e+00h 1 31 2.6000555e+04 6.14e-04 1.79e-03 -2.5 4.37e-01 - 1.00e+00 1.00e+00h 1 32 2.5174621e+04 5.03e-03 3.00e-03 -3.8 1.45e+00 - 7.61e-01 6.78e-01h 1 33 2.4929285e+04 7.12e-03 1.92e-02 -3.8 4.72e-01 - 8.90e-01 6.51e-01h 1 34 2.4784905e+04 1.65e-02 2.64e-03 -3.8 6.52e-01 - 1.00e+00 1.00e+00h 1 35 2.4789563e+04 4.92e-04 3.69e-05 -3.8 2.70e-01 - 1.00e+00 1.00e+00h 1 36 2.4789052e+04 3.65e-05 2.54e-06 -3.8 6.18e-03 - 1.00e+00 1.00e+00h 1 37 2.4744667e+04 9.23e-04 4.73e-03 -5.7 4.58e-01 - 8.62e-01 5.96e-01h 1 38 2.4728900e+04 1.07e-03 1.44e-02 -5.7 2.67e-01 - 9.99e-01 5.08e-01h 1 39 2.4718280e+04 1.11e-03 4.72e-03 -5.7 2.65e-01 - 1.00e+00 8.02e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 2.4716317e+04 2.10e-04 3.63e-05 -5.7 1.87e-01 - 1.00e+00 1.00e+00h 1 41 2.4716420e+04 4.04e-07 1.17e-05 -5.7 2.53e-02 - 1.00e+00 1.00e+00h 1 42 2.4716414e+04 9.86e-09 4.97e-08 -5.7 9.60e-04 - 1.00e+00 1.00e+00h 1 43 2.4715764e+04 6.76e-06 4.34e-03 -8.6 4.95e-02 - 9.81e-01 8.29e-01h 1 44 2.4715675e+04 1.11e-06 8.93e-03 -8.6 1.07e-03 -1.7 1.00e+00 8.37e-01h 1 45 2.4715656e+04 1.37e-06 1.37e-03 -8.6 1.35e-02 - 1.00e+00 9.44e-01f 1 46 2.4715656e+04 6.64e-07 1.02e-01 -8.6 5.84e-05 -2.2 1.00e+00 5.00e-01f 2 47 2.4715656e+04 2.25e-10 1.68e-07 -8.6 8.46e-05 -2.7 1.00e+00 1.00e+00h 1 Number of Iterations....: 47 (scaled) (unscaled) Objective...............: 2.4715656299405393e+00 2.4715656299405393e+04 Dual infeasibility......: 1.6761314967840538e-07 1.6761314967840538e-03 Constraint violation....: 2.2467694371641755e-10 2.2467694371641755e-10 Variable bound violation: 4.6545966192468313e-08 4.6545966192468313e-08 Complementarity.........: 2.6405190245033219e-09 2.6405190245033217e-05 Overall NLP error.......: 1.6761314967840538e-07 1.6761314967840538e-03 Number of objective function evaluations = 49 Number of objective gradient evaluations = 48 Number of equality constraint evaluations = 49 Number of inequality constraint evaluations = 49 Number of equality constraint Jacobian evaluations = 48 Number of inequality constraint Jacobian evaluations = 48 Number of Lagrangian Hessian evaluations = 47 Total seconds in IPOPT = 18.919 EXIT: Optimal Solution Found. PSTs not yet defined for SOC formulations This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 716 Number of nonzeros in inequality constraint Jacobian.: 418 Number of nonzeros in Lagrangian Hessian.............: 206 Total number of variables............................: 310 variables with only lower bounds: 0 variables with lower and upper bounds: 310 variables with only upper bounds: 0 Total number of equality constraints.................: 194 Total number of inequality constraints...............: 152 inequality constraints with only lower bounds: 45 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 107 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0761139e+04 5.06e+01 6.29e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.5890565e+03 4.99e+01 6.23e+01 -1.0 5.38e+00 - 1.07e-02 1.40e-02f 1 2 3.3071950e+04 4.27e+01 6.52e+01 -1.0 4.40e+00 - 2.27e-02 1.45e-01f 1 3 5.9275446e+03 4.06e+01 6.00e+01 -1.0 3.36e+00 - 7.04e-02 4.86e-02h 1 4 4.8183627e+04 8.29e+00 6.64e+01 -1.0 2.98e+00 - 1.92e-01 7.96e-01f 1 5 2.2722521e+04 5.64e+00 3.04e+01 -1.0 7.08e-01 - 5.24e-01 3.19e-01f 1 6 3.2857826e+04 7.79e-01 4.58e+01 -1.0 9.68e-01 - 2.91e-01 8.62e-01h 1 7 3.1354319e+04 2.27e-01 5.17e+01 -1.0 6.91e-01 - 2.88e-01 7.09e-01h 1 8 3.2364205e+04 1.72e-01 3.90e+01 -1.0 2.02e+00 - 2.53e-01 2.43e-01h 1 9 3.5342307e+04 8.97e-02 2.67e+01 -1.0 2.36e+00 - 3.56e-01 4.79e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 4.1894105e+04 5.68e-14 2.11e+01 -1.0 2.19e+00 - 7.34e-01 1.00e+00h 1 11 3.9579132e+04 6.04e-14 7.96e-01 -1.0 1.99e+00 - 1.00e+00 1.00e+00h 1 12 1.7531758e+04 5.68e-14 8.39e+00 -1.7 3.50e+00 - 8.98e-01 1.00e+00f 1 13 1.4102169e+04 5.68e-14 1.12e-02 -1.7 3.58e+00 - 1.00e+00 1.00e+00h 1 14 1.3599280e+04 1.14e-13 4.28e-04 -1.7 9.65e-01 - 1.00e+00 1.00e+00h 1 15 7.2727521e+03 5.68e-14 8.87e-01 -3.8 4.15e+00 - 7.54e-01 8.00e-01f 1 16 3.6546366e+03 2.97e-03 2.42e-01 -3.8 3.48e+00 - 7.01e-01 9.73e-01h 1 17 3.2153974e+03 5.68e-14 3.86e-03 -3.8 6.43e-01 - 1.00e+00 1.00e+00h 1 18 3.2367220e+03 6.87e-14 3.56e-03 -3.8 2.79e-01 - 1.00e+00 1.00e+00h 1 19 3.2363174e+03 5.68e-14 2.39e-06 -3.8 1.12e-02 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 3.1369097e+03 7.28e-04 4.20e-03 -5.7 1.03e-01 - 9.17e-01 9.42e-01h 1 21 3.1242081e+03 3.87e-05 7.68e-02 -5.7 8.52e-01 - 8.39e-01 6.21e-01h 1 22 3.1164463e+03 1.11e-05 2.20e-02 -5.7 1.87e-01 - 1.00e+00 9.81e-01h 1 23 3.1159197e+03 1.26e-06 2.65e-02 -5.7 1.52e-01 - 1.00e+00 6.35e-01h 1 24 3.1154519e+03 5.68e-14 1.34e-04 -5.7 4.42e-02 - 1.00e+00 1.00e+00h 1 25 3.1152665e+03 5.68e-14 2.98e-06 -5.7 1.48e-02 - 1.00e+00 1.00e+00h 1 26 3.1152693e+03 5.68e-14 2.32e-07 -5.7 1.25e-03 - 1.00e+00 1.00e+00h 1 27 3.1141821e+03 5.68e-14 4.87e-02 -8.6 9.01e-02 - 9.12e-01 4.87e-01h 1 28 3.1137687e+03 5.68e-14 2.82e-01 -8.6 8.83e-02 - 7.21e-01 4.40e-01h 1 29 3.1133502e+03 5.68e-14 2.46e-01 -8.6 1.23e-01 - 7.60e-01 7.79e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 3.1132338e+03 2.05e-06 8.31e-01 -8.6 1.33e-01 - 9.15e-01 8.43e-01f 1 31 3.1132099e+03 9.20e-07 1.68e-01 -8.6 3.34e-02 - 1.00e+00 8.17e-01h 1 32 3.1132018e+03 3.65e-07 1.28e-03 -8.6 6.73e-03 - 1.00e+00 1.00e+00f 1 33 3.1132004e+03 5.68e-14 2.18e-02 -8.6 1.66e-03 - 1.00e+00 7.26e-01h 1 34 3.1131993e+03 6.12e-14 4.28e-05 -8.6 9.62e-04 - 1.00e+00 1.00e+00f 1 35 3.1131989e+03 6.58e-14 9.16e-03 -8.6 5.02e-04 - 1.00e+00 7.88e-01h 1 36 3.1131986e+03 5.68e-14 3.59e-05 -8.6 2.62e-04 - 1.00e+00 1.00e+00f 1 37 3.1131984e+03 5.68e-14 1.31e-02 -8.6 1.68e-04 - 1.00e+00 8.81e-01h 1 38 3.1131983e+03 5.68e-14 1.20e-05 -8.6 5.43e-05 - 1.00e+00 1.00e+00f 1 39 3.1131983e+03 5.68e-14 2.77e-06 -8.6 4.37e-05 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 3.1131983e+03 4.72e-14 5.27e-08 -8.6 5.82e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 40 (scaled) (unscaled) Objective...............: 3.1131982681946918e-01 3.1131982681946915e+03 Dual infeasibility......: 5.2699748222007767e-08 5.2699748222007764e-04 Constraint violation....: 3.0517988136580248e-14 4.7212234122184782e-14 Variable bound violation: 1.7637169946738140e-08 1.7637169946738140e-08 Complementarity.........: 2.5059036076667861e-09 2.5059036076667859e-05 Overall NLP error.......: 5.2699748222007767e-08 5.2699748222007764e-04 Number of objective function evaluations = 41 Number of objective gradient evaluations = 41 Number of equality constraint evaluations = 41 Number of inequality constraint evaluations = 41 Number of equality constraint Jacobian evaluations = 41 Number of inequality constraint Jacobian evaluations = 41 Number of Lagrangian Hessian evaluations = 40 Total seconds in IPOPT = 0.074 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 998 Number of nonzeros in inequality constraint Jacobian.: 1297 Number of nonzeros in Lagrangian Hessian.............: 113 Total number of variables............................: 299 variables with only lower bounds: 0 variables with lower and upper bounds: 285 variables with only upper bounds: 0 Total number of equality constraints.................: 203 Total number of inequality constraints...............: 495 inequality constraints with only lower bounds: 2 inequality constraints with lower and upper bounds: 15 inequality constraints with only upper bounds: 478 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 6.0761139e+04 5.01e+01 6.21e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0030006e+03 4.94e+01 6.15e+01 -1.0 4.21e+00 - 1.03e-02 1.48e-02f 1 2 1.9811016e+04 4.47e+01 6.00e+01 -1.0 3.51e+00 - 4.84e-02 9.51e-02f 1 3 9.7337831e+03 4.10e+01 5.62e+01 -1.0 4.39e+00 - 6.99e-02 8.28e-02f 1 4 4.4471393e+04 2.10e+01 6.03e+01 -1.0 3.61e+00 - 1.26e-01 4.87e-01h 1 5 4.3709872e+04 1.42e+01 1.49e+01 -1.0 1.53e+00 - 6.63e-01 3.23e-01h 1 6 6.5032336e+04 6.07e-01 3.39e+00 -1.0 1.11e+00 - 8.85e-01 9.57e-01h 1 7 6.8972896e+04 2.75e-01 5.59e+00 -1.0 2.16e+00 - 4.23e-01 5.47e-01h 1 8 8.3684657e+04 8.24e-02 3.97e+01 -1.0 4.18e+00 - 3.05e-01 7.00e-01f 1 9 7.9586871e+04 2.84e-14 9.94e-03 -1.0 4.30e+00 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.8793748e+04 2.84e-14 1.19e+01 -1.7 1.58e+00 - 7.29e-01 1.00e+00f 1 11 5.3027493e+04 5.68e-14 5.08e+00 -1.7 2.14e+00 - 5.96e-01 1.00e+00h 1 12 4.8488447e+04 5.68e-14 4.96e-03 -1.7 1.22e+00 - 1.00e+00 1.00e+00h 1 13 4.8876851e+04 2.84e-14 2.98e-04 -1.7 3.38e-01 - 1.00e+00 1.00e+00h 1 14 4.0709611e+04 2.84e-14 9.72e-01 -3.8 4.45e+00 - 3.69e-01 4.70e-01f 1 15 2.9428713e+04 2.84e-14 1.45e+00 -3.8 4.50e+00 - 4.28e-01 7.09e-01h 1 16 2.8655306e+04 2.84e-14 6.17e+00 -3.8 2.46e+00 - 4.93e-01 1.48e-01h 1 17 2.6677133e+04 2.84e-14 5.51e+00 -3.8 2.14e+00 - 6.62e-01 4.62e-01h 1 18 2.5290919e+04 2.84e-14 5.82e+00 -3.8 2.25e+00 - 8.84e-01 5.45e-01h 1 19 2.4859819e+04 2.19e-02 4.12e+00 -3.8 1.99e+00 - 9.52e-01 5.70e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 2.4630591e+04 2.84e-14 7.97e-02 -3.8 1.74e+00 - 1.00e+00 9.88e-01h 1 21 2.4648346e+04 2.84e-14 3.18e-04 -3.8 7.75e-01 - 1.00e+00 1.00e+00h 1 22 2.4646620e+04 2.84e-14 1.86e-05 -3.8 8.66e-02 - 1.00e+00 1.00e+00h 1 23 2.4568446e+04 2.84e-14 2.92e-01 -5.7 2.30e+00 - 7.54e-01 6.46e-01h 1 24 2.4534723e+04 9.00e-07 9.14e-02 -5.7 5.36e+00 - 7.55e-01 7.36e-01h 1 25 2.4523299e+04 8.41e-02 3.03e-02 -5.7 5.58e+00 - 7.93e-01 7.36e-01h 1 26 2.4521905e+04 3.43e-01 6.27e-01 -5.7 1.21e+00 - 1.00e+00 4.34e-01h 1 27 2.4520652e+04 2.84e-14 2.32e-05 -5.7 1.08e-01 - 1.00e+00 1.00e+00h 1 28 2.4520681e+04 2.84e-14 3.03e-06 -5.7 3.88e-02 - 1.00e+00 1.00e+00h 1 29 2.4520681e+04 1.42e-14 5.30e-09 -5.7 2.21e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 2.4519498e+04 9.54e-05 1.47e-01 -8.6 8.80e-02 - 9.56e-01 7.67e-01h 1 31 2.4519208e+04 7.23e-07 3.04e-02 -8.6 5.50e-02 - 6.03e-01 8.43e-01h 1 32 2.4519157e+04 2.09e-07 6.96e-04 -8.6 7.89e-03 -4.0 1.00e+00 9.88e-01h 1 33 2.4519156e+04 1.37e-07 2.21e-01 -8.6 1.32e-02 -4.5 1.00e+00 2.98e-01f 1 34 2.4519156e+04 2.84e-14 2.43e-07 -8.6 7.03e-03 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 34 (scaled) (unscaled) Objective...............: 2.4519155744890835e+00 2.4519155744890835e+04 Dual infeasibility......: 2.4294139032780264e-07 2.4294139032780262e-03 Constraint violation....: 1.8371792975813153e-14 2.8421709430404007e-14 Variable bound violation: 4.6907531192630358e-08 4.6907531192630358e-08 Complementarity.........: 5.1880764733827567e-09 5.1880764733827564e-05 Overall NLP error.......: 2.4294139032780264e-07 2.4294139032780262e-03 Number of objective function evaluations = 35 Number of objective gradient evaluations = 35 Number of equality constraint evaluations = 35 Number of inequality constraint evaluations = 35 Number of equality constraint Jacobian evaluations = 35 Number of inequality constraint Jacobian evaluations = 35 Number of Lagrangian Hessian evaluations = 34 Total seconds in IPOPT = 0.129 EXIT: Optimal Solution Found. [warn | InfrastructureModels]: Matlab parser skipping the following line: ]; Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.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 Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2692 rows, 2664 cols, 9061 nonzeros 0s 2335 rows, 1789 cols, 8380 nonzeros 0s 2157 rows, 1646 cols, 7899 nonzeros 0s Solving MIP model with: 2157 rows 1646 cols (697 binary, 0 integer, 0 implied int., 949 continuous) 7899 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 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.0006 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0006 36.1506245 100.00% 0 0 0 644 0.1s 1 0 1 100.00% 36.1506245 36.1506245 0.00% 0 0 0 644 0.1s Solving report Status Optimal Primal bound 36.1506245026 Dual bound 36.1506245026 Gap 0% (tolerance: 0.01%) P-D integral 0.000112531701591 Solution status feasible 36.1506245026 (objective) 0 (bound viol.) 2.88657986403e-15 (int. viol.) 0 (row viol.) Timing 0.14 (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 644 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.4; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 1848 5 1790 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 6484 rows, 5928 cols, 23077 nonzeros 0s 4903 rows, 4405 cols, 19112 nonzeros 0s 4168 rows, 3718 cols, 17529 nonzeros 0s 2968 rows, 1921 cols, 13881 nonzeros 0s 2968 rows, 1921 cols, 13881 nonzeros 0s Solving MIP model with: 2968 rows 1921 cols (697 binary, 0 integer, 0 implied int., 1224 continuous) 13881 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 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.0006 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1097 0.3s 96.6% inactive integer columns, restarting Model after restart has 936 rows, 1046 cols (15 bin., 0 int., 0 impl., 1031 cont.), and 3207 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1097 0.3s 0 0 0 0.00% 1.330837351 1.331336304 0.04% 0 0 0 1573 0.3s 46.7% inactive integer columns, restarting Model after restart has 885 rows, 1038 cols (7 bin., 0 int., 0 impl., 1031 cont.), and 2964 nonzeros 0 0 0 0.00% 1.33097375 1.331336304 0.03% 2 0 0 1654 0.5s 0 0 0 0.00% 1.33097375 1.331336304 0.03% 2 2 0 1692 0.5s 42.9% inactive integer columns, restarting Model after restart has 867 rows, 1035 cols (4 bin., 0 int., 0 impl., 1031 cont.), and 2881 nonzeros 0 0 0 0.00% 1.33102973 1.331336304 0.02% 3 0 0 1716 0.6s 0 0 0 0.00% 1.33102973 1.331336304 0.02% 3 3 0 1732 0.6s 1 0 1 100.00% 1.331336304 1.331336304 0.00% 59 6 0 1743 0.6s Solving report Status Optimal Primal bound 1.33133630422 Dual bound 1.33133630422 Gap 0% (tolerance: 0.01%) P-D integral 9.54172471407e-05 Solution status feasible 1.33133630422 (objective) 0 (bound viol.) 1.68753899743e-14 (int. viol.) 0 (row viol.) Timing 0.60 (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 1743 (total) 0 (strong br.) 18 (separation) 98 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.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 Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2692 rows, 2664 cols, 9061 nonzeros 0s 2320 rows, 1774 cols, 8315 nonzeros 0s 2149 rows, 1642 cols, 7856 nonzeros 0s Solving MIP model with: 2149 rows 1642 cols (240 binary, 0 integer, 6 implied int., 1396 continuous) 7856 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 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.0006 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0006 36.1506245 100.00% 0 0 0 659 0.1s 1 0 1 100.00% 36.1506245 36.1506245 0.00% 0 0 0 659 0.1s Solving report Status Optimal Primal bound 36.1506245026 Dual bound 36.1506245026 Gap 0% (tolerance: 0.01%) P-D integral 8.08225568631e-05 Solution status feasible 36.1506245026 (objective) 0 (bound viol.) 4.66293670343e-15 (int. viol.) 0 (row viol.) Timing 0.11 (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 659 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.4; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 1848 5 1790 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [8e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 6484 rows, 5928 cols, 23077 nonzeros 0s 4903 rows, 4405 cols, 19112 nonzeros 0s 4168 rows, 3718 cols, 17529 nonzeros 0s 2968 rows, 1921 cols, 13881 nonzeros 0s 2870 rows, 1872 cols, 13195 nonzeros 0s Solving MIP model with: 2870 rows 1872 cols (240 binary, 0 integer, 6 implied int., 1626 continuous) 13195 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 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.0006 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1091 0.2s 58.8% inactive integer columns, restarting Model after restart has 1798 rows, 1267 cols (94 bin., 0 int., 7 impl., 1166 cont.), and 7230 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1091 0.3s 48.9% inactive integer columns, restarting Model after restart has 1361 rows, 1141 cols (47 bin., 0 int., 0 impl., 1094 cont.), and 4965 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1495 0.3s 14.9% inactive integer columns, restarting Model after restart has 1282 rows, 1119 cols (39 bin., 0 int., 0 impl., 1080 cont.), and 4603 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1746 0.4s 17.9% inactive integer columns, restarting Model after restart has 1196 rows, 1098 cols (32 bin., 0 int., 0 impl., 1066 cont.), and 4248 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1786 0.4s 18.8% inactive integer columns, restarting Model after restart has 1127 rows, 1080 cols (26 bin., 0 int., 0 impl., 1054 cont.), and 3954 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1836 0.5s 23.1% inactive integer columns, restarting Model after restart has 994 rows, 1057 cols (15 bin., 0 int., 0 impl., 1042 cont.), and 3409 nonzeros 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1872 0.5s 0 0 0 0.00% 1.330766951 1.331336304 0.04% 0 0 0 1923 0.5s 53.3% inactive integer columns, restarting Model after restart has 892 rows, 1041 cols (7 bin., 0 int., 0 impl., 1034 cont.), and 3003 nonzeros 0 0 0 0.00% 1.33097375 1.331336304 0.03% 2 0 0 2051 0.6s 0 0 0 0.00% 1.33097375 1.331336304 0.03% 2 2 0 2119 0.6s 42.9% inactive integer columns, restarting Model after restart has 869 rows, 1036 cols (4 bin., 0 int., 0 impl., 1032 cont.), and 2886 nonzeros 0 0 0 0.00% 1.33102973 1.331336304 0.02% 3 0 0 2143 0.7s 0 0 0 0.00% 1.33102973 1.331336304 0.02% 3 3 0 2159 0.8s 1 0 1 100.00% 1.331336304 1.331336304 0.00% 50 7 0 2170 0.8s Solving report Status Optimal Primal bound 1.33133630422 Dual bound 1.33133630422 Gap 0% (tolerance: 0.01%) P-D integral 0.000204208410491 Solution status feasible 1.33133630422 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.79 (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 2170 (total) 0 (strong br.) 19 (separation) 144 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.4; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2668 rows, 2448 cols, 9325 nonzeros 0s 2302 rows, 1516 cols, 8850 nonzeros 0s 2057 rows, 1322 cols, 8274 nonzeros 0s Solving MIP model with: 2057 rows 1322 cols (697 binary, 0 integer, 0 implied int., 625 continuous) 8274 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 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.0003 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0003 161.57221 100.00% 0 0 0 535 0.1s 1 0 1 100.00% 161.57221 161.57221 0.00% 0 0 0 535 0.1s Solving report Status Optimal Primal bound 161.572209983 Dual bound 161.572209983 Gap 0% (tolerance: 0.01%) P-D integral 0.000111579687843 Solution status feasible 161.572209983 (objective) 0 (bound viol.) 5.10702591328e-15 (int. viol.) 0 (row viol.) Timing 0.13 (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 535 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.4; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 1968 5 1884 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.02 Presolving model 6700 rows, 5976 cols, 24157 nonzeros 0s 5038 rows, 4372 cols, 19974 nonzeros 0s 4250 rows, 3632 cols, 18259 nonzeros 0s 2920 rows, 1681 cols, 14262 nonzeros 0s 2920 rows, 1681 cols, 14262 nonzeros 0s Solving MIP model with: 2920 rows 1681 cols (697 binary, 0 integer, 0 implied int., 984 continuous) 14262 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 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.0003 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 920 0.3s 78.8% inactive integer columns, restarting Model after restart has 1527 rows, 1071 cols (112 bin., 0 int., 0 impl., 959 cont.), and 5687 nonzeros 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 920 0.3s 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 1279 0.4s L 0 0 0 0.00% 1.422334552 1.422531576 0.01% 64 6 0 1308 0.5s 94.6% inactive integer columns, restarting Model after restart has 928 rows, 957 cols (5 bin., 0 int., 0 impl., 952 cont.), and 2999 nonzeros 0 0 0 0.00% 1.422363328 1.422531576 0.01% 5 0 0 1890 0.6s 0 0 0 0.00% 1.422363328 1.422531576 0.01% 5 5 0 2266 0.6s 1 0 1 100.00% 1.422443328 1.422531576 0.01% 23 6 0 2267 0.6s Solving report Status Optimal Primal bound 1.42253157607 Dual bound 1.42244332847 Gap 0.0062% (tolerance: 0.01%) P-D integral 0.000255105570964 Solution status feasible 1.42253157607 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.63 (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 2267 (total) 0 (strong br.) 32 (separation) 580 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.4; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2668 rows, 2448 cols, 9325 nonzeros 0s 2264 rows, 1486 cols, 8734 nonzeros 0s 2036 rows, 1304 cols, 8266 nonzeros 0s Solving MIP model with: 2036 rows 1304 cols (240 binary, 0 integer, 6 implied int., 1058 continuous) 8266 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 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.0003 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0003 161.57221 100.00% 0 0 0 533 0.1s 1 0 1 100.00% 161.57221 161.57221 0.00% 0 0 0 533 0.1s Solving report Status Optimal Primal bound 161.572209983 Dual bound 161.572209983 Gap 0% (tolerance: 0.01%) P-D integral 8.91683830198e-05 Solution status feasible 161.572209983 (objective) 0 (bound viol.) 5.10702591328e-15 (int. viol.) 0 (row viol.) Timing 0.10 (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 533 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 2.4 from [lower, value, upper] = [ 0; 2.4; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 1968 5 1884 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [7e-08, 1e+00] Bound [4e-01, 1e+06] RHS [3e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.02 Presolving model 6700 rows, 5976 cols, 24157 nonzeros 0s 5038 rows, 4372 cols, 19974 nonzeros 0s 4227 rows, 3609 cols, 18213 nonzeros 0s 2920 rows, 1681 cols, 14262 nonzeros 0s 2869 rows, 1653 cols, 13978 nonzeros 0s Solving MIP model with: 2869 rows 1653 cols (240 binary, 0 integer, 6 implied int., 1407 continuous) 13978 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 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.0003 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 925 0.2s 41.2% inactive integer columns, restarting Model after restart has 2229 rows, 1325 cols (140 bin., 0 int., 0 impl., 1185 cont.), and 9472 nonzeros 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 925 0.2s 0 0 0 0.00% 1.421932129 1.423590036 0.12% 0 0 0 1023 0.3s L 0 0 0 0.00% 1.422129654 1.422688191 0.04% 47 3 0 1036 0.4s L 0 0 0 0.00% 1.422129654 1.422531576 0.03% 57 4 0 1286 0.5s 86.4% inactive integer columns, restarting Model after restart has 1121 rows, 989 cols (19 bin., 0 int., 0 impl., 970 cont.), and 3813 nonzeros 0 0 0 0.00% 1.42226124 1.422531576 0.02% 2 0 0 1623 0.6s 36.8% inactive integer columns, restarting Model after restart has 987 rows, 966 cols (8 bin., 0 int., 0 impl., 958 cont.), and 3220 nonzeros 0 0 0 0.00% 1.42226124 1.422531576 0.02% 2 0 0 2007 0.6s 12.5% inactive integer columns, restarting Model after restart has 968 rows, 963 cols (7 bin., 0 int., 0 impl., 956 cont.), and 3151 nonzeros 0 0 0 0.00% 1.42226124 1.422531576 0.02% 2 0 0 2086 0.6s 14.3% inactive integer columns, restarting Model after restart has 949 rows, 960 cols (6 bin., 0 int., 0 impl., 954 cont.), and 3078 nonzeros 0 0 0 0.00% 1.42226124 1.422531576 0.02% 2 0 0 2107 0.6s 16.7% inactive integer columns, restarting Model after restart has 913 rows, 956 cols (4 bin., 0 int., 0 impl., 952 cont.), and 2938 nonzeros 0 0 0 0.00% 1.42226124 1.422531576 0.02% 2 0 0 2134 0.7s 0 0 0 0.00% 1.42226124 1.422531576 0.02% 2 2 0 2165 0.7s 1 0 1 100.00% 1.422469441 1.422531576 0.00% 43 5 0 2177 0.7s Solving report Status Optimal Primal bound 1.42253157607 Dual bound 1.42246944076 Gap 0.00437% (tolerance: 0.01%) P-D integral 0.000336663166309 Solution status feasible 1.42253157607 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.70 (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 2177 (total) 0 (strong br.) 32 (separation) 580 (heuristics) [warn | InfrastructureModels]: Matlab parser skipping the following line: ]; Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 432 5 950.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model 1632 rows, 3240 cols, 4488 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.03 Presolving model 4218 rows, 4728 cols, 13893 nonzeros 0s 3574 rows, 2779 cols, 12595 nonzeros 0s 3259 rows, 2517 cols, 11671 nonzeros 0s Solving MIP model with: 3259 rows 2517 cols (1047 binary, 0 integer, 0 implied int., 1470 continuous) 11671 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 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.0009 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0009 136.4116433 100.00% 0 0 0 1070 0.2s 1 0 1 100.00% 136.4116433 136.4116433 0.00% 0 0 0 1070 0.2s Solving report Status Optimal Primal bound 136.411643313 Dual bound 136.411643313 Gap 0% (tolerance: 0.01%) P-D integral 0.000132798272394 Solution status feasible 136.411643313 (objective) 0 (bound viol.) 4.88498130835e-15 (int. viol.) 0 (row viol.) Timing 0.23 (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 1070 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 5040 5 7009 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.06 Presolving model 15378 rows, 15240 cols, 53853 nonzeros 0s 11638 rows, 11707 cols, 44103 nonzeros 0s 6758 rows, 5366 cols, 31035 nonzeros 0s 5673 rows, 4137 cols, 29791 nonzeros 0s 5670 rows, 4137 cols, 29768 nonzeros 0s Solving MIP model with: 5670 rows 4137 cols (1044 binary, 0 integer, 0 implied int., 3093 continuous) 29768 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 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.0009 inf inf 0 0 0 0 0.4s R 0 0 0 0.00% 1.435621297 1.74760461 17.85% 0 0 0 3000 0.9s C 0 0 0 0.00% 1.456543094 1.59507983 8.69% 1690 141 0 3478 2.0s 0 0 0 0.00% 1.46073846 1.59507983 8.42% 4980 249 0 5183 7.1s L 0 0 0 0.00% 1.46073846 1.50031353 2.64% 4980 249 0 5183 17.1s 8.5% inactive integer columns, restarting Model after restart has 5370 rows, 3836 cols (929 bin., 0 int., 0 impl., 2907 cont.), and 28766 nonzeros 0 0 0 0.00% 1.460740434 1.50031353 2.64% 134 0 0 19211 17.4s 0 0 0 0.00% 1.460740434 1.50031353 2.64% 134 41 0 20970 17.7s 1 0 1 100.00% 1.500167904 1.50031353 0.01% 1836 135 49 26033 23.9s 1 0 1 100.00% 1.500167904 1.50031353 0.01% 1836 135 49 26033 23.9s Solving report Status Optimal Primal bound 1.50031352982 Dual bound 1.50016790376 Gap 0.00971% (tolerance: 0.01%) P-D integral 1.62566926935 Solution status feasible 1.50031352982 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 23.91 (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 26033 (total) 3332 (strong br.) 3324 (separation) 14024 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 432 5 950.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model 1584 rows, 3216 cols, 4392 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.03 Presolving model 4218 rows, 4728 cols, 13893 nonzeros 0s 3566 rows, 2771 cols, 12567 nonzeros 0s 3208 rows, 2469 cols, 11510 nonzeros 0s Solving MIP model with: 3208 rows 2469 cols (360 binary, 0 integer, 6 implied int., 2103 continuous) 11510 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 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.0009 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 0.0009 136.4116433 100.00% 0 0 0 1054 0.2s 1 0 1 100.00% 136.4116433 136.4116433 0.00% 0 0 0 1054 0.2s Solving report Status Optimal Primal bound 136.411643313 Dual bound 136.411643313 Gap 0% (tolerance: 0.01%) P-D integral 9.36978833944e-05 Solution status feasible 136.411643313 (objective) 0 (bound viol.) 8.21565038223e-15 (int. viol.) 0 (row viol.) Timing 0.18 (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 1054 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 5040 5 7009 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [2e-01, 2e+02] Cost [5e-08, 1e+00] Bound [4e-01, 1e+06] RHS [7e-03, 5e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.05 Presolving model 15378 rows, 15240 cols, 53853 nonzeros 0s 11638 rows, 11707 cols, 44103 nonzeros 0s 6758 rows, 5366 cols, 31035 nonzeros 0s 5673 rows, 4137 cols, 29791 nonzeros 0s 5670 rows, 4137 cols, 29768 nonzeros 0s Solving MIP model with: 5670 rows 4137 cols (360 binary, 0 integer, 6 implied int., 3771 continuous) 29768 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 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.0009 inf inf 0 0 0 0 0.3s R 0 0 0 0.00% 1.435621297 2.001485033 28.27% 0 0 0 3000 0.8s C 0 0 0 0.00% 1.456274699 1.59507983 8.70% 1246 146 0 3533 1.7s L 0 0 0 0.00% 1.460970336 1.50031353 2.62% 2709 200 0 4883 7.6s 0 0 0 0.00% 1.460972136 1.50031353 2.62% 2711 143 0 24423 17.7s 1 0 0 100.00% 1.500227372 1.50031353 0.01% 2565 143 79 26856 18.8s Solving report Status Optimal Primal bound 1.50031352982 Dual bound 1.50022737249 Gap 0.00574% (tolerance: 0.01%) P-D integral 1.04079407139 Solution status feasible 1.50031352982 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 18.81 (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 26856 (total) 1832 (strong br.) 1903 (separation) 19520 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e-06, 1e+00] Bound [1e+00, 1e+06] RHS [3e-03, 4e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 4 from [lower, value, upper] = [ 0; 4; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 11 4 24.01 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e-06, 1e+00] Bound [1e+00, 1e+06] RHS [3e-03, 4e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 148 rows, 130 cols, 410 nonzeros 0s 49 rows, 73 cols, 195 nonzeros 0s 42 rows, 40 cols, 178 nonzeros 0s 40 rows, 38 cols, 172 nonzeros 0s Solving MIP model with: 40 rows 38 cols (10 binary, 0 integer, 0 implied int., 28 continuous) 172 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 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 0.2958207129 100.00% 0 0 0 0 0.0s R 0 0 0 0.00% 0.1533869228 0.2931109878 47.67% 0 0 0 21 0.0s S 0 0 0 0.00% 0.1533869228 0.2927046208 47.60% 11 1 0 21 0.0s S 0 0 0 0.00% 0.2117175275 0.2125861645 0.41% 40 5 0 35 0.0s L 0 0 0 0.00% 0.2121858156 0.2125223424 0.16% 40 5 2 37 0.0s 1 0 1 100.00% 0.2125223424 0.2125223424 0.00% 42 6 2 43 0.0s Solving report Status Optimal Primal bound 0.212522342447 Dual bound 0.212522342447 Gap 0% (tolerance: 0.01%) P-D integral 0.004349478137 Solution status feasible 0.212522342447 (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 43 (total) 0 (strong br.) 17 (separation) 1 (heuristics) Running HiGHS 1.9.0 (git hash: 66f735e60): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [5e-02, 2e+02] Cost [2e-06, 1e+00] Bound [1e+00, 1e+06] RHS [3e-03, 4e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 4 from [lower, value, upper] = [ 0; 4; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 82 4 80.1 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables Coefficient ranges: Matrix [5e-02, 2e+02] Cost [2e-06, 1e+00] Bound [1e+00, 1e+06] RHS [3e-03, 4e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 316 rows, 277 cols, 1028 nonzeros 0s 217 rows, 190 cols, 833 nonzeros 0s 184 rows, 159 cols, 764 nonzeros 0s 130 rows, 79 cols, 602 nonzeros 0s 130 rows, 79 cols, 602 nonzeros 0s Solving MIP model with: 130 rows 79 cols (10 binary, 0 integer, 0 implied int., 69 continuous) 602 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point 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 0.130823071 100.00% 0 0 0 0 0.0s S 0 0 0 0.00% 0.1186733998 0.1308194454 9.28% 0 0 0 51 0.0s R 0 0 0 0.00% 0.1300902786 0.1308176161 0.56% 0 0 0 53 0.0s 70.0% inactive integer columns, restarting Model after restart has 71 rows, 59 cols (1 bin., 0 int., 0 impl., 58 cont.), and 236 nonzeros 0 0 0 0.00% 0.1300902786 0.1308176161 0.56% 0 0 0 53 0.0s 1 0 1 100.00% 0.1308176161 0.1308176161 0.00% 0 0 0 56 0.0s Solving report Status Optimal Primal bound 0.130817616142 Dual bound 0.130817616142 Gap 0% (tolerance: 0.01%) P-D integral 0.00023034566184 Solution status feasible 0.130817616142 (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 56 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Test Summary: | Pass Total Time CbaOPF | 34 34 4m51.4s Testing CbaOPF tests passed Testing completed after 400.22s PkgEval succeeded after 631.82s