LukasBarner

I edited a bit of the code to make it more concise and a little more performant. For practical usage, it is important to set the right solver attributes before...

Hey @joaquimg, I have now also implemented a default solution strategy without iteratively using copy_to (this seems to be considerably better from a performance point of view). I have tested...

Think this should be good to go for now. @joaquimg, could you give some feedback?

Now includes tests and a mutable log as well. Note that I had to update Ipopt compat (because it did not have methods to alter the rhs prior to https://github.com/jump-dev/Ipopt.jl/pull/336).

can you check if this is better?

I can also reproduce this behavior with Gurobi and SOS1Mode(). See the code below. Indeed assertion fails for the lower level maximization problem, but works for a minimization of the...

Managed to take a look at this now. For both Problems, the KKTs stated in BilevelJuMP are actually different. I think this is related to a bug in Dualization.jl: https://github.com/jump-dev/Dualization.jl/issues/142

What needs to be done on this end? I think this should greatly decrease solution times for problems with many variable bounds... For quite a few examples, it already seems...

So it would be required to add complements for the inequality stationarity conditions related to primal bounded variables, right? My guess that this would speed things up was because one...

Think I may have found a way for this without too much unnecessary bookkeeping: https://github.com/joaquimg/BilevelJuMP.jl/pull/189. Relevant are only the last three commits (the rest is the iterative stuff, just wanted...