---
title: Network simplex algorithm
slug: network-simplex-algorithm
qid: 
snapshot: enwiki-001327006071
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1327006071
tags: [20477143, 23221441, 23374305, 23603337, 23617828, 24623845, 26220375, 26709293, 29176239, 29176510, 62317677, 7692542]
---

# Network simplex algorithm

> [!note] Provenance
> Snapshot `enwiki-001327006071` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1327006071> · Licensed CC BY-SA 4.0

In mathematical optimization, the network simplex algorithm is a graph theoretic specialization of the simplex algorithm. The algorithm is usually formulated in terms of a minimum-cost flow problem. The network simplex method works very well in practice, typically 200 to 300 times faster than the simplex method applied to general linear program of same dimensions.

In mathematical optimization, the network simplex algorithm is a graph theoretic specialization of the simplex algorithm. The algorithm is usually formulated in terms of a minimum-cost flow problem. The network simplex method works very well in practice, typically 200 to 300 times faster than the simplex method applied to general linear program of same dimensions. ==References==
