Network Simplex - Conclusion | Previous | Next |
![]() |
Shown above is the optimal solution found for the minimum cost flow problem, with the flows through all of the original arcs. The total cost is 490. |
This concludes the demonstration. See the OR Tutor menu (to the left) for other demonstrations or close the browser window to exit OR Tutor. |