For solving a very sparse LP: {min $cx$: s.t.: $A_{m \times n}x=b$ , $x\geq 0$}, which one of the following algorithms is faster?
- Logarithmic barrier method
- Other variants of the interior point method
- Simplex method
What is the best worst case complexity? In general, which algorithm performs well in practice for sparse matrices?