The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption.
Shinji MizunoPublished in: Optim. Methods Softw. (2016)
Keyphrases
- simplex method
- linear programming
- strongly polynomial
- linear program
- primal dual
- optimal solution
- linear fractional
- np hard
- learning algorithm
- objective function
- convergence rate
- dynamic programming
- integer programming
- quadratic programming
- search space
- knapsack problem
- convex optimization
- computationally intensive
- worst case
- state space
- extreme points
- minimum cost flow