On Finding Primal- and Dual-Optimal Bases (1991)

by Nimrod Megiddo
Venue:ORSA Journal on Computing
Citations:44 - 1 self

Documents Related by Co-Citation

652 A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING – N. Karmarkar - 1984
122 Interior point methods for linear programming: Computational state of the art – I J Lustig, R E Marsten, D F Shanno - 1994
267 On implementation of a (primal-dual) interior point method – S Mehrotra - 1992
181 Monotonicity of primal-dual interior-point algorithms for semidefinite programming problems – Masakazu Kojima, Levent Tuncel - 1998
46 On the finite convergence of interior-point algorithms for linear programming – Y Ye - 1992
23 The use of the optimal partition in a linear programming solution for postoptimal analysis – H Greenberg - 1994
39 Progress in linear programming – R E Bixby - 1994
66 On projected Newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method – P E Gill, W Murray, M A Saunders, J A Tomlin, M H Wright - 1986
89 On implementing mehrotra's predictor-corrector interior point method for linear programming – I J Lustig, R E Marsten, D F Shanno - 1992
798 Linear Programming and Extensions – G B Dantzig - 1963
5 An opposite sign algorithm for purification to an extreme point solution – A Charnes, K O Kortanek - 1963
40 Theory of linear programming – A J Goldman, A W Tucker - 1956
6 New purification algorithms for linear programming – K O KORTANEK, J S ZHU - 1988
75 Computational experience with a primal-dual interior point method for linear programming – I J Lustig, R E Marsten, D F Shanno - 1992
35 Very large-scale linear programming: A case study in combining interior point and simplex methods – R E Bixby, J W Gregory, I J Lustig, R E Marsten, D F Shanno - 1992
15 An interior point approach to postoptimal . . . – B. Jansen, C. Roos, T. Terlaky - 1993
12 A build-up variant of the path-following method for LP – C Roos, D. Den Hertog, C. Roos, T. Terlaky, T. Terlaky - 1991
54 Solving combinatorial optimization problems using Karmarkar’s algorithm – J E Mitchell, M J Todd - 1992
55 Interior point approach to linear, quadratic and convex programming, volume 277 of Mathematics and its Applications – D den Hertog - 1994