|
From: | Michael Hennebry |
Subject: | Re: [Help-glpk] Slow performance on "Select minimum" task |
Date: | Wed, 6 Jun 2018 09:06:28 -0500 (CDT) |
User-agent: | Alpine 2.20 (DEB 67 2015-01-07) |
On Tue, 5 Jun 2018, Jan van Rijn wrote:
2018-06-05 23:39 GMT-04:00 Michael Hennebry <address@hidden> :On Tue, 5 Jun 2018, Jan van Rijn wrote:
- M[r,c] should contain positive values (which guarantees that y[r,c] == 1iff x[r] - SUM x[s] == 1)I'm pretty sure that is not necessary. the y's depend only on the x's and the order of the M values. In any case, I think the zeros in your original problem will not be much of an issue.I should rephrase: The array should contain values >= zero. (negative values are an issue, but these can be scaled away easily. )
I'm not sure where that is coming from. The y's are determined by the x's and by sets of rows determined by the order of the M values, not their signs. Only one y value in a column can be one. -- Michael address@hidden "Sorry but your password must contain an uppercase letter, a number, a haiku, a gang sign, a heiroglyph, and the blood of a virgin." -- someeecards
[Prev in Thread] | Current Thread | [Next in Thread] |