A New Steepest Edge Approximation for the Simplex Method for Linear Programming.
Artur SwietanowskiPublished in: Comput. Optim. Appl. (1998)
Keyphrases
- simplex method
- linear programming
- linear program
- linear fractional
- linear programming problems
- interior point algorithm
- feasible solution
- column generation
- primal dual
- optimal solution
- np hard
- dynamic programming
- simplex algorithm
- objective function
- integer programming
- semidefinite programming
- edge detection
- multiscale
- interior point methods
- convergence rate
- quadratic programming
- approximation algorithms
- machine learning
- upper bound
- special case
- image processing