Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference14 articles.
1. M. Kojima, N. Megiddo and S. Mizuno, “A primal—dual, infeasible-interior-point algorithm for linear programming,”Mathematical Programming 61 (1993) 263–280.
2. M. Kojima, S. Mizuno and A. Yoshise, “A primal—dual interior-point algorithm for linear programming,” in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior-Point and Related Methods (Springer-Verlag, New York, 1989) 29–47.
3. M. Kojima, S. Mizuno and A. Yoshise, “A polynomial-time algorithm for a class of linear complementarity problems,”Mathematical Programming 44 (1989) 1–26.
4. I.J. Lustig, “Feasibility issues in a primal—dual interior-point method for linear programming,”Mathematical Programming 49 (1990/91) 145–162.
5. I.J. Lustig, R.E. Marsten and D.F. Shanno, “Computational experience with a primal—dual interior-point method for linear programming,”Linear Algebra and Its Applications 152 (1991) 191–222.
Cited by
84 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献