Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- 1 October 1987
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 39 (3) , 305-317
- https://doi.org/10.1007/bf02592079
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- A monotonic projective algorithm for fractional linear programmingAlgorithmica, 1986
- A multiplicative barrier function method for linear programmingAlgorithmica, 1986
- An extension of Karmarkar's algorithm for linear programming using dual variablesAlgorithmica, 1986
- A modification of karmarkar's linear programming algorithmAlgorithmica, 1986
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A new polynomial-time algorithm for linear programmingPublished by Association for Computing Machinery (ACM) ,1984