Klee-Minty's LP and upper bounds for Dantzig's simplex method.
Tomonari KitaharaShinji MizunoPublished in: Oper. Res. Lett. (2011)
Keyphrases
- simplex method
- upper bound
- linear programming
- linear program
- lower bound
- linear fractional
- column generation
- branch and bound
- worst case
- convergence rate
- primal dual
- linear programming problems
- optimal solution
- objective function
- interior point methods
- feasible solution
- semidefinite programming
- finite number
- lp relaxation
- supervised learning
- np hard