Carleton Coffrin

Yes, one correct implementation is to add the constraint during the search, once the binary variable becomes true. However, this is not really in the sprit of "bound" in branch-and-bound...

I think there are two keys points, 1. 60s is a pretty aggressive limit, for a large problem 2. Juniper probably is not entering search, which prevents the time limit...

Until JuMP v0.19, we should not try to have Juniper set the NLP solver runtime limit. The parameters differ by solver, so the user should specify this.

Great suggestion, would love to get it added at some point.

@Wikunia @odow this looks like a reasonable extension to me. What do you think?

Possibly the [MOI documentation](https://jump.dev/MathOptInterface.jl/stable/reference/models/#MathOptInterface.TerminationStatusCode) makes `SLOW_PROGRESS` sound more problematic that it really is?

A nice improvement for such minor updates.

@odow good point! I had not noticed the JuMP change that is required.

Still there are some good uses cases of this. Like multi-start inside of MINLP algorithms.

Thanks @blegat, at least at a high level this is sounding reasonable to me. Is this required to break the NLP block into separate MOI constraints or is there an...