See the comments at the bottom of this code. import JuMP, Gurobi CR = JuMP.Model(() -> Gurobi.Optimizer()) JuMP.@variable(CR, x[1:3]) JuMP.set_lower_bound(x[1], exp(1)); JuMP.set_upper_bound(x[1], exp(2)) JuMP.set_lower_bound(x[3], 1e-6) JuMP.@objective(CR, Min, -x[1] * x[2] - log(x[3]) + x[2]^2/4)…

If you are solving an LP and stop with a time limit, it probably won’t have a feasible point to return. If you are solving a MIP, it depends whether Gurobi found a primal feasible point. It might find one in 1 second, or it might take 1000 years. You should not rely on the fact that Gurobi will have…

Gurobi12 reports obj_value < obj_bound in a Min-Program?

Specific Domains Optimization (Mathematical)

odow March 12, 2025, 9:03am 6

I can reproduce the CTRL+C thing. It may be a change in Gurobi 12 that we need to fix in Gurobi.jl. Open an issue

Topic		Replies	Views
Gurobi12 Reports unbounded to a nonconvex QP which is actually bounded Optimization (Mathematical) jump , gurobi	15	300	May 14, 2025
Sometimes no objective_bound info from an LP solve, by Gurobi Optimization (Mathematical) question , gurobi	13	194	January 29, 2026
About JuMP.is_solved_and_feasible Optimization (Mathematical) jump	27	549	April 6, 2025
Detecting problems with numerically challenging models Optimization (Mathematical) gurobi	4	310	September 2, 2024
Gurobi12 reports OPTIMAL to an NLP which is actually UNbounded Optimization (Mathematical) question , jump , gurobi	9	214	May 14, 2025

Gurobi12 reports obj_value < obj_bound in a Min-Program?

Related topics