Thomas Opfer
- Total activity 72
- Last activity
- Member since
- Following 0 users
- Followed by 0 users
- Votes 0
- Subscriptions 29
Activity overview
Latest activity by Thomas Opfer-
Thomas Opfer commented,
A typical mistake in Benders Decomposition is that some variables have non-trivial bounds (different from 0 or infinity) and not taking the reduced cost vector into account when calculating the dua...
-
Thomas Opfer commented,
Hi Andy, first of all, if you look into literature, you might find different standard forms for LPs. So you should tell us which standard form you are talking about. Anyway, for every form, you mig...
-
Thomas Opfer commented,
Hi Andy, an equality constraint has kind of a slack variable with an upper and lower bound of 0. When the equality constraint is basic, then this variable is part of the basis. Best regards,Thomas
-
Thomas Opfer commented,
There might be an easier way, but this should work: I1 = [s[0] for s in I1]
-
Thomas Opfer commented,
Some information about the gap and other MIP basics can be found here. The question which gap is good enough to stop the code cannot be answered in general. A gap of 0 is obviously always good enou...
-
Thomas Opfer commented,
The default upper bound should be +INF, so you should not have to specify it explicitly. But of course, it is perfectly ok to do so. Best regards,Thomas
-
Thomas Opfer commented,
Without having verified this, I guess you are using the default lower bound of 0. You should add the variables with lower bound -INF. Best regards,Thomas
-
Thomas Opfer commented,
You might also try to continue using your current machine and restrict Gurobi to 6 cores. The remaining 2 cores might be sufficient for your other work. The difference between 6 and 8 cores for Gur...
-
Thomas Opfer commented,
Something like -inf <= GOAL <= inf should be the correct way to do this.
-
Thomas Opfer commented,
I guess the problem is that lower bounds of variables are 0 if not specified otherwise.