General Form of the MCNF Problem
Defined on a network N = (V,A)
V is a set of vertices (nodes)
- Each node i has an assoicated value bi
- bi < 0 => node i is a demand node with a demand of -bi
- bi = 0 => node i is a transshipment node
- bi > 0 => node i is a supply node with a supply of bi
A is a set of arcs
- arc (i,j) from node i to node j has
- cost cij per unit of flow on arc (i,j)
- upper bound on flow of uij (capacity)
- lower bound on flow of lij (usually 0)