Network Simplex - Next Iteration | Previous | Next |
![]() |
We have completed another iteration of the network simplex method. The new basic feasible solution is shown above. To begin the next iteration, we again need to select an entering basic arc (or determine that the current solution is optimal). There are three nonbasic arcs (AD, DF, and EC) which could potentially be the entering basic arc. We will consider each of these arcs in turn. |