Package evaluation of Alpine on Julia 1.13.0-DEV.791 (d5209bd37d*) started at 2025-07-04T13:33:49.086 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.57s ################################################################################ # Installation # Installing Alpine... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [07493b3f] + Alpine v0.5.7 Updating `~/.julia/environments/v1.13/Manifest.toml` [07493b3f] + Alpine v0.5.7 [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.0.3 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.17.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.0.1 [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 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.41.0 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [276daf66] + SpecialFunctions v2.5.1 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 Installation completed after 3.93s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 51.5s ################################################################################ # Testing # Testing Alpine Status `/tmp/jl_PzaAKn/Project.toml` [07493b3f] Alpine v0.5.7 [861a8166] Combinatorics v1.0.3 [87dc4568] HiGHS v1.18.1 [b6b21f68] Ipopt v1.10.6 [4076af6c] JuMP v1.26.0 [2ddba703] Juniper v0.9.3 [b8f27783] MathOptInterface v1.41.0 [cd433a01] Pavito v0.3.9 [10745b16] Statistics v1.11.1 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_PzaAKn/Manifest.toml` [07493b3f] Alpine v0.5.7 [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.3 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.17.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.0.1 [87dc4568] HiGHS v1.18.1 [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 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.41.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [cd433a01] Pavito v0.3.9 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [276daf66] SpecialFunctions v2.5.1 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [e33a78d0] Hwloc_jll v2.12.1+0 [9cc047cb] Ipopt_jll v300.1400.1701+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.0+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [319450e9] SPRAL_jll v2025.5.20+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.14.1+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.0+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Testing Running tests... Precompiling packages... 12733.7 ms ✓ Juniper 1 dependency successfully precompiled in 13 seconds. 52 already precompiled. PROBLEM STATISTICS Objective sense = Min # Variables = 6 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 8 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 6 # Bin-Int Variables = 0 # Constraints = 9 # NL Constraints = 8 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 8 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = All Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 39.71s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 59.49s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 0.62s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 3 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 2618.1981 | 62.858 | 0.08s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 0.63s | finish | 7446.9743 | 7049.2479 | 6424.1806 | 8.867 | 3.73s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 42 # Bin-Int Variables = 0 # Constraints = 45 # NL Constraints = 12 # Linear Constraints = 33 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 10 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 0 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = All Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 130.7025 Completed presolve in 0.22s *** Alpine ended with status LOCALLY_SOLVED *** PROBLEM STATISTICS Objective sense = Min # Variables = 42 # Bin-Int Variables = 0 # Constraints = 45 # NL Constraints = 12 # Linear Constraints = 33 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 10 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 0 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 130.7025 Completed presolve in 0.08s *** Alpine ended with status LOCALLY_SOLVED *** PROBLEM STATISTICS Objective sense = Min # Variables = 42 # Bin-Int Variables = 0 # Constraints = 45 # NL Constraints = 12 # Linear Constraints = 33 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 10 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 0 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 130.7025 Completed presolve in 0.08s *** Alpine ended with status LOCALLY_SOLVED *** PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 225 # NL Constraints = 24 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 26 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = All Partition scaling factor = 10 Bound-tightening presolve = false PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 225 # NL Constraints = 24 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 225 # NL Constraints = 24 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false Initial constraint-based bound evaluation exhausted... Warning: -/+Inf bounds detected on at least 40 variables. Initializing with values -/+1.0e6. This may affect global optimal values and run times. PROBLEM STATISTICS Objective sense = Min # Variables = 174 # Bin-Int Variables = 0 # Constraints = 152 # NL Constraints = 48 # Linear Constraints = 104 # Detected convex constraints = 0 # Detected nonlinear terms = 48 # Variables involved in nonlinear terms = 24 # Potential variables for partitioning = 12 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 227.981 Completed presolve in 0.42s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 227.981 | 227.981 | 108.1633 | 52.556 | 0.95s UPDATED DISC-VAR COUNT = 12 : [110, 111, 112, 113, 114, 115, 116, 117, 118, 122, 123, 124] | finish | 232.5739 | 227.981 | 125.8419 | 44.802 | 11.6s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 6 # Bin-Int Variables = 0 # Constraints = 9 # NL Constraints = 8 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 8 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 6 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 8 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 213 # NL Constraints = 12 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 3 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 1 # Variables involved in nonlinear terms = 3 # Potential variables for partitioning = 3 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 3 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 3 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 1 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 11 # NL Constraints = 5 # Linear Constraints = 6 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 9 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 6 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 15 # Variables involved in nonlinear terms = 12 # Potential variables for partitioning = 12 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 6 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 19 # Variables involved in nonlinear terms = 17 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 7 # NL Constraints = 7 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 11 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 9 # NL Constraints = 9 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 20 # Variables involved in nonlinear terms = 15 # Potential variables for partitioning = 15 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 CONVEX Objective: 1.0 * x[1] * x[1] + 1.0 * x[3] * x[3] CONVEX Constraint 1: 3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] <= 25.0 CONVEX Constraint 2: 3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] <= 25.0 CONVEX Constraint 4: 3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] <= 10.0 CONVEX Constraint 5: 3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] + 6.0 * x[3] * x[3] <= 10.0 CONVEX Constraint 8: (3.0 * x[1] ^ 3.0 + x[2] ^ 3.0 + 5.0 * x[3] ^ 3.0) - 200.0 <= 0.0 CONVEX Constraint 9: (1.0 * x[1] * x[1] * x[1] + 1.0 * x[2] * x[2] * x[2] + 1.0 * x[3] * x[3] * x[3] + 100.0 * x[4] * x[4] * x[4]) - 200.0 <= 0.0 CONVEX Constraint 10: (3.0 * x[1] * x[1] + 4.0 * x[2] * x[2]) - 25.0 <= 0.0 CONVEX Constraint 11: (3.0 * x[1] * x[1] + 4.0 * x[2] * x[2]) - 25.0 <= 0.0 CONVEX Constraint 12: ((3.0 * x[1] * x[1] + 4.0 * x[2] * x[2]) - 25.0) - 0.0 <= 0.0 CONVEX Constraint 13: (-3.0 * x[1] * x[1] - 4.0 * x[2] * x[2]) - -25.0 >= 0.0 CONVEX Constraint 14: (3.0 * x[1] * x[1] + 1.0 * x[2] * (5.0 * x[2])) - 25.0 <= 0.0 CONVEX Constraint 15: (3.0 * x[1] * x[1] + 5.0 * x[2] * x[2] + x[4] ^ 2.0) - 25.0 <= 0.0 CONVEX Constraint 16: (4.0 * x[1] ^ 2.0 + 5.0 * x[2] ^ 2.0) - 25.0 <= 0.0 CONVEX Constraint 19: (3.0 * x[1] * x[1] + 16.0 * x[2] ^ 2.0) - 40.0 <= 0.0 CONVEX Constraint 22: (3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] + 5.0 * x[3] * x[3] + 6.0 * x[4] * x[4]) - 15.0 <= 0.0 CONVEX Constraint 25: (x[1] ^ 2.0 + x[2] ^ 2.0 + x[3] ^ 2.0 + x[4] ^ 2.0 + x[5] ^ 2.0) - 99999.0 <= 0.0 CONVEX Constraint 26: (3.0 * x[1] ^ 4.0 + 4.0 * x[2] ^ 4.0) - 200.0 <= 0.0 CONVEX Constraint 27: ((3.0 * x[1] ^ 4.0 + 4.0 * x[2] * x[2] * x[2] * x[2]) - 200.0) - 0.0 <= 0.0 CONVEX Constraint 28: (3.0 * x[1] ^ 4.0 + 1.0 * x[2] * x[2] * (4.0 * x[2] ^ 2.0)) - 200.0 <= 0.0 PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 30 # NL Constraints = 30 # Linear Constraints = 0 # Detected convex constraints = 19 # Detected nonlinear terms = 10 # Variables involved in nonlinear terms = 3 # Potential variables for partitioning = 3 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 0 # NL Constraints = 0 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 8 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 3 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 9 # Variables involved in nonlinear terms = 9 # Potential variables for partitioning = 9 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 Warning: -/+Inf bounds detected on at least 6907 variables. Initializing with values -/+1.0e6. This may affect global optimal values and run times. Automatically turning OFF 'partition_scaling_factor_branch' due to the size of the problem PROBLEM STATISTICS Objective sense = Min # Variables = 6907 # Bin-Int Variables = 0 # Constraints = 0 # NL Constraints = 0 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 52 # Variables involved in nonlinear terms = 53 # Potential variables for partitioning = 27 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 8 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 80 # NL Constraints = 80 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 105 # Variables involved in nonlinear terms = 40 # Potential variables for partitioning = 11 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 5 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 0 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 1 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 0 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 1 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 0 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 10 # Bin-Int Variables = 5 # Constraints = 8 # NL Constraints = 8 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 10 # Bin-Int Variables = 5 # Constraints = 3 # NL Constraints = 3 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 Expression Parsing || bmpl && binlin && binprod with linear lifting and coefficients: Test Failed at /home/pkgeval/.julia/packages/Alpine/BQG51/test/test_expression.jl:3524 Expression: (alpine.linear_terms[lk3])[:lifted_constr_ref] == :(x[15] == 2 * x[6] + x[7]) Evaluated: (x[15] == 2.0 * x[6] + x[7]) == (x[15] == 2 * x[6] + x[7]) Stacktrace: [1] top-level scope @ ~/.julia/packages/Alpine/BQG51/test/test_expression.jl:3395 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1855 [inlined] [3] macro expansion @ ~/.julia/packages/Alpine/BQG51/test/test_expression.jl:3478 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1855 [inlined] [5] macro expansion @ ~/.julia/packages/Alpine/BQG51/test/test_expression.jl:3524 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:741 [inlined] PROBLEM STATISTICS Objective sense = Max # Variables = 2 # Bin-Int Variables = 1 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 0 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Starting bound-tightening Actual iterations (OBBT): 1 Post-presolve optimality gap: 0.0% Completed presolve in 43.54s *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 1 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 2 # Linear Constraints = 0 # Detected convex constraints = 1 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 1 # Potential variables for partitioning = 1 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PRESOLVE Doing local search Local solver returns a feasible point with value 1.0 Starting bound-tightening Actual iterations (OBBT): 5 Post-presolve optimality gap: 382.887% Completed presolve in 34.94s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 1.0 | 1.0 | -2.8288 | 382.882 | 35.06s | 2 | - | 1.0 | -2.8285 | 382.85 | 35.17s | finish | -2.8284 | -2.8284 | -2.8285 | 0.003 | 35.17s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = All Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 4179.1645 | 40.715 | 0.36s | finish | 7446.9743 | 7049.2479 | 5897.2165 | 16.343 | 1.74s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 3 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 2717.1317 | 61.455 | 0.04s | finish | - | 7049.2479 | 3106.3098 | 55.934 | 0.46s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 2 PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Starting bound-tightening + VAR 1 LB contracted 100.0=>100.0 + VAR 1 UB contracted 10000.0=>4762.2 + VAR 2 LB contracted 1000.0=>1000.0 + VAR 2 UB contracted 10000.0=>5944.1 + VAR 3 LB contracted 1000.0=>1000.0 + VAR 3 UB contracted 10000.0=>5949.3 + VAR 4 LB contracted 10.0=>10.0 + VAR 4 UB contracted 390.0=>334.20000000000005 + VAR 5 LB contracted 10.0=>94.5 + VAR 5 UB contracted 780.0=>572.8000000000001 + VAR 6 LB contracted 10.0=>10.0 + VAR 6 UB contracted 390.0=>390.0 + VAR 7 LB contracted 10.0=>16.900000000000002 + VAR 7 UB contracted 780.0=>626.9000000000001 + VAR 8 LB contracted 10.0=>91.9 + VAR 8 UB contracted 880.0=>660.7 + VAR 1 LB contracted 100.0=>100.0 + VAR 1 UB contracted 4762.2=>4573.6 + VAR 2 LB contracted 1000.0=>1000.0 + VAR 2 UB contracted 5944.1=>5547.8 + VAR 3 LB contracted 1000.0=>1000.0 + VAR 3 UB contracted 5949.3=>5913.3 + VAR 4 LB contracted 10.0=>10.0 + VAR 4 UB contracted 334.20000000000005=>332.40000000000003 + VAR 5 LB contracted 94.5=>150.20000000000002 + VAR 5 UB contracted 572.8000000000001=>551.0 + VAR 6 LB contracted 10.0=>10.0 + VAR 6 UB contracted 390.0=>390.0 + VAR 7 LB contracted 16.900000000000002=>35.4 + VAR 7 UB contracted 626.9000000000001=>571.1 + VAR 8 LB contracted 91.9=>168.0 + VAR 8 UB contracted 660.7=>638.7 Variables whose bounds were tightened: Actual iterations (OBBT): 2 VAR 3: 45.0% contraction |1000.0 --> | 1000.0 - 5913.3 | <-- 10000.0 | VAR 2: 49.0% contraction |1000.0 --> | 1000.0 - 5547.8 | <-- 10000.0 | VAR 1: 55.00000000000001% contraction |100.0 --> | 100.0 - 4573.6 | <-- 10000.0 | VAR 4: 15.0% contraction |10.0 --> | 10.0 - 332.4 | <-- 390.0 | VAR 5: 48.0% contraction |10.0 --> | 150.2 - 551.0 | <-- 780.0 | VAR 8: 46.0% contraction |10.0 --> | 168.0 - 638.7 | <-- 880.0 | VAR 7: 30.0% contraction |10.0 --> | 35.4 - 571.1 | <-- 780.0 | Post-presolve optimality gap: 57.188% Completed presolve in 1.05s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 4993.3484 | 29.165 | 1.64s | finish | 9080.2482 | 7049.2479 | 6310.9733 | 10.473 | 3.32s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 2 PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Starting bound-tightening + VAR 1 LB contracted 100.0=>100.0 + VAR 1 UB contracted 10000.0=>3532.6000000000004 + VAR 2 LB contracted 1000.0=>1000.0 + VAR 2 UB contracted 10000.0=>5749.5 + VAR 3 LB contracted 1000.0=>2516.6000000000004 + VAR 3 UB contracted 10000.0=>5884.0 + VAR 4 LB contracted 10.0=>10.0 + VAR 4 UB contracted 390.0=>264.1 + VAR 5 LB contracted 10.0=>250.10000000000002 + VAR 5 UB contracted 780.0=>378.90000000000003 + VAR 6 LB contracted 10.0=>10.0 + VAR 6 UB contracted 390.0=>390.0 + VAR 7 LB contracted 10.0=>77.30000000000001 + VAR 7 UB contracted 780.0=>352.0 + VAR 8 LB contracted 10.0=>350.1 + VAR 8 UB contracted 880.0=>470.40000000000003 + VAR 1 LB contracted 100.0=>100.0 + VAR 1 UB contracted 3532.6000000000004=>2268.7000000000003 + VAR 2 LB contracted 1000.0=>1000.0 + VAR 2 UB contracted 5749.5=>3851.7000000000003 + VAR 3 LB contracted 2516.6000000000004=>3177.1000000000004 + VAR 3 UB contracted 5884.0=>5766.700000000001 + VAR 4 LB contracted 10.0=>57.5 + VAR 4 UB contracted 264.1=>241.60000000000002 + VAR 5 LB contracted 250.10000000000002=>270.8 + VAR 5 UB contracted 378.90000000000003=>350.20000000000005 + VAR 6 LB contracted 10.0=>10.0 + VAR 6 UB contracted 390.0=>328.5 + VAR 7 LB contracted 77.30000000000001=>151.1 + VAR 7 UB contracted 352.0=>317.70000000000005 + VAR 8 LB contracted 350.1=>371.20000000000005 + VAR 8 UB contracted 470.40000000000003=>446.0 Variables whose bounds were tightened: Actual iterations (OBBT): 2 VAR 3: 71.0% contraction |1000.0 --> | 3177.1 - 5766.7 | <-- 10000.0 | VAR 2: 68.0% contraction |1000.0 --> | 1000.0 - 3851.7 | <-- 10000.0 | VAR 1: 78.0% contraction |100.0 --> | 100.0 - 2268.7 | <-- 10000.0 | VAR 4: 52.0% contraction |10.0 --> | 57.5 - 241.6 | <-- 390.0 | VAR 5: 90.0% contraction |10.0 --> | 270.8 - 350.2 | <-- 780.0 | VAR 6: 16.0% contraction |10.0 --> | 10.0 - 328.5 | <-- 390.0 | VAR 8: 91.0% contraction |10.0 --> | 371.2 - 446.0 | <-- 880.0 | VAR 7: 78.0% contraction |10.0 --> | 151.1 - 317.7 | <-- 780.0 | Post-presolve optimality gap: 7.222% Completed presolve in 10.17s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 6343.871 | 10.006 | 10.56s | finish | 7200.8409 | 7049.2479 | 6877.9116 | 2.431 | 12.35s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 12 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 58.3837 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 58.3837 | 58.3837 | 57.7725 | 1.047 | 0.53s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 14 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 4249.2127 | 39.721 | 0.54s | 2 | 7226.7536 | 7049.2479 | 5641.8462 | 19.965 | 2.88s | 3 | - | 7049.2479 | 6540.1946 | 7.221 | 6.42s | finish | 7254.9412 | 7049.2479 | 6839.4877 | 2.976 | 15.3s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 6 Relative global optimality gap = 0.01% Partition scaling factor = 8 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1.3846 | 30.769 | 0.1s | 2 | 1.4142 | 1.4142 | 1.3846 | 2.093 | 0.3s | 3 | 1.4142 | 1.4142 | 1.4114 | 0.202 | 0.45s | 4 | 1.4142 | 1.4142 | 1.4114 | 0.202 | 0.75s | 5 | 1.4142 | 1.4142 | 1.414 | 0.014 | 1.08s | finish | 1.4142 | 1.4142 | 1.414 | 0.014 | 1.21s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 4179.1645 | 40.715 | 0.65s | 2 | 7446.9743 | 7049.2479 | 5897.2165 | 16.343 | 1.74s | finish | - | 7049.2479 | 6654.6983 | 5.597 | 8.1s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1106.7368 | 99.819 | 5.21s | 2 | 2.0 | 2.0 | 79.4099 | 97.481 | 5.33s | 3 | 1.9102 | 2.0 | 17.2206 | 88.386 | 6.13s | finish | 1.6253 | 2.0 | 5.1847 | 61.425 | 10.25s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 11 # Potential variables for partitioning = 11 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 2600.6779 | 99.923 | 0.03s | 2 | 2.0 | 2.0 | 231.6096 | 99.136 | 0.12s | 3 | 1.8932 | 2.0 | 31.5066 | 93.652 | 0.36s | finish | 1.0279 | 2.0 | 12.0495 | 83.402 | 1.4s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 9 # Potential variables for partitioning = 9 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1716.8718 | 99.884 | 1.25s | 2 | 2.0 | 2.0 | 116.45 | 98.283 | 1.54s | 3 | 1.3036 | 2.0 | 20.1272 | 90.063 | 1.82s | finish | 1.6358 | 2.0 | 7.2445 | 72.393 | 4.18s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 9 # Potential variables for partitioning = 9 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1145.3656 | 99.825 | 0.02s | 2 | 2.0 | 2.0 | 146.2847 | 98.633 | 0.12s | 3 | 1.6581 | 2.0 | 20.6737 | 90.326 | 0.95s | finish | 1.5935 | 2.0 | 8.509 | 76.496 | 3.15s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 11 # Potential variables for partitioning = 11 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 2173.2429 | 99.908 | 0.08s | 2 | 1.5355 | 2.0 | 151.2878 | 98.678 | 0.15s | 3 | 1.2333 | 2.0 | 29.2411 | 93.16 | 0.55s | finish | 1.761 | 2.0 | 8.1611 | 75.494 | 2.82s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 1 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 5 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 0.9291 Completed presolve in 0.0s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 0.9291 | 0.9291 | 0.9291 | 0.0 | 0.03s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 71.906 | 97.219 | 0.02s | 2 | 2.0 | 2.0 | 15.1302 | 86.781 | 0.1s | 3 | 2.0 | 2.0 | 5.1976 | 61.521 | 0.31s | finish | 1.8729 | 2.0 | 2.8976 | 30.977 | 0.88s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 110.4708 | 98.19 | 0.02s | 2 | 2.0 | 2.0 | 23.3338 | 91.429 | 0.13s | 3 | 2.0 | 2.0 | 7.9925 | 74.976 | 0.38s | finish | 2.0 | 2.0 | 3.8551 | 48.121 | 1.2s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 75.1519 | 97.339 | 0.02s | 2 | 2.0 | 2.0 | 20.6138 | 90.298 | 0.1s | 3 | 1.9823 | 2.0 | 5.4363 | 63.21 | 0.27s | finish | 1.5645 | 2.0 | 3.5967 | 44.394 | 0.76s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 9 # Bin-Int Variables = 0 # Constraints = 3 # NL Constraints = 0 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 9 # Potential variables for partitioning = 9 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 3.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 3.0 | 3.0 | 493.9224 | 99.393 | 0.02s | 2 | 3.0 | 3.0 | 52.1469 | 94.247 | 0.05s | finish | 3.0 | 3.0 | 12.0546 | 75.113 | 0.17s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 3004.247 | 57.382 | 0.2s | 2 | - | 7049.2479 | 4896.6075 | 30.537 | 1.18s | finish | 7049.2479 | 7049.2479 | 5871.5307 | 16.707 | 3.95s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 18 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 4564.5646 | 35.247 | 0.39s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 BRANCH RATIO = 8, METRIC = 3819.013741219198 || TIME = 0.3880960941314697 BRANCH RATIO = 10, METRIC = 4179.164520879307 || TIME = 0.26918888092041016 BRANCH RATIO = 12, METRIC = 4624.802867549727 || TIME = 0.23938393592834473 BRANCH RATIO = 14, METRIC = 4892.857770310047 || TIME = 0.22986698150634766 BRANCH RATIO = 16, METRIC = 4703.605725826052 || TIME = 0.30936193466186523 BRANCH RATIO = 18, METRIC = 4564.564609540183 || TIME = 0.373337984085083 BRANCH RATIO = 20, METRIC = 4458.109915572033 || TIME = 0.3296620845794678 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 14 Completed presolve in 2.15s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 4892.8578 | 30.59 | 2.69s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 42 # Bin-Int Variables = 0 # Constraints = 45 # NL Constraints = 12 # Linear Constraints = 33 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 10 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 130.7025 BRANCH RATIO = 8, METRIC = 117.91941897074435 || TIME = 0.13481712341308594 BRANCH RATIO = 10, METRIC = 117.30720065950943 || TIME = 0.1850738525390625 BRANCH RATIO = 12, METRIC = 117.4761639111994 || TIME = 0.17412805557250977 BRANCH RATIO = 14, METRIC = 117.49730354290253 || TIME = 0.17503595352172852 BRANCH RATIO = 16, METRIC = 117.51714020171165 || TIME = 0.16936397552490234 BRANCH RATIO = 18, METRIC = 117.54580809946215 || TIME = 0.24787402153015137 BRANCH RATIO = 20, METRIC = 117.57374191761735 || TIME = 0.20973610877990723 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 8 Completed presolve in 1.35s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 130.7025 | 130.7025 | 122.4188 | 6.338 | 1.7s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 3 # NL Constraints = 0 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 3.0 BRANCH RATIO = 8, METRIC = 4.02515624999994 || TIME = 0.5712080001831055 BRANCH RATIO = 10, METRIC = 3.656099999999997 || TIME = 2.29911208152771 BRANCH RATIO = 12, METRIC = 3.4556250000000723 || TIME = 1.9133999347686768 BRANCH RATIO = 14, METRIC = 3.334744897959184 || TIME = 2.5646800994873047 BRANCH RATIO = 16, METRIC = 3.256289062500011 || TIME = 2.913398027420044 BRANCH RATIO = 18, METRIC = 3.299750000001146 || TIME = 2.0345990657806396 BRANCH RATIO = 20, METRIC = 3.456980192308049 || TIME = 2.3025288581848145 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 16 Completed presolve in 14.61s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 3.0 | 3.0 | 3.1057 | 3.405 | 23.38s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 3 # NL Constraints = 0 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 3.0 BRANCH RATIO = 8, METRIC = 42.616654497606255 || TIME = 0.09845399856567383 BRANCH RATIO = 10, METRIC = 36.49851361082922 || TIME = 0.09920191764831543 BRANCH RATIO = 12, METRIC = 33.547797049169354 || TIME = 0.15150117874145508 BRANCH RATIO = 14, METRIC = 31.073171449650456 || TIME = 0.1502668857574463 BRANCH RATIO = 16, METRIC = 28.68617139611689 || TIME = 0.24152302742004395 BRANCH RATIO = 18, METRIC = 26.55080670073408 || TIME = 0.09360098838806152 BRANCH RATIO = 20, METRIC = 24.569442309794443 || TIME = 0.12382102012634277 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 20 Completed presolve in 0.97s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 3.0 | 3.0 | 3.326 | 9.802 | 6.27s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 BRANCH RATIO = 8, METRIC = 4.512012500000004 || TIME = 2.3054311275482178 BRANCH RATIO = 10, METRIC = 3.588792320000001 || TIME = 2.8223838806152344 BRANCH RATIO = 12, METRIC = 3.096199999999999 || TIME = 1.9485399723052979 BRANCH RATIO = 14, METRIC = 3.172791836735395 || TIME = 2.8966708183288574 BRANCH RATIO = 16, METRIC = 3.547533928571742 || TIME = 3.0718939304351807 BRANCH RATIO = 18, METRIC = 3.8557000000147124 || TIME = 3.2276690006256104 BRANCH RATIO = 20, METRIC = 4.11284000000008 || TIME = 3.1251978874206543 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 12 Completed presolve in 19.41s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 2.0 | 2.0 | 2.7103 | 26.207 | 28.16s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 BRANCH RATIO = 8, METRIC = 256.1741472550344 || TIME = 0.10747694969177246 BRANCH RATIO = 10, METRIC = 209.94716570042846 || TIME = 0.14430999755859375 BRANCH RATIO = 12, METRIC = 169.70604858406278 || TIME = 0.1007080078125 BRANCH RATIO = 14, METRIC = 138.9946735212247 || TIME = 0.18814706802368164 BRANCH RATIO = 16, METRIC = 115.97342016451196 || TIME = 0.3366270065307617 BRANCH RATIO = 18, METRIC = 98.52620058308176 || TIME = 0.13271307945251465 BRANCH RATIO = 20, METRIC = 84.53481726488263 || TIME = 0.331967830657959 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 20 Completed presolve in 1.35s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 2.0 | 2.0 | 4.9851 | 59.88 | 7.09s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 11 # Potential variables for partitioning = 11 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 BRANCH RATIO = 8, METRIC = 6.487399999999996 || TIME = 0.937938928604126 BRANCH RATIO = 10, METRIC = 5.3250176 || TIME = 0.8507039546966553 BRANCH RATIO = 12, METRIC = 6.047969230769259 || TIME = 0.9906570911407471 BRANCH RATIO = 14, METRIC = 6.411638782045072 || TIME = 1.5429749488830566 BRANCH RATIO = 16, METRIC = 5.7133799952069975 || TIME = 2.6568260192871094 BRANCH RATIO = 18, METRIC = 5.197792466318397 || TIME = 3.368144989013672 BRANCH RATIO = 20, METRIC = 4.803130895055454 || TIME = 2.930678129196167 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 20 Completed presolve in 13.29s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 2.0 | 2.0 | 3.6234 | 44.803 | 21.8s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 10 # Bin-Int Variables = 5 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 0.3 Completed presolve in 4.72s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 0.3 | 0.3 | 0.3 | 0.0 | 5.35s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Max # Variables = 10 # Bin-Int Variables = 5 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 10 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 4 Using convhull_ebd formulation Encoding method = default Independent branching scheme = false Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 58.3837 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 58.3837 | 58.3837 | 52.9702 | 9.272 | 3.44s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 8 Using convhull_ebd formulation Encoding method = default Independent branching scheme = true Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 58.3837 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 58.3837 | 58.3837 | 57.012 | 2.349 | 0.35s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 10 Using convhull_ebd formulation Encoding method = default Independent branching scheme = true Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 0.59s | 2 | 7446.9743 | 7049.2479 | 6424.1806 | 8.867 | 2.27s | finish | 7141.5401 | 7049.2479 | 6893.2067 | 2.214 | 6.71s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 6 Relative global optimality gap = 0.01% Partition scaling factor = 8 Using convhull_ebd formulation Encoding method = default Independent branching scheme = true Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1.3846 | 30.769 | 0.15s | 2 | 1.4142 | 1.4142 | 1.3846 | 2.093 | 0.29s | 3 | 1.4142 | 1.4142 | 1.3846 | 2.093 | 0.41s | 4 | 1.4142 | 1.4142 | 1.4114 | 0.202 | 0.55s | 5 | 1.4142 | 1.4142 | 1.414 | 0.014 | 0.72s | finish | 1.4142 | 1.4142 | 1.4141 | 0.01 | 0.94s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 10 Using convhull_ebd formulation Encoding method = default Independent branching scheme = false Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 2.92s | 2 | 7446.9743 | 7049.2479 | 6424.1806 | 8.867 | 7.97s | finish | 7141.5401 | 7049.2479 | 6893.2067 | 2.214 | 14.56s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Warning: -/+Inf bounds detected on at least 21 variables. Initializing with values -/+1.0e6. This may affect global optimal values and run times. PROBLEM STATISTICS Objective sense = Min # Variables = 76 # Bin-Int Variables = 0 # Constraints = 66 # NL Constraints = 18 # Linear Constraints = 48 # Detected convex constraints = 0 # Detected nonlinear terms = 18 # Variables involved in nonlinear terms = 12 # Potential variables for partitioning = 12 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search ┌ Warning: Warning: Presolve ends with local solver yielding OTHER_ERROR. └ @ Alpine ~/.julia/packages/Alpine/BQG51/src/main_algorithm.jl:259 Completed presolve in 0.2s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | - | Inf | 69.2386 | LARGE | 0.22s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 225 # NL Constraints = 24 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 3 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search ┌ Warning: Infeasible NLP problem terminated with primal status: NEARLY_FEASIBLE_POINT └ @ Pavito ~/.julia/packages/Pavito/IfONk/src/optimize.jl:702 ┌ Warning: Warning: Presolve ends with local solver yielding OTHER_ERROR. └ @ Alpine ~/.julia/packages/Alpine/BQG51/src/main_algorithm.jl:259 Completed presolve in 1.23s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | - | -Inf | 14.0064 | LARGE | 2.57s | 2 | - | -Inf | 13.9694 | LARGE | 4.38s | finish | - | -Inf | 13.9694 | LARGE | 6.78s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** CONVEX Objective: 1.0 * x[1] * x[1] + 1.0 * x[3] * x[3] CONVEX Constraint 1: (3.0 * x[1] * x[1] + 4.0 * x[2] * x[2]) - 25.0 <= 0.0 CONVEX Constraint 2: (3.0 * (1.0 * x[1] * x[1]) + 4.0 * x[2] ^ 2.0) - 10.0 <= 0.0 CONVEX Constraint 3: (3.0 * x[1] ^ 2.0 + 4.0 * x[2] ^ 2.0 + 6.0 * x[3] ^ 2.0) - 10.0 <= 0.0 CONVEX Constraint 5: (-3.0 * x[1] * x[1] - 4.0 * x[2] * x[2]) - -25.0 >= 0.0 PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 4 # Detected nonlinear terms = 1 # Variables involved in nonlinear terms = 1 # Potential variables for partitioning = 1 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 3.3333 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 3.3333 | 3.3333 | 3.3333 | 0.0 | 0.26s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 6561.7841 | 6.915 | 3.05s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 13 # Bin-Int Variables = 5 # Constraints = 9 # NL Constraints = 9 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 20 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 3651.0204 Completed presolve in 0.05s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 3651.0204 | 3651.0204 | 3495.9592 | 4.247 | 0.56s | 2 | - | 3651.0204 | 3499.7471 | 4.143 | 0.94s | 3 | 3651.0204 | 3651.0204 | 3649.8107 | 0.033 | 1.72s | finish | 3651.0204 | 3651.0204 | 3650.7864 | 0.006 | 3.37s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 3 # NL Constraints = 1 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 2 PRESOLVE Doing local search Local solver returns a feasible point with value -18.0 Starting bound-tightening Actual iterations (OBBT): 1 Post-presolve optimality gap: 0.009% Completed presolve in 0.41s *** Alpine ended with status OPTIMAL *** Warning: -/+Inf bounds detected on at least 1 variable. Initializing with values -/+1.0e6. This may affect global optimal values and run times. PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value -0.5294 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | -0.5294 | -0.5294 | -0.7003 | 32.278 | 0.05s | finish | -0.407 | -0.5294 | -0.5294 | 0.0 | 0.44s ==================================================================================================== *** Alpine ended with status OPTIMAL *** Warning: -/+Inf bounds detected on at least 1 variable. Initializing with values -/+1.0e6. This may affect global optimal values and run times. PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value -0.5294 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | -0.5294 | -0.5294 | -0.5294 | 0.0 | 2.41s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 0.55s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PRESOLVE Doing local search Using warm starting point as a local incumbent solution with value 7049.2479 Starting bound-tightening Actual iterations (OBBT): 23 Post-presolve optimality gap: 54.262% Completed presolve in 9.54s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 4810.2129 | 31.763 | 10.05s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 17 # Bin-Int Variables = 16 # Constraints = 8 # NL Constraints = 8 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 10 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 Local solver returns a feasible point with value 13.0 Completed presolve in 13.9s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 13.0 | 13.0 | 13.0 | 0.0 | 13.93s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 17 # Bin-Int Variables = 16 # Constraints = 8 # NL Constraints = 8 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 10 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PRESOLVE Doing local search ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 Local solver returns a feasible point with value 13.0 Starting bound-tightening Actual iterations (OBBT): 1 Post-presolve optimality gap: 0.0% Completed presolve in 2.8s *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 6 # Bin-Int Variables = 5 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 0 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PRESOLVE Doing local search Local solver returns a feasible point with value -10.0 Starting bound-tightening Actual iterations (OBBT): 1 Post-presolve optimality gap: 0.0% Completed presolve in 0.25s *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 3 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 1 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value -190.0 Completed presolve in 0.03s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | -190.0 | -190.0 | -2057.2519 | 982.764 | 0.3s | 2 | -1004.7309 | -1004.7309 | -1121.8764 | 11.659 | 1.38s | 3 | - | -1004.7309 | -1116.6402 | 11.138 | 2.53s | 4 | -1004.7309 | -1004.7309 | -1025.0492 | 2.022 | 4.64s | 5 | -1004.7309 | -1004.7309 | -1006.7934 | 0.205 | 6.86s ┌ Warning: mixed-integer cycling detected, terminating Pavito └ @ Pavito ~/.julia/packages/Pavito/IfONk/src/optimize.jl:488 | 6 | -1004.7309 | -1004.7309 | -1004.8694 | 0.014 | 12.12s ┌ Warning: mixed-integer cycling detected, terminating Pavito └ @ Pavito ~/.julia/packages/Pavito/IfONk/src/optimize.jl:488 | finish | -1004.7309 | -1004.7309 | -1004.779 | 0.005 | 19.0s ==================================================================================================== *** Alpine ended with status OPTIMAL *** x[1] = -10.0 x[2] = 15.25434 x[3] = -3.20347 PROBLEM STATISTICS Objective sense = Min # Variables = 3 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 1 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.7 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value -190.0 Completed presolve in 0.03s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | -190.0 | -190.0 | -2057.2519 | 982.764 | 0.29s | 2 | -1004.7309 | -1004.7309 | -1121.8764 | 11.659 | 2.55s | 3 | - | -1004.7309 | -1010.6155 | 0.586 | 9.04s | 4 | -1004.7309 | -1004.7309 | -1005.0478 | 0.032 | 23.99s | finish | -1004.7309 | -1004.7309 | -1004.7605 | 0.003 | 47.4s ==================================================================================================== *** Alpine ended with status OPTIMAL *** Test Summary: | Pass Fail Total Time Alpine tests | 2456 1 2457 12m30.4s Optimizer loading tests | 2 2 1m21.5s Partitioning variable selection tests :: nlp3 | 20 20 1m49.9s Partitioning variable selection tests :: castro2m2 | 12 12 6.5s Partitioning variable selection tests :: blend029 | 12 12 25.1s Partitioning variable selection tests :: castro6m2 | 7 7 35.7s Hessians disabled with user-defined multivariate functions | 1 1 1.4s Expression Parsing || bilinear || Affine || exprs.jl | 72 72 0.3s Expression Parsing || bilinear || Affine || nlp1.jl | 8 8 2.5s Expression Parsing || bilinear || Affine || nlp3.jl | 48 48 0.4s Expression Parsing || bilinear || Simple || bi1.jl | 7 7 0.0s Expression Parsing || bilinear || Complex || blend029.jl | 86 86 12.9s Expression Parsing || multilinear || Simple || multi.jl | 197 197 1.9s Expression Parsing || bilinear || Complex-div || div.jl | 65 65 1.0s Expression Parsing || part1 | 23 23 0.1s Expression Parsing || part2 | 36 36 0.1s Expression Parsing || part3 | 44 44 0.1s Expression Parsing || part7 | 29 29 0.1s Expression Parsing || part8 | 29 29 0.1s Expression Parsing || Convex | 141 141 10.7s Expression Prasing || Linear Lifting | 638 638 6.9s Expression Parsing || Basic Multiplication Operators (Machine Generated for diffs) | 495 495 5.6s Expression Parsing || corner cases | 25 25 0.5s Expression Parsing || Discrete Multilinear | 117 1 118 9.5s Expression Parsing || bmpl && binlin && binprod | 38 38 1.4s Expression Parsing || bmpl && binlin && binprod with linear lifting and coefficients | 79 1 80 8.0s Expr dereferencing for @NLexpression | 3 3 44.0s @NLexpression from quadratic @expression (Issue #221) | 17 17 36.2s Validation Test || AMP-TMC || basic solve || examples/nlp3.jl (2 iterations) | 3 3 2.1s Validation Test || AMP-TMC || minimum-vertex solving || examples/nlp3.jl (3 iterations) | 3 3 0.5s Validation Test || BT-AMP-TMC || basic solve || examples/nlp3.jl | 5 5 6.9s Validation Test || PBT-AMP-TMC || basic solve || examples/nlp3.jl | 2 2 12.5s Validation Test || AMP-CONV || basic solve || examples/nlp1.jl | 3 3 0.9s Validation Test || AMP-CONV || basic solve || examples/nlp3.jl | 3 3 15.4s Validation Test || AMP || basic solve || examples/circle.jl | 1 1 1.5s Validation Test || AMP-CONV-FACET || basic solve || examples/nlp3.jl | 3 3 8.3s Validation Test || AMP || multi4N || N = 2 || exprmode=1:11 | 10 10 23.4s Validation Test || AMP || multi2 || exprmode=1:11 | 5 5 0.4s Validation Test || AMP || multi3N || N = 2 || exprmode=1:11 | 9 9 3.4s Validation Test || AMP || multiKND || K = 3, N = 3, D = 0 | 3 3 0.6s Validation Test || AMP-CONV-FACET || basic solve || examples/nlp3.jl | 4 4 4.0s Validation Test || AMP || PARTITION-SCALING-FACTOR || examples/nlp3.jl | 2 2 0.4s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/nlp3.jl | 2 2 2.7s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/castro2m2.jl | 2 2 1.7s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi3N.jl exprmode=2 | 2 2 23.4s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi3N.jl exprmode=2 | 2 2 6.3s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi4N.jl exprmode=1 | 2 2 28.2s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi4N.jl exprmode=2 | 2 2 7.1s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi4N.jl exprmode=2 | 2 2 21.8s Operator :: bmpl && binlin && binprod solve test I | 11 11 6.0s Operator :: bmpl && binlin && binprod solve test II | 20 20 0.5s Embedding Test || AMP-CONV || basic solve || examples/nlp1.jl | 4 4 3.6s Embedding IBS Test || AMP-CONV || basic solve || examples/nlp1.jl | 4 4 0.5s Embedding IBS Test || AMP-CONV || basic solve || examples/nlp3.jl | 4 4 6.8s Embedding IBS Test || AMP || special problem || ... | 1 1 1.0s Embedding LINK Test || AMP-CONV || basic solve || examples/nlp3.jl | 3 3 14.6s Algorithm Logic Test || castro4m2 || 1 iteration || Error case | 1 1 6.7s Algorithm Logic Test || blend029_gl || 3 iterations || Infeasible Case | 3 3 7.0s Convex Model Solve | 1 1 0.6s Uniform partitioning | 1 1 3.2s Algorithm Test with binprod terms | 127 127 4.3s TESTS for closing the optimality gap in OBBT | 4 4 1.5s Linking constraints for multilinear terms | 14 14 3.6s Warm start value used as the incumbent solution | 8 8 10.7s Test binary multilinear product linearization | 6 6 26.5s Test integer variable support via IntegerToZeroOneBridge | 4 4 10.8s Test integer variable support 0 | 1 1 0.4s Test integer variable support 1 | 1 1 0.0s Test integer variable support 2 | 1 1 0.1s Utility Function Tests: Solver identifier fetch | 3 3 0.1s Solver Funtion Tests :: Embedding | 26 26 1.0s Utility Function Tests: check_solution_history test | 4 4 1m07.1s RNG of the outermost testset: Random.Xoshiro(0xf174c5061d11624b, 0x11c06251e29a3c82, 0xc8d49f69d512f922, 0x89d2b3391d74450f, 0xd79fef9cbc6cd8e4) ERROR: LoadError: Some tests did not pass: 2456 passed, 1 failed, 0 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Alpine/BQG51/test/runtests.jl:55 Testing failed after 814.77s ERROR: LoadError: Package Alpine errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2423 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2278 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:500 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:151 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:309 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:324 [12] _start() @ Base ./client.jl:557 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 966.83s: package has test failures