A polynomial dual simplex algorithm for the generalized circulation problem.
Donald GoldfarbZhiying JinYiqing LinPublished in: Math. Program. (2002)
Keyphrases
- simplex algorithm
- primal dual
- linear programming
- nelder mead
- linear program
- network simplex algorithm
- linear programming problems
- convex optimization
- approximation algorithms
- semidefinite programming
- randomly generated
- variational inequalities
- convergence rate
- interior point methods
- feasible solution
- np complete
- cost function
- integer programming
- interior point
- least squares