A Primal-Dual Interior Point Algorithm for Linear Programming

Publisher Website

1 January 1989

book chapter
Published by Springer Nature

p. 29-47
https://doi.org/10.1007/978-1-4613-9617-8_2

Abstract

No abstract available

Keywords

This publication has 10 references indexed in Scilit:

A polynomial-time algorithm for a class of linear complementarity problems
Mathematical Programming, 1989
A polynomial-time algorithm, based on Newton's method, for linear programming
Mathematical Programming, 1988
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
Mathematical Programming, 1987
A variant of Karmarkar's linear programming algorithm for problems in standard form
Mathematical Programming, 1987
EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMING
Journal of the Operations Research Society of Japan, 1987
Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
Algorithmica, 1986
A multiplicative barrier function method for linear programming
Algorithmica, 1986
An extension of Karmarkar's algorithm for linear programming using dual variables
Algorithmica, 1986
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
Mathematical Programming, 1986
A new polynomial-time algorithm for linear programming
Combinatorica, 1984