How do I find the minimum cost flow in a digraph whose arcs have a lower and upper bound for the flow and cost per unit of flow?
Note: Do not use linear programming. Initially there is no viable flow. Only the offer of the vendor vertex is known. Suppose there will always be a viable stream of minimal cost.