Network Simplex - Initial Solution | Previous | Next |
![]() |
To obtain an initial basic feasible solution, suppose we are given the feasible spanning tree represented by the basic arcs (the red arcs) above, where none of the nonbasic arcs are reverse arcs. To solve this spanning tree, we must determine the flow through each basic arc such that the required net flow at each node is satisfied. (Flows will be shown in parentheses.) |