An efficient simplex type algorithm for sparse and dense linear programs.
Konstantinos PaparrizosNikolaos SamarasGeorge StephanidesPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- linear program
- linear programming
- simplex method
- learning algorithm
- simplex algorithm
- dynamic programming
- nelder mead
- strongly polynomial
- objective function
- np hard
- randomly generated
- column generation
- convergence rate
- computational complexity
- worst case
- combinatorial optimization
- convex hull
- primal dual
- optimal solution
- extreme points
- semi infinite
- machine learning