Feasibility issues in a primal-dual interior-point method for linear programming
- 1 November 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 49 (1-3), 145-162
- https://doi.org/10.1007/bf01588785
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A practical anti-cycling procedure for linearly constrained optimizationMathematical Programming, 1989
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- An analysis of an available set of linear programming test problemsComputers & Operations Research, 1989
- Computational experience with a dual affine variant of Karmarkar's method for linear programmingOperations Research Letters, 1987
- A modification of karmarkar's linear programming algorithmAlgorithmica, 1986
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 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