A Primal-Dual Interior Point Algorithm for Linear Programming
Masakazu Kojima, Shinji Mizuno, Akiko Yoshise · Springer eBooks · 1989
Cited by 496 works. doi:10.1007/978-1-4613-9617-8_2
Authors
References
- A new polynomial-time algorithm for linear programming
- Nonlinear Programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Pathways to the Optimal Set in Linear Programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Nonlinear Programming
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An extension of Karmarkar's algorithm for linear programming using dual variables
- An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations