Re: Slow performance on "Select minimum" task

Michael Hennebry <[email protected]>
Newsgroups gmane.comp.gnu.glpk
Message-ID <[email protected]>
On Tue, 5 Jun 2018, Jan van Rijn wrote:

> 2018-06-05 23:39 GMT-04:00 Michael Hennebry <[email protected]>
> :
>
>> On Tue, 5 Jun 2018, Jan van Rijn wrote:

>> - M[r,c] should contain positive values (which guarantees that y[r,c] == 1
>>> iff 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   [email protected]
"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
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.