I need the minimal constraints needed to prove the contradiction.
The problem is binary but maybe its easier to explain like this:
a > 20
a > 40
a < 60
asking the model a = 70 should return a < 60 as the only constraint needed to prove invalid.
Adding an extra var to the constraints as fallback
.AddTerm(1.0, model.AddVar(0.0, 1.0, 0.0, GRB.BINARY, "Extra var"))
.AddConstr(constraint, GRB.EQUAL, 1.0,
And then SetObjective(Maximize all fallback vars)
did not work
It this even possible with Gurobi?
How to set the objectives for this problem? (in .net syntax if possible)
(Then I can enumerate each possible var a to scan for the minimal constraints needed.
Enumerating if var is impossible is done by scenarios)
Please sign in to leave a comment.