[Lemon-user] Optimal Solution for MCF Problem

[T.A. Heba Essam]

Thanks a lot.


________________________________
From: Alpár Jüttner <alpar.juttner at gmail.com> on behalf of Alpar Juttner <alpar at cs.elte.hu>
Sent: Tuesday, June 21, 2016 1:14 PM
To: T.A. Heba Essam; lemon-user at lemon.cs.elte.hu
Subject: Re: [Lemon-user] Optimal Solution for MCF Problem

Hi,

I'm not sure what do you mean by Question 1, but as far as Question 2
is concerned, the answer is yes, the network simplex algorithm finds an
optimal solution to (a quite general version of) MCF problems.

Regards,
Alpár


On Tue, 2016-06-21 at 08:23 +0000, T.A. Heba Essam wrote:
> Dear all,
>
> 1- If satisfying the feasibility conditions (integers, non-negative
> costs, directed graph..etc) gives us a feasible solution for a MCF
> problem. What does provide an optimal solution? what are the
> conditions?
>
> 2- Also, does the network simplex algorithm implemented by LEMON
> finds an "optimal" solution for a given MCF problem?
>
> Thanks,
> Heba Essam
>
>
> _______________________________________________
> Lemon-user mailing list
> Lemon-user at lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20160621/59c15822/attachment.html>