[Lemon-devel] Network Simplex

[Kovács Péter]

Hi All,

I accept Alpar reasons. I wrote a summary of this discussion to the ticket:
http://lemon.cs.elte.hu/trac/lemon/ticket/454

Peter


On 2012.12.06. 15:51, Alpar Juttner wrote:
> On Thu, 2012-12-06 at 14:04 +0100, Kovács Péter wrote:
>> Hi All,
>>
>> I generally agree with Alpar, but I also agree with Pierre that the
>> distinction between invalid and infeasible is not so clear in this case.
>>
>> The min cost flow problem formulation explicitly says that:
>>    (a) l(a)<=u(a) must hold for each arc;
>>    (b) sum of node supply values must be zero or negative.
>
> No. The doc ( http://lemon.cs.elte.hu/pub/doc/1.2.3/a00005.html ) says
> that "The sum of the supply values must be zero or negative in order to
> have a feasible solution"
>
> which is exactly what I say.
>
>
> Regards,
> Alpar
>
>