Timeline for In a MIP, how to force a decision variable to be zero unless the sum of specific other decision variables is equal to a certain number?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 10, 2021 at 13:21 | answer | added | Alex Fleischer | timeline score: 2 | |
| Sep 9, 2021 at 22:36 | history | became hot network question | |||
| Sep 9, 2021 at 20:40 | comment | added | Kuifje | In this case consider the answer below with $L:=0$. | |
| Sep 9, 2021 at 17:43 | comment | added | AnneBart | No q may still be zero. In general, there are multiple paths available for each q, so the fact that $f_{AB}$ and $f_{BC}$ are both 1, does not mean that this path will be used to transport q. I'm using a timespace network, so AB and BC do not only represent airports, but also points in time. Therefore, if a path earlier/later in time is better, then that other path can also be used. | |
| Sep 9, 2021 at 14:52 | history | edited | Kuifje |
edited tags
|
|
| Sep 9, 2021 at 14:49 | answer | added | Kuifje | timeline score: 5 | |
| Sep 9, 2021 at 14:48 | comment | added | Kuifje | In II) you mean $q>0$ ? Otherwise you could have $q=0$ in both cases. | |
| S Sep 9, 2021 at 14:34 | review | First questions | |||
| Sep 9, 2021 at 15:27 | |||||
| S Sep 9, 2021 at 14:34 | history | asked | AnneBart | CC BY-SA 4.0 |