A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm.
Karl Heinz BorgwardtPetra HuhnPublished in: Math. Methods Oper. Res. (1999)
Keyphrases
- linear program
- simplex algorithm
- linear programming problems
- simplex method
- linear programming
- nelder mead
- lower bound
- primal dual
- optimal solution
- branch and bound algorithm
- upper bound
- computational complexity
- column generation
- integer program
- interior point
- objective function
- feasible solution
- interior point methods
- np hard