Technical Note - Generalized Upper Bounds and Triangular Decomposition in the Simplex Method.
John A. TomlinPublished in: Oper. Res. (1974)
Keyphrases
- simplex method
- upper bound
- linear programming
- linear program
- linear fractional
- lower bound
- simplex algorithm
- column generation
- convergence rate
- branch and bound
- upper and lower bounds
- interior point algorithm
- lower and upper bounds
- worst case
- primal dual
- efficiently computable
- optimal solution
- sample complexity
- interior point methods
- generalization error
- objective function