Timeline for Integer Linear Programming
Current License: CC BY-SA 3.0
42 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Dec 14, 2018 at 2:22 | vote | accept | Weijun Zhou | ||
| Nov 27, 2018 at 16:15 | answer | added | mmuntag | timeline score: 2 | |
| Jun 15, 2018 at 19:45 | answer | added | PieCot | timeline score: 1 | |
| Apr 21, 2018 at 19:42 | comment | added | Khuldraeseth na'Barya | Farewell, bounty. So tragic. | |
| S Apr 21, 2018 at 19:39 | history | bounty ended | CommunityBot | ||
| S Apr 21, 2018 at 19:39 | history | notice removed | CommunityBot | ||
| Apr 20, 2018 at 5:29 | comment | added | Weijun Zhou | Yes, of course. | |
| Apr 20, 2018 at 4:19 | comment | added | l4m2 |
You can take input and provide output through any standard form, and you are free to choose the format. so can we split out the objective function?
|
|
| Apr 20, 2018 at 4:18 | comment | added | l4m2 | Can I output same value for both "all range" and "no range"? | |
| Apr 16, 2018 at 3:16 | comment | added | Weijun Zhou |
3x+2y is specified by the last subarray [3,2,0]
|
|
| Apr 15, 2018 at 10:15 | comment | added | l4m2 |
For test cases which function to optimize? still 3x+2y?
|
|
| S Apr 13, 2018 at 18:22 | history | bounty started | Khuldraeseth na'Barya | ||
| S Apr 13, 2018 at 18:22 | history | notice added | Khuldraeseth na'Barya | Draw attention | |
| S Mar 4, 2018 at 7:06 | history | bounty ended | CommunityBot | ||
| S Mar 4, 2018 at 7:06 | history | notice removed | CommunityBot | ||
| Mar 4, 2018 at 0:21 | comment | added | Weijun Zhou | @Scrooble Yes, you may output a space (or a letter, if you like). | |
| Mar 4, 2018 at 0:10 | comment | added | Weijun Zhou | @Scrooble You can use any set of value of your choice as the falsy value, as long as they are discernible from the cases where there are solutions, as stated in the question. | |
| Mar 3, 2018 at 18:00 | comment | added | Weijun Zhou | Yes, the unknowns may be negative. | |
| Mar 3, 2018 at 17:17 | comment | added | user202729 | The unknowns may be negative. Correct? | |
| Mar 2, 2018 at 9:29 | comment | added | Sanchises | @WeijunZhou Sorry, I misread that bit. Thanks. | |
| Mar 2, 2018 at 9:22 | comment | added | Weijun Zhou | @Sanchises In the challenge I stated that you can use any falsy value of your choice that is discernible from other cases as the output for cases without solutions. You can even use the same output for NaN and Inf and -Inf. | |
| Mar 2, 2018 at 8:56 | history | edited | Weijun Zhou | CC BY-SA 3.0 |
added 116 characters in body
|
| Mar 2, 2018 at 8:28 | history | edited | Weijun Zhou | CC BY-SA 3.0 |
edited body
|
| Mar 2, 2018 at 8:10 | history | edited | Weijun Zhou | CC BY-SA 3.0 |
edited body
|
| Mar 2, 2018 at 8:07 | comment | added | Weijun Zhou | Oh sorry I didn't notice the restriction. I don't mean the unknowns have to be nonnegative. So the issue is still with the 55. Can you give me a vector that gets a goal below 55 or point out what is wrong in my reasoning above? Thank you very much for your time and interest. Edit: I see what is faulty. Changed accordingly. | |
| Mar 1, 2018 at 19:03 | comment | added | Kirill L. | OK, that site specifically formulates the problem with x>=0. So, 55 test case is correct. But then I get 0 instead of -inf/error in [-inf, 12] case. I enter the constraints as 4 2 -1 15;1 2 -1 8;1 1 -1 5. Is that correct? | |
| Mar 1, 2018 at 16:11 | comment | added | Weijun Zhou | Here it is. I don't like the ads but at least it works. | |
| Mar 1, 2018 at 16:03 | comment | added | Kirill L. | Here is my snippet, although it won't work on TIO due to missing library. This gives 55, but exits with "model is unbounded" when I uncomment the set.bounds line. Quite possibly, the error is on my side, though. Could you also give a link to online solver? | |
| Mar 1, 2018 at 14:46 | comment | added | Weijun Zhou | @KirillL. Can you provide a vector where the function in test case [55, inf] gives a value smaller than 55? I just checked it against an online solver and the case seems to be fine. I have the following reasoning when making this test case: The first restriction requires the sum of all the free variables to be geq 8, but the second requires the sum of all except the last to be leq 0. If we ever try to decrease the goal by reducing any of the first 4 free var, it would require the final var to be increased by the same amount hence a larger value for the goal. | |
| Mar 1, 2018 at 14:13 | comment | added | Weijun Zhou | Yes I am looking for original implementations. | |
| Mar 1, 2018 at 14:08 | comment | added | Kirill L. | You haven't explicitly mentioned it in the task description, but I suspect you are seeking original implementations of the algorithm, and not some boring code that makes use of existing libraries? Nevertheless, I played with your test cases in R and couldn't exactly reproduce the results.E.g., [55, inf] case only works when the variables are bounded to be non-negative. But then [-inf, 12] case also produces normal results [0, 12]. On the other hand, when the lower bound is -inf, the [55, inf] case fails to solve in both min and max scenarios. | |
| Feb 24, 2018 at 7:36 | history | edited | Weijun Zhou | CC BY-SA 3.0 |
edited body
|
| S Feb 24, 2018 at 5:28 | history | bounty started | Weijun Zhou | ||
| S Feb 24, 2018 at 5:28 | history | notice added | Weijun Zhou | Draw attention | |
| Feb 22, 2018 at 5:11 | history | edited | Weijun Zhou | CC BY-SA 3.0 |
added 138 characters in body
|
| Feb 21, 2018 at 11:38 | history | edited | Weijun Zhou | CC BY-SA 3.0 |
edited body
|
| Feb 21, 2018 at 8:50 | comment | added | Peter Taylor | Generalises codegolf.stackexchange.com/q/155460/194 | |
| Feb 21, 2018 at 1:01 | history | edited | Weijun Zhou |
edited tags
|
|
| Feb 20, 2018 at 18:52 | history | tweeted | twitter.com/StackCodeGolf/status/966022669920624640 | ||
| Feb 20, 2018 at 17:55 | history | edited | Weijun Zhou | CC BY-SA 3.0 |
edited title
|
| Feb 20, 2018 at 17:06 | history | asked | Weijun Zhou | CC BY-SA 3.0 |