<p>A major open problem in mathematical programming is designing a strongly polynomial time linear programming algorithm. A related problem is whether any variant of the simplex algorithm runs in strongly polynomial time. It makes sense to first prove strong polynomial time bounds for variants of simplex applied to problems for which we already know strong polynomial time algorithms exist. </p>

CC BY-SA 3.0
2012-11-17T18:26:09.727Z
2012-11-17T18:26:09.727Z
Sasho Nikolov
<p>I'm reading <a href="http://or.journal.informs.org/content/38/4/624.abstract" rel="nofollow">Efficient Shortest Path Simplex Algorithms</a> by Donald Goldfarb, Jianxiu Hao and Shen-Roan Kai who considered  "the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a given node to all other nodes in a network of n nodes or finding a directed cycle of negative length. Two efficient variants of this shortest path simplex algorithm are analyzed and shown to require at most $(n − 1)(n − 2)/2$ pivots and $O(n^3)$ time."</p>

<p>I'm trying to find motivation for this article and wonder isn't Bellman-Ford algorithm good enough? It works in $O(nm)$ time which and good for the type of graph which the problem above algorithm deals with.</p>

<ds.algorithms><linear-programming><shortest-path><simplex>
Motivation for Developing Shortest Path Simplex Algorithms
Jozef
# Motivation for Developing Shortest Path Simplex Algorithms

(Asked by: username_0 on 2012-11-17)

I'm reading [Efficient Shortest Path Simplex Algorithms](http://or.journal.informs.org/content/38/4/624.abstract) by Donald Goldfarb, Jianxiu Hao and Shen-Roan Kai who considered "the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a given node to all other nodes in a network of n nodes or finding a directed cycle of negative length. Two efficient variants of this shortest path simplex algorithm are analyzed and shown to require at most $(n − 1)(n − 2)/2$ pivots and $O(n^3)$ time."

I'm trying to find motivation for this article and wonder isn't Bellman-Ford algorithm good enough? It works in $O(nm)$ time which and good for the type of graph which the problem above algorithm deals with.

**Tags:** ds.algorithms, linear-programming, shortest-path, simplex

---

## 1 answers

### Answer by username_1 on 2012-11-17. Score: 16 | Accepted answer

A major open problem in mathematical programming is designing a strongly polynomial time linear programming algorithm. A related problem is whether any variant of the simplex algorithm runs in strongly polynomial time. It makes sense to first prove strong polynomial time bounds for variants of simplex applied to problems for which we already know strong polynomial time algorithms exist.


---

