Polynomial affine algorithms for linear programming
Clóvis C. Gonzaga · Mathematical Programming · 1990
Cited by 61 works. doi:10.1007/bf01588776
Authors
References
- A new polynomial-time algorithm for linear programming
- A Primal-Dual Interior Point Algorithm for Linear Programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations
- An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations
- A Centered Projective Algorithm for Linear Programming
- The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Progress in mathematical programming — interior-point and related methods