A Primal-Dual Interior Point Algorithm for Linear Programming
- 1 January 1989
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programmingMathematical Programming, 1987
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMINGJournal of the Operations Research Society of Japan, 1987
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithmAlgorithmica, 1986
- A multiplicative barrier function method for linear programmingAlgorithmica, 1986
- An extension of Karmarkar's algorithm for linear programming using dual variablesAlgorithmica, 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