Ole Kröger
Ole Kröger
I'm getting closer with this one as you seem to only need it for constant arrays. (#213) The problem here is also that you do some boolean logic inside the...
Thanks for opening the issue. Unfortunately there isn't yet. For your example I could create own the next week which would look like this: ``` @constraint(m, x in ElementSet(ix, ix)...
Let me see. Maybe I can even support the nice syntax with some of this: https://github.com/dourouc05/JuCP.jl/blob/master/src/sets.jl Will get back to you in a week :smile:
The first step is done with #213 but it currently only works for constant arrays so your example isn't working yet. At least the nice syntax of `z == T[y]`...
Thanks for opening up this issue. It's very valuable for me to have different people trying out different problems to improve this solver. I'll test this out tmr and get...
Okay some new ideas :smile: When you write `v[1] - v[2]` without defining `diff` with it the bound computation is less strong such that the best bound is often negative....
In most cases it is reasonable to use an lp solver as my bound computation is really bad but I've seen that you have tried that as well so I'll...
Should have more especially for the table constraint
For the next version it's sufficient to disallow adding new constraints by throwing an error if `optimize` was called already.
Do you have any logs?