Exploiting special structure in Karmarkar's linear programming algorithm
From MaRDI portal
Publication:1106098
DOI10.1007/BF01580755zbMath0649.90070MaRDI QIDQ1106098
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C06: Large-scale problems in mathematical programming
90C05: Linear programming
Related Items
A survey of dynamic network flows, Interior-point methods with decomposition for solving large-scale linear programs, Exploiting special structure in a primal-dual path-following algorithm, El metodo de Karmarkar: Un estudio de sus variantes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A monotonic projective algorithm for fractional linear programming
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A projective method for linear programming with box-type constraints
- A polynomial Newton method for linear programming
- Generalized upper bounding techniques
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A variation on Karmarkar’s algorithm for solving linear programming problems
- The Decomposition Algorithm for Linear Programs
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- An implementation of the simplex method for linear programming problems with variable upper bounds
- The factorization approach to large-scale linear programming
- Implicit representation of generalized variable upper bounds in linear programming
