Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Robert M. Freund · Mathematical Programming · 1991
Cited by 78 works. doi:10.1007/bf01586933 Open-access PDF
Authors
References
- A new polynomial-time algorithm for linear programming
- A Primal-Dual Interior Point Algorithm for Linear Programming
- Pathways to the Optimal Set in 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
- A monotonic projective algorithm for fractional linear programming
- A variant of Karmarkar's linear programming algorithm for problems in standard form